./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 fca748b1 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-wip.dd.update-z3-fca748b-m [2024-11-20 19:10:55,363 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 19:10:55,422 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-20 19:10:55,425 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 19:10:55,425 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 19:10:55,438 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 19:10:55,439 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 19:10:55,439 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 19:10:55,439 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 19:10:55,439 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 19:10:55,440 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 19:10:55,440 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 19:10:55,440 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 19:10:55,441 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 19:10:55,441 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 19:10:55,441 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 19:10:55,441 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 19:10:55,442 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 19:10:55,442 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 19:10:55,442 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 19:10:55,442 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 19:10:55,445 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 19:10:55,445 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 19:10:55,445 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 19:10:55,445 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 19:10:55,445 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-20 19:10:55,446 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 19:10:55,446 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 19:10:55,446 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 19:10:55,446 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 19:10:55,449 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 19:10:55,449 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 19:10:55,449 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 19:10:55,449 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 19:10:55,449 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 19:10:55,449 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 19:10:55,449 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 19:10:55,450 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 19:10:55,450 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 19:10:55,450 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 19:10:55,450 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 19:10:55,450 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 19:10:55,450 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 19:10:55,451 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 19:10:55,451 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-11-20 19:10:55,650 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 19:10:55,668 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 19:10:55,669 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 19:10:55,670 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 19:10:55,671 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 19:10:55,671 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-11-20 19:10:56,875 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 19:10:57,068 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 19:10:57,068 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-11-20 19:10:57,081 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19bafeffd/bccfc1d0d1c94439899f201cf25b62a8/FLAG6208b475a [2024-11-20 19:10:57,094 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19bafeffd/bccfc1d0d1c94439899f201cf25b62a8 [2024-11-20 19:10:57,096 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 19:10:57,097 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 19:10:57,099 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 19:10:57,099 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 19:10:57,103 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 19:10:57,104 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:10:57" (1/1) ... [2024-11-20 19:10:57,105 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48cd8068 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:10:57, skipping insertion in model container [2024-11-20 19:10:57,106 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:10:57" (1/1) ... [2024-11-20 19:10:57,139 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 19:10:57,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 19:10:57,394 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 19:10:57,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 19:10:57,491 INFO L204 MainTranslator]: Completed translation [2024-11-20 19:10:57,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:10:57 WrapperNode [2024-11-20 19:10:57,492 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 19:10:57,492 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 19:10:57,492 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 19:10:57,492 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 19:10:57,497 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:10:57" (1/1) ... [2024-11-20 19:10:57,506 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:10:57" (1/1) ... [2024-11-20 19:10:57,537 INFO L138 Inliner]: procedures = 32, calls = 49, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 518 [2024-11-20 19:10:57,537 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 19:10:57,538 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 19:10:57,538 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 19:10:57,538 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 19:10:57,546 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:10:57" (1/1) ... [2024-11-20 19:10:57,546 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:10:57" (1/1) ... [2024-11-20 19:10:57,551 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:10:57" (1/1) ... [2024-11-20 19:10:57,573 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-11-20 19:10:57,574 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:10:57" (1/1) ... [2024-11-20 19:10:57,574 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:10:57" (1/1) ... [2024-11-20 19:10:57,585 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:10:57" (1/1) ... [2024-11-20 19:10:57,589 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:10:57" (1/1) ... [2024-11-20 19:10:57,591 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:10:57" (1/1) ... [2024-11-20 19:10:57,592 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:10:57" (1/1) ... [2024-11-20 19:10:57,595 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 19:10:57,596 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 19:10:57,596 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 19:10:57,596 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 19:10:57,597 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:10:57" (1/1) ... [2024-11-20 19:10:57,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 19:10:57,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:10:57,630 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-11-20 19:10:57,635 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-11-20 19:10:57,669 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2024-11-20 19:10:57,669 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2024-11-20 19:10:57,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 19:10:57,670 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2024-11-20 19:10:57,670 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2024-11-20 19:10:57,670 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2024-11-20 19:10:57,670 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2024-11-20 19:10:57,670 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2024-11-20 19:10:57,670 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2024-11-20 19:10:57,671 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 19:10:57,671 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 19:10:57,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 19:10:57,672 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2024-11-20 19:10:57,672 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2024-11-20 19:10:57,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 19:10:57,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 19:10:57,672 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2024-11-20 19:10:57,673 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2024-11-20 19:10:57,766 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 19:10:57,768 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 19:10:58,231 INFO L? ?]: Removed 118 outVars from TransFormulas that were not future-live. [2024-11-20 19:10:58,232 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 19:10:58,247 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 19:10:58,248 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 19:10:58,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:10:58 BoogieIcfgContainer [2024-11-20 19:10:58,248 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 19:10:58,249 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 19:10:58,250 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 19:10:58,253 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 19:10:58,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:10:57" (1/3) ... [2024-11-20 19:10:58,255 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7be15af8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:10:58, skipping insertion in model container [2024-11-20 19:10:58,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:10:57" (2/3) ... [2024-11-20 19:10:58,255 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7be15af8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:10:58, skipping insertion in model container [2024-11-20 19:10:58,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:10:58" (3/3) ... [2024-11-20 19:10:58,256 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c [2024-11-20 19:10:58,270 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 19:10:58,270 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-20 19:10:58,333 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 19:10:58,337 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;@4abc86a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 19:10:58,338 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-20 19:10:58,344 INFO L276 IsEmpty]: Start isEmpty. Operand has 185 states, 144 states have (on average 1.5486111111111112) internal successors, (223), 146 states have internal predecessors, (223), 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-11-20 19:10:58,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-20 19:10:58,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:10:58,359 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, 1, 1, 1] [2024-11-20 19:10:58,359 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-20 19:10:58,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:10:58,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1720236815, now seen corresponding path program 1 times [2024-11-20 19:10:58,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:10:58,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013819979] [2024-11-20 19:10:58,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:10:58,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:10:58,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:58,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 19:10:58,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:58,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 19:10:58,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:58,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-20 19:10:58,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:58,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 19:10:58,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:58,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 19:10:58,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:58,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 19:10:58,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:58,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 19:10:58,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:58,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-20 19:10:58,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:58,748 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-20 19:10:58,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:10:58,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013819979] [2024-11-20 19:10:58,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013819979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:10:58,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 19:10:58,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 19:10:58,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592863141] [2024-11-20 19:10:58,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:10:58,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 19:10:58,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:10:58,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 19:10:58,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 19:10:58,778 INFO L87 Difference]: Start difference. First operand has 185 states, 144 states have (on average 1.5486111111111112) internal successors, (223), 146 states have internal predecessors, (223), 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 24.5) internal successors, (49), 2 states have internal predecessors, (49), 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-11-20 19:10:58,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:10:58,813 INFO L93 Difference]: Finished difference Result 353 states and 569 transitions. [2024-11-20 19:10:58,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 19:10:58,815 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 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 71 [2024-11-20 19:10:58,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:10:58,823 INFO L225 Difference]: With dead ends: 353 [2024-11-20 19:10:58,823 INFO L226 Difference]: Without dead ends: 179 [2024-11-20 19:10:58,827 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-11-20 19:10:58,829 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 19:10:58,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 19:10:58,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-20 19:10:58,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2024-11-20 19:10:58,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 139 states have (on average 1.539568345323741) internal successors, (214), 140 states have internal predecessors, (214), 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-11-20 19:10:58,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 276 transitions. [2024-11-20 19:10:58,873 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 276 transitions. Word has length 71 [2024-11-20 19:10:58,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:10:58,874 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 276 transitions. [2024-11-20 19:10:58,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 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-11-20 19:10:58,874 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 276 transitions. [2024-11-20 19:10:58,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-20 19:10:58,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:10:58,877 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, 1, 1, 1] [2024-11-20 19:10:58,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 19:10:58,878 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-20 19:10:58,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:10:58,878 INFO L85 PathProgramCache]: Analyzing trace with hash -956816523, now seen corresponding path program 1 times [2024-11-20 19:10:58,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:10:58,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120185612] [2024-11-20 19:10:58,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:10:58,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:10:58,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:59,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 19:10:59,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:59,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 19:10:59,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:59,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-20 19:10:59,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:59,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 19:10:59,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:59,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 19:10:59,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:59,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 19:10:59,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:59,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 19:10:59,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:59,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-20 19:10:59,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:59,097 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-20 19:10:59,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:10:59,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120185612] [2024-11-20 19:10:59,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120185612] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:10:59,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754545544] [2024-11-20 19:10:59,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:10:59,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:10:59,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:10:59,103 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-11-20 19:10:59,104 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-11-20 19:10:59,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:59,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 19:10:59,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:10:59,358 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 19:10:59,358 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:10:59,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754545544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:10:59,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 19:10:59,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-11-20 19:10:59,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098478861] [2024-11-20 19:10:59,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:10:59,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 19:10:59,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:10:59,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 19:10:59,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-20 19:10:59,363 INFO L87 Difference]: Start difference. First operand 179 states and 276 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 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-11-20 19:10:59,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:10:59,538 INFO L93 Difference]: Finished difference Result 394 states and 598 transitions. [2024-11-20 19:10:59,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 19:10:59,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 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 71 [2024-11-20 19:10:59,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:10:59,541 INFO L225 Difference]: With dead ends: 394 [2024-11-20 19:10:59,541 INFO L226 Difference]: Without dead ends: 232 [2024-11-20 19:10:59,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 84 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-11-20 19:10:59,543 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 405 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 19:10:59,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 714 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 19:10:59,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-20 19:10:59,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 228. [2024-11-20 19:10:59,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 181 states have (on average 1.5193370165745856) internal successors, (275), 182 states have internal predecessors, (275), 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-11-20 19:10:59,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 345 transitions. [2024-11-20 19:10:59,564 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 345 transitions. Word has length 71 [2024-11-20 19:10:59,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:10:59,565 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 345 transitions. [2024-11-20 19:10:59,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 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-11-20 19:10:59,565 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 345 transitions. [2024-11-20 19:10:59,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-20 19:10:59,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:10:59,567 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, 1, 1, 1, 1] [2024-11-20 19:10:59,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 19:10:59,768 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-11-20 19:10:59,768 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-20 19:10:59,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:10:59,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1221807773, now seen corresponding path program 1 times [2024-11-20 19:10:59,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:10:59,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380987929] [2024-11-20 19:10:59,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:10:59,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:10:59,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:59,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 19:10:59,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:59,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 19:10:59,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:59,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-20 19:10:59,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:59,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-20 19:10:59,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:59,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 19:10:59,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:59,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 19:10:59,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:59,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-20 19:10:59,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:59,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 19:10:59,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:10:59,903 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-20 19:10:59,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:10:59,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380987929] [2024-11-20 19:10:59,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380987929] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:10:59,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274546021] [2024-11-20 19:10:59,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:10:59,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:10:59,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:10:59,906 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-11-20 19:10:59,907 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-11-20 19:11:00,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:00,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 19:11:00,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:11:00,097 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 19:11:00,100 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:11:00,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274546021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:11:00,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 19:11:00,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-11-20 19:11:00,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570885495] [2024-11-20 19:11:00,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:11:00,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 19:11:00,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:00,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 19:11:00,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-20 19:11:00,103 INFO L87 Difference]: Start difference. First operand 228 states and 345 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 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-11-20 19:11:00,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:00,226 INFO L93 Difference]: Finished difference Result 395 states and 598 transitions. [2024-11-20 19:11:00,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 19:11:00,226 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 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 72 [2024-11-20 19:11:00,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:00,228 INFO L225 Difference]: With dead ends: 395 [2024-11-20 19:11:00,228 INFO L226 Difference]: Without dead ends: 233 [2024-11-20 19:11:00,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 85 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-11-20 19:11:00,230 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 405 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 19:11:00,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 714 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 19:11:00,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-20 19:11:00,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 230. [2024-11-20 19:11:00,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 183 states have (on average 1.5136612021857923) internal successors, (277), 184 states have internal predecessors, (277), 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-11-20 19:11:00,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 347 transitions. [2024-11-20 19:11:00,250 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 347 transitions. Word has length 72 [2024-11-20 19:11:00,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:00,251 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 347 transitions. [2024-11-20 19:11:00,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 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-11-20 19:11:00,251 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 347 transitions. [2024-11-20 19:11:00,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-20 19:11:00,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:00,252 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, 1, 1, 1, 1, 1, 1] [2024-11-20 19:11:00,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-20 19:11:00,453 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-11-20 19:11:00,454 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-20 19:11:00,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:00,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1559821585, now seen corresponding path program 1 times [2024-11-20 19:11:00,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:00,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191464947] [2024-11-20 19:11:00,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:00,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:00,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:00,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 19:11:00,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:00,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 19:11:00,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:00,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 19:11:00,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:00,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 19:11:00,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:00,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 19:11:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:00,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-20 19:11:00,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:00,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 19:11:00,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:00,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 19:11:00,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:00,589 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-20 19:11:00,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:00,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191464947] [2024-11-20 19:11:00,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191464947] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:11:00,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069489385] [2024-11-20 19:11:00,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:00,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:00,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:11:00,592 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-11-20 19:11:00,593 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-11-20 19:11:00,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:00,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 19:11:00,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:11:00,740 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-20 19:11:00,740 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:11:00,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069489385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:11:00,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 19:11:00,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-11-20 19:11:00,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036071525] [2024-11-20 19:11:00,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:11:00,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 19:11:00,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:00,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 19:11:00,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 19:11:00,742 INFO L87 Difference]: Start difference. First operand 230 states and 347 transitions. Second operand has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 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-11-20 19:11:00,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:00,762 INFO L93 Difference]: Finished difference Result 230 states and 347 transitions. [2024-11-20 19:11:00,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 19:11:00,763 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 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 74 [2024-11-20 19:11:00,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:00,764 INFO L225 Difference]: With dead ends: 230 [2024-11-20 19:11:00,764 INFO L226 Difference]: Without dead ends: 229 [2024-11-20 19:11:00,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 88 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-11-20 19:11:00,765 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 108 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 19:11:00,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 647 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 19:11:00,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-20 19:11:00,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2024-11-20 19:11:00,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 183 states have (on average 1.5081967213114753) internal successors, (276), 183 states have internal predecessors, (276), 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-11-20 19:11:00,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 346 transitions. [2024-11-20 19:11:00,776 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 346 transitions. Word has length 74 [2024-11-20 19:11:00,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:00,776 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 346 transitions. [2024-11-20 19:11:00,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 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-11-20 19:11:00,777 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 346 transitions. [2024-11-20 19:11:00,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-20 19:11:00,777 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:00,778 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 19:11:00,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-20 19:11:00,978 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-11-20 19:11:00,979 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-20 19:11:00,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:00,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1109828355, now seen corresponding path program 1 times [2024-11-20 19:11:00,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:00,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061190059] [2024-11-20 19:11:00,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:00,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:00,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:01,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 19:11:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:01,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 19:11:01,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:01,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 19:11:01,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:01,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 19:11:01,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:01,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 19:11:01,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:01,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-20 19:11:01,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:01,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 19:11:01,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:01,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 19:11:01,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:01,088 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-20 19:11:01,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:01,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061190059] [2024-11-20 19:11:01,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061190059] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:11:01,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148481838] [2024-11-20 19:11:01,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:01,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:01,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:11:01,091 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-11-20 19:11:01,092 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-11-20 19:11:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:01,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 19:11:01,192 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:11:01,243 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-20 19:11:01,243 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:11:01,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148481838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:11:01,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 19:11:01,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-11-20 19:11:01,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031452134] [2024-11-20 19:11:01,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:11:01,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 19:11:01,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:01,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 19:11:01,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 19:11:01,245 INFO L87 Difference]: Start difference. First operand 229 states and 346 transitions. Second operand has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 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-11-20 19:11:01,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:01,277 INFO L93 Difference]: Finished difference Result 310 states and 478 transitions. [2024-11-20 19:11:01,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 19:11:01,278 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 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 75 [2024-11-20 19:11:01,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:01,280 INFO L225 Difference]: With dead ends: 310 [2024-11-20 19:11:01,280 INFO L226 Difference]: Without dead ends: 309 [2024-11-20 19:11:01,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 89 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-11-20 19:11:01,281 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 101 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 19:11:01,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 808 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 19:11:01,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-11-20 19:11:01,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2024-11-20 19:11:01,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 240 states have (on average 1.5041666666666667) internal successors, (361), 240 states have internal predecessors, (361), 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-11-20 19:11:01,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 477 transitions. [2024-11-20 19:11:01,302 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 477 transitions. Word has length 75 [2024-11-20 19:11:01,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:01,303 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 477 transitions. [2024-11-20 19:11:01,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 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-11-20 19:11:01,303 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 477 transitions. [2024-11-20 19:11:01,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-20 19:11:01,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:01,305 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 19:11:01,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-20 19:11:01,505 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-11-20 19:11:01,506 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-20 19:11:01,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:01,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1091561665, now seen corresponding path program 1 times [2024-11-20 19:11:01,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:01,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264966613] [2024-11-20 19:11:01,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:01,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:01,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:01,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 19:11:01,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:01,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 19:11:01,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:01,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 19:11:01,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:01,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 19:11:01,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:01,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 19:11:01,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:01,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-20 19:11:01,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:01,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 19:11:01,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:01,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 19:11:01,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:01,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-20 19:11:01,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:01,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 19:11:01,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:01,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 19:11:01,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:01,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 19:11:01,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:01,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-20 19:11:01,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:01,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 19:11:01,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:01,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-20 19:11:01,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:01,654 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-20 19:11:01,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:01,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264966613] [2024-11-20 19:11:01,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264966613] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:11:01,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826232535] [2024-11-20 19:11:01,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:01,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:01,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:11:01,658 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-11-20 19:11:01,659 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-11-20 19:11:01,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:01,812 INFO L255 TraceCheckSpWp]: Trace formula consists of 709 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 19:11:01,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:11:01,920 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-20 19:11:01,920 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 19:11:02,072 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-20 19:11:02,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826232535] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 19:11:02,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 19:11:02,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2024-11-20 19:11:02,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551225208] [2024-11-20 19:11:02,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 19:11:02,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 19:11:02,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:02,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 19:11:02,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-20 19:11:02,076 INFO L87 Difference]: Start difference. First operand 309 states and 477 transitions. Second operand has 14 states, 13 states have (on average 13.538461538461538) internal successors, (176), 14 states have internal predecessors, (176), 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-11-20 19:11:02,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:02,262 INFO L93 Difference]: Finished difference Result 719 states and 1119 transitions. [2024-11-20 19:11:02,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 19:11:02,263 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 13.538461538461538) internal successors, (176), 14 states have internal predecessors, (176), 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 137 [2024-11-20 19:11:02,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:02,264 INFO L225 Difference]: With dead ends: 719 [2024-11-20 19:11:02,264 INFO L226 Difference]: Without dead ends: 0 [2024-11-20 19:11:02,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 295 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-11-20 19:11:02,266 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 552 mSDsluCounter, 2156 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 2422 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 19:11:02,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 2422 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 19:11:02,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-20 19:11:02,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-20 19:11:02,266 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-11-20 19:11:02,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-20 19:11:02,267 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 137 [2024-11-20 19:11:02,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:02,267 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-20 19:11:02,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 13.538461538461538) internal successors, (176), 14 states have internal predecessors, (176), 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-11-20 19:11:02,267 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-20 19:11:02,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-20 19:11:02,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-20 19:11:02,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-20 19:11:02,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-20 19:11:02,472 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-11-20 19:11:02,475 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-20 19:11:02,476 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-20 19:11:02,954 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 19:11:02,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 07:11:02 BoogieIcfgContainer [2024-11-20 19:11:02,976 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 19:11:02,976 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 19:11:02,976 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 19:11:02,976 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 19:11:02,976 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:10:58" (3/4) ... [2024-11-20 19:11:02,978 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-20 19:11:02,982 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure read_manual_selection_history [2024-11-20 19:11:02,983 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure flip_the_side [2024-11-20 19:11:02,983 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure read_side2_failed_history [2024-11-20 19:11:02,983 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assert [2024-11-20 19:11:02,983 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure read_side1_failed_history [2024-11-20 19:11:02,983 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-20 19:11:02,983 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure read_active_side_history [2024-11-20 19:11:02,995 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2024-11-20 19:11:02,996 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-20 19:11:02,996 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-20 19:11:02,997 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-20 19:11:03,110 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-20 19:11:03,111 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-20 19:11:03,111 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 19:11:03,111 INFO L158 Benchmark]: Toolchain (without parser) took 6014.08ms. Allocated memory was 153.1MB in the beginning and 203.4MB in the end (delta: 50.3MB). Free memory was 83.4MB in the beginning and 113.2MB in the end (delta: -29.8MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. [2024-11-20 19:11:03,111 INFO L158 Benchmark]: CDTParser took 0.67ms. Allocated memory is still 115.3MB. Free memory is still 75.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 19:11:03,112 INFO L158 Benchmark]: CACSL2BoogieTranslator took 392.89ms. Allocated memory is still 153.1MB. Free memory was 83.2MB in the beginning and 120.8MB in the end (delta: -37.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-20 19:11:03,112 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.83ms. Allocated memory is still 153.1MB. Free memory was 120.8MB in the beginning and 117.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 19:11:03,112 INFO L158 Benchmark]: Boogie Preprocessor took 57.73ms. Allocated memory is still 153.1MB. Free memory was 117.7MB in the beginning and 112.4MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 19:11:03,112 INFO L158 Benchmark]: RCFGBuilder took 652.29ms. Allocated memory is still 153.1MB. Free memory was 112.4MB in the beginning and 69.4MB in the end (delta: 42.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-20 19:11:03,113 INFO L158 Benchmark]: TraceAbstraction took 4726.11ms. Allocated memory was 153.1MB in the beginning and 203.4MB in the end (delta: 50.3MB). Free memory was 68.3MB in the beginning and 126.8MB in the end (delta: -58.5MB). Peak memory consumption was 69.4MB. Max. memory is 16.1GB. [2024-11-20 19:11:03,113 INFO L158 Benchmark]: Witness Printer took 134.94ms. Allocated memory is still 203.4MB. Free memory was 126.8MB in the beginning and 113.2MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-20 19:11:03,114 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.67ms. Allocated memory is still 115.3MB. Free memory is still 75.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 392.89ms. Allocated memory is still 153.1MB. Free memory was 83.2MB in the beginning and 120.8MB in the end (delta: -37.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.83ms. Allocated memory is still 153.1MB. Free memory was 120.8MB in the beginning and 117.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.73ms. Allocated memory is still 153.1MB. Free memory was 117.7MB in the beginning and 112.4MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 652.29ms. Allocated memory is still 153.1MB. Free memory was 112.4MB in the beginning and 69.4MB in the end (delta: 42.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 4726.11ms. Allocated memory was 153.1MB in the beginning and 203.4MB in the end (delta: 50.3MB). Free memory was 68.3MB in the beginning and 126.8MB in the end (delta: -58.5MB). Peak memory consumption was 69.4MB. Max. memory is 16.1GB. * Witness Printer took 134.94ms. Allocated memory is still 203.4MB. Free memory was 126.8MB in the beginning and 113.2MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. 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, 185 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 4.2s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1673 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1571 mSDsluCounter, 5586 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4014 mSDsCounter, 87 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 364 IncrementalHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 87 mSolverCounterUnsat, 1572 mSDtfsCounter, 364 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 703 GetRequests, 661 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=309occurred 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, 7 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 929 NumberOfCodeBlocks, 929 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1054 ConstructedInterpolants, 0 QuantifiedInterpolants, 1748 SizeOfPredicates, 2 NumberOfNonLiveVariables, 2511 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 12 InterpolantComputations, 5 PerfectInterpolantSequences, 244/330 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-11-20 19:11:03,133 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