./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f225ff3-3b83-4fbd-8c45-80f36c895598/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f225ff3-3b83-4fbd-8c45-80f36c895598/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f225ff3-3b83-4fbd-8c45-80f36c895598/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f225ff3-3b83-4fbd-8c45-80f36c895598/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f225ff3-3b83-4fbd-8c45-80f36c895598/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f225ff3-3b83-4fbd-8c45-80f36c895598/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d33c1f18af8463c39a69fa160e98d9892e84f7d8b10911d6b0c55a462978880c --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:26:05,135 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:26:05,291 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f225ff3-3b83-4fbd-8c45-80f36c895598/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-11-06 22:26:05,303 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:26:05,304 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:26:05,329 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:26:05,330 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:26:05,331 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:26:05,331 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:26:05,332 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:26:05,333 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:26:05,334 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:26:05,334 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:26:05,335 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:26:05,337 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:26:05,338 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:26:05,339 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:26:05,342 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:26:05,343 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:26:05,343 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:26:05,344 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:26:05,350 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:26:05,350 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-06 22:26:05,351 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:26:05,351 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:26:05,352 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:26:05,352 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:26:05,353 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:26:05,353 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:26:05,354 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:26:05,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:26:05,355 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:26:05,356 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:26:05,357 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:26:05,358 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:26:05,358 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:26:05,358 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:26:05,359 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:26:05,359 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:26:05,359 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:26:05,359 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:26:05,360 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f225ff3-3b83-4fbd-8c45-80f36c895598/bin/uautomizer-verify-WvqO1wxjHP/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f225ff3-3b83-4fbd-8c45-80f36c895598/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 ! overflow) ) 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 -> d33c1f18af8463c39a69fa160e98d9892e84f7d8b10911d6b0c55a462978880c [2023-11-06 22:26:05,667 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:26:05,701 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:26:05,704 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:26:05,706 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:26:05,706 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:26:05,708 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f225ff3-3b83-4fbd-8c45-80f36c895598/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2023-11-06 22:26:08,797 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:26:09,082 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:26:09,083 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f225ff3-3b83-4fbd-8c45-80f36c895598/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2023-11-06 22:26:09,093 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f225ff3-3b83-4fbd-8c45-80f36c895598/bin/uautomizer-verify-WvqO1wxjHP/data/4bae02da6/08a112f9df434bddbbf7a9a612d1254a/FLAG393c24c09 [2023-11-06 22:26:09,108 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f225ff3-3b83-4fbd-8c45-80f36c895598/bin/uautomizer-verify-WvqO1wxjHP/data/4bae02da6/08a112f9df434bddbbf7a9a612d1254a [2023-11-06 22:26:09,111 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:26:09,113 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:26:09,114 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:26:09,114 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:26:09,119 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:26:09,120 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:26:09" (1/1) ... [2023-11-06 22:26:09,121 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18848384 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:09, skipping insertion in model container [2023-11-06 22:26:09,122 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:26:09" (1/1) ... [2023-11-06 22:26:09,185 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:26:09,429 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:26:09,458 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:26:09,543 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:26:09,566 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:26:09,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:09 WrapperNode [2023-11-06 22:26:09,567 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:26:09,568 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:26:09,568 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:26:09,568 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:26:09,574 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:09" (1/1) ... [2023-11-06 22:26:09,586 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:09" (1/1) ... [2023-11-06 22:26:09,618 INFO L138 Inliner]: procedures = 23, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 303 [2023-11-06 22:26:09,619 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:26:09,620 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:26:09,620 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:26:09,620 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:26:09,630 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:09" (1/1) ... [2023-11-06 22:26:09,630 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:09" (1/1) ... [2023-11-06 22:26:09,635 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:09" (1/1) ... [2023-11-06 22:26:09,635 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:09" (1/1) ... [2023-11-06 22:26:09,643 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:09" (1/1) ... [2023-11-06 22:26:09,646 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:09" (1/1) ... [2023-11-06 22:26:09,649 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:09" (1/1) ... [2023-11-06 22:26:09,651 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:09" (1/1) ... [2023-11-06 22:26:09,655 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:26:09,656 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:26:09,656 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:26:09,656 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:26:09,657 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:09" (1/1) ... [2023-11-06 22:26:09,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:26:09,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f225ff3-3b83-4fbd-8c45-80f36c895598/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:26:09,697 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f225ff3-3b83-4fbd-8c45-80f36c895598/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:26:09,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f225ff3-3b83-4fbd-8c45-80f36c895598/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:26:09,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:26:09,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:26:09,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:26:09,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:26:09,866 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:26:09,867 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:26:10,303 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:26:10,311 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:26:10,311 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:26:10,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:26:10 BoogieIcfgContainer [2023-11-06 22:26:10,314 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:26:10,316 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:26:10,316 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:26:10,320 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:26:10,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:26:09" (1/3) ... [2023-11-06 22:26:10,321 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ba8a50c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:26:10, skipping insertion in model container [2023-11-06 22:26:10,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:09" (2/3) ... [2023-11-06 22:26:10,322 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ba8a50c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:26:10, skipping insertion in model container [2023-11-06 22:26:10,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:26:10" (3/3) ... [2023-11-06 22:26:10,323 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2023-11-06 22:26:10,346 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:26:10,346 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2023-11-06 22:26:10,400 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:26:10,407 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@7e6ef569, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:26:10,408 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2023-11-06 22:26:10,413 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 75 states have (on average 1.7466666666666666) internal successors, (131), 90 states have internal predecessors, (131), 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) [2023-11-06 22:26:10,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-06 22:26:10,420 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:10,421 INFO L195 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] [2023-11-06 22:26:10,421 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 22:26:10,427 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:10,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1523334527, now seen corresponding path program 1 times [2023-11-06 22:26:10,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:10,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024957900] [2023-11-06 22:26:10,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:10,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:10,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:10,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:26:10,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:10,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024957900] [2023-11-06 22:26:10,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024957900] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:10,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:10,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:26:10,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869477123] [2023-11-06 22:26:10,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:10,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:26:10,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:10,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:26:10,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:26:10,866 INFO L87 Difference]: Start difference. First operand has 91 states, 75 states have (on average 1.7466666666666666) internal successors, (131), 90 states have internal predecessors, (131), 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, 1 states have (on average 23.0) internal successors, (23), 2 states have internal predecessors, (23), 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) [2023-11-06 22:26:10,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:10,908 INFO L93 Difference]: Finished difference Result 94 states and 133 transitions. [2023-11-06 22:26:10,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:26:10,910 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 23.0) internal successors, (23), 2 states have internal predecessors, (23), 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 23 [2023-11-06 22:26:10,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:10,922 INFO L225 Difference]: With dead ends: 94 [2023-11-06 22:26:10,922 INFO L226 Difference]: Without dead ends: 83 [2023-11-06 22:26:10,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:26:10,959 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:10,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:26:10,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-11-06 22:26:11,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2023-11-06 22:26:11,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 71 states have (on average 1.4788732394366197) internal successors, (105), 82 states have internal predecessors, (105), 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) [2023-11-06 22:26:11,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 105 transitions. [2023-11-06 22:26:11,048 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 105 transitions. Word has length 23 [2023-11-06 22:26:11,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:11,049 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 105 transitions. [2023-11-06 22:26:11,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 23.0) internal successors, (23), 2 states have internal predecessors, (23), 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) [2023-11-06 22:26:11,051 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 105 transitions. [2023-11-06 22:26:11,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-06 22:26:11,053 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:11,054 INFO L195 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] [2023-11-06 22:26:11,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:26:11,055 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 22:26:11,057 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:11,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1695954455, now seen corresponding path program 1 times [2023-11-06 22:26:11,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:11,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465642501] [2023-11-06 22:26:11,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:11,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:11,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:11,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:26:11,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:11,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465642501] [2023-11-06 22:26:11,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465642501] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:11,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:11,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:26:11,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008977252] [2023-11-06 22:26:11,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:11,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:26:11,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:11,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:26:11,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:26:11,301 INFO L87 Difference]: Start difference. First operand 83 states and 105 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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) [2023-11-06 22:26:11,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:11,348 INFO L93 Difference]: Finished difference Result 203 states and 264 transitions. [2023-11-06 22:26:11,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:26:11,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 34 [2023-11-06 22:26:11,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:11,352 INFO L225 Difference]: With dead ends: 203 [2023-11-06 22:26:11,352 INFO L226 Difference]: Without dead ends: 139 [2023-11-06 22:26:11,353 INFO L412 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 [2023-11-06 22:26:11,354 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 71 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:11,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 239 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:26:11,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-11-06 22:26:11,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 123. [2023-11-06 22:26:11,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 111 states have (on average 1.5315315315315314) internal successors, (170), 122 states have internal predecessors, (170), 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) [2023-11-06 22:26:11,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 170 transitions. [2023-11-06 22:26:11,378 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 170 transitions. Word has length 34 [2023-11-06 22:26:11,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:11,378 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 170 transitions. [2023-11-06 22:26:11,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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) [2023-11-06 22:26:11,379 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 170 transitions. [2023-11-06 22:26:11,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-06 22:26:11,380 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:11,380 INFO L195 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] [2023-11-06 22:26:11,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:26:11,381 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 22:26:11,382 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:11,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1943407502, now seen corresponding path program 1 times [2023-11-06 22:26:11,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:11,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014717561] [2023-11-06 22:26:11,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:11,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:11,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:11,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:26:11,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:11,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014717561] [2023-11-06 22:26:11,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014717561] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:11,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:11,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:26:11,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807486198] [2023-11-06 22:26:11,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:11,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:26:11,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:11,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:26:11,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:26:11,481 INFO L87 Difference]: Start difference. First operand 123 states and 170 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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) [2023-11-06 22:26:11,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:11,536 INFO L93 Difference]: Finished difference Result 315 states and 446 transitions. [2023-11-06 22:26:11,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:26:11,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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 35 [2023-11-06 22:26:11,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:11,542 INFO L225 Difference]: With dead ends: 315 [2023-11-06 22:26:11,544 INFO L226 Difference]: Without dead ends: 211 [2023-11-06 22:26:11,546 INFO L412 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 [2023-11-06 22:26:11,552 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 66 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:11,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 235 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:26:11,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2023-11-06 22:26:11,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 195. [2023-11-06 22:26:11,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 183 states have (on average 1.5628415300546448) internal successors, (286), 194 states have internal predecessors, (286), 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) [2023-11-06 22:26:11,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 286 transitions. [2023-11-06 22:26:11,610 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 286 transitions. Word has length 35 [2023-11-06 22:26:11,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:11,610 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 286 transitions. [2023-11-06 22:26:11,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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) [2023-11-06 22:26:11,621 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 286 transitions. [2023-11-06 22:26:11,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-06 22:26:11,624 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:11,624 INFO L195 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] [2023-11-06 22:26:11,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:26:11,625 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 22:26:11,625 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:11,625 INFO L85 PathProgramCache]: Analyzing trace with hash -2103371824, now seen corresponding path program 1 times [2023-11-06 22:26:11,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:11,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61115976] [2023-11-06 22:26:11,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:11,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:11,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:11,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:26:11,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:11,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61115976] [2023-11-06 22:26:11,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61115976] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:11,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:11,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:26:11,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342637306] [2023-11-06 22:26:11,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:11,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:26:11,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:11,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:26:11,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:26:11,742 INFO L87 Difference]: Start difference. First operand 195 states and 286 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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) [2023-11-06 22:26:11,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:11,904 INFO L93 Difference]: Finished difference Result 368 states and 553 transitions. [2023-11-06 22:26:11,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:26:11,905 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2023-11-06 22:26:11,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:11,909 INFO L225 Difference]: With dead ends: 368 [2023-11-06 22:26:11,909 INFO L226 Difference]: Without dead ends: 365 [2023-11-06 22:26:11,910 INFO L412 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 [2023-11-06 22:26:11,912 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 243 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:11,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 142 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:26:11,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2023-11-06 22:26:11,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 356. [2023-11-06 22:26:11,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 344 states have (on average 1.566860465116279) internal successors, (539), 355 states have internal predecessors, (539), 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) [2023-11-06 22:26:11,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 539 transitions. [2023-11-06 22:26:11,969 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 539 transitions. Word has length 36 [2023-11-06 22:26:11,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:11,970 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 539 transitions. [2023-11-06 22:26:11,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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) [2023-11-06 22:26:11,970 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 539 transitions. [2023-11-06 22:26:11,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-06 22:26:11,971 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:11,971 INFO L195 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] [2023-11-06 22:26:11,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:26:11,972 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 22:26:11,972 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:11,973 INFO L85 PathProgramCache]: Analyzing trace with hash -780016968, now seen corresponding path program 1 times [2023-11-06 22:26:11,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:11,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903770585] [2023-11-06 22:26:11,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:11,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:11,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:12,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:26:12,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:12,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903770585] [2023-11-06 22:26:12,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903770585] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:12,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:12,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:26:12,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802933313] [2023-11-06 22:26:12,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:12,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:26:12,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:12,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:26:12,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:26:12,191 INFO L87 Difference]: Start difference. First operand 356 states and 539 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 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) [2023-11-06 22:26:12,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:12,408 INFO L93 Difference]: Finished difference Result 702 states and 1055 transitions. [2023-11-06 22:26:12,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:26:12,409 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 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 37 [2023-11-06 22:26:12,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:12,414 INFO L225 Difference]: With dead ends: 702 [2023-11-06 22:26:12,414 INFO L226 Difference]: Without dead ends: 699 [2023-11-06 22:26:12,415 INFO L412 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 [2023-11-06 22:26:12,421 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 233 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:12,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 254 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:26:12,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2023-11-06 22:26:12,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 518. [2023-11-06 22:26:12,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 506 states have (on average 1.551383399209486) internal successors, (785), 517 states have internal predecessors, (785), 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) [2023-11-06 22:26:12,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 785 transitions. [2023-11-06 22:26:12,505 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 785 transitions. Word has length 37 [2023-11-06 22:26:12,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:12,506 INFO L495 AbstractCegarLoop]: Abstraction has 518 states and 785 transitions. [2023-11-06 22:26:12,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 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) [2023-11-06 22:26:12,507 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 785 transitions. [2023-11-06 22:26:12,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-06 22:26:12,513 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:12,514 INFO L195 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] [2023-11-06 22:26:12,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:26:12,514 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 22:26:12,514 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:12,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1589277906, now seen corresponding path program 1 times [2023-11-06 22:26:12,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:12,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20750501] [2023-11-06 22:26:12,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:12,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:12,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:12,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:26:12,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:12,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20750501] [2023-11-06 22:26:12,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20750501] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:12,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:12,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:26:12,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571923399] [2023-11-06 22:26:12,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:12,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:26:12,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:12,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:26:12,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:26:12,651 INFO L87 Difference]: Start difference. First operand 518 states and 785 transitions. Second operand has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 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) [2023-11-06 22:26:12,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:12,971 INFO L93 Difference]: Finished difference Result 864 states and 1315 transitions. [2023-11-06 22:26:12,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:26:12,971 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 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 38 [2023-11-06 22:26:12,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:12,978 INFO L225 Difference]: With dead ends: 864 [2023-11-06 22:26:12,978 INFO L226 Difference]: Without dead ends: 861 [2023-11-06 22:26:12,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:26:12,984 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 476 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:12,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 291 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:26:12,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2023-11-06 22:26:13,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 842. [2023-11-06 22:26:13,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 830 states have (on average 1.5409638554216867) internal successors, (1279), 841 states have internal predecessors, (1279), 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) [2023-11-06 22:26:13,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1279 transitions. [2023-11-06 22:26:13,122 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1279 transitions. Word has length 38 [2023-11-06 22:26:13,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:13,123 INFO L495 AbstractCegarLoop]: Abstraction has 842 states and 1279 transitions. [2023-11-06 22:26:13,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 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) [2023-11-06 22:26:13,123 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1279 transitions. [2023-11-06 22:26:13,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-06 22:26:13,124 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:13,124 INFO L195 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] [2023-11-06 22:26:13,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:26:13,124 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 22:26:13,125 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:13,125 INFO L85 PathProgramCache]: Analyzing trace with hash 2022974970, now seen corresponding path program 1 times [2023-11-06 22:26:13,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:13,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903734458] [2023-11-06 22:26:13,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:13,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:13,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:13,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:26:13,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:13,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903734458] [2023-11-06 22:26:13,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903734458] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:13,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:13,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:26:13,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817613819] [2023-11-06 22:26:13,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:13,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:26:13,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:13,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:26:13,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:26:13,212 INFO L87 Difference]: Start difference. First operand 842 states and 1279 transitions. Second operand has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 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) [2023-11-06 22:26:13,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:13,738 INFO L93 Difference]: Finished difference Result 2668 states and 4039 transitions. [2023-11-06 22:26:13,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:26:13,739 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 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 [2023-11-06 22:26:13,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:13,751 INFO L225 Difference]: With dead ends: 2668 [2023-11-06 22:26:13,751 INFO L226 Difference]: Without dead ends: 1837 [2023-11-06 22:26:13,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:26:13,754 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 432 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:13,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 595 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:26:13,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1837 states. [2023-11-06 22:26:13,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1837 to 1325. [2023-11-06 22:26:13,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 1313 states have (on average 1.5041888804265042) internal successors, (1975), 1324 states have internal predecessors, (1975), 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) [2023-11-06 22:26:13,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1975 transitions. [2023-11-06 22:26:13,920 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1975 transitions. Word has length 39 [2023-11-06 22:26:13,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:13,920 INFO L495 AbstractCegarLoop]: Abstraction has 1325 states and 1975 transitions. [2023-11-06 22:26:13,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 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) [2023-11-06 22:26:13,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1975 transitions. [2023-11-06 22:26:13,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-06 22:26:13,924 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:13,924 INFO L195 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, 1] [2023-11-06 22:26:13,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:26:13,925 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 22:26:13,925 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:13,925 INFO L85 PathProgramCache]: Analyzing trace with hash 130408946, now seen corresponding path program 1 times [2023-11-06 22:26:13,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:13,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013823190] [2023-11-06 22:26:13,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:13,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:13,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:14,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:26:14,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:14,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013823190] [2023-11-06 22:26:14,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013823190] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:14,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:14,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:26:14,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234992848] [2023-11-06 22:26:14,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:14,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:26:14,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:14,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:26:14,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:26:14,013 INFO L87 Difference]: Start difference. First operand 1325 states and 1975 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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) [2023-11-06 22:26:14,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:14,302 INFO L93 Difference]: Finished difference Result 3585 states and 5343 transitions. [2023-11-06 22:26:14,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:26:14,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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 40 [2023-11-06 22:26:14,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:14,317 INFO L225 Difference]: With dead ends: 3585 [2023-11-06 22:26:14,317 INFO L226 Difference]: Without dead ends: 2279 [2023-11-06 22:26:14,319 INFO L412 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 [2023-11-06 22:26:14,320 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 72 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:14,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 248 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:26:14,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2279 states. [2023-11-06 22:26:14,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2279 to 2253. [2023-11-06 22:26:14,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2253 states, 2241 states have (on average 1.4881749219098617) internal successors, (3335), 2252 states have internal predecessors, (3335), 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) [2023-11-06 22:26:14,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2253 states to 2253 states and 3335 transitions. [2023-11-06 22:26:14,625 INFO L78 Accepts]: Start accepts. Automaton has 2253 states and 3335 transitions. Word has length 40 [2023-11-06 22:26:14,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:14,625 INFO L495 AbstractCegarLoop]: Abstraction has 2253 states and 3335 transitions. [2023-11-06 22:26:14,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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) [2023-11-06 22:26:14,625 INFO L276 IsEmpty]: Start isEmpty. Operand 2253 states and 3335 transitions. [2023-11-06 22:26:14,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-06 22:26:14,626 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:14,627 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-06 22:26:14,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:26:14,627 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 22:26:14,627 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:14,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1882770870, now seen corresponding path program 1 times [2023-11-06 22:26:14,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:14,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64564258] [2023-11-06 22:26:14,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:14,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:14,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:14,710 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:26:14,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:14,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64564258] [2023-11-06 22:26:14,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64564258] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:14,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:14,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:26:14,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657160185] [2023-11-06 22:26:14,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:14,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:26:14,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:14,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:26:14,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:26:14,713 INFO L87 Difference]: Start difference. First operand 2253 states and 3335 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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) [2023-11-06 22:26:15,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:15,116 INFO L93 Difference]: Finished difference Result 5203 states and 7673 transitions. [2023-11-06 22:26:15,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:26:15,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 62 [2023-11-06 22:26:15,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:15,136 INFO L225 Difference]: With dead ends: 5203 [2023-11-06 22:26:15,140 INFO L226 Difference]: Without dead ends: 2969 [2023-11-06 22:26:15,146 INFO L412 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 [2023-11-06 22:26:15,146 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 45 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:15,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 180 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:26:15,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2969 states. [2023-11-06 22:26:15,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2969 to 2923. [2023-11-06 22:26:15,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2923 states, 2911 states have (on average 1.467880453452422) internal successors, (4273), 2922 states have internal predecessors, (4273), 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) [2023-11-06 22:26:15,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2923 states to 2923 states and 4273 transitions. [2023-11-06 22:26:15,535 INFO L78 Accepts]: Start accepts. Automaton has 2923 states and 4273 transitions. Word has length 62 [2023-11-06 22:26:15,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:15,536 INFO L495 AbstractCegarLoop]: Abstraction has 2923 states and 4273 transitions. [2023-11-06 22:26:15,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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) [2023-11-06 22:26:15,536 INFO L276 IsEmpty]: Start isEmpty. Operand 2923 states and 4273 transitions. [2023-11-06 22:26:15,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-06 22:26:15,537 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:15,537 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-06 22:26:15,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:26:15,538 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 22:26:15,538 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:15,538 INFO L85 PathProgramCache]: Analyzing trace with hash -572370161, now seen corresponding path program 1 times [2023-11-06 22:26:15,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:15,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135125560] [2023-11-06 22:26:15,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:15,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:15,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:15,743 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:26:15,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:15,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135125560] [2023-11-06 22:26:15,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135125560] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:15,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:15,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:26:15,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622065694] [2023-11-06 22:26:15,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:15,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:26:15,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:15,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:26:15,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:26:15,745 INFO L87 Difference]: Start difference. First operand 2923 states and 4273 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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) [2023-11-06 22:26:16,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:16,224 INFO L93 Difference]: Finished difference Result 5831 states and 8525 transitions. [2023-11-06 22:26:16,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:26:16,224 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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 66 [2023-11-06 22:26:16,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:16,240 INFO L225 Difference]: With dead ends: 5831 [2023-11-06 22:26:16,240 INFO L226 Difference]: Without dead ends: 2929 [2023-11-06 22:26:16,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:26:16,245 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 98 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:16,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 217 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:26:16,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2929 states. [2023-11-06 22:26:16,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2929 to 2923. [2023-11-06 22:26:16,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2923 states, 2911 states have (on average 1.456887667468224) internal successors, (4241), 2922 states have internal predecessors, (4241), 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) [2023-11-06 22:26:16,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2923 states to 2923 states and 4241 transitions. [2023-11-06 22:26:16,638 INFO L78 Accepts]: Start accepts. Automaton has 2923 states and 4241 transitions. Word has length 66 [2023-11-06 22:26:16,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:16,639 INFO L495 AbstractCegarLoop]: Abstraction has 2923 states and 4241 transitions. [2023-11-06 22:26:16,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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) [2023-11-06 22:26:16,639 INFO L276 IsEmpty]: Start isEmpty. Operand 2923 states and 4241 transitions. [2023-11-06 22:26:16,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-06 22:26:16,640 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:16,641 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-06 22:26:16,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:26:16,641 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 22:26:16,641 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:16,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1347932395, now seen corresponding path program 1 times [2023-11-06 22:26:16,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:16,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7251724] [2023-11-06 22:26:16,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:16,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:16,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:16,739 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 22:26:16,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:16,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7251724] [2023-11-06 22:26:16,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7251724] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:16,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:16,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:26:16,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117822927] [2023-11-06 22:26:16,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:16,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:26:16,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:16,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:26:16,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:26:16,742 INFO L87 Difference]: Start difference. First operand 2923 states and 4241 transitions. Second operand has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 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) [2023-11-06 22:26:17,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:17,226 INFO L93 Difference]: Finished difference Result 3774 states and 5487 transitions. [2023-11-06 22:26:17,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:26:17,227 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 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 67 [2023-11-06 22:26:17,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:17,249 INFO L225 Difference]: With dead ends: 3774 [2023-11-06 22:26:17,249 INFO L226 Difference]: Without dead ends: 3769 [2023-11-06 22:26:17,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:26:17,252 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 113 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:17,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 283 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:26:17,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3769 states. [2023-11-06 22:26:17,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3769 to 2933. [2023-11-06 22:26:17,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2933 states, 2921 states have (on average 1.4649092776446422) internal successors, (4279), 2932 states have internal predecessors, (4279), 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) [2023-11-06 22:26:17,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2933 states to 2933 states and 4279 transitions. [2023-11-06 22:26:17,641 INFO L78 Accepts]: Start accepts. Automaton has 2933 states and 4279 transitions. Word has length 67 [2023-11-06 22:26:17,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:17,641 INFO L495 AbstractCegarLoop]: Abstraction has 2933 states and 4279 transitions. [2023-11-06 22:26:17,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 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) [2023-11-06 22:26:17,642 INFO L276 IsEmpty]: Start isEmpty. Operand 2933 states and 4279 transitions. [2023-11-06 22:26:17,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-06 22:26:17,643 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:17,643 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-06 22:26:17,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:26:17,644 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 22:26:17,644 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:17,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1163768577, now seen corresponding path program 1 times [2023-11-06 22:26:17,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:17,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623247386] [2023-11-06 22:26:17,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:17,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:17,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:17,774 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 22:26:17,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:17,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623247386] [2023-11-06 22:26:17,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623247386] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:17,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:17,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:26:17,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668047998] [2023-11-06 22:26:17,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:17,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:26:17,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:17,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:26:17,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:26:17,777 INFO L87 Difference]: Start difference. First operand 2933 states and 4279 transitions. Second operand has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 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) [2023-11-06 22:26:18,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:18,697 INFO L93 Difference]: Finished difference Result 8223 states and 12078 transitions. [2023-11-06 22:26:18,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:26:18,698 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 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 68 [2023-11-06 22:26:18,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:18,728 INFO L225 Difference]: With dead ends: 8223 [2023-11-06 22:26:18,729 INFO L226 Difference]: Without dead ends: 5311 [2023-11-06 22:26:18,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:26:18,736 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 284 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:18,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 278 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:26:18,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5311 states. [2023-11-06 22:26:19,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5311 to 4587. [2023-11-06 22:26:19,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4587 states, 4575 states have (on average 1.4708196721311475) internal successors, (6729), 4586 states have internal predecessors, (6729), 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) [2023-11-06 22:26:19,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4587 states to 4587 states and 6729 transitions. [2023-11-06 22:26:19,350 INFO L78 Accepts]: Start accepts. Automaton has 4587 states and 6729 transitions. Word has length 68 [2023-11-06 22:26:19,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:19,350 INFO L495 AbstractCegarLoop]: Abstraction has 4587 states and 6729 transitions. [2023-11-06 22:26:19,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 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) [2023-11-06 22:26:19,351 INFO L276 IsEmpty]: Start isEmpty. Operand 4587 states and 6729 transitions. [2023-11-06 22:26:19,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-06 22:26:19,352 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:19,352 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-06 22:26:19,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:26:19,353 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 22:26:19,353 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:19,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1651039598, now seen corresponding path program 1 times [2023-11-06 22:26:19,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:19,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793024296] [2023-11-06 22:26:19,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:19,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:19,467 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 22:26:19,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:19,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793024296] [2023-11-06 22:26:19,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793024296] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:19,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:19,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:26:19,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724407126] [2023-11-06 22:26:19,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:19,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:26:19,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:19,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:26:19,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:26:19,471 INFO L87 Difference]: Start difference. First operand 4587 states and 6729 transitions. Second operand has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 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) [2023-11-06 22:26:20,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:20,036 INFO L93 Difference]: Finished difference Result 4592 states and 6731 transitions. [2023-11-06 22:26:20,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:26:20,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 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 68 [2023-11-06 22:26:20,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:20,063 INFO L225 Difference]: With dead ends: 4592 [2023-11-06 22:26:20,063 INFO L226 Difference]: Without dead ends: 4589 [2023-11-06 22:26:20,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:26:20,065 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 110 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:20,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 213 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:26:20,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4589 states. [2023-11-06 22:26:20,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4589 to 4581. [2023-11-06 22:26:20,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4581 states, 4572 states have (on average 1.4494750656167978) internal successors, (6627), 4580 states have internal predecessors, (6627), 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) [2023-11-06 22:26:20,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4581 states to 4581 states and 6627 transitions. [2023-11-06 22:26:20,716 INFO L78 Accepts]: Start accepts. Automaton has 4581 states and 6627 transitions. Word has length 68 [2023-11-06 22:26:20,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:20,716 INFO L495 AbstractCegarLoop]: Abstraction has 4581 states and 6627 transitions. [2023-11-06 22:26:20,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 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) [2023-11-06 22:26:20,717 INFO L276 IsEmpty]: Start isEmpty. Operand 4581 states and 6627 transitions. [2023-11-06 22:26:20,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-06 22:26:20,718 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:20,718 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-06 22:26:20,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:26:20,720 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 22:26:20,721 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:20,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1717087379, now seen corresponding path program 1 times [2023-11-06 22:26:20,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:20,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800941856] [2023-11-06 22:26:20,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:20,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:20,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:20,851 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 22:26:20,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:20,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800941856] [2023-11-06 22:26:20,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800941856] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:20,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:20,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:26:20,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712743879] [2023-11-06 22:26:20,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:20,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:26:20,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:20,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:26:20,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:26:20,854 INFO L87 Difference]: Start difference. First operand 4581 states and 6627 transitions. Second operand has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 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) [2023-11-06 22:26:21,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:21,613 INFO L93 Difference]: Finished difference Result 9150 states and 13227 transitions. [2023-11-06 22:26:21,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:26:21,613 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 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 69 [2023-11-06 22:26:21,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:21,627 INFO L225 Difference]: With dead ends: 9150 [2023-11-06 22:26:21,628 INFO L226 Difference]: Without dead ends: 5406 [2023-11-06 22:26:21,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:26:21,636 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 251 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:21,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 371 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:26:21,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5406 states. [2023-11-06 22:26:22,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5406 to 5401. [2023-11-06 22:26:22,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5401 states, 5392 states have (on average 1.4256305637982196) internal successors, (7687), 5400 states have internal predecessors, (7687), 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) [2023-11-06 22:26:22,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5401 states to 5401 states and 7687 transitions. [2023-11-06 22:26:22,259 INFO L78 Accepts]: Start accepts. Automaton has 5401 states and 7687 transitions. Word has length 69 [2023-11-06 22:26:22,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:22,259 INFO L495 AbstractCegarLoop]: Abstraction has 5401 states and 7687 transitions. [2023-11-06 22:26:22,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 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) [2023-11-06 22:26:22,259 INFO L276 IsEmpty]: Start isEmpty. Operand 5401 states and 7687 transitions. [2023-11-06 22:26:22,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-06 22:26:22,261 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:22,261 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-06 22:26:22,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:26:22,261 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 22:26:22,262 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:22,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1070854285, now seen corresponding path program 1 times [2023-11-06 22:26:22,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:22,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134400551] [2023-11-06 22:26:22,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:22,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:22,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:22,366 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 22:26:22,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:22,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134400551] [2023-11-06 22:26:22,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134400551] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:22,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:22,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:26:22,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178319001] [2023-11-06 22:26:22,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:22,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:26:22,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:22,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:26:22,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:26:22,369 INFO L87 Difference]: Start difference. First operand 5401 states and 7687 transitions. Second operand has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 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) [2023-11-06 22:26:22,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:22,981 INFO L93 Difference]: Finished difference Result 9970 states and 14299 transitions. [2023-11-06 22:26:22,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:26:22,982 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 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 69 [2023-11-06 22:26:22,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:22,993 INFO L225 Difference]: With dead ends: 9970 [2023-11-06 22:26:22,994 INFO L226 Difference]: Without dead ends: 5406 [2023-11-06 22:26:23,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:26:23,002 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 256 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:23,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 353 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:26:23,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5406 states. [2023-11-06 22:26:23,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5406 to 5401. [2023-11-06 22:26:23,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5401 states, 5392 states have (on average 1.4174703264094954) internal successors, (7643), 5400 states have internal predecessors, (7643), 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) [2023-11-06 22:26:23,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5401 states to 5401 states and 7643 transitions. [2023-11-06 22:26:23,650 INFO L78 Accepts]: Start accepts. Automaton has 5401 states and 7643 transitions. Word has length 69 [2023-11-06 22:26:23,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:23,651 INFO L495 AbstractCegarLoop]: Abstraction has 5401 states and 7643 transitions. [2023-11-06 22:26:23,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 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) [2023-11-06 22:26:23,651 INFO L276 IsEmpty]: Start isEmpty. Operand 5401 states and 7643 transitions. [2023-11-06 22:26:23,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-06 22:26:23,652 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:23,652 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-06 22:26:23,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:26:23,653 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 22:26:23,653 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:23,653 INFO L85 PathProgramCache]: Analyzing trace with hash 357380150, now seen corresponding path program 1 times [2023-11-06 22:26:23,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:23,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077048258] [2023-11-06 22:26:23,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:23,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:23,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:23,768 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 22:26:23,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:23,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077048258] [2023-11-06 22:26:23,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077048258] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:23,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:23,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:26:23,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144027002] [2023-11-06 22:26:23,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:23,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:26:23,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:23,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:26:23,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:26:23,773 INFO L87 Difference]: Start difference. First operand 5401 states and 7643 transitions. Second operand has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 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) [2023-11-06 22:26:24,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:24,421 INFO L93 Difference]: Finished difference Result 7075 states and 10119 transitions. [2023-11-06 22:26:24,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:26:24,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 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 69 [2023-11-06 22:26:24,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:24,436 INFO L225 Difference]: With dead ends: 7075 [2023-11-06 22:26:24,436 INFO L226 Difference]: Without dead ends: 7070 [2023-11-06 22:26:24,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:26:24,439 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 110 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:24,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 272 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:26:24,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7070 states. [2023-11-06 22:26:25,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7070 to 7059. [2023-11-06 22:26:25,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7059 states, 7050 states have (on average 1.4180141843971632) internal successors, (9997), 7058 states have internal predecessors, (9997), 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) [2023-11-06 22:26:25,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7059 states to 7059 states and 9997 transitions. [2023-11-06 22:26:25,119 INFO L78 Accepts]: Start accepts. Automaton has 7059 states and 9997 transitions. Word has length 69 [2023-11-06 22:26:25,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:25,120 INFO L495 AbstractCegarLoop]: Abstraction has 7059 states and 9997 transitions. [2023-11-06 22:26:25,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 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) [2023-11-06 22:26:25,121 INFO L276 IsEmpty]: Start isEmpty. Operand 7059 states and 9997 transitions. [2023-11-06 22:26:25,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-06 22:26:25,122 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:25,122 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-06 22:26:25,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 22:26:25,123 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 22:26:25,123 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:25,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1806117100, now seen corresponding path program 1 times [2023-11-06 22:26:25,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:25,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902901525] [2023-11-06 22:26:25,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:25,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:25,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:25,249 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 22:26:25,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:25,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902901525] [2023-11-06 22:26:25,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902901525] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:25,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:25,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:26:25,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815161975] [2023-11-06 22:26:25,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:25,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:26:25,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:25,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:26:25,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:26:25,252 INFO L87 Difference]: Start difference. First operand 7059 states and 9997 transitions. Second operand has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 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) [2023-11-06 22:26:26,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:26,316 INFO L93 Difference]: Finished difference Result 13320 states and 19251 transitions. [2023-11-06 22:26:26,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:26:26,317 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 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 70 [2023-11-06 22:26:26,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:26,332 INFO L225 Difference]: With dead ends: 13320 [2023-11-06 22:26:26,332 INFO L226 Difference]: Without dead ends: 8330 [2023-11-06 22:26:26,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:26:26,340 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 278 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:26,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 269 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:26:26,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8330 states. [2023-11-06 22:26:27,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8330 to 6913. [2023-11-06 22:26:27,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6913 states, 6904 states have (on average 1.4216396292004636) internal successors, (9815), 6912 states have internal predecessors, (9815), 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) [2023-11-06 22:26:27,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6913 states to 6913 states and 9815 transitions. [2023-11-06 22:26:27,195 INFO L78 Accepts]: Start accepts. Automaton has 6913 states and 9815 transitions. Word has length 70 [2023-11-06 22:26:27,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:27,195 INFO L495 AbstractCegarLoop]: Abstraction has 6913 states and 9815 transitions. [2023-11-06 22:26:27,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 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) [2023-11-06 22:26:27,196 INFO L276 IsEmpty]: Start isEmpty. Operand 6913 states and 9815 transitions. [2023-11-06 22:26:27,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-11-06 22:26:27,197 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:27,198 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-06 22:26:27,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 22:26:27,198 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 22:26:27,198 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:27,199 INFO L85 PathProgramCache]: Analyzing trace with hash 536801861, now seen corresponding path program 1 times [2023-11-06 22:26:27,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:27,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708301530] [2023-11-06 22:26:27,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:27,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:27,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:27,341 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 22:26:27,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:27,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708301530] [2023-11-06 22:26:27,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708301530] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:27,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:27,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:26:27,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053844257] [2023-11-06 22:26:27,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:27,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:26:27,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:27,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:26:27,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:26:27,344 INFO L87 Difference]: Start difference. First operand 6913 states and 9815 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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) [2023-11-06 22:26:28,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:28,467 INFO L93 Difference]: Finished difference Result 7335 states and 10395 transitions. [2023-11-06 22:26:28,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:26:28,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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 71 [2023-11-06 22:26:28,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:28,479 INFO L225 Difference]: With dead ends: 7335 [2023-11-06 22:26:28,479 INFO L226 Difference]: Without dead ends: 7328 [2023-11-06 22:26:28,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:26:28,482 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 167 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:28,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 431 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:26:28,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7328 states. [2023-11-06 22:26:29,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7328 to 7321. [2023-11-06 22:26:29,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7321 states, 7312 states have (on average 1.411788840262582) internal successors, (10323), 7320 states have internal predecessors, (10323), 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) [2023-11-06 22:26:29,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7321 states to 7321 states and 10323 transitions. [2023-11-06 22:26:29,169 INFO L78 Accepts]: Start accepts. Automaton has 7321 states and 10323 transitions. Word has length 71 [2023-11-06 22:26:29,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:29,169 INFO L495 AbstractCegarLoop]: Abstraction has 7321 states and 10323 transitions. [2023-11-06 22:26:29,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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) [2023-11-06 22:26:29,170 INFO L276 IsEmpty]: Start isEmpty. Operand 7321 states and 10323 transitions. [2023-11-06 22:26:29,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-11-06 22:26:29,171 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:29,171 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-06 22:26:29,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 22:26:29,172 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 22:26:29,172 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:29,172 INFO L85 PathProgramCache]: Analyzing trace with hash -471598904, now seen corresponding path program 1 times [2023-11-06 22:26:29,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:29,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944079371] [2023-11-06 22:26:29,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:29,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:29,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:29,257 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 22:26:29,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:29,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944079371] [2023-11-06 22:26:29,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944079371] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:29,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:29,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:26:29,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646581233] [2023-11-06 22:26:29,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:29,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:26:29,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:29,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:26:29,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:26:29,260 INFO L87 Difference]: Start difference. First operand 7321 states and 10323 transitions. Second operand has 4 states, 3 states have (on average 23.333333333333332) internal successors, (70), 4 states have internal predecessors, (70), 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) [2023-11-06 22:26:30,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:30,223 INFO L93 Difference]: Finished difference Result 9554 states and 13619 transitions. [2023-11-06 22:26:30,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:26:30,223 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 23.333333333333332) internal successors, (70), 4 states have internal predecessors, (70), 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 71 [2023-11-06 22:26:30,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:30,231 INFO L225 Difference]: With dead ends: 9554 [2023-11-06 22:26:30,231 INFO L226 Difference]: Without dead ends: 9549 [2023-11-06 22:26:30,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:26:30,233 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 147 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:30,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 407 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:26:30,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9549 states. [2023-11-06 22:26:31,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9549 to 8979. [2023-11-06 22:26:31,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8979 states, 8970 states have (on average 1.4007803790412485) internal successors, (12565), 8978 states have internal predecessors, (12565), 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) [2023-11-06 22:26:31,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8979 states to 8979 states and 12565 transitions. [2023-11-06 22:26:31,082 INFO L78 Accepts]: Start accepts. Automaton has 8979 states and 12565 transitions. Word has length 71 [2023-11-06 22:26:31,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:31,083 INFO L495 AbstractCegarLoop]: Abstraction has 8979 states and 12565 transitions. [2023-11-06 22:26:31,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 23.333333333333332) internal successors, (70), 4 states have internal predecessors, (70), 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) [2023-11-06 22:26:31,083 INFO L276 IsEmpty]: Start isEmpty. Operand 8979 states and 12565 transitions. [2023-11-06 22:26:31,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-11-06 22:26:31,084 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:31,085 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-06 22:26:31,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-06 22:26:31,085 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 22:26:31,085 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:31,086 INFO L85 PathProgramCache]: Analyzing trace with hash -155055112, now seen corresponding path program 1 times [2023-11-06 22:26:31,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:31,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558104923] [2023-11-06 22:26:31,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:31,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:31,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:31,197 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 22:26:31,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:31,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558104923] [2023-11-06 22:26:31,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558104923] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:31,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:31,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:26:31,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669172463] [2023-11-06 22:26:31,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:31,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:26:31,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:31,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:26:31,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:26:31,199 INFO L87 Difference]: Start difference. First operand 8979 states and 12565 transitions. Second operand has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 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) [2023-11-06 22:26:32,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:32,228 INFO L93 Difference]: Finished difference Result 13695 states and 19221 transitions. [2023-11-06 22:26:32,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:26:32,228 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 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 71 [2023-11-06 22:26:32,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:32,241 INFO L225 Difference]: With dead ends: 13695 [2023-11-06 22:26:32,242 INFO L226 Difference]: Without dead ends: 9814 [2023-11-06 22:26:32,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:26:32,251 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 243 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:32,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 389 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:26:32,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9814 states. [2023-11-06 22:26:33,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9814 to 9255. [2023-11-06 22:26:33,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9255 states, 9246 states have (on average 1.3979017953709711) internal successors, (12925), 9254 states have internal predecessors, (12925), 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) [2023-11-06 22:26:33,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9255 states to 9255 states and 12925 transitions. [2023-11-06 22:26:33,375 INFO L78 Accepts]: Start accepts. Automaton has 9255 states and 12925 transitions. Word has length 71 [2023-11-06 22:26:33,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:33,375 INFO L495 AbstractCegarLoop]: Abstraction has 9255 states and 12925 transitions. [2023-11-06 22:26:33,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 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) [2023-11-06 22:26:33,376 INFO L276 IsEmpty]: Start isEmpty. Operand 9255 states and 12925 transitions. [2023-11-06 22:26:33,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-11-06 22:26:33,380 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:33,381 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-06 22:26:33,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-06 22:26:33,384 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 22:26:33,384 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:33,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1734663998, now seen corresponding path program 1 times [2023-11-06 22:26:33,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:33,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348822207] [2023-11-06 22:26:33,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:33,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:33,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:33,533 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 22:26:33,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:33,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348822207] [2023-11-06 22:26:33,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348822207] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:33,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:33,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:26:33,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463327461] [2023-11-06 22:26:33,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:33,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:26:33,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:33,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:26:33,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:26:33,538 INFO L87 Difference]: Start difference. First operand 9255 states and 12925 transitions. Second operand has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 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) [2023-11-06 22:26:34,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:34,530 INFO L93 Difference]: Finished difference Result 11522 states and 16131 transitions. [2023-11-06 22:26:34,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:26:34,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 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 72 [2023-11-06 22:26:34,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:34,539 INFO L225 Difference]: With dead ends: 11522 [2023-11-06 22:26:34,539 INFO L226 Difference]: Without dead ends: 7645 [2023-11-06 22:26:34,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:26:34,547 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 191 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:34,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 313 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:26:34,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7645 states. [2023-11-06 22:26:35,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7645 to 5609. [2023-11-06 22:26:35,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5609 states, 5600 states have (on average 1.383392857142857) internal successors, (7747), 5608 states have internal predecessors, (7747), 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) [2023-11-06 22:26:35,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5609 states to 5609 states and 7747 transitions. [2023-11-06 22:26:35,294 INFO L78 Accepts]: Start accepts. Automaton has 5609 states and 7747 transitions. Word has length 72 [2023-11-06 22:26:35,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:35,294 INFO L495 AbstractCegarLoop]: Abstraction has 5609 states and 7747 transitions. [2023-11-06 22:26:35,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 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) [2023-11-06 22:26:35,295 INFO L276 IsEmpty]: Start isEmpty. Operand 5609 states and 7747 transitions. [2023-11-06 22:26:35,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-06 22:26:35,296 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:35,296 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-06 22:26:35,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-06 22:26:35,297 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 22:26:35,297 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:35,297 INFO L85 PathProgramCache]: Analyzing trace with hash 2059991050, now seen corresponding path program 1 times [2023-11-06 22:26:35,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:35,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069529207] [2023-11-06 22:26:35,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:35,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:35,422 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 22:26:35,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:35,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069529207] [2023-11-06 22:26:35,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069529207] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:35,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:35,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:26:35,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823906448] [2023-11-06 22:26:35,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:35,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:26:35,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:35,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:26:35,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:26:35,425 INFO L87 Difference]: Start difference. First operand 5609 states and 7747 transitions. Second operand has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 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) [2023-11-06 22:26:36,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:36,209 INFO L93 Difference]: Finished difference Result 6676 states and 9295 transitions. [2023-11-06 22:26:36,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:26:36,210 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 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 73 [2023-11-06 22:26:36,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:36,217 INFO L225 Difference]: With dead ends: 6676 [2023-11-06 22:26:36,218 INFO L226 Difference]: Without dead ends: 6675 [2023-11-06 22:26:36,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:26:36,220 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 175 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:36,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 391 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:26:36,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6675 states. [2023-11-06 22:26:36,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6675 to 6657. [2023-11-06 22:26:36,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6657 states, 6648 states have (on average 1.395156438026474) internal successors, (9275), 6656 states have internal predecessors, (9275), 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) [2023-11-06 22:26:36,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6657 states to 6657 states and 9275 transitions. [2023-11-06 22:26:36,877 INFO L78 Accepts]: Start accepts. Automaton has 6657 states and 9275 transitions. Word has length 73 [2023-11-06 22:26:36,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:36,877 INFO L495 AbstractCegarLoop]: Abstraction has 6657 states and 9275 transitions. [2023-11-06 22:26:36,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 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) [2023-11-06 22:26:36,877 INFO L276 IsEmpty]: Start isEmpty. Operand 6657 states and 9275 transitions. [2023-11-06 22:26:36,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-06 22:26:36,878 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:36,878 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-06 22:26:36,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-06 22:26:36,879 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 22:26:36,879 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:36,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1588743152, now seen corresponding path program 1 times [2023-11-06 22:26:36,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:36,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50293204] [2023-11-06 22:26:36,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:36,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:36,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:37,000 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 22:26:37,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:37,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50293204] [2023-11-06 22:26:37,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50293204] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:37,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:37,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:26:37,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551294573] [2023-11-06 22:26:37,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:37,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:26:37,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:37,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:26:37,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:26:37,004 INFO L87 Difference]: Start difference. First operand 6657 states and 9275 transitions. Second operand has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 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) [2023-11-06 22:26:37,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:37,833 INFO L93 Difference]: Finished difference Result 6947 states and 9675 transitions. [2023-11-06 22:26:37,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:26:37,834 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 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 73 [2023-11-06 22:26:37,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:37,841 INFO L225 Difference]: With dead ends: 6947 [2023-11-06 22:26:37,841 INFO L226 Difference]: Without dead ends: 6940 [2023-11-06 22:26:37,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:26:37,844 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 189 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:37,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 379 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:26:37,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6940 states. [2023-11-06 22:26:38,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6940 to 6933. [2023-11-06 22:26:38,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6933 states, 6924 states have (on average 1.3926920854997111) internal successors, (9643), 6932 states have internal predecessors, (9643), 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) [2023-11-06 22:26:38,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6933 states to 6933 states and 9643 transitions. [2023-11-06 22:26:38,564 INFO L78 Accepts]: Start accepts. Automaton has 6933 states and 9643 transitions. Word has length 73 [2023-11-06 22:26:38,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:38,564 INFO L495 AbstractCegarLoop]: Abstraction has 6933 states and 9643 transitions. [2023-11-06 22:26:38,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 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) [2023-11-06 22:26:38,565 INFO L276 IsEmpty]: Start isEmpty. Operand 6933 states and 9643 transitions. [2023-11-06 22:26:38,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-06 22:26:38,567 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:38,567 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-06 22:26:38,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-06 22:26:38,567 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 22:26:38,568 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:38,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1061807010, now seen corresponding path program 1 times [2023-11-06 22:26:38,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:38,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078546251] [2023-11-06 22:26:38,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:38,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:38,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:38,675 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 22:26:38,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:38,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078546251] [2023-11-06 22:26:38,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078546251] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:38,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:38,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:26:38,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972322740] [2023-11-06 22:26:38,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:38,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:26:38,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:38,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:26:38,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:26:38,678 INFO L87 Difference]: Start difference. First operand 6933 states and 9643 transitions. Second operand has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 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) [2023-11-06 22:26:39,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:39,517 INFO L93 Difference]: Finished difference Result 7162 states and 9951 transitions. [2023-11-06 22:26:39,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:26:39,517 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 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 75 [2023-11-06 22:26:39,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:39,524 INFO L225 Difference]: With dead ends: 7162 [2023-11-06 22:26:39,524 INFO L226 Difference]: Without dead ends: 6721 [2023-11-06 22:26:39,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:26:39,527 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 192 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:39,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 476 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:26:39,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6721 states. [2023-11-06 22:26:40,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6721 to 6713. [2023-11-06 22:26:40,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6713 states, 6704 states have (on average 1.3912589498806682) internal successors, (9327), 6712 states have internal predecessors, (9327), 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) [2023-11-06 22:26:40,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6713 states to 6713 states and 9327 transitions. [2023-11-06 22:26:40,404 INFO L78 Accepts]: Start accepts. Automaton has 6713 states and 9327 transitions. Word has length 75 [2023-11-06 22:26:40,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:40,405 INFO L495 AbstractCegarLoop]: Abstraction has 6713 states and 9327 transitions. [2023-11-06 22:26:40,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 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) [2023-11-06 22:26:40,405 INFO L276 IsEmpty]: Start isEmpty. Operand 6713 states and 9327 transitions. [2023-11-06 22:26:40,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-11-06 22:26:40,410 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:40,410 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2023-11-06 22:26:40,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-06 22:26:40,410 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 22:26:40,411 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:40,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1763683459, now seen corresponding path program 1 times [2023-11-06 22:26:40,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:40,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290636884] [2023-11-06 22:26:40,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:40,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:40,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:40,588 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 22:26:40,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:40,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290636884] [2023-11-06 22:26:40,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290636884] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:40,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:40,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:26:40,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708755472] [2023-11-06 22:26:40,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:40,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:26:40,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:40,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:26:40,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:26:40,593 INFO L87 Difference]: Start difference. First operand 6713 states and 9327 transitions. Second operand has 4 states, 3 states have (on average 30.0) internal successors, (90), 4 states have internal predecessors, (90), 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) [2023-11-06 22:26:41,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:41,462 INFO L93 Difference]: Finished difference Result 6945 states and 9633 transitions. [2023-11-06 22:26:41,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:26:41,462 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 30.0) internal successors, (90), 4 states have internal predecessors, (90), 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 96 [2023-11-06 22:26:41,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:41,472 INFO L225 Difference]: With dead ends: 6945 [2023-11-06 22:26:41,472 INFO L226 Difference]: Without dead ends: 6940 [2023-11-06 22:26:41,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:26:41,475 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 128 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:41,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 335 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:26:41,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6940 states. [2023-11-06 22:26:42,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6940 to 6706. [2023-11-06 22:26:42,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6706 states, 6700 states have (on average 1.363731343283582) internal successors, (9137), 6705 states have internal predecessors, (9137), 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) [2023-11-06 22:26:42,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6706 states to 6706 states and 9137 transitions. [2023-11-06 22:26:42,185 INFO L78 Accepts]: Start accepts. Automaton has 6706 states and 9137 transitions. Word has length 96 [2023-11-06 22:26:42,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:42,185 INFO L495 AbstractCegarLoop]: Abstraction has 6706 states and 9137 transitions. [2023-11-06 22:26:42,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 30.0) internal successors, (90), 4 states have internal predecessors, (90), 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) [2023-11-06 22:26:42,185 INFO L276 IsEmpty]: Start isEmpty. Operand 6706 states and 9137 transitions. [2023-11-06 22:26:42,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-11-06 22:26:42,189 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:42,190 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1] [2023-11-06 22:26:42,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-06 22:26:42,190 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 22:26:42,191 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:42,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1612282239, now seen corresponding path program 1 times [2023-11-06 22:26:42,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:42,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086727892] [2023-11-06 22:26:42,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:42,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:42,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:42,351 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 22:26:42,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:42,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086727892] [2023-11-06 22:26:42,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086727892] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:42,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:42,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:26:42,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427132306] [2023-11-06 22:26:42,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:42,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:26:42,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:42,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:26:42,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:26:42,354 INFO L87 Difference]: Start difference. First operand 6706 states and 9137 transitions. Second operand has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 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) [2023-11-06 22:26:43,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:43,326 INFO L93 Difference]: Finished difference Result 9819 states and 13497 transitions. [2023-11-06 22:26:43,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:26:43,327 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 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 98 [2023-11-06 22:26:43,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:43,334 INFO L225 Difference]: With dead ends: 9819 [2023-11-06 22:26:43,334 INFO L226 Difference]: Without dead ends: 5854 [2023-11-06 22:26:43,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:26:43,339 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 176 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:43,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 481 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:26:43,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5854 states. [2023-11-06 22:26:43,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5854 to 5834. [2023-11-06 22:26:43,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5834 states, 5828 states have (on average 1.3618737131091283) internal successors, (7937), 5833 states have internal predecessors, (7937), 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) [2023-11-06 22:26:43,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5834 states to 5834 states and 7937 transitions. [2023-11-06 22:26:43,916 INFO L78 Accepts]: Start accepts. Automaton has 5834 states and 7937 transitions. Word has length 98 [2023-11-06 22:26:43,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:43,917 INFO L495 AbstractCegarLoop]: Abstraction has 5834 states and 7937 transitions. [2023-11-06 22:26:43,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 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) [2023-11-06 22:26:43,917 INFO L276 IsEmpty]: Start isEmpty. Operand 5834 states and 7937 transitions. [2023-11-06 22:26:43,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-11-06 22:26:43,921 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:43,921 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1] [2023-11-06 22:26:43,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-06 22:26:43,922 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 22:26:43,922 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:43,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1406860725, now seen corresponding path program 2 times [2023-11-06 22:26:43,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:43,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782671825] [2023-11-06 22:26:43,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:43,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:43,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:44,072 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 22:26:44,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:44,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782671825] [2023-11-06 22:26:44,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782671825] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:44,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:44,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:26:44,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599285786] [2023-11-06 22:26:44,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:44,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:26:44,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:44,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:26:44,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:26:44,075 INFO L87 Difference]: Start difference. First operand 5834 states and 7937 transitions. Second operand has 5 states, 4 states have (on average 24.25) internal successors, (97), 5 states have internal predecessors, (97), 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) [2023-11-06 22:26:45,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:45,123 INFO L93 Difference]: Finished difference Result 6075 states and 8249 transitions. [2023-11-06 22:26:45,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:26:45,124 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.25) internal successors, (97), 5 states have internal predecessors, (97), 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 98 [2023-11-06 22:26:45,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:45,130 INFO L225 Difference]: With dead ends: 6075 [2023-11-06 22:26:45,131 INFO L226 Difference]: Without dead ends: 5082 [2023-11-06 22:26:45,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:26:45,134 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 184 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:45,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 556 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:26:45,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5082 states. [2023-11-06 22:26:45,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5082 to 5062. [2023-11-06 22:26:45,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5062 states, 5056 states have (on average 1.364121835443038) internal successors, (6897), 5061 states have internal predecessors, (6897), 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) [2023-11-06 22:26:45,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5062 states to 5062 states and 6897 transitions. [2023-11-06 22:26:45,654 INFO L78 Accepts]: Start accepts. Automaton has 5062 states and 6897 transitions. Word has length 98 [2023-11-06 22:26:45,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:45,655 INFO L495 AbstractCegarLoop]: Abstraction has 5062 states and 6897 transitions. [2023-11-06 22:26:45,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.25) internal successors, (97), 5 states have internal predecessors, (97), 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) [2023-11-06 22:26:45,655 INFO L276 IsEmpty]: Start isEmpty. Operand 5062 states and 6897 transitions. [2023-11-06 22:26:45,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-11-06 22:26:45,659 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:45,659 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2023-11-06 22:26:45,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-06 22:26:45,659 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 22:26:45,660 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:45,660 INFO L85 PathProgramCache]: Analyzing trace with hash -616498749, now seen corresponding path program 1 times [2023-11-06 22:26:45,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:45,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105081014] [2023-11-06 22:26:45,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:45,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:45,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:45,722 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-06 22:26:45,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:45,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105081014] [2023-11-06 22:26:45,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105081014] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:45,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:45,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:26:45,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412393634] [2023-11-06 22:26:45,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:45,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:26:45,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:45,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:26:45,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:26:45,725 INFO L87 Difference]: Start difference. First operand 5062 states and 6897 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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) [2023-11-06 22:26:46,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:46,259 INFO L93 Difference]: Finished difference Result 9475 states and 12953 transitions. [2023-11-06 22:26:46,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:26:46,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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 98 [2023-11-06 22:26:46,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:46,265 INFO L225 Difference]: With dead ends: 9475 [2023-11-06 22:26:46,265 INFO L226 Difference]: Without dead ends: 5046 [2023-11-06 22:26:46,269 INFO L412 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 [2023-11-06 22:26:46,270 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 6 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:46,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 182 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:26:46,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5046 states. [2023-11-06 22:26:46,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5046 to 4984. [2023-11-06 22:26:46,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4984 states, 4978 states have (on average 1.3457211731619123) internal successors, (6699), 4983 states have internal predecessors, (6699), 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) [2023-11-06 22:26:46,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4984 states to 4984 states and 6699 transitions. [2023-11-06 22:26:46,724 INFO L78 Accepts]: Start accepts. Automaton has 4984 states and 6699 transitions. Word has length 98 [2023-11-06 22:26:46,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:46,724 INFO L495 AbstractCegarLoop]: Abstraction has 4984 states and 6699 transitions. [2023-11-06 22:26:46,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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) [2023-11-06 22:26:46,724 INFO L276 IsEmpty]: Start isEmpty. Operand 4984 states and 6699 transitions. [2023-11-06 22:26:46,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-11-06 22:26:46,727 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:46,727 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:26:46,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-06 22:26:46,727 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 22:26:46,728 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:46,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1492177009, now seen corresponding path program 1 times [2023-11-06 22:26:46,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:46,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424701959] [2023-11-06 22:26:46,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:46,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:46,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:46,874 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-06 22:26:46,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:46,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424701959] [2023-11-06 22:26:46,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424701959] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:46,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:46,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:26:46,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216966582] [2023-11-06 22:26:46,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:46,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:26:46,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:46,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:26:46,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:26:46,877 INFO L87 Difference]: Start difference. First operand 4984 states and 6699 transitions. Second operand has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 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) [2023-11-06 22:26:47,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:47,481 INFO L93 Difference]: Finished difference Result 4992 states and 6704 transitions. [2023-11-06 22:26:47,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:26:47,481 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 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 100 [2023-11-06 22:26:47,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:47,486 INFO L225 Difference]: With dead ends: 4992 [2023-11-06 22:26:47,486 INFO L226 Difference]: Without dead ends: 4984 [2023-11-06 22:26:47,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:26:47,488 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 140 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:47,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 441 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:26:47,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4984 states. [2023-11-06 22:26:47,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4984 to 4984. [2023-11-06 22:26:47,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4984 states, 4978 states have (on average 1.3392928887103255) internal successors, (6667), 4983 states have internal predecessors, (6667), 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) [2023-11-06 22:26:47,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4984 states to 4984 states and 6667 transitions. [2023-11-06 22:26:47,917 INFO L78 Accepts]: Start accepts. Automaton has 4984 states and 6667 transitions. Word has length 100 [2023-11-06 22:26:47,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:47,918 INFO L495 AbstractCegarLoop]: Abstraction has 4984 states and 6667 transitions. [2023-11-06 22:26:47,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 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) [2023-11-06 22:26:47,918 INFO L276 IsEmpty]: Start isEmpty. Operand 4984 states and 6667 transitions. [2023-11-06 22:26:47,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-11-06 22:26:47,921 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:47,921 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-06 22:26:47,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-06 22:26:47,921 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 22:26:47,922 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:47,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1356366236, now seen corresponding path program 1 times [2023-11-06 22:26:47,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:47,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386147212] [2023-11-06 22:26:47,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:47,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:47,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:48,067 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 22:26:48,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:48,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386147212] [2023-11-06 22:26:48,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386147212] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:48,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:48,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:26:48,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499380148] [2023-11-06 22:26:48,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:48,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:26:48,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:48,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:26:48,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:26:48,070 INFO L87 Difference]: Start difference. First operand 4984 states and 6667 transitions. Second operand has 5 states, 4 states have (on average 23.75) internal successors, (95), 5 states have internal predecessors, (95), 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) [2023-11-06 22:26:48,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:48,771 INFO L93 Difference]: Finished difference Result 6274 states and 8458 transitions. [2023-11-06 22:26:48,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:26:48,771 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.75) internal successors, (95), 5 states have internal predecessors, (95), 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 101 [2023-11-06 22:26:48,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:48,775 INFO L225 Difference]: With dead ends: 6274 [2023-11-06 22:26:48,775 INFO L226 Difference]: Without dead ends: 3603 [2023-11-06 22:26:48,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:26:48,779 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 127 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:48,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 381 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:26:48,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3603 states. [2023-11-06 22:26:49,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3603 to 3201. [2023-11-06 22:26:49,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3201 states, 3198 states have (on average 1.310193871169481) internal successors, (4190), 3200 states have internal predecessors, (4190), 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) [2023-11-06 22:26:49,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3201 states to 3201 states and 4190 transitions. [2023-11-06 22:26:49,144 INFO L78 Accepts]: Start accepts. Automaton has 3201 states and 4190 transitions. Word has length 101 [2023-11-06 22:26:49,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:49,144 INFO L495 AbstractCegarLoop]: Abstraction has 3201 states and 4190 transitions. [2023-11-06 22:26:49,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.75) internal successors, (95), 5 states have internal predecessors, (95), 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) [2023-11-06 22:26:49,144 INFO L276 IsEmpty]: Start isEmpty. Operand 3201 states and 4190 transitions. [2023-11-06 22:26:49,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-11-06 22:26:49,146 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:49,146 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:26:49,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-06 22:26:49,147 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 22:26:49,147 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:49,147 INFO L85 PathProgramCache]: Analyzing trace with hash 852205028, now seen corresponding path program 1 times [2023-11-06 22:26:49,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:49,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507520993] [2023-11-06 22:26:49,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:49,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:49,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:49,318 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-06 22:26:49,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:49,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507520993] [2023-11-06 22:26:49,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507520993] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:49,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:49,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:26:49,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537464738] [2023-11-06 22:26:49,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:49,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:26:49,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:49,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:26:49,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:26:49,321 INFO L87 Difference]: Start difference. First operand 3201 states and 4190 transitions. Second operand has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 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) [2023-11-06 22:26:49,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:49,805 INFO L93 Difference]: Finished difference Result 3202 states and 4190 transitions. [2023-11-06 22:26:49,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:26:49,806 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 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 102 [2023-11-06 22:26:49,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:49,809 INFO L225 Difference]: With dead ends: 3202 [2023-11-06 22:26:49,809 INFO L226 Difference]: Without dead ends: 3194 [2023-11-06 22:26:49,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:26:49,811 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 147 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:49,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 366 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:26:49,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3194 states. [2023-11-06 22:26:50,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3194 to 3194. [2023-11-06 22:26:50,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3194 states, 3193 states have (on average 1.303163169433135) internal successors, (4161), 3193 states have internal predecessors, (4161), 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) [2023-11-06 22:26:50,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3194 states to 3194 states and 4161 transitions. [2023-11-06 22:26:50,175 INFO L78 Accepts]: Start accepts. Automaton has 3194 states and 4161 transitions. Word has length 102 [2023-11-06 22:26:50,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:50,175 INFO L495 AbstractCegarLoop]: Abstraction has 3194 states and 4161 transitions. [2023-11-06 22:26:50,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 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) [2023-11-06 22:26:50,175 INFO L276 IsEmpty]: Start isEmpty. Operand 3194 states and 4161 transitions. [2023-11-06 22:26:50,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-11-06 22:26:50,179 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:50,179 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:26:50,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-11-06 22:26:50,180 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 22:26:50,180 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:50,182 INFO L85 PathProgramCache]: Analyzing trace with hash -902319504, now seen corresponding path program 1 times [2023-11-06 22:26:50,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:50,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866368608] [2023-11-06 22:26:50,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:50,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:50,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:50,370 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 22:26:50,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:50,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866368608] [2023-11-06 22:26:50,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866368608] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:50,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:50,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:26:50,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882438247] [2023-11-06 22:26:50,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:50,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:26:50,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:50,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:26:50,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:26:50,373 INFO L87 Difference]: Start difference. First operand 3194 states and 4161 transitions. Second operand has 5 states, 4 states have (on average 24.0) internal successors, (96), 5 states have internal predecessors, (96), 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) [2023-11-06 22:26:50,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:50,808 INFO L93 Difference]: Finished difference Result 3195 states and 4161 transitions. [2023-11-06 22:26:50,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:26:50,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.0) internal successors, (96), 5 states have internal predecessors, (96), 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 102 [2023-11-06 22:26:50,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:50,813 INFO L225 Difference]: With dead ends: 3195 [2023-11-06 22:26:50,813 INFO L226 Difference]: Without dead ends: 3194 [2023-11-06 22:26:50,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:26:50,815 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 117 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:50,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 379 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:26:50,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3194 states. [2023-11-06 22:26:51,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3194 to 3194. [2023-11-06 22:26:51,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3194 states, 3193 states have (on average 1.3006576886940182) internal successors, (4153), 3193 states have internal predecessors, (4153), 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) [2023-11-06 22:26:51,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3194 states to 3194 states and 4153 transitions. [2023-11-06 22:26:51,206 INFO L78 Accepts]: Start accepts. Automaton has 3194 states and 4153 transitions. Word has length 102 [2023-11-06 22:26:51,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:51,207 INFO L495 AbstractCegarLoop]: Abstraction has 3194 states and 4153 transitions. [2023-11-06 22:26:51,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.0) internal successors, (96), 5 states have internal predecessors, (96), 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) [2023-11-06 22:26:51,207 INFO L276 IsEmpty]: Start isEmpty. Operand 3194 states and 4153 transitions. [2023-11-06 22:26:51,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-06 22:26:51,209 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:51,209 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:26:51,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-11-06 22:26:51,209 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 22:26:51,209 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:51,209 INFO L85 PathProgramCache]: Analyzing trace with hash 359852434, now seen corresponding path program 1 times [2023-11-06 22:26:51,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:51,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469907361] [2023-11-06 22:26:51,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:51,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:51,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:51,353 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-06 22:26:51,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:51,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469907361] [2023-11-06 22:26:51,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469907361] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:51,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:51,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:26:51,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916899575] [2023-11-06 22:26:51,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:51,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:26:51,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:51,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:26:51,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:26:51,356 INFO L87 Difference]: Start difference. First operand 3194 states and 4153 transitions. Second operand has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 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) [2023-11-06 22:26:51,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:51,940 INFO L93 Difference]: Finished difference Result 3416 states and 4449 transitions. [2023-11-06 22:26:51,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:26:51,941 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 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 [2023-11-06 22:26:51,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:51,944 INFO L225 Difference]: With dead ends: 3416 [2023-11-06 22:26:51,944 INFO L226 Difference]: Without dead ends: 2927 [2023-11-06 22:26:51,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:26:51,946 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 153 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:51,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 495 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:26:51,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2927 states. [2023-11-06 22:26:52,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2927 to 2706. [2023-11-06 22:26:52,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 2705 states have (on average 1.2913123844731977) internal successors, (3493), 2705 states have internal predecessors, (3493), 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) [2023-11-06 22:26:52,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 3493 transitions. [2023-11-06 22:26:52,233 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 3493 transitions. Word has length 104 [2023-11-06 22:26:52,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:52,233 INFO L495 AbstractCegarLoop]: Abstraction has 2706 states and 3493 transitions. [2023-11-06 22:26:52,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 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) [2023-11-06 22:26:52,234 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 3493 transitions. [2023-11-06 22:26:52,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-06 22:26:52,236 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:52,236 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:26:52,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-11-06 22:26:52,237 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 22:26:52,237 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:52,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1288261038, now seen corresponding path program 2 times [2023-11-06 22:26:52,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:52,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277423820] [2023-11-06 22:26:52,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:52,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:52,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:52,385 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 22:26:52,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:52,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277423820] [2023-11-06 22:26:52,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277423820] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:52,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:52,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:26:52,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426997159] [2023-11-06 22:26:52,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:52,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:26:52,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:52,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:26:52,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:26:52,388 INFO L87 Difference]: Start difference. First operand 2706 states and 3493 transitions. Second operand has 5 states, 4 states have (on average 24.5) internal successors, (98), 5 states have internal predecessors, (98), 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) [2023-11-06 22:26:52,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:52,766 INFO L93 Difference]: Finished difference Result 2707 states and 3493 transitions. [2023-11-06 22:26:52,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:26:52,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.5) internal successors, (98), 5 states have internal predecessors, (98), 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 [2023-11-06 22:26:52,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:52,768 INFO L225 Difference]: With dead ends: 2707 [2023-11-06 22:26:52,769 INFO L226 Difference]: Without dead ends: 1866 [2023-11-06 22:26:52,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:26:52,770 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 137 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:52,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 485 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:26:52,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1866 states. [2023-11-06 22:26:52,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1866 to 1866. [2023-11-06 22:26:52,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1866 states, 1865 states have (on average 1.2809651474530832) internal successors, (2389), 1865 states have internal predecessors, (2389), 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) [2023-11-06 22:26:52,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1866 states and 2389 transitions. [2023-11-06 22:26:52,967 INFO L78 Accepts]: Start accepts. Automaton has 1866 states and 2389 transitions. Word has length 104 [2023-11-06 22:26:52,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:52,967 INFO L495 AbstractCegarLoop]: Abstraction has 1866 states and 2389 transitions. [2023-11-06 22:26:52,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.5) internal successors, (98), 5 states have internal predecessors, (98), 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) [2023-11-06 22:26:52,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1866 states and 2389 transitions. [2023-11-06 22:26:52,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-06 22:26:52,971 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:52,971 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-06 22:26:52,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-11-06 22:26:52,971 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 22:26:52,972 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:52,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1572607299, now seen corresponding path program 1 times [2023-11-06 22:26:52,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:52,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397587615] [2023-11-06 22:26:52,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:52,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:52,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:53,128 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-06 22:26:53,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:53,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397587615] [2023-11-06 22:26:53,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397587615] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:53,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:53,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:26:53,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747700177] [2023-11-06 22:26:53,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:53,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:26:53,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:53,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:26:53,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:26:53,131 INFO L87 Difference]: Start difference. First operand 1866 states and 2389 transitions. Second operand has 5 states, 4 states have (on average 28.75) internal successors, (115), 5 states have internal predecessors, (115), 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) [2023-11-06 22:26:53,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:53,419 INFO L93 Difference]: Finished difference Result 1866 states and 2389 transitions. [2023-11-06 22:26:53,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:26:53,419 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 28.75) internal successors, (115), 5 states have internal predecessors, (115), 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 126 [2023-11-06 22:26:53,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:53,420 INFO L225 Difference]: With dead ends: 1866 [2023-11-06 22:26:53,420 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 22:26:53,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:26:53,422 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 127 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:53,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 494 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:26:53,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 22:26:53,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 22:26:53,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2023-11-06 22:26:53,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 22:26:53,424 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 126 [2023-11-06 22:26:53,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:53,424 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 22:26:53,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 28.75) internal successors, (115), 5 states have internal predecessors, (115), 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) [2023-11-06 22:26:53,424 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 22:26:53,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 22:26:53,427 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2023-11-06 22:26:53,428 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2023-11-06 22:26:53,429 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2023-11-06 22:26:53,429 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2023-11-06 22:26:53,429 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2023-11-06 22:26:53,429 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2023-11-06 22:26:53,430 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2023-11-06 22:26:53,430 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2023-11-06 22:26:53,430 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2023-11-06 22:26:53,430 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2023-11-06 22:26:53,431 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2023-11-06 22:26:53,431 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2023-11-06 22:26:53,431 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2023-11-06 22:26:53,431 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2023-11-06 22:26:53,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-11-06 22:26:53,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 22:27:01,853 WARN L293 SmtUtils]: Spent 5.37s on a formula simplification. DAG size of input: 673 DAG size of output: 109 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-06 22:27:07,338 WARN L293 SmtUtils]: Spent 5.48s on a formula simplification. DAG size of input: 705 DAG size of output: 109 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-06 22:27:14,556 WARN L293 SmtUtils]: Spent 6.03s on a formula simplification. DAG size of input: 733 DAG size of output: 109 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-06 22:27:35,397 WARN L293 SmtUtils]: Spent 6.15s on a formula simplification. DAG size of input: 701 DAG size of output: 109 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-06 22:27:41,105 WARN L293 SmtUtils]: Spent 5.71s on a formula simplification. DAG size of input: 674 DAG size of output: 110 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-06 22:27:50,616 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 181) no Hoare annotation was computed. [2023-11-06 22:27:50,617 INFO L895 garLoopResultBuilder]: At program point L366(lines 363 376) the Hoare annotation is: (let ((.cse4 (= ~st2~0 1)) (.cse2 (= ~st3~0 1)) (.cse0 (= ~st1~0 1)) (.cse1 (= (* 256 (div ~mode1~0 256)) ~mode1~0)) (.cse6 (= ~st3~0 0)) (.cse5 (= ~st1~0 0)) (.cse3 (= ~st2~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse2 .cse5) (and .cse0 .cse4 .cse1 .cse6) (and .cse1 .cse2 .cse5 .cse3) (and .cse4 .cse1 .cse6 .cse5) (and .cse0 .cse4 .cse1 .cse2) (and .cse0 .cse1 .cse6 .cse3) (and .cse1 .cse6 .cse5 .cse3))) [2023-11-06 22:27:50,617 INFO L899 garLoopResultBuilder]: For program point L267(lines 267 280) no Hoare annotation was computed. [2023-11-06 22:27:50,617 INFO L899 garLoopResultBuilder]: For program point L135(lines 135 351) no Hoare annotation was computed. [2023-11-06 22:27:50,618 INFO L899 garLoopResultBuilder]: For program point L102(lines 102 408) no Hoare annotation was computed. [2023-11-06 22:27:50,618 INFO L899 garLoopResultBuilder]: For program point L152(lines 152 300) no Hoare annotation was computed. [2023-11-06 22:27:50,618 INFO L899 garLoopResultBuilder]: For program point L86(lines 86 448) no Hoare annotation was computed. [2023-11-06 22:27:50,618 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 212) no Hoare annotation was computed. [2023-11-06 22:27:50,618 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 212) no Hoare annotation was computed. [2023-11-06 22:27:50,619 INFO L895 garLoopResultBuilder]: At program point L170(lines 165 260) the Hoare annotation is: (let ((.cse3 (= ~st2~0 0)) (.cse2 (= ~st3~0 1)) (.cse0 (= ~st1~0 1)) (.cse1 (= ~st2~0 1)) (.cse5 (= ~st3~0 0)) (.cse4 (= ~st1~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse2 .cse3) (and .cse2 .cse4 .cse3) (and .cse5 .cse4 .cse3) (and .cse0 .cse5 .cse3) (and .cse1 .cse2 .cse4) (and .cse0 .cse1 .cse5) (and .cse1 .cse5 .cse4))) [2023-11-06 22:27:50,619 INFO L899 garLoopResultBuilder]: For program point L137(lines 137 346) no Hoare annotation was computed. [2023-11-06 22:27:50,619 INFO L899 garLoopResultBuilder]: For program point L104(lines 104 403) no Hoare annotation was computed. [2023-11-06 22:27:50,619 INFO L899 garLoopResultBuilder]: For program point L88(lines 88 443) no Hoare annotation was computed. [2023-11-06 22:27:50,619 INFO L899 garLoopResultBuilder]: For program point L336(lines 336 345) no Hoare annotation was computed. [2023-11-06 22:27:50,620 INFO L895 garLoopResultBuilder]: At program point L270(lines 267 280) the Hoare annotation is: (let ((.cse5 (= ~st2~0 1)) (.cse6 (= ~st3~0 0)) (.cse2 (= ~st1~0 0)) (.cse4 (= ~st1~0 1)) (.cse0 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse1 (= ~st3~0 1)) (.cse3 (= ~st2~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse0) (and .cse4 .cse5 .cse0 .cse1) (and .cse5 .cse0 .cse1 .cse2) (and .cse4 .cse6 .cse0 .cse3) (and .cse6 .cse0 .cse2 .cse3) (and .cse5 .cse6 .cse0 .cse2) (and .cse4 .cse0 .cse1 .cse3))) [2023-11-06 22:27:50,620 INFO L895 garLoopResultBuilder]: At program point L155(lines 150 305) the Hoare annotation is: (let ((.cse3 (= ~st2~0 0)) (.cse2 (= ~st3~0 1)) (.cse0 (= ~st1~0 1)) (.cse1 (= ~st2~0 1)) (.cse5 (= ~st3~0 0)) (.cse4 (= ~st1~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse2 .cse3) (and .cse2 .cse4 .cse3) (and .cse5 .cse4 .cse3) (and .cse0 .cse5 .cse3) (and .cse1 .cse2 .cse4) (and .cse0 .cse1 .cse5) (and .cse1 .cse5 .cse4))) [2023-11-06 22:27:50,621 INFO L895 garLoopResultBuilder]: At program point L122(lines 114 384) the Hoare annotation is: (let ((.cse3 (= ~st2~0 0)) (.cse2 (= ~st3~0 1)) (.cse0 (= ~st1~0 1)) (.cse1 (= ~st2~0 1)) (.cse5 (= ~st3~0 0)) (.cse4 (= ~st1~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse2 .cse3) (and .cse2 .cse4 .cse3) (and .cse5 .cse4 .cse3) (and .cse0 .cse5 .cse3) (and .cse1 .cse2 .cse4) (and .cse0 .cse1 .cse5) (and .cse1 .cse5 .cse4))) [2023-11-06 22:27:50,621 INFO L895 garLoopResultBuilder]: At program point L172(lines 161 286) the Hoare annotation is: (let ((.cse3 (= ~st2~0 0)) (.cse2 (= ~st3~0 1)) (.cse0 (= ~st1~0 1)) (.cse1 (= ~st2~0 1)) (.cse5 (= ~st3~0 0)) (.cse4 (= ~st1~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse2 .cse3) (and .cse2 .cse4 .cse3) (and .cse5 .cse4 .cse3) (and .cse0 .cse5 .cse3) (and .cse1 .cse2 .cse4) (and .cse0 .cse1 .cse5) (and .cse1 .cse5 .cse4))) [2023-11-06 22:27:50,621 INFO L899 garLoopResultBuilder]: For program point L106(lines 106 398) no Hoare annotation was computed. [2023-11-06 22:27:50,621 INFO L895 garLoopResultBuilder]: At program point L189(lines 181 241) the Hoare annotation is: (let ((.cse3 (= ~st2~0 0)) (.cse2 (= ~st3~0 1)) (.cse0 (= ~st1~0 1)) (.cse1 (= ~st2~0 1)) (.cse5 (= ~st3~0 0)) (.cse4 (= ~st1~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse2 .cse3) (and .cse2 .cse4 .cse3) (and .cse5 .cse4 .cse3) (and .cse0 .cse5 .cse3) (and .cse1 .cse2 .cse4) (and .cse0 .cse1 .cse5) (and .cse1 .cse5 .cse4))) [2023-11-06 22:27:50,622 INFO L895 garLoopResultBuilder]: At program point $Ultimate##60(lines 186 222) the Hoare annotation is: (let ((.cse4 (= ~st1~0 1)) (.cse2 (= ~st2~0 0)) (.cse0 (= ~st3~0 1)) (.cse6 (= ~st2~0 1)) (.cse5 (= ~st3~0 0)) (.cse1 (= ~st1~0 0)) (.cse3 (<= (+ (* (div ~r1~0 256) 256) 3) ~r1~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse2) (and .cse5 .cse1 .cse2) (and .cse4 .cse5 .cse2) (and .cse6 .cse0 .cse1) (and .cse6 .cse5 .cse1 .cse3))) [2023-11-06 22:27:50,622 INFO L899 garLoopResultBuilder]: For program point L90(lines 90 438) no Hoare annotation was computed. [2023-11-06 22:27:50,622 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 226) no Hoare annotation was computed. [2023-11-06 22:27:50,623 INFO L895 garLoopResultBuilder]: At program point L140(lines 135 351) the Hoare annotation is: (let ((.cse3 (= ~st2~0 0)) (.cse2 (= ~st3~0 1)) (.cse0 (= ~st1~0 1)) (.cse1 (= ~st2~0 1)) (.cse5 (= ~st3~0 0)) (.cse4 (= ~st1~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse2 .cse3) (and .cse2 .cse4 .cse3) (and .cse5 .cse4 .cse3) (and .cse0 .cse5 .cse3) (and .cse1 .cse2 .cse4) (and .cse0 .cse1 .cse5) (and .cse1 .cse5 .cse4))) [2023-11-06 22:27:50,623 INFO L895 garLoopResultBuilder]: At program point L322(lines 310 330) the Hoare annotation is: (let ((.cse1 (= ~st2~0 1)) (.cse4 (= ~st3~0 0)) (.cse6 (= ~st1~0 0)) (.cse0 (= ~st1~0 1)) (.cse2 (= (* 256 (div ~mode2~0 256)) ~mode2~0)) (.cse3 (= ~st3~0 1)) (.cse5 (= ~st2~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse4 .cse5) (and .cse1 .cse2 .cse3 .cse6) (and .cse0 .cse1 .cse2 .cse4) (and .cse2 .cse3 .cse6 .cse5) (and .cse1 .cse2 .cse4 .cse6) (and .cse2 .cse4 .cse6 .cse5) (and .cse0 .cse2 .cse3 .cse5))) [2023-11-06 22:27:50,623 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 22:27:50,624 INFO L895 garLoopResultBuilder]: At program point L157(lines 146 331) the Hoare annotation is: (let ((.cse3 (= ~st2~0 0)) (.cse2 (= ~st3~0 1)) (.cse0 (= ~st1~0 1)) (.cse1 (= ~st2~0 1)) (.cse5 (= ~st3~0 0)) (.cse4 (= ~st1~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse2 .cse3) (and .cse2 .cse4 .cse3) (and .cse5 .cse4 .cse3) (and .cse0 .cse5 .cse3) (and .cse1 .cse2 .cse4) (and .cse0 .cse1 .cse5) (and .cse1 .cse5 .cse4))) [2023-11-06 22:27:50,624 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 226) no Hoare annotation was computed. [2023-11-06 22:27:50,624 INFO L899 garLoopResultBuilder]: For program point L108(lines 108 393) no Hoare annotation was computed. [2023-11-06 22:27:50,624 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 181) no Hoare annotation was computed. [2023-11-06 22:27:50,624 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 433) no Hoare annotation was computed. [2023-11-06 22:27:50,625 INFO L895 garLoopResultBuilder]: At program point L373(lines 361 381) the Hoare annotation is: (let ((.cse4 (= ~st2~0 1)) (.cse2 (= ~st3~0 1)) (.cse0 (= ~st1~0 1)) (.cse1 (= (* 256 (div ~mode1~0 256)) ~mode1~0)) (.cse6 (= ~st3~0 0)) (.cse5 (= ~st1~0 0)) (.cse3 (= ~st2~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse2 .cse5) (and .cse0 .cse4 .cse1 .cse6) (and .cse1 .cse2 .cse5 .cse3) (and .cse4 .cse1 .cse6 .cse5) (and .cse0 .cse4 .cse1 .cse2) (and .cse0 .cse1 .cse6 .cse3) (and .cse1 .cse6 .cse5 .cse3))) [2023-11-06 22:27:50,625 INFO L895 garLoopResultBuilder]: At program point L142(lines 126 382) the Hoare annotation is: (let ((.cse3 (= ~st2~0 0)) (.cse2 (= ~st3~0 1)) (.cse0 (= ~st1~0 1)) (.cse1 (= ~st2~0 1)) (.cse5 (= ~st3~0 0)) (.cse4 (= ~st1~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse2 .cse3) (and .cse2 .cse4 .cse3) (and .cse5 .cse4 .cse3) (and .cse0 .cse5 .cse3) (and .cse1 .cse2 .cse4) (and .cse0 .cse1 .cse5) (and .cse1 .cse5 .cse4))) [2023-11-06 22:27:50,625 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 212) no Hoare annotation was computed. [2023-11-06 22:27:50,626 INFO L899 garLoopResultBuilder]: For program point L291(lines 291 299) no Hoare annotation was computed. [2023-11-06 22:27:50,626 INFO L899 garLoopResultBuilder]: For program point L126(lines 126 382) no Hoare annotation was computed. [2023-11-06 22:27:50,626 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 58 470) the Hoare annotation is: true [2023-11-06 22:27:50,626 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 212) no Hoare annotation was computed. [2023-11-06 22:27:50,626 INFO L899 garLoopResultBuilder]: For program point L226(line 226) no Hoare annotation was computed. [2023-11-06 22:27:50,626 INFO L899 garLoopResultBuilder]: For program point L226-1(line 226) no Hoare annotation was computed. [2023-11-06 22:27:50,627 INFO L899 garLoopResultBuilder]: For program point L226-2(line 226) no Hoare annotation was computed. [2023-11-06 22:27:50,627 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 132) no Hoare annotation was computed. [2023-11-06 22:27:50,627 INFO L899 garLoopResultBuilder]: For program point L226-3(line 226) no Hoare annotation was computed. [2023-11-06 22:27:50,627 INFO L899 garLoopResultBuilder]: For program point L94(lines 94 428) no Hoare annotation was computed. [2023-11-06 22:27:50,627 INFO L899 garLoopResultBuilder]: For program point L226-4(lines 226 234) no Hoare annotation was computed. [2023-11-06 22:27:50,628 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 22:27:50,628 INFO L899 garLoopResultBuilder]: For program point L78(lines 78 468) no Hoare annotation was computed. [2023-11-06 22:27:50,628 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 132) no Hoare annotation was computed. [2023-11-06 22:27:50,628 INFO L899 garLoopResultBuilder]: For program point L161(lines 161 286) no Hoare annotation was computed. [2023-11-06 22:27:50,628 INFO L899 garLoopResultBuilder]: For program point L128(lines 128 356) no Hoare annotation was computed. [2023-11-06 22:27:50,629 INFO L899 garLoopResultBuilder]: For program point L310(lines 310 330) no Hoare annotation was computed. [2023-11-06 22:27:50,629 INFO L895 garLoopResultBuilder]: At program point L277(lines 265 285) the Hoare annotation is: (let ((.cse5 (= ~st2~0 1)) (.cse6 (= ~st3~0 0)) (.cse2 (= ~st1~0 0)) (.cse4 (= ~st1~0 1)) (.cse0 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse1 (= ~st3~0 1)) (.cse3 (= ~st2~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse0) (and .cse4 .cse5 .cse0 .cse1) (and .cse5 .cse0 .cse1 .cse2) (and .cse4 .cse6 .cse0 .cse3) (and .cse6 .cse0 .cse2 .cse3) (and .cse5 .cse6 .cse0 .cse2) (and .cse4 .cse0 .cse1 .cse3))) [2023-11-06 22:27:50,629 INFO L899 garLoopResultBuilder]: For program point L13(line 13) no Hoare annotation was computed. [2023-11-06 22:27:50,629 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 22:27:50,630 INFO L899 garLoopResultBuilder]: For program point L96(lines 96 423) no Hoare annotation was computed. [2023-11-06 22:27:50,630 INFO L899 garLoopResultBuilder]: For program point L212(line 212) no Hoare annotation was computed. [2023-11-06 22:27:50,630 INFO L899 garLoopResultBuilder]: For program point L212-1(line 212) no Hoare annotation was computed. [2023-11-06 22:27:50,630 INFO L899 garLoopResultBuilder]: For program point L146(lines 146 331) no Hoare annotation was computed. [2023-11-06 22:27:50,630 INFO L899 garLoopResultBuilder]: For program point L212-2(line 212) no Hoare annotation was computed. [2023-11-06 22:27:50,631 INFO L899 garLoopResultBuilder]: For program point L113(lines 113 388) no Hoare annotation was computed. [2023-11-06 22:27:50,631 INFO L899 garLoopResultBuilder]: For program point L212-3(line 212) no Hoare annotation was computed. [2023-11-06 22:27:50,631 INFO L899 garLoopResultBuilder]: For program point L80(lines 80 463) no Hoare annotation was computed. [2023-11-06 22:27:50,631 INFO L899 garLoopResultBuilder]: For program point L212-4(lines 212 221) no Hoare annotation was computed. [2023-11-06 22:27:50,631 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 226) no Hoare annotation was computed. [2023-11-06 22:27:50,631 INFO L899 garLoopResultBuilder]: For program point L361(lines 361 381) no Hoare annotation was computed. [2023-11-06 22:27:50,632 INFO L899 garLoopResultBuilder]: For program point L312(lines 312 325) no Hoare annotation was computed. [2023-11-06 22:27:50,632 INFO L899 garLoopResultBuilder]: For program point L246(lines 246 254) no Hoare annotation was computed. [2023-11-06 22:27:50,632 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 226) no Hoare annotation was computed. [2023-11-06 22:27:50,632 INFO L895 garLoopResultBuilder]: At program point L131(lines 128 356) the Hoare annotation is: (let ((.cse3 (= ~st2~0 0)) (.cse2 (= ~st3~0 1)) (.cse0 (= ~st1~0 1)) (.cse1 (= ~st2~0 1)) (.cse5 (= ~st3~0 0)) (.cse4 (= ~st1~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse2 .cse3) (and .cse2 .cse4 .cse3) (and .cse5 .cse4 .cse3) (and .cse0 .cse5 .cse3) (and .cse1 .cse2 .cse4) (and .cse0 .cse1 .cse5) (and .cse1 .cse5 .cse4))) [2023-11-06 22:27:50,633 INFO L899 garLoopResultBuilder]: For program point L98(lines 98 418) no Hoare annotation was computed. [2023-11-06 22:27:50,633 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 22:27:50,633 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 181) no Hoare annotation was computed. [2023-11-06 22:27:50,633 INFO L899 garLoopResultBuilder]: For program point L181(line 181) no Hoare annotation was computed. [2023-11-06 22:27:50,633 INFO L899 garLoopResultBuilder]: For program point L181-1(line 181) no Hoare annotation was computed. [2023-11-06 22:27:50,634 INFO L899 garLoopResultBuilder]: For program point L181-2(line 181) no Hoare annotation was computed. [2023-11-06 22:27:50,634 INFO L899 garLoopResultBuilder]: For program point L82(lines 82 458) no Hoare annotation was computed. [2023-11-06 22:27:50,634 INFO L899 garLoopResultBuilder]: For program point L181-3(line 181) no Hoare annotation was computed. [2023-11-06 22:27:50,634 INFO L899 garLoopResultBuilder]: For program point L181-4(lines 181 241) no Hoare annotation was computed. [2023-11-06 22:27:50,634 INFO L899 garLoopResultBuilder]: For program point L363(lines 363 376) no Hoare annotation was computed. [2023-11-06 22:27:50,634 INFO L899 garLoopResultBuilder]: For program point L165(lines 165 260) no Hoare annotation was computed. [2023-11-06 22:27:50,635 INFO L899 garLoopResultBuilder]: For program point L132(line 132) no Hoare annotation was computed. [2023-11-06 22:27:50,635 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 181) no Hoare annotation was computed. [2023-11-06 22:27:50,635 INFO L899 garLoopResultBuilder]: For program point L265(lines 265 285) no Hoare annotation was computed. [2023-11-06 22:27:50,635 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 207) no Hoare annotation was computed. [2023-11-06 22:27:50,635 INFO L899 garLoopResultBuilder]: For program point L100(lines 100 413) no Hoare annotation was computed. [2023-11-06 22:27:50,636 INFO L895 garLoopResultBuilder]: At program point L315(lines 312 325) the Hoare annotation is: (let ((.cse1 (= ~st2~0 1)) (.cse4 (= ~st3~0 0)) (.cse6 (= ~st1~0 0)) (.cse0 (= ~st1~0 1)) (.cse2 (= (* 256 (div ~mode2~0 256)) ~mode2~0)) (.cse3 (= ~st3~0 1)) (.cse5 (= ~st2~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse4 .cse5) (and .cse1 .cse2 .cse3 .cse6) (and .cse0 .cse1 .cse2 .cse4) (and .cse2 .cse3 .cse6 .cse5) (and .cse1 .cse2 .cse4 .cse6) (and .cse2 .cse4 .cse6 .cse5) (and .cse0 .cse2 .cse3 .cse5))) [2023-11-06 22:27:50,636 INFO L899 garLoopResultBuilder]: For program point L183(lines 183 235) no Hoare annotation was computed. [2023-11-06 22:27:50,636 INFO L899 garLoopResultBuilder]: For program point L150(lines 150 305) no Hoare annotation was computed. [2023-11-06 22:27:50,636 INFO L899 garLoopResultBuilder]: For program point L84(lines 84 453) no Hoare annotation was computed. [2023-11-06 22:27:50,637 INFO L899 garLoopResultBuilder]: For program point L167(lines 167 255) no Hoare annotation was computed. [2023-11-06 22:27:50,641 INFO L445 BasicCegarLoop]: Path program histogram: [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] [2023-11-06 22:27:50,644 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:27:50,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:27:50 BoogieIcfgContainer [2023-11-06 22:27:50,706 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:27:50,707 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:27:50,708 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:27:50,708 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:27:50,709 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:26:10" (3/4) ... [2023-11-06 22:27:50,711 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 22:27:50,728 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2023-11-06 22:27:50,729 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-06 22:27:50,730 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 22:27:50,731 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 22:27:50,857 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f225ff3-3b83-4fbd-8c45-80f36c895598/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:27:50,859 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f225ff3-3b83-4fbd-8c45-80f36c895598/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 22:27:50,859 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:27:50,860 INFO L158 Benchmark]: Toolchain (without parser) took 101747.21ms. Allocated memory was 153.1MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 120.4MB in the beginning and 1.9GB in the end (delta: -1.7GB). Peak memory consumption was 484.3MB. Max. memory is 16.1GB. [2023-11-06 22:27:50,860 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 113.2MB. Free memory is still 66.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:27:50,861 INFO L158 Benchmark]: CACSL2BoogieTranslator took 453.36ms. Allocated memory is still 153.1MB. Free memory was 120.4MB in the beginning and 106.4MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-06 22:27:50,861 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.13ms. Allocated memory is still 153.1MB. Free memory was 106.4MB in the beginning and 103.7MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:27:50,861 INFO L158 Benchmark]: Boogie Preprocessor took 35.57ms. Allocated memory is still 153.1MB. Free memory was 103.7MB in the beginning and 102.2MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:27:50,862 INFO L158 Benchmark]: RCFGBuilder took 657.89ms. Allocated memory is still 153.1MB. Free memory was 102.2MB in the beginning and 80.2MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-06 22:27:50,862 INFO L158 Benchmark]: TraceAbstraction took 100390.42ms. Allocated memory was 153.1MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 79.7MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2023-11-06 22:27:50,863 INFO L158 Benchmark]: Witness Printer took 151.76ms. Allocated memory is still 2.4GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-06 22:27:50,865 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 113.2MB. Free memory is still 66.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 453.36ms. Allocated memory is still 153.1MB. Free memory was 120.4MB in the beginning and 106.4MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.13ms. Allocated memory is still 153.1MB. Free memory was 106.4MB in the beginning and 103.7MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.57ms. Allocated memory is still 153.1MB. Free memory was 103.7MB in the beginning and 102.2MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 657.89ms. Allocated memory is still 153.1MB. Free memory was 102.2MB in the beginning and 80.2MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 100390.42ms. Allocated memory was 153.1MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 79.7MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 151.76ms. Allocated memory is still 2.4GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 132]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 132]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 181]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 181]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 181]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 181]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 212]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 212]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 212]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 212]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 226]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 226]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 226]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 226]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 90 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 100.3s, OverallIterations: 35, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 21.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 57.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5884 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5884 mSDsluCounter, 11948 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6225 mSDsCounter, 164 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3016 IncrementalHoareTripleChecker+Invalid, 3180 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 164 mSolverCounterUnsat, 5723 mSDtfsCounter, 3016 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 155 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9255occurred in iteration=20, InterpolantAutomatonStates: 161, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 16.1s AutomataMinimizationTime, 35 MinimizatonAttempts, 8001 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 1725 NumberOfFragments, 1631 HoareAnnotationTreeSize, 17 FomulaSimplifications, 896368 FormulaSimplificationTreeSizeReduction, 51.6s HoareSimplificationTime, 17 FomulaSimplificationsInter, 17961 FormulaSimplificationTreeSizeReductionInter, 5.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 2525 NumberOfCodeBlocks, 2525 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2490 ConstructedInterpolants, 0 QuantifiedInterpolants, 9613 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 PerfectInterpolantSequences, 773/773 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: 310]: Loop Invariant Derived loop invariant: (((((((((((st1 == 1) && (st2 == 1)) && ((256 * (mode2 / 256)) == mode2)) && (st3 == 1)) || ((((st1 == 1) && ((256 * (mode2 / 256)) == mode2)) && (st3 == 0)) && (st2 == 0))) || ((((st2 == 1) && ((256 * (mode2 / 256)) == mode2)) && (st3 == 1)) && (st1 == 0))) || ((((st1 == 1) && (st2 == 1)) && ((256 * (mode2 / 256)) == mode2)) && (st3 == 0))) || (((((256 * (mode2 / 256)) == mode2) && (st3 == 1)) && (st1 == 0)) && (st2 == 0))) || ((((st2 == 1) && ((256 * (mode2 / 256)) == mode2)) && (st3 == 0)) && (st1 == 0))) || (((((256 * (mode2 / 256)) == mode2) && (st3 == 0)) && (st1 == 0)) && (st2 == 0))) || ((((st1 == 1) && ((256 * (mode2 / 256)) == mode2)) && (st3 == 1)) && (st2 == 0))) - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: ((((((((((st1 == 1) && (st2 == 1)) && (st3 == 1)) || (((st1 == 1) && (st3 == 1)) && (st2 == 0))) || (((st3 == 1) && (st1 == 0)) && (st2 == 0))) || (((st3 == 0) && (st1 == 0)) && (st2 == 0))) || (((st1 == 1) && (st3 == 0)) && (st2 == 0))) || (((st2 == 1) && (st3 == 1)) && (st1 == 0))) || (((st1 == 1) && (st2 == 1)) && (st3 == 0))) || (((st2 == 1) && (st3 == 0)) && (st1 == 0))) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: ((((((((((st1 == 1) && (st2 == 1)) && (st3 == 1)) || (((st1 == 1) && (st3 == 1)) && (st2 == 0))) || (((st3 == 1) && (st1 == 0)) && (st2 == 0))) || (((st3 == 0) && (st1 == 0)) && (st2 == 0))) || (((st1 == 1) && (st3 == 0)) && (st2 == 0))) || (((st2 == 1) && (st3 == 1)) && (st1 == 0))) || (((st1 == 1) && (st2 == 1)) && (st3 == 0))) || (((st2 == 1) && (st3 == 0)) && (st1 == 0))) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((((((((st1 == 1) && (st2 == 1)) && (st3 == 1)) || (((st1 == 1) && (st3 == 1)) && (st2 == 0))) || (((st3 == 1) && (st1 == 0)) && (st2 == 0))) || (((st3 == 0) && (st1 == 0)) && (st2 == 0))) || (((st1 == 1) && (st3 == 0)) && (st2 == 0))) || (((st2 == 1) && (st3 == 1)) && (st1 == 0))) || (((st1 == 1) && (st2 == 1)) && (st3 == 0))) || (((st2 == 1) && (st3 == 0)) && (st1 == 0))) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: ((((((((((st1 == 1) && (st2 == 1)) && (st3 == 1)) || (((st1 == 1) && (st3 == 1)) && (st2 == 0))) || (((st3 == 1) && (st1 == 0)) && (st2 == 0))) || (((st3 == 0) && (st1 == 0)) && (st2 == 0))) || (((st1 == 1) && (st3 == 0)) && (st2 == 0))) || (((st2 == 1) && (st3 == 1)) && (st1 == 0))) || (((st1 == 1) && (st2 == 1)) && (st3 == 0))) || (((st2 == 1) && (st3 == 0)) && (st1 == 0))) - InvariantResult [Line: 363]: Loop Invariant Derived loop invariant: (((((((((((st1 == 1) && ((256 * (mode1 / 256)) == mode1)) && (st3 == 1)) && (st2 == 0)) || ((((st2 == 1) && ((256 * (mode1 / 256)) == mode1)) && (st3 == 1)) && (st1 == 0))) || ((((st1 == 1) && (st2 == 1)) && ((256 * (mode1 / 256)) == mode1)) && (st3 == 0))) || (((((256 * (mode1 / 256)) == mode1) && (st3 == 1)) && (st1 == 0)) && (st2 == 0))) || ((((st2 == 1) && ((256 * (mode1 / 256)) == mode1)) && (st3 == 0)) && (st1 == 0))) || ((((st1 == 1) && (st2 == 1)) && ((256 * (mode1 / 256)) == mode1)) && (st3 == 1))) || ((((st1 == 1) && ((256 * (mode1 / 256)) == mode1)) && (st3 == 0)) && (st2 == 0))) || (((((256 * (mode1 / 256)) == mode1) && (st3 == 0)) && (st1 == 0)) && (st2 == 0))) - InvariantResult [Line: 267]: Loop Invariant Derived loop invariant: ((((((((((((256 * (mode3 / 256)) == mode3) && (st3 == 1)) && (st1 == 0)) && (st2 == 0)) || ((((st1 == 1) && (st2 == 1)) && (st3 == 0)) && ((256 * (mode3 / 256)) == mode3))) || ((((st1 == 1) && (st2 == 1)) && ((256 * (mode3 / 256)) == mode3)) && (st3 == 1))) || ((((st2 == 1) && ((256 * (mode3 / 256)) == mode3)) && (st3 == 1)) && (st1 == 0))) || ((((st1 == 1) && (st3 == 0)) && ((256 * (mode3 / 256)) == mode3)) && (st2 == 0))) || ((((st3 == 0) && ((256 * (mode3 / 256)) == mode3)) && (st1 == 0)) && (st2 == 0))) || ((((st2 == 1) && (st3 == 0)) && ((256 * (mode3 / 256)) == mode3)) && (st1 == 0))) || ((((st1 == 1) && ((256 * (mode3 / 256)) == mode3)) && (st3 == 1)) && (st2 == 0))) - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: ((((((((((st1 == 1) && (st2 == 1)) && (st3 == 1)) || (((st1 == 1) && (st3 == 1)) && (st2 == 0))) || (((st3 == 1) && (st1 == 0)) && (st2 == 0))) || (((st3 == 0) && (st1 == 0)) && (st2 == 0))) || (((st1 == 1) && (st3 == 0)) && (st2 == 0))) || (((st2 == 1) && (st3 == 1)) && (st1 == 0))) || (((st1 == 1) && (st2 == 1)) && (st3 == 0))) || (((st2 == 1) && (st3 == 0)) && (st1 == 0))) - InvariantResult [Line: 58]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 312]: Loop Invariant Derived loop invariant: (((((((((((st1 == 1) && (st2 == 1)) && ((256 * (mode2 / 256)) == mode2)) && (st3 == 1)) || ((((st1 == 1) && ((256 * (mode2 / 256)) == mode2)) && (st3 == 0)) && (st2 == 0))) || ((((st2 == 1) && ((256 * (mode2 / 256)) == mode2)) && (st3 == 1)) && (st1 == 0))) || ((((st1 == 1) && (st2 == 1)) && ((256 * (mode2 / 256)) == mode2)) && (st3 == 0))) || (((((256 * (mode2 / 256)) == mode2) && (st3 == 1)) && (st1 == 0)) && (st2 == 0))) || ((((st2 == 1) && ((256 * (mode2 / 256)) == mode2)) && (st3 == 0)) && (st1 == 0))) || (((((256 * (mode2 / 256)) == mode2) && (st3 == 0)) && (st1 == 0)) && (st2 == 0))) || ((((st1 == 1) && ((256 * (mode2 / 256)) == mode2)) && (st3 == 1)) && (st2 == 0))) - InvariantResult [Line: 265]: Loop Invariant Derived loop invariant: ((((((((((((256 * (mode3 / 256)) == mode3) && (st3 == 1)) && (st1 == 0)) && (st2 == 0)) || ((((st1 == 1) && (st2 == 1)) && (st3 == 0)) && ((256 * (mode3 / 256)) == mode3))) || ((((st1 == 1) && (st2 == 1)) && ((256 * (mode3 / 256)) == mode3)) && (st3 == 1))) || ((((st2 == 1) && ((256 * (mode3 / 256)) == mode3)) && (st3 == 1)) && (st1 == 0))) || ((((st1 == 1) && (st3 == 0)) && ((256 * (mode3 / 256)) == mode3)) && (st2 == 0))) || ((((st3 == 0) && ((256 * (mode3 / 256)) == mode3)) && (st1 == 0)) && (st2 == 0))) || ((((st2 == 1) && (st3 == 0)) && ((256 * (mode3 / 256)) == mode3)) && (st1 == 0))) || ((((st1 == 1) && ((256 * (mode3 / 256)) == mode3)) && (st3 == 1)) && (st2 == 0))) - InvariantResult [Line: 150]: Loop Invariant Derived loop invariant: ((((((((((st1 == 1) && (st2 == 1)) && (st3 == 1)) || (((st1 == 1) && (st3 == 1)) && (st2 == 0))) || (((st3 == 1) && (st1 == 0)) && (st2 == 0))) || (((st3 == 0) && (st1 == 0)) && (st2 == 0))) || (((st1 == 1) && (st3 == 0)) && (st2 == 0))) || (((st2 == 1) && (st3 == 1)) && (st1 == 0))) || (((st1 == 1) && (st2 == 1)) && (st3 == 0))) || (((st2 == 1) && (st3 == 0)) && (st1 == 0))) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: ((((((((((st1 == 1) && (st2 == 1)) && (st3 == 1)) || (((st1 == 1) && (st3 == 1)) && (st2 == 0))) || (((st3 == 1) && (st1 == 0)) && (st2 == 0))) || (((st3 == 0) && (st1 == 0)) && (st2 == 0))) || (((st1 == 1) && (st3 == 0)) && (st2 == 0))) || (((st2 == 1) && (st3 == 1)) && (st1 == 0))) || (((st1 == 1) && (st2 == 1)) && (st3 == 0))) || (((st2 == 1) && (st3 == 0)) && (st1 == 0))) - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: (((((((((st3 == 1) && (st1 == 0)) && (st2 == 0)) && ((((r1 / 256) * 256) + 3) <= r1)) || (((st1 == 1) && (st3 == 1)) && (st2 == 0))) || (((st3 == 0) && (st1 == 0)) && (st2 == 0))) || (((st1 == 1) && (st3 == 0)) && (st2 == 0))) || (((st2 == 1) && (st3 == 1)) && (st1 == 0))) || ((((st2 == 1) && (st3 == 0)) && (st1 == 0)) && ((((r1 / 256) * 256) + 3) <= r1))) - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: ((((((((((st1 == 1) && (st2 == 1)) && (st3 == 1)) || (((st1 == 1) && (st3 == 1)) && (st2 == 0))) || (((st3 == 1) && (st1 == 0)) && (st2 == 0))) || (((st3 == 0) && (st1 == 0)) && (st2 == 0))) || (((st1 == 1) && (st3 == 0)) && (st2 == 0))) || (((st2 == 1) && (st3 == 1)) && (st1 == 0))) || (((st1 == 1) && (st2 == 1)) && (st3 == 0))) || (((st2 == 1) && (st3 == 0)) && (st1 == 0))) - InvariantResult [Line: 361]: Loop Invariant Derived loop invariant: (((((((((((st1 == 1) && ((256 * (mode1 / 256)) == mode1)) && (st3 == 1)) && (st2 == 0)) || ((((st2 == 1) && ((256 * (mode1 / 256)) == mode1)) && (st3 == 1)) && (st1 == 0))) || ((((st1 == 1) && (st2 == 1)) && ((256 * (mode1 / 256)) == mode1)) && (st3 == 0))) || (((((256 * (mode1 / 256)) == mode1) && (st3 == 1)) && (st1 == 0)) && (st2 == 0))) || ((((st2 == 1) && ((256 * (mode1 / 256)) == mode1)) && (st3 == 0)) && (st1 == 0))) || ((((st1 == 1) && (st2 == 1)) && ((256 * (mode1 / 256)) == mode1)) && (st3 == 1))) || ((((st1 == 1) && ((256 * (mode1 / 256)) == mode1)) && (st3 == 0)) && (st2 == 0))) || (((((256 * (mode1 / 256)) == mode1) && (st3 == 0)) && (st1 == 0)) && (st2 == 0))) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: ((((((((((st1 == 1) && (st2 == 1)) && (st3 == 1)) || (((st1 == 1) && (st3 == 1)) && (st2 == 0))) || (((st3 == 1) && (st1 == 0)) && (st2 == 0))) || (((st3 == 0) && (st1 == 0)) && (st2 == 0))) || (((st1 == 1) && (st3 == 0)) && (st2 == 0))) || (((st2 == 1) && (st3 == 1)) && (st1 == 0))) || (((st1 == 1) && (st2 == 1)) && (st3 == 0))) || (((st2 == 1) && (st3 == 0)) && (st1 == 0))) RESULT: Ultimate proved your program to be correct! [2023-11-06 22:27:50,924 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f225ff3-3b83-4fbd-8c45-80f36c895598/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE