./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 cdd691469d2e12c2dd1871c48be4dd2db0b9d27541ac5dee5ff25a04db0d98eb --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 20:47:06,960 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 20:47:07,030 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-24 20:47:07,033 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 20:47:07,034 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 20:47:07,062 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 20:47:07,064 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 20:47:07,064 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 20:47:07,065 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 20:47:07,066 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 20:47:07,067 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 20:47:07,067 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 20:47:07,068 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 20:47:07,068 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 20:47:07,070 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 20:47:07,070 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 20:47:07,070 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 20:47:07,071 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 20:47:07,071 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 20:47:07,071 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 20:47:07,071 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 20:47:07,074 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 20:47:07,074 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 20:47:07,074 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 20:47:07,074 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 20:47:07,075 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-24 20:47:07,075 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 20:47:07,075 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 20:47:07,075 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 20:47:07,075 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 20:47:07,076 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 20:47:07,076 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 20:47:07,076 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 20:47:07,076 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 20:47:07,076 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 20:47:07,076 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 20:47:07,077 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 20:47:07,077 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 20:47:07,077 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 20:47:07,077 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 20:47:07,077 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 20:47:07,078 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 20:47:07,078 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 20:47:07,079 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 20:47:07,079 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> cdd691469d2e12c2dd1871c48be4dd2db0b9d27541ac5dee5ff25a04db0d98eb [2024-10-24 20:47:07,320 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 20:47:07,341 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 20:47:07,343 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 20:47:07,344 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 20:47:07,344 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 20:47:07,345 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c [2024-10-24 20:47:07,904 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 20:47:08,202 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 20:47:08,203 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c [2024-10-24 20:47:08,221 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ac3a46e1/5e29c34ff2d947378eb445f823e4289c/FLAG2773defcd [2024-10-24 20:47:10,471 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ac3a46e1/5e29c34ff2d947378eb445f823e4289c [2024-10-24 20:47:10,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 20:47:10,475 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 20:47:10,477 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 20:47:10,477 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 20:47:10,481 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 20:47:10,482 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:47:10" (1/1) ... [2024-10-24 20:47:10,483 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f64d250 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:47:10, skipping insertion in model container [2024-10-24 20:47:10,483 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:47:10" (1/1) ... [2024-10-24 20:47:10,515 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 20:47:10,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 20:47:10,817 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 20:47:10,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 20:47:10,878 INFO L204 MainTranslator]: Completed translation [2024-10-24 20:47:10,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:47:10 WrapperNode [2024-10-24 20:47:10,879 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 20:47:10,880 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 20:47:10,880 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 20:47:10,880 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 20:47:10,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:47:10" (1/1) ... [2024-10-24 20:47:10,896 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:47:10" (1/1) ... [2024-10-24 20:47:10,939 INFO L138 Inliner]: procedures = 32, calls = 49, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 518 [2024-10-24 20:47:10,943 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 20:47:10,944 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 20:47:10,944 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 20:47:10,944 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 20:47:10,953 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:47:10" (1/1) ... [2024-10-24 20:47:10,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:47:10" (1/1) ... [2024-10-24 20:47:10,957 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:47:10" (1/1) ... [2024-10-24 20:47:10,985 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 20:47:10,985 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:47:10" (1/1) ... [2024-10-24 20:47:10,985 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:47:10" (1/1) ... [2024-10-24 20:47:10,996 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:47:10" (1/1) ... [2024-10-24 20:47:11,004 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:47:10" (1/1) ... [2024-10-24 20:47:11,011 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:47:10" (1/1) ... [2024-10-24 20:47:11,012 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:47:10" (1/1) ... [2024-10-24 20:47:11,019 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 20:47:11,022 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 20:47:11,022 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 20:47:11,022 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 20:47:11,023 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:47:10" (1/1) ... [2024-10-24 20:47:11,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 20:47:11,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:47:11,057 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 20:47:11,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 20:47:11,098 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2024-10-24 20:47:11,098 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2024-10-24 20:47:11,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 20:47:11,099 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2024-10-24 20:47:11,099 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2024-10-24 20:47:11,099 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2024-10-24 20:47:11,099 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2024-10-24 20:47:11,099 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2024-10-24 20:47:11,099 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2024-10-24 20:47:11,100 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 20:47:11,100 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 20:47:11,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 20:47:11,101 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2024-10-24 20:47:11,101 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2024-10-24 20:47:11,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 20:47:11,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 20:47:11,101 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2024-10-24 20:47:11,102 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2024-10-24 20:47:11,194 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 20:47:11,196 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 20:47:11,707 INFO L? ?]: Removed 118 outVars from TransFormulas that were not future-live. [2024-10-24 20:47:11,707 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 20:47:11,749 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 20:47:11,753 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 20:47:11,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:47:11 BoogieIcfgContainer [2024-10-24 20:47:11,754 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 20:47:11,755 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 20:47:11,755 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 20:47:11,762 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 20:47:11,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 08:47:10" (1/3) ... [2024-10-24 20:47:11,762 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33ffa668 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:47:11, skipping insertion in model container [2024-10-24 20:47:11,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:47:10" (2/3) ... [2024-10-24 20:47:11,763 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33ffa668 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:47:11, skipping insertion in model container [2024-10-24 20:47:11,763 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:47:11" (3/3) ... [2024-10-24 20:47:11,764 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c [2024-10-24 20:47:11,783 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 20:47:11,783 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-24 20:47:11,841 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 20:47:11,854 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5e16c41a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 20:47:11,854 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-24 20:47:11,861 INFO L276 IsEmpty]: Start isEmpty. Operand has 173 states, 132 states have (on average 1.5984848484848484) internal successors, (211), 134 states have internal predecessors, (211), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-24 20:47:11,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-24 20:47:11,881 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:47:11,882 INFO L215 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] [2024-10-24 20:47:11,882 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-24 20:47:11,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:47:11,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1487519119, now seen corresponding path program 1 times [2024-10-24 20:47:11,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:47:11,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812725929] [2024-10-24 20:47:11,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:11,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:47:12,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:12,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 20:47:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:12,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 20:47:12,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:12,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 20:47:12,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:12,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 20:47:12,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:12,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 20:47:12,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:12,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 20:47:12,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:12,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 20:47:12,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:12,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 20:47:12,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:12,201 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 20:47:12,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:47:12,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812725929] [2024-10-24 20:47:12,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812725929] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:47:12,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:47:12,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 20:47:12,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221742495] [2024-10-24 20:47:12,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:47:12,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 20:47:12,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:47:12,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 20:47:12,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 20:47:12,237 INFO L87 Difference]: Start difference. First operand has 173 states, 132 states have (on average 1.5984848484848484) internal successors, (211), 134 states have internal predecessors, (211), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 20:47:12,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:47:12,301 INFO L93 Difference]: Finished difference Result 331 states and 547 transitions. [2024-10-24 20:47:12,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 20:47:12,304 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 64 [2024-10-24 20:47:12,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:47:12,311 INFO L225 Difference]: With dead ends: 331 [2024-10-24 20:47:12,311 INFO L226 Difference]: Without dead ends: 171 [2024-10-24 20:47:12,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 20:47:12,317 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:47:12,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 264 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:47:12,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-10-24 20:47:12,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2024-10-24 20:47:12,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 131 states have (on average 1.5725190839694656) internal successors, (206), 132 states have internal predecessors, (206), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-24 20:47:12,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 268 transitions. [2024-10-24 20:47:12,382 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 268 transitions. Word has length 64 [2024-10-24 20:47:12,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:47:12,383 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 268 transitions. [2024-10-24 20:47:12,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 20:47:12,384 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 268 transitions. [2024-10-24 20:47:12,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-24 20:47:12,386 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:47:12,386 INFO L215 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] [2024-10-24 20:47:12,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 20:47:12,387 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-24 20:47:12,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:47:12,388 INFO L85 PathProgramCache]: Analyzing trace with hash 202851731, now seen corresponding path program 1 times [2024-10-24 20:47:12,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:47:12,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625454665] [2024-10-24 20:47:12,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:12,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:47:12,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:12,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 20:47:12,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:12,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 20:47:12,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:12,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 20:47:12,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:12,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 20:47:12,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:12,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 20:47:12,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:12,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 20:47:12,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:12,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 20:47:12,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:12,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 20:47:12,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:12,631 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-24 20:47:12,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:47:12,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625454665] [2024-10-24 20:47:12,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625454665] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:47:12,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026338214] [2024-10-24 20:47:12,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:12,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:12,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:47:12,634 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:47:12,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 20:47:12,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:12,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 20:47:12,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:47:12,839 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 20:47:12,839 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:47:12,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026338214] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:47:12,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:47:12,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-10-24 20:47:12,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110348469] [2024-10-24 20:47:12,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:47:12,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 20:47:12,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:47:12,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 20:47:12,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 20:47:12,843 INFO L87 Difference]: Start difference. First operand 171 states and 268 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-24 20:47:12,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:47:12,980 INFO L93 Difference]: Finished difference Result 372 states and 576 transitions. [2024-10-24 20:47:12,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 20:47:12,981 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 64 [2024-10-24 20:47:12,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:47:12,983 INFO L225 Difference]: With dead ends: 372 [2024-10-24 20:47:12,983 INFO L226 Difference]: Without dead ends: 217 [2024-10-24 20:47:12,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-24 20:47:12,985 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 384 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 20:47:12,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 690 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 20:47:12,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-10-24 20:47:12,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 215. [2024-10-24 20:47:12,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 168 states have (on average 1.5595238095238095) internal successors, (262), 169 states have internal predecessors, (262), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-24 20:47:13,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 332 transitions. [2024-10-24 20:47:13,001 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 332 transitions. Word has length 64 [2024-10-24 20:47:13,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:47:13,001 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 332 transitions. [2024-10-24 20:47:13,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-24 20:47:13,002 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 332 transitions. [2024-10-24 20:47:13,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-24 20:47:13,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:47:13,004 INFO L215 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] [2024-10-24 20:47:13,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 20:47:13,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:13,205 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-24 20:47:13,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:47:13,206 INFO L85 PathProgramCache]: Analyzing trace with hash 888124015, now seen corresponding path program 1 times [2024-10-24 20:47:13,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:47:13,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541515592] [2024-10-24 20:47:13,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:13,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:47:13,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:13,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 20:47:13,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:13,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 20:47:13,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:13,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 20:47:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:13,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 20:47:13,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:13,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 20:47:13,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:13,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 20:47:13,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:13,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 20:47:13,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:13,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 20:47:13,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:13,328 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-24 20:47:13,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:47:13,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541515592] [2024-10-24 20:47:13,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541515592] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:47:13,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551918319] [2024-10-24 20:47:13,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:13,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:13,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:47:13,334 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:47:13,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 20:47:13,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:13,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 20:47:13,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:47:13,557 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 20:47:13,557 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:47:13,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551918319] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:47:13,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:47:13,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-10-24 20:47:13,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513324199] [2024-10-24 20:47:13,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:47:13,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 20:47:13,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:47:13,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 20:47:13,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 20:47:13,563 INFO L87 Difference]: Start difference. First operand 215 states and 332 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-24 20:47:13,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:47:13,714 INFO L93 Difference]: Finished difference Result 373 states and 576 transitions. [2024-10-24 20:47:13,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 20:47:13,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 65 [2024-10-24 20:47:13,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:47:13,718 INFO L225 Difference]: With dead ends: 373 [2024-10-24 20:47:13,719 INFO L226 Difference]: Without dead ends: 218 [2024-10-24 20:47:13,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-24 20:47:13,722 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 384 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 20:47:13,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 690 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 20:47:13,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-10-24 20:47:13,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2024-10-24 20:47:13,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 170 states have (on average 1.5529411764705883) internal successors, (264), 171 states have internal predecessors, (264), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-24 20:47:13,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 334 transitions. [2024-10-24 20:47:13,748 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 334 transitions. Word has length 65 [2024-10-24 20:47:13,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:47:13,749 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 334 transitions. [2024-10-24 20:47:13,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-24 20:47:13,749 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 334 transitions. [2024-10-24 20:47:13,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-24 20:47:13,751 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:47:13,752 INFO L215 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] [2024-10-24 20:47:13,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 20:47:13,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-10-24 20:47:13,953 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-24 20:47:13,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:47:13,954 INFO L85 PathProgramCache]: Analyzing trace with hash 697576641, now seen corresponding path program 1 times [2024-10-24 20:47:13,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:47:13,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519064160] [2024-10-24 20:47:13,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:13,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:47:13,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:14,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 20:47:14,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:14,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 20:47:14,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:14,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 20:47:14,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:14,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 20:47:14,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:14,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 20:47:14,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:14,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 20:47:14,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:14,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 20:47:14,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:14,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 20:47:14,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:14,087 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-24 20:47:14,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:47:14,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519064160] [2024-10-24 20:47:14,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519064160] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:47:14,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669507097] [2024-10-24 20:47:14,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:14,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:14,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:47:14,093 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:47:14,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 20:47:14,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:14,220 INFO L255 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 20:47:14,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:47:14,287 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 20:47:14,288 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:47:14,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669507097] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:47:14,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:47:14,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-10-24 20:47:14,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250046567] [2024-10-24 20:47:14,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:47:14,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:47:14,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:47:14,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:47:14,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 20:47:14,291 INFO L87 Difference]: Start difference. First operand 217 states and 334 transitions. Second operand has 4 states, 3 states have (on average 15.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 20:47:14,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:47:14,332 INFO L93 Difference]: Finished difference Result 217 states and 334 transitions. [2024-10-24 20:47:14,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 20:47:14,334 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 15.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 67 [2024-10-24 20:47:14,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:47:14,335 INFO L225 Difference]: With dead ends: 217 [2024-10-24 20:47:14,336 INFO L226 Difference]: Without dead ends: 216 [2024-10-24 20:47:14,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 20:47:14,337 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 108 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:47:14,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 621 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:47:14,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-10-24 20:47:14,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2024-10-24 20:47:14,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 170 states have (on average 1.5470588235294118) internal successors, (263), 170 states have internal predecessors, (263), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-24 20:47:14,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 333 transitions. [2024-10-24 20:47:14,352 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 333 transitions. Word has length 67 [2024-10-24 20:47:14,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:47:14,353 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 333 transitions. [2024-10-24 20:47:14,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 15.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 20:47:14,353 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 333 transitions. [2024-10-24 20:47:14,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-24 20:47:14,354 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:47:14,354 INFO L215 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] [2024-10-24 20:47:14,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 20:47:14,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:14,559 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-24 20:47:14,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:47:14,560 INFO L85 PathProgramCache]: Analyzing trace with hash 150039915, now seen corresponding path program 1 times [2024-10-24 20:47:14,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:47:14,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346748619] [2024-10-24 20:47:14,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:14,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:47:14,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:14,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 20:47:14,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:14,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 20:47:14,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:14,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 20:47:14,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:14,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 20:47:14,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:14,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 20:47:14,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:14,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 20:47:14,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:14,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 20:47:14,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:14,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 20:47:14,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:14,798 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-24 20:47:14,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:47:14,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346748619] [2024-10-24 20:47:14,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346748619] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:47:14,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163394737] [2024-10-24 20:47:14,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:14,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:14,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:47:14,801 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:47:14,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 20:47:14,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:14,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 20:47:14,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:47:15,062 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 20:47:15,066 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:47:15,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163394737] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:47:15,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:47:15,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-10-24 20:47:15,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864529814] [2024-10-24 20:47:15,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:47:15,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:47:15,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:47:15,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:47:15,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 20:47:15,068 INFO L87 Difference]: Start difference. First operand 216 states and 333 transitions. Second operand has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 20:47:15,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:47:15,143 INFO L93 Difference]: Finished difference Result 295 states and 463 transitions. [2024-10-24 20:47:15,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 20:47:15,147 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 68 [2024-10-24 20:47:15,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:47:15,149 INFO L225 Difference]: With dead ends: 295 [2024-10-24 20:47:15,149 INFO L226 Difference]: Without dead ends: 294 [2024-10-24 20:47:15,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 20:47:15,150 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 101 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:47:15,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 774 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:47:15,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-10-24 20:47:15,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2024-10-24 20:47:15,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 225 states have (on average 1.5377777777777777) internal successors, (346), 225 states have internal predecessors, (346), 58 states have call successors, (58), 10 states have call predecessors, (58), 10 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-24 20:47:15,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 462 transitions. [2024-10-24 20:47:15,178 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 462 transitions. Word has length 68 [2024-10-24 20:47:15,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:47:15,179 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 462 transitions. [2024-10-24 20:47:15,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 20:47:15,179 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 462 transitions. [2024-10-24 20:47:15,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-24 20:47:15,184 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:47:15,185 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:47:15,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-24 20:47:15,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:15,385 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-10-24 20:47:15,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:47:15,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1646856766, now seen corresponding path program 1 times [2024-10-24 20:47:15,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:47:15,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678352836] [2024-10-24 20:47:15,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:15,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:47:15,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:15,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 20:47:15,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:15,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 20:47:15,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:15,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 20:47:15,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:15,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 20:47:15,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:15,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 20:47:15,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:15,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 20:47:15,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:15,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 20:47:15,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:15,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 20:47:15,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:15,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 20:47:15,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:15,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 20:47:15,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:15,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 20:47:15,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:15,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 20:47:15,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:15,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 20:47:15,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:15,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 20:47:15,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:15,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 20:47:15,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:15,594 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-10-24 20:47:15,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:47:15,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678352836] [2024-10-24 20:47:15,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678352836] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:47:15,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359186878] [2024-10-24 20:47:15,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:47:15,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:15,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:47:15,600 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:47:15,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-24 20:47:15,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:47:15,744 INFO L255 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 20:47:15,747 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:47:15,847 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-24 20:47:15,848 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 20:47:16,018 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-24 20:47:16,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359186878] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 20:47:16,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 20:47:16,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2024-10-24 20:47:16,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167771504] [2024-10-24 20:47:16,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 20:47:16,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 20:47:16,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:47:16,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 20:47:16,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-24 20:47:16,021 INFO L87 Difference]: Start difference. First operand 294 states and 462 transitions. Second operand has 14 states, 13 states have (on average 11.153846153846153) internal successors, (145), 14 states have internal predecessors, (145), 7 states have call successors, (37), 1 states have call predecessors, (37), 2 states have return successors, (37), 6 states have call predecessors, (37), 7 states have call successors, (37) [2024-10-24 20:47:16,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:47:16,248 INFO L93 Difference]: Finished difference Result 684 states and 1084 transitions. [2024-10-24 20:47:16,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 20:47:16,249 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 11.153846153846153) internal successors, (145), 14 states have internal predecessors, (145), 7 states have call successors, (37), 1 states have call predecessors, (37), 2 states have return successors, (37), 6 states have call predecessors, (37), 7 states have call successors, (37) Word has length 124 [2024-10-24 20:47:16,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:47:16,250 INFO L225 Difference]: With dead ends: 684 [2024-10-24 20:47:16,250 INFO L226 Difference]: Without dead ends: 0 [2024-10-24 20:47:16,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-24 20:47:16,253 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 647 mSDsluCounter, 1706 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 1960 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 20:47:16,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 1960 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 20:47:16,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-24 20:47:16,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-24 20:47:16,254 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) [2024-10-24 20:47:16,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-24 20:47:16,254 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 124 [2024-10-24 20:47:16,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:47:16,254 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 20:47:16,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 11.153846153846153) internal successors, (145), 14 states have internal predecessors, (145), 7 states have call successors, (37), 1 states have call predecessors, (37), 2 states have return successors, (37), 6 states have call predecessors, (37), 7 states have call successors, (37) [2024-10-24 20:47:16,255 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-24 20:47:16,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-24 20:47:16,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-10-24 20:47:16,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-10-24 20:47:16,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-24 20:47:16,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:47:16,461 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-24 20:47:16,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-24 20:47:16,999 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 20:47:17,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 08:47:17 BoogieIcfgContainer [2024-10-24 20:47:17,034 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 20:47:17,034 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 20:47:17,035 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 20:47:17,035 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 20:47:17,035 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:47:11" (3/4) ... [2024-10-24 20:47:17,037 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-24 20:47:17,040 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure read_manual_selection_history [2024-10-24 20:47:17,040 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure flip_the_side [2024-10-24 20:47:17,040 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure read_side2_failed_history [2024-10-24 20:47:17,040 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assert [2024-10-24 20:47:17,041 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure read_side1_failed_history [2024-10-24 20:47:17,041 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-24 20:47:17,041 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure read_active_side_history [2024-10-24 20:47:17,049 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 35 nodes and edges [2024-10-24 20:47:17,050 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-24 20:47:17,051 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-24 20:47:17,051 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-24 20:47:17,174 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 20:47:17,175 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-24 20:47:17,175 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 20:47:17,175 INFO L158 Benchmark]: Toolchain (without parser) took 6700.47ms. Allocated memory was 226.5MB in the beginning and 375.4MB in the end (delta: 148.9MB). Free memory was 138.9MB in the beginning and 144.4MB in the end (delta: -5.5MB). Peak memory consumption was 146.5MB. Max. memory is 16.1GB. [2024-10-24 20:47:17,176 INFO L158 Benchmark]: CDTParser took 0.74ms. Allocated memory is still 226.5MB. Free memory is still 184.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 20:47:17,176 INFO L158 Benchmark]: CACSL2BoogieTranslator took 402.75ms. Allocated memory is still 226.5MB. Free memory was 138.7MB in the beginning and 186.8MB in the end (delta: -48.1MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2024-10-24 20:47:17,176 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.21ms. Allocated memory is still 226.5MB. Free memory was 186.8MB in the beginning and 182.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 20:47:17,177 INFO L158 Benchmark]: Boogie Preprocessor took 77.87ms. Allocated memory is still 226.5MB. Free memory was 182.6MB in the beginning and 178.1MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 20:47:17,177 INFO L158 Benchmark]: RCFGBuilder took 731.48ms. Allocated memory is still 226.5MB. Free memory was 178.1MB in the beginning and 126.9MB in the end (delta: 51.2MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-10-24 20:47:17,177 INFO L158 Benchmark]: TraceAbstraction took 5278.80ms. Allocated memory was 226.5MB in the beginning and 375.4MB in the end (delta: 148.9MB). Free memory was 126.9MB in the beginning and 158.1MB in the end (delta: -31.2MB). Peak memory consumption was 118.6MB. Max. memory is 16.1GB. [2024-10-24 20:47:17,178 INFO L158 Benchmark]: Witness Printer took 140.32ms. Allocated memory is still 375.4MB. Free memory was 158.1MB in the beginning and 144.4MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 20:47:17,179 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.74ms. Allocated memory is still 226.5MB. Free memory is still 184.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 402.75ms. Allocated memory is still 226.5MB. Free memory was 138.7MB in the beginning and 186.8MB in the end (delta: -48.1MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.21ms. Allocated memory is still 226.5MB. Free memory was 186.8MB in the beginning and 182.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.87ms. Allocated memory is still 226.5MB. Free memory was 182.6MB in the beginning and 178.1MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 731.48ms. Allocated memory is still 226.5MB. Free memory was 178.1MB in the beginning and 126.9MB in the end (delta: 51.2MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5278.80ms. Allocated memory was 226.5MB in the beginning and 375.4MB in the end (delta: 148.9MB). Free memory was 126.9MB in the beginning and 158.1MB in the end (delta: -31.2MB). Peak memory consumption was 118.6MB. Max. memory is 16.1GB. * Witness Printer took 140.32ms. Allocated memory is still 375.4MB. Free memory was 158.1MB in the beginning and 144.4MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. 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: 606]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 606]: 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 8 procedures, 173 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1726 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1624 mSDsluCounter, 4999 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3498 mSDsCounter, 106 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 406 IncrementalHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 106 mSolverCounterUnsat, 1501 mSDtfsCounter, 406 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 649 GetRequests, 607 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=294occurred in iteration=5, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 840 NumberOfCodeBlocks, 840 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 952 ConstructedInterpolants, 0 QuantifiedInterpolants, 1534 SizeOfPredicates, 2 NumberOfNonLiveVariables, 2119 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 12 InterpolantComputations, 5 PerfectInterpolantSequences, 238/312 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 2 specifications checked. All of them hold - InvariantResult [Line: 582]: Loop Invariant Derived loop invariant: (((0 <= i2) && (i2 <= 2147483646)) && (((short) nomsg + 1) <= 0)) - ProcedureContractResult [Line: 173]: Procedure Contract for read_manual_selection_history Derived contract for procedure read_manual_selection_history. Requires: (((short) nomsg + 1) <= 0) Ensures: ((((short) nomsg + 1) <= 0) && (((((((((((((((((((((((((((((((((((((((((nomsg == \old(nomsg)) && (cs1 == \old(cs1))) && (cs1_old == \old(cs1_old))) && (cs1_new == \old(cs1_new))) && (cs2 == \old(cs2))) && (cs2_old == \old(cs2_old))) && (cs2_new == \old(cs2_new))) && (s1s2 == \old(s1s2))) && (s1s2_old == \old(s1s2_old))) && (s1s2_new == \old(s1s2_new))) && (s1s1 == \old(s1s1))) && (s1s1_old == \old(s1s1_old))) && (s1s1_new == \old(s1s1_new))) && (s2s1 == \old(s2s1))) && (s2s1_old == \old(s2s1_old))) && (s2s1_new == \old(s2s1_new))) && (s2s2 == \old(s2s2))) && (s2s2_old == \old(s2s2_old))) && (s2s2_new == \old(s2s2_new))) && (s1p == \old(s1p))) && (s1p_old == \old(s1p_old))) && (s1p_new == \old(s1p_new))) && (s2p == \old(s2p))) && (s2p_old == \old(s2p_old))) && (s2p_new == \old(s2p_new))) && (side1Failed == \old(side1Failed))) && (side2Failed == \old(side2Failed))) && (side1_written == \old(side1_written))) && (side2_written == \old(side2_written))) && (side1Failed_History_0 == \old(side1Failed_History_0))) && (side1Failed_History_1 == \old(side1Failed_History_1))) && (side1Failed_History_2 == \old(side1Failed_History_2))) && (side2Failed_History_0 == \old(side2Failed_History_0))) && (side2Failed_History_1 == \old(side2Failed_History_1))) && (side2Failed_History_2 == \old(side2Failed_History_2))) && (active_side_History_0 == \old(active_side_History_0))) && (active_side_History_1 == \old(active_side_History_1))) && (active_side_History_2 == \old(active_side_History_2))) && (manual_selection_History_0 == \old(manual_selection_History_0))) && (manual_selection_History_1 == \old(manual_selection_History_1))) && (manual_selection_History_2 == \old(manual_selection_History_2)))) - ProcedureContractResult [Line: 236]: Procedure Contract for flip_the_side Derived contract for procedure flip_the_side. Requires: (((short) nomsg + 1) <= 0) Ensures: ((((short) nomsg + 1) <= 0) && (((((((((((((((((((((((((((((((((((((((((nomsg == \old(nomsg)) && (cs1 == \old(cs1))) && (cs1_old == \old(cs1_old))) && (cs1_new == \old(cs1_new))) && (cs2 == \old(cs2))) && (cs2_old == \old(cs2_old))) && (cs2_new == \old(cs2_new))) && (s1s2 == \old(s1s2))) && (s1s2_old == \old(s1s2_old))) && (s1s2_new == \old(s1s2_new))) && (s1s1 == \old(s1s1))) && (s1s1_old == \old(s1s1_old))) && (s1s1_new == \old(s1s1_new))) && (s2s1 == \old(s2s1))) && (s2s1_old == \old(s2s1_old))) && (s2s1_new == \old(s2s1_new))) && (s2s2 == \old(s2s2))) && (s2s2_old == \old(s2s2_old))) && (s2s2_new == \old(s2s2_new))) && (s1p == \old(s1p))) && (s1p_old == \old(s1p_old))) && (s1p_new == \old(s1p_new))) && (s2p == \old(s2p))) && (s2p_old == \old(s2p_old))) && (s2p_new == \old(s2p_new))) && (side1Failed == \old(side1Failed))) && (side2Failed == \old(side2Failed))) && (side1_written == \old(side1_written))) && (side2_written == \old(side2_written))) && (side1Failed_History_0 == \old(side1Failed_History_0))) && (side1Failed_History_1 == \old(side1Failed_History_1))) && (side1Failed_History_2 == \old(side1Failed_History_2))) && (side2Failed_History_0 == \old(side2Failed_History_0))) && (side2Failed_History_1 == \old(side2Failed_History_1))) && (side2Failed_History_2 == \old(side2Failed_History_2))) && (active_side_History_0 == \old(active_side_History_0))) && (active_side_History_1 == \old(active_side_History_1))) && (active_side_History_2 == \old(active_side_History_2))) && (manual_selection_History_0 == \old(manual_selection_History_0))) && (manual_selection_History_1 == \old(manual_selection_History_1))) && (manual_selection_History_2 == \old(manual_selection_History_2)))) - ProcedureContractResult [Line: 113]: Procedure Contract for read_side2_failed_history Derived contract for procedure read_side2_failed_history. Requires: (((short) nomsg + 1) <= 0) Ensures: ((((short) nomsg + 1) <= 0) && (((((((((((((((((((((((((((((((((((((((((nomsg == \old(nomsg)) && (cs1 == \old(cs1))) && (cs1_old == \old(cs1_old))) && (cs1_new == \old(cs1_new))) && (cs2 == \old(cs2))) && (cs2_old == \old(cs2_old))) && (cs2_new == \old(cs2_new))) && (s1s2 == \old(s1s2))) && (s1s2_old == \old(s1s2_old))) && (s1s2_new == \old(s1s2_new))) && (s1s1 == \old(s1s1))) && (s1s1_old == \old(s1s1_old))) && (s1s1_new == \old(s1s1_new))) && (s2s1 == \old(s2s1))) && (s2s1_old == \old(s2s1_old))) && (s2s1_new == \old(s2s1_new))) && (s2s2 == \old(s2s2))) && (s2s2_old == \old(s2s2_old))) && (s2s2_new == \old(s2s2_new))) && (s1p == \old(s1p))) && (s1p_old == \old(s1p_old))) && (s1p_new == \old(s1p_new))) && (s2p == \old(s2p))) && (s2p_old == \old(s2p_old))) && (s2p_new == \old(s2p_new))) && (side1Failed == \old(side1Failed))) && (side2Failed == \old(side2Failed))) && (side1_written == \old(side1_written))) && (side2_written == \old(side2_written))) && (side1Failed_History_0 == \old(side1Failed_History_0))) && (side1Failed_History_1 == \old(side1Failed_History_1))) && (side1Failed_History_2 == \old(side1Failed_History_2))) && (side2Failed_History_0 == \old(side2Failed_History_0))) && (side2Failed_History_1 == \old(side2Failed_History_1))) && (side2Failed_History_2 == \old(side2Failed_History_2))) && (active_side_History_0 == \old(active_side_History_0))) && (active_side_History_1 == \old(active_side_History_1))) && (active_side_History_2 == \old(active_side_History_2))) && (manual_selection_History_0 == \old(manual_selection_History_0))) && (manual_selection_History_1 == \old(manual_selection_History_1))) && (manual_selection_History_2 == \old(manual_selection_History_2)))) - ProcedureContractResult [Line: 612]: Procedure Contract for assert Derived contract for procedure assert. Requires: (((short) nomsg + 1) <= 0) Ensures: ((((short) nomsg + 1) <= 0) && (((((((((((((((((((((((((((((((((((((((((nomsg == \old(nomsg)) && (cs1 == \old(cs1))) && (cs1_old == \old(cs1_old))) && (cs1_new == \old(cs1_new))) && (cs2 == \old(cs2))) && (cs2_old == \old(cs2_old))) && (cs2_new == \old(cs2_new))) && (s1s2 == \old(s1s2))) && (s1s2_old == \old(s1s2_old))) && (s1s2_new == \old(s1s2_new))) && (s1s1 == \old(s1s1))) && (s1s1_old == \old(s1s1_old))) && (s1s1_new == \old(s1s1_new))) && (s2s1 == \old(s2s1))) && (s2s1_old == \old(s2s1_old))) && (s2s1_new == \old(s2s1_new))) && (s2s2 == \old(s2s2))) && (s2s2_old == \old(s2s2_old))) && (s2s2_new == \old(s2s2_new))) && (s1p == \old(s1p))) && (s1p_old == \old(s1p_old))) && (s1p_new == \old(s1p_new))) && (s2p == \old(s2p))) && (s2p_old == \old(s2p_old))) && (s2p_new == \old(s2p_new))) && (side1Failed == \old(side1Failed))) && (side2Failed == \old(side2Failed))) && (side1_written == \old(side1_written))) && (side2_written == \old(side2_written))) && (side1Failed_History_0 == \old(side1Failed_History_0))) && (side1Failed_History_1 == \old(side1Failed_History_1))) && (side1Failed_History_2 == \old(side1Failed_History_2))) && (side2Failed_History_0 == \old(side2Failed_History_0))) && (side2Failed_History_1 == \old(side2Failed_History_1))) && (side2Failed_History_2 == \old(side2Failed_History_2))) && (active_side_History_0 == \old(active_side_History_0))) && (active_side_History_1 == \old(active_side_History_1))) && (active_side_History_2 == \old(active_side_History_2))) && (manual_selection_History_0 == \old(manual_selection_History_0))) && (manual_selection_History_1 == \old(manual_selection_History_1))) && (manual_selection_History_2 == \old(manual_selection_History_2)))) - ProcedureContractResult [Line: 83]: Procedure Contract for read_side1_failed_history Derived contract for procedure read_side1_failed_history. Requires: (((short) nomsg + 1) <= 0) Ensures: ((((short) nomsg + 1) <= 0) && (((((((((((((((((((((((((((((((((((((((((nomsg == \old(nomsg)) && (cs1 == \old(cs1))) && (cs1_old == \old(cs1_old))) && (cs1_new == \old(cs1_new))) && (cs2 == \old(cs2))) && (cs2_old == \old(cs2_old))) && (cs2_new == \old(cs2_new))) && (s1s2 == \old(s1s2))) && (s1s2_old == \old(s1s2_old))) && (s1s2_new == \old(s1s2_new))) && (s1s1 == \old(s1s1))) && (s1s1_old == \old(s1s1_old))) && (s1s1_new == \old(s1s1_new))) && (s2s1 == \old(s2s1))) && (s2s1_old == \old(s2s1_old))) && (s2s1_new == \old(s2s1_new))) && (s2s2 == \old(s2s2))) && (s2s2_old == \old(s2s2_old))) && (s2s2_new == \old(s2s2_new))) && (s1p == \old(s1p))) && (s1p_old == \old(s1p_old))) && (s1p_new == \old(s1p_new))) && (s2p == \old(s2p))) && (s2p_old == \old(s2p_old))) && (s2p_new == \old(s2p_new))) && (side1Failed == \old(side1Failed))) && (side2Failed == \old(side2Failed))) && (side1_written == \old(side1_written))) && (side2_written == \old(side2_written))) && (side1Failed_History_0 == \old(side1Failed_History_0))) && (side1Failed_History_1 == \old(side1Failed_History_1))) && (side1Failed_History_2 == \old(side1Failed_History_2))) && (side2Failed_History_0 == \old(side2Failed_History_0))) && (side2Failed_History_1 == \old(side2Failed_History_1))) && (side2Failed_History_2 == \old(side2Failed_History_2))) && (active_side_History_0 == \old(active_side_History_0))) && (active_side_History_1 == \old(active_side_History_1))) && (active_side_History_2 == \old(active_side_History_2))) && (manual_selection_History_0 == \old(manual_selection_History_0))) && (manual_selection_History_1 == \old(manual_selection_History_1))) && (manual_selection_History_2 == \old(manual_selection_History_2)))) - ProcedureContractResult [Line: 57]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (((short) nomsg + 1) <= 0) Ensures: (((cond != 0) && (((short) nomsg + 1) <= 0)) && (((((((((((((((((((((((((((((((((((((((((nomsg == \old(nomsg)) && (cs1 == \old(cs1))) && (cs1_old == \old(cs1_old))) && (cs1_new == \old(cs1_new))) && (cs2 == \old(cs2))) && (cs2_old == \old(cs2_old))) && (cs2_new == \old(cs2_new))) && (s1s2 == \old(s1s2))) && (s1s2_old == \old(s1s2_old))) && (s1s2_new == \old(s1s2_new))) && (s1s1 == \old(s1s1))) && (s1s1_old == \old(s1s1_old))) && (s1s1_new == \old(s1s1_new))) && (s2s1 == \old(s2s1))) && (s2s1_old == \old(s2s1_old))) && (s2s1_new == \old(s2s1_new))) && (s2s2 == \old(s2s2))) && (s2s2_old == \old(s2s2_old))) && (s2s2_new == \old(s2s2_new))) && (s1p == \old(s1p))) && (s1p_old == \old(s1p_old))) && (s1p_new == \old(s1p_new))) && (s2p == \old(s2p))) && (s2p_old == \old(s2p_old))) && (s2p_new == \old(s2p_new))) && (side1Failed == \old(side1Failed))) && (side2Failed == \old(side2Failed))) && (side1_written == \old(side1_written))) && (side2_written == \old(side2_written))) && (side1Failed_History_0 == \old(side1Failed_History_0))) && (side1Failed_History_1 == \old(side1Failed_History_1))) && (side1Failed_History_2 == \old(side1Failed_History_2))) && (side2Failed_History_0 == \old(side2Failed_History_0))) && (side2Failed_History_1 == \old(side2Failed_History_1))) && (side2Failed_History_2 == \old(side2Failed_History_2))) && (active_side_History_0 == \old(active_side_History_0))) && (active_side_History_1 == \old(active_side_History_1))) && (active_side_History_2 == \old(active_side_History_2))) && (manual_selection_History_0 == \old(manual_selection_History_0))) && (manual_selection_History_1 == \old(manual_selection_History_1))) && (manual_selection_History_2 == \old(manual_selection_History_2)))) - ProcedureContractResult [Line: 143]: Procedure Contract for read_active_side_history Derived contract for procedure read_active_side_history. Requires: (((short) nomsg + 1) <= 0) Ensures: ((((short) nomsg + 1) <= 0) && (((((((((((((((((((((((((((((((((((((((((nomsg == \old(nomsg)) && (cs1 == \old(cs1))) && (cs1_old == \old(cs1_old))) && (cs1_new == \old(cs1_new))) && (cs2 == \old(cs2))) && (cs2_old == \old(cs2_old))) && (cs2_new == \old(cs2_new))) && (s1s2 == \old(s1s2))) && (s1s2_old == \old(s1s2_old))) && (s1s2_new == \old(s1s2_new))) && (s1s1 == \old(s1s1))) && (s1s1_old == \old(s1s1_old))) && (s1s1_new == \old(s1s1_new))) && (s2s1 == \old(s2s1))) && (s2s1_old == \old(s2s1_old))) && (s2s1_new == \old(s2s1_new))) && (s2s2 == \old(s2s2))) && (s2s2_old == \old(s2s2_old))) && (s2s2_new == \old(s2s2_new))) && (s1p == \old(s1p))) && (s1p_old == \old(s1p_old))) && (s1p_new == \old(s1p_new))) && (s2p == \old(s2p))) && (s2p_old == \old(s2p_old))) && (s2p_new == \old(s2p_new))) && (side1Failed == \old(side1Failed))) && (side2Failed == \old(side2Failed))) && (side1_written == \old(side1_written))) && (side2_written == \old(side2_written))) && (side1Failed_History_0 == \old(side1Failed_History_0))) && (side1Failed_History_1 == \old(side1Failed_History_1))) && (side1Failed_History_2 == \old(side1Failed_History_2))) && (side2Failed_History_0 == \old(side2Failed_History_0))) && (side2Failed_History_1 == \old(side2Failed_History_1))) && (side2Failed_History_2 == \old(side2Failed_History_2))) && (active_side_History_0 == \old(active_side_History_0))) && (active_side_History_1 == \old(active_side_History_1))) && (active_side_History_2 == \old(active_side_History_2))) && (manual_selection_History_0 == \old(manual_selection_History_0))) && (manual_selection_History_1 == \old(manual_selection_History_1))) && (manual_selection_History_2 == \old(manual_selection_History_2)))) RESULT: Ultimate proved your program to be correct! [2024-10-24 20:47:17,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE