./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label42.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label42.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 96107ddac20ae25720715e53c2e276b0ff7d668effb9cd422fe5eafc03582006 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:48:27,980 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:48:28,048 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:48:28,052 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:48:28,052 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:48:28,081 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:48:28,082 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:48:28,082 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:48:28,083 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:48:28,083 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:48:28,084 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:48:28,084 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:48:28,084 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:48:28,085 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:48:28,085 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:48:28,085 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:48:28,086 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:48:28,086 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:48:28,086 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:48:28,087 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:48:28,087 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:48:28,088 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:48:28,088 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:48:28,088 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:48:28,089 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:48:28,089 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:48:28,089 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:48:28,090 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:48:28,090 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:48:28,090 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:48:28,090 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:48:28,091 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:48:28,091 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:48:28,092 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:48:28,092 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:48:28,092 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:48:28,093 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:48:28,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:48:28,093 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:48:28,094 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:48:28,094 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:48:28,094 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:48:28,095 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 96107ddac20ae25720715e53c2e276b0ff7d668effb9cd422fe5eafc03582006 [2024-10-10 23:48:28,344 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:48:28,368 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:48:28,371 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:48:28,372 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:48:28,373 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:48:28,374 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label42.c [2024-10-10 23:48:29,797 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:48:30,195 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:48:30,196 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label42.c [2024-10-10 23:48:30,225 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0b915e6c7/c1acd09f0f5048d495bf40d89b81cfad/FLAG2e88f38df [2024-10-10 23:48:30,242 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0b915e6c7/c1acd09f0f5048d495bf40d89b81cfad [2024-10-10 23:48:30,246 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:48:30,249 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:48:30,250 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:48:30,250 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:48:30,255 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:48:30,256 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:48:30" (1/1) ... [2024-10-10 23:48:30,257 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b0c934d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:48:30, skipping insertion in model container [2024-10-10 23:48:30,259 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:48:30" (1/1) ... [2024-10-10 23:48:30,359 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:48:30,621 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label42.c[6070,6083] [2024-10-10 23:48:31,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:48:31,155 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:48:31,201 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label42.c[6070,6083] [2024-10-10 23:48:31,445 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:48:31,468 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:48:31,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:48:31 WrapperNode [2024-10-10 23:48:31,469 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:48:31,470 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:48:31,470 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:48:31,471 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:48:31,478 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:48:31" (1/1) ... [2024-10-10 23:48:31,521 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:48:31" (1/1) ... [2024-10-10 23:48:31,803 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2613 [2024-10-10 23:48:31,803 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:48:31,804 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:48:31,804 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:48:31,804 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:48:31,815 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:48:31" (1/1) ... [2024-10-10 23:48:31,816 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:48:31" (1/1) ... [2024-10-10 23:48:31,851 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:48:31" (1/1) ... [2024-10-10 23:48:32,026 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-10 23:48:32,026 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:48:31" (1/1) ... [2024-10-10 23:48:32,027 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:48:31" (1/1) ... [2024-10-10 23:48:32,132 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:48:31" (1/1) ... [2024-10-10 23:48:32,161 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:48:31" (1/1) ... [2024-10-10 23:48:32,182 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:48:31" (1/1) ... [2024-10-10 23:48:32,200 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:48:31" (1/1) ... [2024-10-10 23:48:32,239 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:48:32,242 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:48:32,242 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:48:32,243 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:48:32,245 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:48:31" (1/1) ... [2024-10-10 23:48:32,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:48:32,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:48:32,275 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:48:32,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:48:32,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:48:32,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:48:32,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:48:32,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:48:32,425 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:48:32,427 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:48:35,616 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2024-10-10 23:48:35,617 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:48:35,678 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:48:35,681 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:48:35,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:48:35 BoogieIcfgContainer [2024-10-10 23:48:35,682 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:48:35,684 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:48:35,684 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:48:35,687 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:48:35,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:48:30" (1/3) ... [2024-10-10 23:48:35,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8360e42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:48:35, skipping insertion in model container [2024-10-10 23:48:35,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:48:31" (2/3) ... [2024-10-10 23:48:35,689 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8360e42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:48:35, skipping insertion in model container [2024-10-10 23:48:35,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:48:35" (3/3) ... [2024-10-10 23:48:35,690 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label42.c [2024-10-10 23:48:35,705 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:48:35,706 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:48:35,789 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:48:35,797 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@66ebf9d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:48:35,798 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:48:35,804 INFO L276 IsEmpty]: Start isEmpty. Operand has 528 states, 526 states have (on average 1.9011406844106464) internal successors, (1000), 527 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:35,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-10 23:48:35,811 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:48:35,812 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:48:35,812 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:48:35,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:48:35,819 INFO L85 PathProgramCache]: Analyzing trace with hash -762381912, now seen corresponding path program 1 times [2024-10-10 23:48:35,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:48:35,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439986606] [2024-10-10 23:48:35,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:48:35,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:48:35,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:48:36,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:48:36,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:48:36,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439986606] [2024-10-10 23:48:36,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439986606] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:48:36,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:48:36,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:48:36,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257826457] [2024-10-10 23:48:36,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:48:36,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:48:36,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:48:36,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:48:36,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:48:36,037 INFO L87 Difference]: Start difference. First operand has 528 states, 526 states have (on average 1.9011406844106464) internal successors, (1000), 527 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:36,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:48:36,138 INFO L93 Difference]: Finished difference Result 1055 states and 1999 transitions. [2024-10-10 23:48:36,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:48:36,143 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-10-10 23:48:36,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:48:36,162 INFO L225 Difference]: With dead ends: 1055 [2024-10-10 23:48:36,163 INFO L226 Difference]: Without dead ends: 526 [2024-10-10 23:48:36,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:48:36,174 INFO L432 NwaCegarLoop]: 935 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:48:36,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 935 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:48:36,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-10-10 23:48:36,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2024-10-10 23:48:36,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 1.7809523809523808) internal successors, (935), 525 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:36,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 935 transitions. [2024-10-10 23:48:36,256 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 935 transitions. Word has length 39 [2024-10-10 23:48:36,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:48:36,257 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 935 transitions. [2024-10-10 23:48:36,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:36,257 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 935 transitions. [2024-10-10 23:48:36,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-10 23:48:36,259 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:48:36,259 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:48:36,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:48:36,260 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:48:36,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:48:36,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1948411654, now seen corresponding path program 1 times [2024-10-10 23:48:36,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:48:36,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419479341] [2024-10-10 23:48:36,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:48:36,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:48:36,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:48:36,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:48:36,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:48:36,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419479341] [2024-10-10 23:48:36,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419479341] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:48:36,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:48:36,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:48:36,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132161500] [2024-10-10 23:48:36,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:48:36,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:48:36,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:48:36,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:48:36,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:48:36,472 INFO L87 Difference]: Start difference. First operand 526 states and 935 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:38,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:48:38,786 INFO L93 Difference]: Finished difference Result 1522 states and 2728 transitions. [2024-10-10 23:48:38,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:48:38,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-10-10 23:48:38,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:48:38,793 INFO L225 Difference]: With dead ends: 1522 [2024-10-10 23:48:38,793 INFO L226 Difference]: Without dead ends: 997 [2024-10-10 23:48:38,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:48:38,798 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 471 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1492 mSolverCounterSat, 351 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 1843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 351 IncrementalHoareTripleChecker+Valid, 1492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:48:38,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 239 Invalid, 1843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [351 Valid, 1492 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-10 23:48:38,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2024-10-10 23:48:38,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 981. [2024-10-10 23:48:38,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 980 states have (on average 1.7081632653061225) internal successors, (1674), 980 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:38,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1674 transitions. [2024-10-10 23:48:38,834 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1674 transitions. Word has length 39 [2024-10-10 23:48:38,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:48:38,834 INFO L471 AbstractCegarLoop]: Abstraction has 981 states and 1674 transitions. [2024-10-10 23:48:38,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:38,835 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1674 transitions. [2024-10-10 23:48:38,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-10 23:48:38,837 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:48:38,838 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:48:38,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:48:38,838 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:48:38,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:48:38,839 INFO L85 PathProgramCache]: Analyzing trace with hash -930264441, now seen corresponding path program 1 times [2024-10-10 23:48:38,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:48:38,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574453882] [2024-10-10 23:48:38,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:48:38,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:48:38,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:48:39,049 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:48:39,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:48:39,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574453882] [2024-10-10 23:48:39,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574453882] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:48:39,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:48:39,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:48:39,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009987885] [2024-10-10 23:48:39,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:48:39,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:48:39,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:48:39,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:48:39,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:48:39,053 INFO L87 Difference]: Start difference. First operand 981 states and 1674 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:41,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:48:41,298 INFO L93 Difference]: Finished difference Result 2840 states and 4880 transitions. [2024-10-10 23:48:41,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:48:41,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2024-10-10 23:48:41,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:48:41,306 INFO L225 Difference]: With dead ends: 2840 [2024-10-10 23:48:41,306 INFO L226 Difference]: Without dead ends: 1860 [2024-10-10 23:48:41,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:48:41,309 INFO L432 NwaCegarLoop]: 421 mSDtfsCounter, 407 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1341 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 1666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:48:41,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 494 Invalid, 1666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1341 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-10 23:48:41,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2024-10-10 23:48:41,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1856. [2024-10-10 23:48:41,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1856 states, 1855 states have (on average 1.4549865229110512) internal successors, (2699), 1855 states have internal predecessors, (2699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:41,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1856 states to 1856 states and 2699 transitions. [2024-10-10 23:48:41,354 INFO L78 Accepts]: Start accepts. Automaton has 1856 states and 2699 transitions. Word has length 104 [2024-10-10 23:48:41,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:48:41,356 INFO L471 AbstractCegarLoop]: Abstraction has 1856 states and 2699 transitions. [2024-10-10 23:48:41,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:41,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1856 states and 2699 transitions. [2024-10-10 23:48:41,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-10 23:48:41,364 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:48:41,365 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:48:41,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:48:41,365 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:48:41,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:48:41,367 INFO L85 PathProgramCache]: Analyzing trace with hash 52578940, now seen corresponding path program 1 times [2024-10-10 23:48:41,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:48:41,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813481624] [2024-10-10 23:48:41,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:48:41,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:48:41,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:48:41,816 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:48:41,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:48:41,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813481624] [2024-10-10 23:48:41,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813481624] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:48:41,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:48:41,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:48:41,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70458020] [2024-10-10 23:48:41,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:48:41,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:48:41,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:48:41,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:48:41,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:48:41,821 INFO L87 Difference]: Start difference. First operand 1856 states and 2699 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:43,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:48:43,766 INFO L93 Difference]: Finished difference Result 4590 states and 6639 transitions. [2024-10-10 23:48:43,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:48:43,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2024-10-10 23:48:43,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:48:43,776 INFO L225 Difference]: With dead ends: 4590 [2024-10-10 23:48:43,776 INFO L226 Difference]: Without dead ends: 2735 [2024-10-10 23:48:43,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:48:43,782 INFO L432 NwaCegarLoop]: 473 mSDtfsCounter, 352 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1666 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 1764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:48:43,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 535 Invalid, 1764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1666 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-10 23:48:43,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2735 states. [2024-10-10 23:48:43,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2735 to 2715. [2024-10-10 23:48:43,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2715 states, 2714 states have (on average 1.3909358879882092) internal successors, (3775), 2714 states have internal predecessors, (3775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:43,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2715 states to 2715 states and 3775 transitions. [2024-10-10 23:48:43,829 INFO L78 Accepts]: Start accepts. Automaton has 2715 states and 3775 transitions. Word has length 144 [2024-10-10 23:48:43,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:48:43,829 INFO L471 AbstractCegarLoop]: Abstraction has 2715 states and 3775 transitions. [2024-10-10 23:48:43,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:43,830 INFO L276 IsEmpty]: Start isEmpty. Operand 2715 states and 3775 transitions. [2024-10-10 23:48:43,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-10 23:48:43,832 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:48:43,832 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:48:43,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:48:43,833 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:48:43,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:48:43,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1793263539, now seen corresponding path program 1 times [2024-10-10 23:48:43,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:48:43,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609789629] [2024-10-10 23:48:43,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:48:43,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:48:43,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:48:44,021 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:48:44,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:48:44,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609789629] [2024-10-10 23:48:44,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609789629] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:48:44,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:48:44,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:48:44,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870230991] [2024-10-10 23:48:44,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:48:44,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:48:44,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:48:44,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:48:44,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:48:44,025 INFO L87 Difference]: Start difference. First operand 2715 states and 3775 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:45,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:48:45,752 INFO L93 Difference]: Finished difference Result 6708 states and 9428 transitions. [2024-10-10 23:48:45,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:48:45,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2024-10-10 23:48:45,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:48:45,766 INFO L225 Difference]: With dead ends: 6708 [2024-10-10 23:48:45,767 INFO L226 Difference]: Without dead ends: 3994 [2024-10-10 23:48:45,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:48:45,775 INFO L432 NwaCegarLoop]: 514 mSDtfsCounter, 347 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:48:45,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 589 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-10 23:48:45,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3994 states. [2024-10-10 23:48:45,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3994 to 3141. [2024-10-10 23:48:45,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3141 states, 3140 states have (on average 1.2745222929936306) internal successors, (4002), 3140 states have internal predecessors, (4002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:45,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 4002 transitions. [2024-10-10 23:48:45,836 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 4002 transitions. Word has length 150 [2024-10-10 23:48:45,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:48:45,837 INFO L471 AbstractCegarLoop]: Abstraction has 3141 states and 4002 transitions. [2024-10-10 23:48:45,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:45,837 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 4002 transitions. [2024-10-10 23:48:45,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-10 23:48:45,868 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:48:45,869 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:48:45,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:48:45,869 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:48:45,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:48:45,870 INFO L85 PathProgramCache]: Analyzing trace with hash -486675673, now seen corresponding path program 1 times [2024-10-10 23:48:45,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:48:45,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873018134] [2024-10-10 23:48:45,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:48:45,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:48:45,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:48:46,245 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:48:46,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:48:46,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873018134] [2024-10-10 23:48:46,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873018134] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:48:46,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:48:46,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-10 23:48:46,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985327531] [2024-10-10 23:48:46,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:48:46,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-10 23:48:46,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:48:46,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-10 23:48:46,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:48:46,250 INFO L87 Difference]: Start difference. First operand 3141 states and 4002 transitions. Second operand has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:48,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:48:48,808 INFO L93 Difference]: Finished difference Result 8004 states and 10507 transitions. [2024-10-10 23:48:48,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:48:48,810 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 187 [2024-10-10 23:48:48,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:48:48,826 INFO L225 Difference]: With dead ends: 8004 [2024-10-10 23:48:48,826 INFO L226 Difference]: Without dead ends: 4864 [2024-10-10 23:48:48,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:48:48,832 INFO L432 NwaCegarLoop]: 763 mSDtfsCounter, 593 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 2472 mSolverCounterSat, 622 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 3094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 622 IncrementalHoareTripleChecker+Valid, 2472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:48:48,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 924 Invalid, 3094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [622 Valid, 2472 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-10 23:48:48,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4864 states. [2024-10-10 23:48:48,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4864 to 4851. [2024-10-10 23:48:48,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4851 states, 4850 states have (on average 1.26659793814433) internal successors, (6143), 4850 states have internal predecessors, (6143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:48,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4851 states to 4851 states and 6143 transitions. [2024-10-10 23:48:48,910 INFO L78 Accepts]: Start accepts. Automaton has 4851 states and 6143 transitions. Word has length 187 [2024-10-10 23:48:48,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:48:48,911 INFO L471 AbstractCegarLoop]: Abstraction has 4851 states and 6143 transitions. [2024-10-10 23:48:48,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:48,911 INFO L276 IsEmpty]: Start isEmpty. Operand 4851 states and 6143 transitions. [2024-10-10 23:48:48,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-10-10 23:48:48,913 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:48:48,914 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:48:48,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:48:48,914 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:48:48,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:48:48,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1974584216, now seen corresponding path program 1 times [2024-10-10 23:48:48,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:48:48,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143240663] [2024-10-10 23:48:48,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:48:48,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:48:48,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:48:49,057 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-10 23:48:49,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:48:49,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143240663] [2024-10-10 23:48:49,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143240663] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:48:49,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:48:49,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:48:49,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945685178] [2024-10-10 23:48:49,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:48:49,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:48:49,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:48:49,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:48:49,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:48:49,061 INFO L87 Difference]: Start difference. First operand 4851 states and 6143 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:50,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:48:50,863 INFO L93 Difference]: Finished difference Result 12248 states and 15824 transitions. [2024-10-10 23:48:50,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:48:50,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 193 [2024-10-10 23:48:50,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:48:50,887 INFO L225 Difference]: With dead ends: 12248 [2024-10-10 23:48:50,887 INFO L226 Difference]: Without dead ends: 7398 [2024-10-10 23:48:50,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:48:50,897 INFO L432 NwaCegarLoop]: 479 mSDtfsCounter, 407 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1340 mSolverCounterSat, 356 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 1696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 356 IncrementalHoareTripleChecker+Valid, 1340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:48:50,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 543 Invalid, 1696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [356 Valid, 1340 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-10 23:48:50,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7398 states. [2024-10-10 23:48:51,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7398 to 4825. [2024-10-10 23:48:51,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4825 states, 4824 states have (on average 1.265339966832504) internal successors, (6104), 4824 states have internal predecessors, (6104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:51,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4825 states to 4825 states and 6104 transitions. [2024-10-10 23:48:51,056 INFO L78 Accepts]: Start accepts. Automaton has 4825 states and 6104 transitions. Word has length 193 [2024-10-10 23:48:51,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:48:51,057 INFO L471 AbstractCegarLoop]: Abstraction has 4825 states and 6104 transitions. [2024-10-10 23:48:51,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:51,058 INFO L276 IsEmpty]: Start isEmpty. Operand 4825 states and 6104 transitions. [2024-10-10 23:48:51,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-10-10 23:48:51,061 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:48:51,061 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-10 23:48:51,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:48:51,061 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:48:51,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:48:51,062 INFO L85 PathProgramCache]: Analyzing trace with hash 742306396, now seen corresponding path program 1 times [2024-10-10 23:48:51,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:48:51,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935850771] [2024-10-10 23:48:51,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:48:51,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:48:51,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:48:51,340 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:48:51,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:48:51,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935850771] [2024-10-10 23:48:51,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935850771] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:48:51,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:48:51,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:48:51,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662731044] [2024-10-10 23:48:51,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:48:51,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:48:51,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:48:51,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:48:51,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:48:51,343 INFO L87 Difference]: Start difference. First operand 4825 states and 6104 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:53,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:48:53,058 INFO L93 Difference]: Finished difference Result 13929 states and 17665 transitions. [2024-10-10 23:48:53,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:48:53,058 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 206 [2024-10-10 23:48:53,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:48:53,079 INFO L225 Difference]: With dead ends: 13929 [2024-10-10 23:48:53,079 INFO L226 Difference]: Without dead ends: 7827 [2024-10-10 23:48:53,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:48:53,090 INFO L432 NwaCegarLoop]: 876 mSDtfsCounter, 418 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 1354 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 1704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 1354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:48:53,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 950 Invalid, 1704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 1354 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-10 23:48:53,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7827 states. [2024-10-10 23:48:53,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7827 to 7821. [2024-10-10 23:48:53,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7821 states, 7820 states have (on average 1.1792838874680307) internal successors, (9222), 7820 states have internal predecessors, (9222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:53,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7821 states to 7821 states and 9222 transitions. [2024-10-10 23:48:53,198 INFO L78 Accepts]: Start accepts. Automaton has 7821 states and 9222 transitions. Word has length 206 [2024-10-10 23:48:53,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:48:53,199 INFO L471 AbstractCegarLoop]: Abstraction has 7821 states and 9222 transitions. [2024-10-10 23:48:53,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:53,199 INFO L276 IsEmpty]: Start isEmpty. Operand 7821 states and 9222 transitions. [2024-10-10 23:48:53,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-10-10 23:48:53,203 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:48:53,203 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:48:53,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:48:53,204 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:48:53,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:48:53,204 INFO L85 PathProgramCache]: Analyzing trace with hash 2043621470, now seen corresponding path program 1 times [2024-10-10 23:48:53,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:48:53,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513441636] [2024-10-10 23:48:53,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:48:53,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:48:53,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:48:53,682 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 75 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:48:53,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:48:53,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513441636] [2024-10-10 23:48:53,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513441636] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:48:53,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637696547] [2024-10-10 23:48:53,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:48:53,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:48:53,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:48:53,686 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:48:53,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 23:48:53,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:48:53,836 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-10 23:48:53,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:48:54,154 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 75 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:48:54,155 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:48:54,539 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:48:54,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637696547] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-10 23:48:54,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-10 23:48:54,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 7 [2024-10-10 23:48:54,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519398729] [2024-10-10 23:48:54,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:48:54,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:48:54,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:48:54,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:48:54,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-10 23:48:54,542 INFO L87 Difference]: Start difference. First operand 7821 states and 9222 transitions. Second operand has 4 states, 4 states have (on average 64.75) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:57,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:48:57,600 INFO L93 Difference]: Finished difference Result 26747 states and 31820 transitions. [2024-10-10 23:48:57,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:48:57,601 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 64.75) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 259 [2024-10-10 23:48:57,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:48:57,634 INFO L225 Difference]: With dead ends: 26747 [2024-10-10 23:48:57,635 INFO L226 Difference]: Without dead ends: 18496 [2024-10-10 23:48:57,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 513 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-10 23:48:57,648 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 1007 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 2219 mSolverCounterSat, 1151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1007 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 3370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1151 IncrementalHoareTripleChecker+Valid, 2219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:48:57,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1007 Valid, 144 Invalid, 3370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1151 Valid, 2219 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-10 23:48:57,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18496 states. [2024-10-10 23:48:57,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18496 to 18494. [2024-10-10 23:48:57,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18494 states, 18493 states have (on average 1.1611961282647487) internal successors, (21474), 18493 states have internal predecessors, (21474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:57,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18494 states to 18494 states and 21474 transitions. [2024-10-10 23:48:57,881 INFO L78 Accepts]: Start accepts. Automaton has 18494 states and 21474 transitions. Word has length 259 [2024-10-10 23:48:57,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:48:57,881 INFO L471 AbstractCegarLoop]: Abstraction has 18494 states and 21474 transitions. [2024-10-10 23:48:57,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.75) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:57,882 INFO L276 IsEmpty]: Start isEmpty. Operand 18494 states and 21474 transitions. [2024-10-10 23:48:57,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2024-10-10 23:48:57,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:48:57,886 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:48:57,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 23:48:58,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:48:58,087 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:48:58,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:48:58,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1471218520, now seen corresponding path program 1 times [2024-10-10 23:48:58,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:48:58,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281053528] [2024-10-10 23:48:58,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:48:58,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:48:58,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:48:58,272 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-10-10 23:48:58,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:48:58,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281053528] [2024-10-10 23:48:58,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281053528] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:48:58,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:48:58,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:48:58,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099382943] [2024-10-10 23:48:58,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:48:58,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:48:58,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:48:58,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:48:58,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:48:58,275 INFO L87 Difference]: Start difference. First operand 18494 states and 21474 transitions. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:00,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:00,012 INFO L93 Difference]: Finished difference Result 40389 states and 46979 transitions. [2024-10-10 23:49:00,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:49:00,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 276 [2024-10-10 23:49:00,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:00,050 INFO L225 Difference]: With dead ends: 40389 [2024-10-10 23:49:00,050 INFO L226 Difference]: Without dead ends: 21470 [2024-10-10 23:49:00,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:00,074 INFO L432 NwaCegarLoop]: 772 mSDtfsCounter, 384 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1194 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 1400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 1194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:00,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 841 Invalid, 1400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 1194 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-10 23:49:00,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21470 states. [2024-10-10 23:49:00,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21470 to 21470. [2024-10-10 23:49:00,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21470 states, 21469 states have (on average 1.1432297731613024) internal successors, (24544), 21469 states have internal predecessors, (24544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:00,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21470 states to 21470 states and 24544 transitions. [2024-10-10 23:49:00,339 INFO L78 Accepts]: Start accepts. Automaton has 21470 states and 24544 transitions. Word has length 276 [2024-10-10 23:49:00,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:00,340 INFO L471 AbstractCegarLoop]: Abstraction has 21470 states and 24544 transitions. [2024-10-10 23:49:00,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:00,341 INFO L276 IsEmpty]: Start isEmpty. Operand 21470 states and 24544 transitions. [2024-10-10 23:49:00,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2024-10-10 23:49:00,345 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:00,346 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:49:00,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:49:00,346 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:00,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:00,347 INFO L85 PathProgramCache]: Analyzing trace with hash 352785438, now seen corresponding path program 1 times [2024-10-10 23:49:00,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:00,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227956878] [2024-10-10 23:49:00,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:00,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:00,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:00,730 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2024-10-10 23:49:00,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:00,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227956878] [2024-10-10 23:49:00,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227956878] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:00,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:00,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:49:00,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501387331] [2024-10-10 23:49:00,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:00,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:49:00,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:00,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:49:00,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:00,733 INFO L87 Difference]: Start difference. First operand 21470 states and 24544 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:02,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:02,499 INFO L93 Difference]: Finished difference Result 52348 states and 59967 transitions. [2024-10-10 23:49:02,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:49:02,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 311 [2024-10-10 23:49:02,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:02,551 INFO L225 Difference]: With dead ends: 52348 [2024-10-10 23:49:02,551 INFO L226 Difference]: Without dead ends: 30451 [2024-10-10 23:49:02,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:02,575 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 459 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1355 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 1583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 1355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:02,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 325 Invalid, 1583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 1355 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-10 23:49:02,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30451 states. [2024-10-10 23:49:02,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30451 to 21467. [2024-10-10 23:49:02,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21467 states, 21466 states have (on average 1.142085157924159) internal successors, (24516), 21466 states have internal predecessors, (24516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:02,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21467 states to 21467 states and 24516 transitions. [2024-10-10 23:49:02,860 INFO L78 Accepts]: Start accepts. Automaton has 21467 states and 24516 transitions. Word has length 311 [2024-10-10 23:49:02,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:02,861 INFO L471 AbstractCegarLoop]: Abstraction has 21467 states and 24516 transitions. [2024-10-10 23:49:02,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:02,861 INFO L276 IsEmpty]: Start isEmpty. Operand 21467 states and 24516 transitions. [2024-10-10 23:49:02,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2024-10-10 23:49:02,873 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:02,873 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:49:02,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:49:02,874 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:02,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:02,875 INFO L85 PathProgramCache]: Analyzing trace with hash -2021237956, now seen corresponding path program 1 times [2024-10-10 23:49:02,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:02,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226873064] [2024-10-10 23:49:02,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:02,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:02,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:03,197 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 269 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-10-10 23:49:03,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:03,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226873064] [2024-10-10 23:49:03,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226873064] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:03,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:03,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:49:03,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751568874] [2024-10-10 23:49:03,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:03,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:49:03,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:03,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:49:03,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:03,200 INFO L87 Difference]: Start difference. First operand 21467 states and 24516 transitions. Second operand has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:04,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:04,880 INFO L93 Difference]: Finished difference Result 51041 states and 58360 transitions. [2024-10-10 23:49:04,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:49:04,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 333 [2024-10-10 23:49:04,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:04,931 INFO L225 Difference]: With dead ends: 51041 [2024-10-10 23:49:04,931 INFO L226 Difference]: Without dead ends: 29575 [2024-10-10 23:49:04,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:04,953 INFO L432 NwaCegarLoop]: 782 mSDtfsCounter, 326 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1372 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 1545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 1372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:04,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 840 Invalid, 1545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 1372 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-10 23:49:04,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29575 states. [2024-10-10 23:49:05,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29575 to 27852. [2024-10-10 23:49:05,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27852 states, 27851 states have (on average 1.1288284083156799) internal successors, (31439), 27851 states have internal predecessors, (31439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:05,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27852 states to 27852 states and 31439 transitions. [2024-10-10 23:49:05,308 INFO L78 Accepts]: Start accepts. Automaton has 27852 states and 31439 transitions. Word has length 333 [2024-10-10 23:49:05,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:05,309 INFO L471 AbstractCegarLoop]: Abstraction has 27852 states and 31439 transitions. [2024-10-10 23:49:05,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:05,309 INFO L276 IsEmpty]: Start isEmpty. Operand 27852 states and 31439 transitions. [2024-10-10 23:49:05,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2024-10-10 23:49:05,314 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:05,315 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:49:05,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:49:05,370 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:05,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:05,370 INFO L85 PathProgramCache]: Analyzing trace with hash 636064546, now seen corresponding path program 1 times [2024-10-10 23:49:05,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:05,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512325953] [2024-10-10 23:49:05,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:05,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:05,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:05,713 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 355 proven. 73 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-10-10 23:49:05,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:05,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512325953] [2024-10-10 23:49:05,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512325953] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:49:05,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869563945] [2024-10-10 23:49:05,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:05,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:49:05,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:49:05,716 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:49:05,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 23:49:05,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:05,853 INFO L255 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-10 23:49:05,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:49:06,063 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 355 proven. 73 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-10-10 23:49:06,063 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:49:06,327 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 428 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-10-10 23:49:06,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869563945] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-10 23:49:06,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-10 23:49:06,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2024-10-10 23:49:06,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150010036] [2024-10-10 23:49:06,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:06,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:49:06,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:06,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:49:06,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:49:06,330 INFO L87 Difference]: Start difference. First operand 27852 states and 31439 transitions. Second operand has 4 states, 4 states have (on average 57.75) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:09,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:09,013 INFO L93 Difference]: Finished difference Result 68930 states and 77944 transitions. [2024-10-10 23:49:09,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:49:09,014 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.75) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 337 [2024-10-10 23:49:09,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:09,071 INFO L225 Difference]: With dead ends: 68930 [2024-10-10 23:49:09,072 INFO L226 Difference]: Without dead ends: 40652 [2024-10-10 23:49:09,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 675 GetRequests, 671 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:49:09,099 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 856 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 2340 mSolverCounterSat, 508 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 856 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 2848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 508 IncrementalHoareTripleChecker+Valid, 2340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:09,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [856 Valid, 204 Invalid, 2848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [508 Valid, 2340 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-10 23:49:09,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40652 states. [2024-10-10 23:49:09,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40652 to 38523. [2024-10-10 23:49:09,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38523 states, 38522 states have (on average 1.1351435543325892) internal successors, (43728), 38522 states have internal predecessors, (43728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:09,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38523 states to 38523 states and 43728 transitions. [2024-10-10 23:49:09,545 INFO L78 Accepts]: Start accepts. Automaton has 38523 states and 43728 transitions. Word has length 337 [2024-10-10 23:49:09,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:09,546 INFO L471 AbstractCegarLoop]: Abstraction has 38523 states and 43728 transitions. [2024-10-10 23:49:09,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.75) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:09,546 INFO L276 IsEmpty]: Start isEmpty. Operand 38523 states and 43728 transitions. [2024-10-10 23:49:09,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-10-10 23:49:09,551 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:09,552 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:49:09,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-10 23:49:09,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:49:09,753 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:09,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:09,753 INFO L85 PathProgramCache]: Analyzing trace with hash 302108357, now seen corresponding path program 1 times [2024-10-10 23:49:09,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:09,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8042251] [2024-10-10 23:49:09,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:09,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:09,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:10,104 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-10-10 23:49:10,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:10,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8042251] [2024-10-10 23:49:10,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8042251] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:10,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:10,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:49:10,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498381412] [2024-10-10 23:49:10,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:10,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:49:10,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:10,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:49:10,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:10,109 INFO L87 Difference]: Start difference. First operand 38523 states and 43728 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:11,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:11,815 INFO L93 Difference]: Finished difference Result 82166 states and 93322 transitions. [2024-10-10 23:49:11,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:49:11,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 351 [2024-10-10 23:49:11,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:11,865 INFO L225 Difference]: With dead ends: 82166 [2024-10-10 23:49:11,865 INFO L226 Difference]: Without dead ends: 43213 [2024-10-10 23:49:11,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:11,893 INFO L432 NwaCegarLoop]: 764 mSDtfsCounter, 436 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1298 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 1424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 1298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:11,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 832 Invalid, 1424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 1298 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-10 23:49:11,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43213 states. [2024-10-10 23:49:12,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43213 to 41081. [2024-10-10 23:49:12,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41081 states, 41080 states have (on average 1.1328140214216165) internal successors, (46536), 41080 states have internal predecessors, (46536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:12,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41081 states to 41081 states and 46536 transitions. [2024-10-10 23:49:12,308 INFO L78 Accepts]: Start accepts. Automaton has 41081 states and 46536 transitions. Word has length 351 [2024-10-10 23:49:12,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:12,309 INFO L471 AbstractCegarLoop]: Abstraction has 41081 states and 46536 transitions. [2024-10-10 23:49:12,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:12,309 INFO L276 IsEmpty]: Start isEmpty. Operand 41081 states and 46536 transitions. [2024-10-10 23:49:12,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2024-10-10 23:49:12,315 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:12,315 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:49:12,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 23:49:12,316 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:12,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:12,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1664220890, now seen corresponding path program 1 times [2024-10-10 23:49:12,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:12,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087723407] [2024-10-10 23:49:12,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:12,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:12,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:12,672 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-10-10 23:49:12,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:12,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087723407] [2024-10-10 23:49:12,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087723407] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:12,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:12,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:49:12,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977283931] [2024-10-10 23:49:12,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:12,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:49:12,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:12,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:49:12,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:12,674 INFO L87 Difference]: Start difference. First operand 41081 states and 46536 transitions. Second operand has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:14,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:14,305 INFO L93 Difference]: Finished difference Result 86417 states and 98039 transitions. [2024-10-10 23:49:14,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:49:14,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 382 [2024-10-10 23:49:14,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:14,372 INFO L225 Difference]: With dead ends: 86417 [2024-10-10 23:49:14,373 INFO L226 Difference]: Without dead ends: 44912 [2024-10-10 23:49:14,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:14,411 INFO L432 NwaCegarLoop]: 805 mSDtfsCounter, 401 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1208 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:14,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 877 Invalid, 1307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1208 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-10 23:49:14,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44912 states. [2024-10-10 23:49:14,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44912 to 44910. [2024-10-10 23:49:14,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44910 states, 44909 states have (on average 1.1258545057783518) internal successors, (50561), 44909 states have internal predecessors, (50561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:15,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44910 states to 44910 states and 50561 transitions. [2024-10-10 23:49:15,023 INFO L78 Accepts]: Start accepts. Automaton has 44910 states and 50561 transitions. Word has length 382 [2024-10-10 23:49:15,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:15,023 INFO L471 AbstractCegarLoop]: Abstraction has 44910 states and 50561 transitions. [2024-10-10 23:49:15,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:15,024 INFO L276 IsEmpty]: Start isEmpty. Operand 44910 states and 50561 transitions. [2024-10-10 23:49:15,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2024-10-10 23:49:15,032 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:15,033 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:49:15,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 23:49:15,033 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:15,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:15,033 INFO L85 PathProgramCache]: Analyzing trace with hash 844440723, now seen corresponding path program 1 times [2024-10-10 23:49:15,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:15,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753360998] [2024-10-10 23:49:15,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:15,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:15,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:15,491 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-10-10 23:49:15,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:15,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753360998] [2024-10-10 23:49:15,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753360998] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:15,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:15,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:49:15,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689415037] [2024-10-10 23:49:15,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:15,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:49:15,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:15,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:49:15,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:15,494 INFO L87 Difference]: Start difference. First operand 44910 states and 50561 transitions. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:17,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:17,354 INFO L93 Difference]: Finished difference Result 100496 states and 112915 transitions. [2024-10-10 23:49:17,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:49:17,355 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 421 [2024-10-10 23:49:17,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:17,418 INFO L225 Difference]: With dead ends: 100496 [2024-10-10 23:49:17,418 INFO L226 Difference]: Without dead ends: 55158 [2024-10-10 23:49:17,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:17,449 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 487 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1284 mSolverCounterSat, 296 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 1580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 296 IncrementalHoareTripleChecker+Valid, 1284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:17,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 192 Invalid, 1580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [296 Valid, 1284 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-10 23:49:17,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55158 states. [2024-10-10 23:49:18,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55158 to 53852. [2024-10-10 23:49:18,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53852 states, 53851 states have (on average 1.1217433288146923) internal successors, (60407), 53851 states have internal predecessors, (60407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:18,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53852 states to 53852 states and 60407 transitions. [2024-10-10 23:49:18,123 INFO L78 Accepts]: Start accepts. Automaton has 53852 states and 60407 transitions. Word has length 421 [2024-10-10 23:49:18,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:18,123 INFO L471 AbstractCegarLoop]: Abstraction has 53852 states and 60407 transitions. [2024-10-10 23:49:18,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:18,123 INFO L276 IsEmpty]: Start isEmpty. Operand 53852 states and 60407 transitions. [2024-10-10 23:49:18,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2024-10-10 23:49:18,132 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:18,132 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:49:18,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-10 23:49:18,133 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:18,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:18,133 INFO L85 PathProgramCache]: Analyzing trace with hash -157988801, now seen corresponding path program 1 times [2024-10-10 23:49:18,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:18,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088726929] [2024-10-10 23:49:18,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:18,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:18,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:18,706 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 539 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2024-10-10 23:49:18,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:18,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088726929] [2024-10-10 23:49:18,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088726929] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:18,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:18,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:49:18,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398794546] [2024-10-10 23:49:18,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:18,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:49:18,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:18,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:49:18,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:18,710 INFO L87 Difference]: Start difference. First operand 53852 states and 60407 transitions. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:20,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:20,634 INFO L93 Difference]: Finished difference Result 125157 states and 140433 transitions. [2024-10-10 23:49:20,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:49:20,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 439 [2024-10-10 23:49:20,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:20,713 INFO L225 Difference]: With dead ends: 125157 [2024-10-10 23:49:20,713 INFO L226 Difference]: Without dead ends: 67463 [2024-10-10 23:49:20,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:20,736 INFO L432 NwaCegarLoop]: 613 mSDtfsCounter, 446 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1199 mSolverCounterSat, 293 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 1492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 293 IncrementalHoareTripleChecker+Valid, 1199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:20,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 654 Invalid, 1492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [293 Valid, 1199 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-10 23:49:20,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67463 states. [2024-10-10 23:49:21,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67463 to 62341. [2024-10-10 23:49:21,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62341 states, 62340 states have (on average 1.1151106833493745) internal successors, (69516), 62340 states have internal predecessors, (69516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:21,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62341 states to 62341 states and 69516 transitions. [2024-10-10 23:49:21,785 INFO L78 Accepts]: Start accepts. Automaton has 62341 states and 69516 transitions. Word has length 439 [2024-10-10 23:49:21,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:21,785 INFO L471 AbstractCegarLoop]: Abstraction has 62341 states and 69516 transitions. [2024-10-10 23:49:21,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:21,786 INFO L276 IsEmpty]: Start isEmpty. Operand 62341 states and 69516 transitions. [2024-10-10 23:49:21,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2024-10-10 23:49:21,791 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:21,791 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:49:21,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-10 23:49:21,791 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:21,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:21,792 INFO L85 PathProgramCache]: Analyzing trace with hash -166097674, now seen corresponding path program 1 times [2024-10-10 23:49:21,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:21,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599461011] [2024-10-10 23:49:21,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:21,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:21,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:22,239 INFO L134 CoverageAnalysis]: Checked inductivity of 656 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 505 trivial. 0 not checked. [2024-10-10 23:49:22,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:22,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599461011] [2024-10-10 23:49:22,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599461011] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:22,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:22,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:49:22,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64390090] [2024-10-10 23:49:22,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:22,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:49:22,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:22,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:49:22,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:22,242 INFO L87 Difference]: Start difference. First operand 62341 states and 69516 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:23,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:23,776 INFO L93 Difference]: Finished difference Result 130193 states and 145274 transitions. [2024-10-10 23:49:23,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:49:23,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 443 [2024-10-10 23:49:23,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:23,847 INFO L225 Difference]: With dead ends: 130193 [2024-10-10 23:49:23,848 INFO L226 Difference]: Without dead ends: 67422 [2024-10-10 23:49:23,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:23,886 INFO L432 NwaCegarLoop]: 660 mSDtfsCounter, 440 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 1339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:23,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 708 Invalid, 1339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1204 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-10 23:49:23,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67422 states. [2024-10-10 23:49:24,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67422 to 60614. [2024-10-10 23:49:24,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60614 states, 60613 states have (on average 1.1074686948344414) internal successors, (67127), 60613 states have internal predecessors, (67127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:24,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60614 states to 60614 states and 67127 transitions. [2024-10-10 23:49:24,836 INFO L78 Accepts]: Start accepts. Automaton has 60614 states and 67127 transitions. Word has length 443 [2024-10-10 23:49:24,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:24,836 INFO L471 AbstractCegarLoop]: Abstraction has 60614 states and 67127 transitions. [2024-10-10 23:49:24,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:24,837 INFO L276 IsEmpty]: Start isEmpty. Operand 60614 states and 67127 transitions. [2024-10-10 23:49:24,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2024-10-10 23:49:24,843 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:24,844 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:49:24,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-10 23:49:24,844 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:24,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:24,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1022718223, now seen corresponding path program 1 times [2024-10-10 23:49:24,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:24,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556381738] [2024-10-10 23:49:24,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:24,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:25,377 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-10-10 23:49:25,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:25,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556381738] [2024-10-10 23:49:25,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556381738] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:25,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:25,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:49:25,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322038166] [2024-10-10 23:49:25,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:25,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:49:25,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:25,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:49:25,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:25,381 INFO L87 Difference]: Start difference. First operand 60614 states and 67127 transitions. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:26,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:26,983 INFO L93 Difference]: Finished difference Result 131453 states and 145576 transitions. [2024-10-10 23:49:26,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:49:26,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 474 [2024-10-10 23:49:26,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:27,055 INFO L225 Difference]: With dead ends: 131453 [2024-10-10 23:49:27,055 INFO L226 Difference]: Without dead ends: 70408 [2024-10-10 23:49:27,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:27,095 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 474 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 293 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 293 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:27,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 118 Invalid, 1466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [293 Valid, 1173 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-10 23:49:27,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70408 states. [2024-10-10 23:49:28,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70408 to 58885. [2024-10-10 23:49:28,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58885 states, 58884 states have (on average 1.1044426329733035) internal successors, (65034), 58884 states have internal predecessors, (65034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:28,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58885 states to 58885 states and 65034 transitions. [2024-10-10 23:49:28,150 INFO L78 Accepts]: Start accepts. Automaton has 58885 states and 65034 transitions. Word has length 474 [2024-10-10 23:49:28,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:28,151 INFO L471 AbstractCegarLoop]: Abstraction has 58885 states and 65034 transitions. [2024-10-10 23:49:28,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:28,151 INFO L276 IsEmpty]: Start isEmpty. Operand 58885 states and 65034 transitions. [2024-10-10 23:49:28,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2024-10-10 23:49:28,158 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:28,158 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:49:28,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-10 23:49:28,159 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:28,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:28,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1098272777, now seen corresponding path program 1 times [2024-10-10 23:49:28,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:28,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136791308] [2024-10-10 23:49:28,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:28,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:28,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:28,717 INFO L134 CoverageAnalysis]: Checked inductivity of 641 backedges. 412 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2024-10-10 23:49:28,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:28,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136791308] [2024-10-10 23:49:28,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136791308] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:28,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:28,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:49:28,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895777902] [2024-10-10 23:49:28,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:28,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:49:28,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:28,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:49:28,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:28,719 INFO L87 Difference]: Start difference. First operand 58885 states and 65034 transitions. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:30,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:30,257 INFO L93 Difference]: Finished difference Result 127984 states and 141201 transitions. [2024-10-10 23:49:30,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:49:30,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 482 [2024-10-10 23:49:30,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:30,328 INFO L225 Difference]: With dead ends: 127984 [2024-10-10 23:49:30,329 INFO L226 Difference]: Without dead ends: 68675 [2024-10-10 23:49:30,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:30,359 INFO L432 NwaCegarLoop]: 698 mSDtfsCounter, 267 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 1291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:30,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 741 Invalid, 1291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-10 23:49:30,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68675 states. [2024-10-10 23:49:31,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68675 to 57574. [2024-10-10 23:49:31,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57574 states, 57573 states have (on average 1.1018185607837008) internal successors, (63435), 57573 states have internal predecessors, (63435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:31,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57574 states to 57574 states and 63435 transitions. [2024-10-10 23:49:31,177 INFO L78 Accepts]: Start accepts. Automaton has 57574 states and 63435 transitions. Word has length 482 [2024-10-10 23:49:31,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:31,177 INFO L471 AbstractCegarLoop]: Abstraction has 57574 states and 63435 transitions. [2024-10-10 23:49:31,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:31,178 INFO L276 IsEmpty]: Start isEmpty. Operand 57574 states and 63435 transitions. [2024-10-10 23:49:31,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2024-10-10 23:49:31,193 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:31,194 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:49:31,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-10 23:49:31,194 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:31,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:31,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1499458442, now seen corresponding path program 1 times [2024-10-10 23:49:31,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:31,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681344907] [2024-10-10 23:49:31,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:31,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:31,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:31,733 INFO L134 CoverageAnalysis]: Checked inductivity of 674 backedges. 391 proven. 0 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2024-10-10 23:49:31,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:31,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681344907] [2024-10-10 23:49:31,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681344907] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:31,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:31,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:49:31,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820475610] [2024-10-10 23:49:31,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:31,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:49:31,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:31,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:49:31,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:31,736 INFO L87 Difference]: Start difference. First operand 57574 states and 63435 transitions. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:33,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:33,188 INFO L93 Difference]: Finished difference Result 123653 states and 136225 transitions. [2024-10-10 23:49:33,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:49:33,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 559 [2024-10-10 23:49:33,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:33,253 INFO L225 Difference]: With dead ends: 123653 [2024-10-10 23:49:33,253 INFO L226 Difference]: Without dead ends: 65655 [2024-10-10 23:49:33,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:33,290 INFO L432 NwaCegarLoop]: 639 mSDtfsCounter, 475 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 1308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:33,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 678 Invalid, 1308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-10 23:49:33,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65655 states. [2024-10-10 23:49:33,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65655 to 65649. [2024-10-10 23:49:34,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65649 states, 65648 states have (on average 1.0945192542042408) internal successors, (71853), 65648 states have internal predecessors, (71853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:34,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65649 states to 65649 states and 71853 transitions. [2024-10-10 23:49:34,342 INFO L78 Accepts]: Start accepts. Automaton has 65649 states and 71853 transitions. Word has length 559 [2024-10-10 23:49:34,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:34,342 INFO L471 AbstractCegarLoop]: Abstraction has 65649 states and 71853 transitions. [2024-10-10 23:49:34,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:34,343 INFO L276 IsEmpty]: Start isEmpty. Operand 65649 states and 71853 transitions. [2024-10-10 23:49:34,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 697 [2024-10-10 23:49:34,381 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:34,382 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:49:34,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-10 23:49:34,382 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:34,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:34,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1561404277, now seen corresponding path program 1 times [2024-10-10 23:49:34,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:34,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222261686] [2024-10-10 23:49:34,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:34,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:34,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:34,649 INFO L134 CoverageAnalysis]: Checked inductivity of 721 backedges. 414 proven. 0 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2024-10-10 23:49:34,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:34,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222261686] [2024-10-10 23:49:34,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222261686] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:34,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:34,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:49:34,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066670163] [2024-10-10 23:49:34,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:34,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:49:34,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:34,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:49:34,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:34,652 INFO L87 Difference]: Start difference. First operand 65649 states and 71853 transitions. Second operand has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:36,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:36,305 INFO L93 Difference]: Finished difference Result 139374 states and 152645 transitions. [2024-10-10 23:49:36,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:49:36,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 696 [2024-10-10 23:49:36,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:36,404 INFO L225 Difference]: With dead ends: 139374 [2024-10-10 23:49:36,404 INFO L226 Difference]: Without dead ends: 73301 [2024-10-10 23:49:36,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:36,451 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 438 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1142 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 1285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 1142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:36,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 328 Invalid, 1285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 1142 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-10 23:49:36,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73301 states. [2024-10-10 23:49:37,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73301 to 68194. [2024-10-10 23:49:37,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68194 states, 68193 states have (on average 1.0906251374774536) internal successors, (74373), 68193 states have internal predecessors, (74373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:37,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68194 states to 68194 states and 74373 transitions. [2024-10-10 23:49:37,527 INFO L78 Accepts]: Start accepts. Automaton has 68194 states and 74373 transitions. Word has length 696 [2024-10-10 23:49:37,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:37,528 INFO L471 AbstractCegarLoop]: Abstraction has 68194 states and 74373 transitions. [2024-10-10 23:49:37,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:37,528 INFO L276 IsEmpty]: Start isEmpty. Operand 68194 states and 74373 transitions. [2024-10-10 23:49:37,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 805 [2024-10-10 23:49:37,560 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:37,560 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:49:37,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-10 23:49:37,560 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:37,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:37,561 INFO L85 PathProgramCache]: Analyzing trace with hash 2069566523, now seen corresponding path program 1 times [2024-10-10 23:49:37,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:37,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254530061] [2024-10-10 23:49:37,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:37,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:37,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:38,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1203 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 1014 trivial. 0 not checked. [2024-10-10 23:49:38,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:38,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254530061] [2024-10-10 23:49:38,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254530061] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:38,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:38,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:49:38,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941246850] [2024-10-10 23:49:38,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:38,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:49:38,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:38,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:49:38,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:38,256 INFO L87 Difference]: Start difference. First operand 68194 states and 74373 transitions. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:39,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:39,764 INFO L93 Difference]: Finished difference Result 140639 states and 153540 transitions. [2024-10-10 23:49:39,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:49:39,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 804 [2024-10-10 23:49:39,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:39,854 INFO L225 Difference]: With dead ends: 140639 [2024-10-10 23:49:39,855 INFO L226 Difference]: Without dead ends: 72446 [2024-10-10 23:49:39,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:39,893 INFO L432 NwaCegarLoop]: 668 mSDtfsCounter, 453 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1096 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 1269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 1096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:39,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 711 Invalid, 1269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 1096 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-10 23:49:39,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72446 states. [2024-10-10 23:49:40,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72446 to 65636. [2024-10-10 23:49:40,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65636 states, 65635 states have (on average 1.0788755999085853) internal successors, (70812), 65635 states have internal predecessors, (70812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:40,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65636 states to 65636 states and 70812 transitions. [2024-10-10 23:49:40,770 INFO L78 Accepts]: Start accepts. Automaton has 65636 states and 70812 transitions. Word has length 804 [2024-10-10 23:49:40,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:40,771 INFO L471 AbstractCegarLoop]: Abstraction has 65636 states and 70812 transitions. [2024-10-10 23:49:40,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:40,771 INFO L276 IsEmpty]: Start isEmpty. Operand 65636 states and 70812 transitions. [2024-10-10 23:49:40,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 838 [2024-10-10 23:49:40,809 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:40,809 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:49:40,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-10 23:49:40,810 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:40,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:40,811 INFO L85 PathProgramCache]: Analyzing trace with hash 534866233, now seen corresponding path program 1 times [2024-10-10 23:49:40,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:40,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092421354] [2024-10-10 23:49:40,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:40,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:41,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:41,697 INFO L134 CoverageAnalysis]: Checked inductivity of 899 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 747 trivial. 0 not checked. [2024-10-10 23:49:41,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:41,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092421354] [2024-10-10 23:49:41,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092421354] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:41,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:41,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:49:41,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188791098] [2024-10-10 23:49:41,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:41,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:49:41,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:41,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:49:41,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:41,701 INFO L87 Difference]: Start difference. First operand 65636 states and 70812 transitions. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 2 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:42,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:42,887 INFO L93 Difference]: Finished difference Result 126144 states and 136026 transitions. [2024-10-10 23:49:42,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:49:42,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 2 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 837 [2024-10-10 23:49:42,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:42,984 INFO L225 Difference]: With dead ends: 126144 [2024-10-10 23:49:42,984 INFO L226 Difference]: Without dead ends: 60509 [2024-10-10 23:49:43,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:43,004 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 358 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:43,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 68 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:49:43,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60509 states.