./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.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 b1fa78b32466948213cdbfc05d3adcde2ac2fc14323ec3ac2f4b441976452676 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 05:03:18,285 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 05:03:18,368 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-17 05:03:18,373 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 05:03:18,374 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 05:03:18,405 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 05:03:18,406 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 05:03:18,407 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 05:03:18,407 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 05:03:18,408 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 05:03:18,410 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 05:03:18,410 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 05:03:18,410 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 05:03:18,411 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 05:03:18,412 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 05:03:18,413 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 05:03:18,413 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 05:03:18,413 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 05:03:18,416 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 05:03:18,416 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 05:03:18,417 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 05:03:18,417 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 05:03:18,418 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 05:03:18,419 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 05:03:18,419 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 05:03:18,419 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-17 05:03:18,420 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 05:03:18,420 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 05:03:18,420 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 05:03:18,420 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 05:03:18,421 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 05:03:18,421 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 05:03:18,421 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 05:03:18,421 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 05:03:18,421 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 05:03:18,422 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 05:03:18,422 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 05:03:18,423 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-17 05:03:18,423 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 05:03:18,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 05:03:18,424 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 05:03:18,424 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 05:03:18,424 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 05:03:18,424 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 05:03:18,425 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 -> b1fa78b32466948213cdbfc05d3adcde2ac2fc14323ec3ac2f4b441976452676 [2024-11-17 05:03:18,669 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 05:03:18,696 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 05:03:18,698 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 05:03:18,699 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 05:03:18,700 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 05:03:18,701 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.BOUNDED-10.pals.c [2024-11-17 05:03:20,160 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 05:03:20,381 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 05:03:20,382 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.BOUNDED-10.pals.c [2024-11-17 05:03:20,397 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a7c4a7b4/e3dfc1ae9bed47fba5d7ab4a42087cc6/FLAG44618df4f [2024-11-17 05:03:20,414 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a7c4a7b4/e3dfc1ae9bed47fba5d7ab4a42087cc6 [2024-11-17 05:03:20,417 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 05:03:20,418 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 05:03:20,420 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 05:03:20,420 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 05:03:20,425 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 05:03:20,426 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 05:03:20" (1/1) ... [2024-11-17 05:03:20,427 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@665b89d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:03:20, skipping insertion in model container [2024-11-17 05:03:20,427 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 05:03:20" (1/1) ... [2024-11-17 05:03:20,469 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 05:03:20,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 05:03:20,837 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 05:03:20,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 05:03:20,920 INFO L204 MainTranslator]: Completed translation [2024-11-17 05:03:20,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:03:20 WrapperNode [2024-11-17 05:03:20,921 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 05:03:20,922 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 05:03:20,922 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 05:03:20,922 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 05:03:20,928 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:03:20" (1/1) ... [2024-11-17 05:03:20,938 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:03:20" (1/1) ... [2024-11-17 05:03:20,972 INFO L138 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 518 [2024-11-17 05:03:20,973 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 05:03:20,974 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 05:03:20,974 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 05:03:20,974 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 05:03:20,984 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:03:20" (1/1) ... [2024-11-17 05:03:20,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:03:20" (1/1) ... [2024-11-17 05:03:20,993 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:03:20" (1/1) ... [2024-11-17 05:03:21,015 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-17 05:03:21,015 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:03:20" (1/1) ... [2024-11-17 05:03:21,015 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:03:20" (1/1) ... [2024-11-17 05:03:21,030 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:03:20" (1/1) ... [2024-11-17 05:03:21,031 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:03:20" (1/1) ... [2024-11-17 05:03:21,033 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:03:20" (1/1) ... [2024-11-17 05:03:21,035 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:03:20" (1/1) ... [2024-11-17 05:03:21,042 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 05:03:21,043 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 05:03:21,043 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 05:03:21,043 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 05:03:21,048 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:03:20" (1/1) ... [2024-11-17 05:03:21,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 05:03:21,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 05:03:21,092 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-17 05:03:21,097 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-17 05:03:21,141 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2024-11-17 05:03:21,142 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2024-11-17 05:03:21,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 05:03:21,142 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2024-11-17 05:03:21,142 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2024-11-17 05:03:21,142 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2024-11-17 05:03:21,142 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2024-11-17 05:03:21,142 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-17 05:03:21,143 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-17 05:03:21,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 05:03:21,144 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2024-11-17 05:03:21,145 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2024-11-17 05:03:21,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 05:03:21,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 05:03:21,145 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2024-11-17 05:03:21,145 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2024-11-17 05:03:21,263 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 05:03:21,264 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 05:03:21,769 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2024-11-17 05:03:21,770 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 05:03:21,789 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 05:03:21,790 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 05:03:21,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 05:03:21 BoogieIcfgContainer [2024-11-17 05:03:21,791 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 05:03:21,794 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 05:03:21,794 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 05:03:21,797 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 05:03:21,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 05:03:20" (1/3) ... [2024-11-17 05:03:21,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70114255 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 05:03:21, skipping insertion in model container [2024-11-17 05:03:21,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 05:03:20" (2/3) ... [2024-11-17 05:03:21,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70114255 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 05:03:21, skipping insertion in model container [2024-11-17 05:03:21,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 05:03:21" (3/3) ... [2024-11-17 05:03:21,802 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.5.ufo.BOUNDED-10.pals.c [2024-11-17 05:03:21,817 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 05:03:21,818 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-17 05:03:21,892 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 05:03:21,899 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;@42c538c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 05:03:21,899 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-17 05:03:21,904 INFO L276 IsEmpty]: Start isEmpty. Operand has 184 states, 146 states have (on average 1.5342465753424657) internal successors, (224), 148 states have internal predecessors, (224), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-17 05:03:21,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-17 05:03:21,917 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 05:03:21,919 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-17 05:03:21,920 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-17 05:03:21,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 05:03:21,927 INFO L85 PathProgramCache]: Analyzing trace with hash -131995113, now seen corresponding path program 1 times [2024-11-17 05:03:21,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 05:03:21,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938344892] [2024-11-17 05:03:21,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 05:03:21,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 05:03:22,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:22,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-17 05:03:22,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:22,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-17 05:03:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:22,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-17 05:03:22,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:22,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-17 05:03:22,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:22,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-17 05:03:22,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:22,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-17 05:03:22,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:22,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-17 05:03:22,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:22,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-17 05:03:22,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:22,366 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-17 05:03:22,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 05:03:22,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938344892] [2024-11-17 05:03:22,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938344892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 05:03:22,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 05:03:22,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 05:03:22,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257821490] [2024-11-17 05:03:22,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 05:03:22,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 05:03:22,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 05:03:22,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 05:03:22,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 05:03:22,405 INFO L87 Difference]: Start difference. First operand has 184 states, 146 states have (on average 1.5342465753424657) internal successors, (224), 148 states have internal predecessors, (224), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 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-17 05:03:22,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 05:03:22,449 INFO L93 Difference]: Finished difference Result 351 states and 563 transitions. [2024-11-17 05:03:22,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 05:03:22,450 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 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 72 [2024-11-17 05:03:22,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 05:03:22,458 INFO L225 Difference]: With dead ends: 351 [2024-11-17 05:03:22,459 INFO L226 Difference]: Without dead ends: 178 [2024-11-17 05:03:22,463 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-17 05:03:22,469 INFO L432 NwaCegarLoop]: 278 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, 278 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-17 05:03:22,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 05:03:22,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-17 05:03:22,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2024-11-17 05:03:22,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 141 states have (on average 1.524822695035461) internal successors, (215), 142 states have internal predecessors, (215), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-17 05:03:22,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 273 transitions. [2024-11-17 05:03:22,519 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 273 transitions. Word has length 72 [2024-11-17 05:03:22,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 05:03:22,519 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 273 transitions. [2024-11-17 05:03:22,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 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-17 05:03:22,520 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 273 transitions. [2024-11-17 05:03:22,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-17 05:03:22,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 05:03:22,524 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-17 05:03:22,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 05:03:22,525 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-17 05:03:22,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 05:03:22,525 INFO L85 PathProgramCache]: Analyzing trace with hash 726821239, now seen corresponding path program 1 times [2024-11-17 05:03:22,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 05:03:22,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47136280] [2024-11-17 05:03:22,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 05:03:22,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 05:03:22,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:22,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-17 05:03:22,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:22,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-17 05:03:22,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:22,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-17 05:03:22,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:22,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-17 05:03:22,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:22,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-17 05:03:22,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:22,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-17 05:03:22,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:22,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-17 05:03:22,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:22,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-17 05:03:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:22,823 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-17 05:03:22,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 05:03:22,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47136280] [2024-11-17 05:03:22,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47136280] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 05:03:22,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861113140] [2024-11-17 05:03:22,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 05:03:22,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 05:03:22,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 05:03:22,827 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-17 05:03:22,832 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-17 05:03:23,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:23,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 05:03:23,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 05:03:23,161 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-17 05:03:23,162 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 05:03:23,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861113140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 05:03:23,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 05:03:23,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-11-17 05:03:23,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256876669] [2024-11-17 05:03:23,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 05:03:23,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 05:03:23,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 05:03:23,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 05:03:23,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-17 05:03:23,168 INFO L87 Difference]: Start difference. First operand 178 states and 273 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-17 05:03:23,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 05:03:23,372 INFO L93 Difference]: Finished difference Result 390 states and 588 transitions. [2024-11-17 05:03:23,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 05:03:23,373 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-17 05:03:23,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 05:03:23,376 INFO L225 Difference]: With dead ends: 390 [2024-11-17 05:03:23,376 INFO L226 Difference]: Without dead ends: 229 [2024-11-17 05:03:23,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 85 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-17 05:03:23,379 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 403 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 05:03:23,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 704 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 05:03:23,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-17 05:03:23,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 224. [2024-11-17 05:03:23,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 183 states have (on average 1.5027322404371584) internal successors, (275), 184 states have internal predecessors, (275), 31 states have call successors, (31), 8 states have call predecessors, (31), 8 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-17 05:03:23,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 337 transitions. [2024-11-17 05:03:23,415 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 337 transitions. Word has length 72 [2024-11-17 05:03:23,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 05:03:23,416 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 337 transitions. [2024-11-17 05:03:23,416 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-17 05:03:23,416 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 337 transitions. [2024-11-17 05:03:23,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-17 05:03:23,422 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 05:03:23,423 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] [2024-11-17 05:03:23,442 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-17 05:03:23,623 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-17 05:03:23,624 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-17 05:03:23,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 05:03:23,625 INFO L85 PathProgramCache]: Analyzing trace with hash 747054772, now seen corresponding path program 1 times [2024-11-17 05:03:23,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 05:03:23,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346618245] [2024-11-17 05:03:23,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 05:03:23,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 05:03:23,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:23,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-17 05:03:23,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:23,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-17 05:03:23,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:23,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-17 05:03:23,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:23,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-17 05:03:23,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:23,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-17 05:03:23,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:23,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-17 05:03:23,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:23,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-17 05:03:23,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:23,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-17 05:03:23,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:23,819 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-17 05:03:23,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 05:03:23,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346618245] [2024-11-17 05:03:23,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346618245] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 05:03:23,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406085149] [2024-11-17 05:03:23,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 05:03:23,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 05:03:23,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 05:03:23,824 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-17 05:03:23,828 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-17 05:03:24,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:24,004 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 05:03:24,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 05:03:24,089 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-17 05:03:24,089 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 05:03:24,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406085149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 05:03:24,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 05:03:24,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-11-17 05:03:24,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351656371] [2024-11-17 05:03:24,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 05:03:24,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 05:03:24,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 05:03:24,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 05:03:24,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-17 05:03:24,095 INFO L87 Difference]: Start difference. First operand 224 states and 337 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 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-17 05:03:24,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 05:03:24,256 INFO L93 Difference]: Finished difference Result 391 states and 588 transitions. [2024-11-17 05:03:24,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 05:03:24,257 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 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 73 [2024-11-17 05:03:24,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 05:03:24,260 INFO L225 Difference]: With dead ends: 391 [2024-11-17 05:03:24,262 INFO L226 Difference]: Without dead ends: 230 [2024-11-17 05:03:24,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 86 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-17 05:03:24,265 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 403 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 05:03:24,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 704 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 05:03:24,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-17 05:03:24,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2024-11-17 05:03:24,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 186 states have (on average 1.4946236559139785) internal successors, (278), 187 states have internal predecessors, (278), 31 states have call successors, (31), 8 states have call predecessors, (31), 8 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-17 05:03:24,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 340 transitions. [2024-11-17 05:03:24,288 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 340 transitions. Word has length 73 [2024-11-17 05:03:24,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 05:03:24,288 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 340 transitions. [2024-11-17 05:03:24,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 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-17 05:03:24,289 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 340 transitions. [2024-11-17 05:03:24,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-17 05:03:24,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 05:03:24,292 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, 1] [2024-11-17 05:03:24,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-17 05:03:24,493 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-17 05:03:24,493 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-17 05:03:24,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 05:03:24,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1842493043, now seen corresponding path program 1 times [2024-11-17 05:03:24,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 05:03:24,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300146529] [2024-11-17 05:03:24,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 05:03:24,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 05:03:24,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:24,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-17 05:03:24,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:24,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-17 05:03:24,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:24,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-17 05:03:24,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:24,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-17 05:03:24,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:24,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-17 05:03:24,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:24,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-17 05:03:24,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:24,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-17 05:03:24,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:24,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-17 05:03:24,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:24,657 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-17 05:03:24,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 05:03:24,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300146529] [2024-11-17 05:03:24,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300146529] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 05:03:24,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238324889] [2024-11-17 05:03:24,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 05:03:24,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 05:03:24,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 05:03:24,664 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-17 05:03:24,667 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-17 05:03:24,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:24,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 05:03:24,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 05:03:24,901 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-17 05:03:24,902 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 05:03:24,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238324889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 05:03:24,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 05:03:24,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-11-17 05:03:24,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872970586] [2024-11-17 05:03:24,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 05:03:24,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 05:03:24,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 05:03:24,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 05:03:24,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-17 05:03:24,906 INFO L87 Difference]: Start difference. First operand 227 states and 340 transitions. Second operand has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 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-17 05:03:24,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 05:03:24,936 INFO L93 Difference]: Finished difference Result 227 states and 340 transitions. [2024-11-17 05:03:24,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 05:03:24,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 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 76 [2024-11-17 05:03:24,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 05:03:24,939 INFO L225 Difference]: With dead ends: 227 [2024-11-17 05:03:24,940 INFO L226 Difference]: Without dead ends: 226 [2024-11-17 05:03:24,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 90 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-17 05:03:24,942 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 112 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 05:03:24,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 632 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 05:03:24,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-17 05:03:24,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2024-11-17 05:03:24,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 186 states have (on average 1.489247311827957) internal successors, (277), 186 states have internal predecessors, (277), 31 states have call successors, (31), 8 states have call predecessors, (31), 8 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-17 05:03:24,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 339 transitions. [2024-11-17 05:03:24,963 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 339 transitions. Word has length 76 [2024-11-17 05:03:24,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 05:03:24,964 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 339 transitions. [2024-11-17 05:03:24,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 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-17 05:03:24,964 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 339 transitions. [2024-11-17 05:03:24,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-17 05:03:24,965 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 05:03:24,965 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, 1, 1] [2024-11-17 05:03:24,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-17 05:03:25,166 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-17 05:03:25,166 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-17 05:03:25,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 05:03:25,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1282709475, now seen corresponding path program 1 times [2024-11-17 05:03:25,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 05:03:25,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875577430] [2024-11-17 05:03:25,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 05:03:25,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 05:03:25,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:25,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-17 05:03:25,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:25,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-17 05:03:25,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:25,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-17 05:03:25,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:25,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-17 05:03:25,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:25,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-17 05:03:25,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:25,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-17 05:03:25,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:25,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-17 05:03:25,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:25,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-17 05:03:25,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:25,331 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-17 05:03:25,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 05:03:25,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875577430] [2024-11-17 05:03:25,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875577430] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 05:03:25,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391973952] [2024-11-17 05:03:25,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 05:03:25,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 05:03:25,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 05:03:25,334 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-17 05:03:25,347 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-17 05:03:25,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:25,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 05:03:25,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 05:03:25,563 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-17 05:03:25,563 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 05:03:25,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391973952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 05:03:25,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 05:03:25,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-11-17 05:03:25,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896089306] [2024-11-17 05:03:25,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 05:03:25,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 05:03:25,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 05:03:25,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 05:03:25,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-17 05:03:25,565 INFO L87 Difference]: Start difference. First operand 226 states and 339 transitions. Second operand has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 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-17 05:03:25,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 05:03:25,602 INFO L93 Difference]: Finished difference Result 308 states and 472 transitions. [2024-11-17 05:03:25,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 05:03:25,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 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 77 [2024-11-17 05:03:25,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 05:03:25,605 INFO L225 Difference]: With dead ends: 308 [2024-11-17 05:03:25,606 INFO L226 Difference]: Without dead ends: 307 [2024-11-17 05:03:25,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 91 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-17 05:03:25,607 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 105 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 05:03:25,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 796 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 05:03:25,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-11-17 05:03:25,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 306. [2024-11-17 05:03:25,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 243 states have (on average 1.4897119341563787) internal successors, (362), 243 states have internal predecessors, (362), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-17 05:03:25,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 470 transitions. [2024-11-17 05:03:25,624 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 470 transitions. Word has length 77 [2024-11-17 05:03:25,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 05:03:25,625 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 470 transitions. [2024-11-17 05:03:25,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 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-17 05:03:25,625 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 470 transitions. [2024-11-17 05:03:25,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-17 05:03:25,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 05:03:25,628 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 05:03:25,645 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-17 05:03:25,831 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-17 05:03:25,832 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-17 05:03:25,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 05:03:25,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1475009552, now seen corresponding path program 1 times [2024-11-17 05:03:25,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 05:03:25,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451426338] [2024-11-17 05:03:25,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 05:03:25,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 05:03:25,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:25,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-17 05:03:25,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:25,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-17 05:03:25,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:25,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-17 05:03:25,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:25,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-17 05:03:25,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:25,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-17 05:03:25,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:25,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-17 05:03:25,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:25,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-17 05:03:25,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:25,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-17 05:03:25,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:25,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-17 05:03:25,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:25,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-17 05:03:25,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:25,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-17 05:03:25,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:26,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-17 05:03:26,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:26,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-17 05:03:26,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:26,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-17 05:03:26,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:26,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-17 05:03:26,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:26,009 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-17 05:03:26,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 05:03:26,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451426338] [2024-11-17 05:03:26,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451426338] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 05:03:26,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115232369] [2024-11-17 05:03:26,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 05:03:26,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 05:03:26,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 05:03:26,011 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-17 05:03:26,013 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-17 05:03:26,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 05:03:26,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 712 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 05:03:26,206 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 05:03:26,338 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-17 05:03:26,339 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 05:03:26,555 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-17 05:03:26,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115232369] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 05:03:26,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 05:03:26,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2024-11-17 05:03:26,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614352830] [2024-11-17 05:03:26,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 05:03:26,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 05:03:26,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 05:03:26,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 05:03:26,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-17 05:03:26,558 INFO L87 Difference]: Start difference. First operand 306 states and 470 transitions. Second operand has 14 states, 13 states have (on average 14.384615384615385) internal successors, (187), 14 states have internal predecessors, (187), 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-17 05:03:26,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 05:03:26,819 INFO L93 Difference]: Finished difference Result 719 states and 1109 transitions. [2024-11-17 05:03:26,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 05:03:26,820 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 14.384615384615385) internal successors, (187), 14 states have internal predecessors, (187), 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 141 [2024-11-17 05:03:26,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 05:03:26,821 INFO L225 Difference]: With dead ends: 719 [2024-11-17 05:03:26,821 INFO L226 Difference]: Without dead ends: 0 [2024-11-17 05:03:26,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 303 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-17 05:03:26,824 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 675 mSDsluCounter, 2023 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 2285 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 05:03:26,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 2285 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 05:03:26,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-17 05:03:26,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-17 05:03:26,825 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-17 05:03:26,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-17 05:03:26,825 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 141 [2024-11-17 05:03:26,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 05:03:26,825 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 05:03:26,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 14.384615384615385) internal successors, (187), 14 states have internal predecessors, (187), 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-17 05:03:26,826 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-17 05:03:26,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-17 05:03:26,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-17 05:03:26,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-17 05:03:26,846 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-17 05:03:27,029 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-17 05:03:27,033 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-17 05:03:27,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-17 05:03:27,591 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 05:03:27,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 05:03:27 BoogieIcfgContainer [2024-11-17 05:03:27,628 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 05:03:27,629 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 05:03:27,629 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 05:03:27,629 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 05:03:27,630 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 05:03:21" (3/4) ... [2024-11-17 05:03:27,632 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-17 05:03:27,637 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure read_manual_selection_history [2024-11-17 05:03:27,638 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure read_side2_failed_history [2024-11-17 05:03:27,638 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure assert [2024-11-17 05:03:27,638 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure read_side1_failed_history [2024-11-17 05:03:27,638 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-17 05:03:27,639 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure read_active_side_history [2024-11-17 05:03:27,656 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 40 nodes and edges [2024-11-17 05:03:27,656 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-17 05:03:27,657 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-17 05:03:27,658 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-17 05:03:27,805 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-17 05:03:27,808 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-17 05:03:27,808 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 05:03:27,808 INFO L158 Benchmark]: Toolchain (without parser) took 7390.32ms. Allocated memory was 153.1MB in the beginning and 249.6MB in the end (delta: 96.5MB). Free memory was 81.1MB in the beginning and 107.6MB in the end (delta: -26.5MB). Peak memory consumption was 71.6MB. Max. memory is 16.1GB. [2024-11-17 05:03:27,809 INFO L158 Benchmark]: CDTParser took 0.88ms. Allocated memory is still 153.1MB. Free memory was 109.5MB in the beginning and 109.3MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 05:03:27,809 INFO L158 Benchmark]: CACSL2BoogieTranslator took 500.72ms. Allocated memory is still 153.1MB. Free memory was 81.0MB in the beginning and 109.9MB in the end (delta: -28.9MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. [2024-11-17 05:03:27,809 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.49ms. Allocated memory is still 153.1MB. Free memory was 109.9MB in the beginning and 106.2MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-17 05:03:27,810 INFO L158 Benchmark]: Boogie Preprocessor took 68.49ms. Allocated memory is still 153.1MB. Free memory was 106.2MB in the beginning and 102.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-17 05:03:27,810 INFO L158 Benchmark]: IcfgBuilder took 748.72ms. Allocated memory is still 153.1MB. Free memory was 102.1MB in the beginning and 59.1MB in the end (delta: 43.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-17 05:03:27,810 INFO L158 Benchmark]: TraceAbstraction took 5834.65ms. Allocated memory was 153.1MB in the beginning and 249.6MB in the end (delta: 96.5MB). Free memory was 58.0MB in the beginning and 121.2MB in the end (delta: -63.2MB). Peak memory consumption was 34.3MB. Max. memory is 16.1GB. [2024-11-17 05:03:27,810 INFO L158 Benchmark]: Witness Printer took 179.25ms. Allocated memory is still 249.6MB. Free memory was 121.2MB in the beginning and 107.6MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-17 05:03:27,812 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.88ms. Allocated memory is still 153.1MB. Free memory was 109.5MB in the beginning and 109.3MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 500.72ms. Allocated memory is still 153.1MB. Free memory was 81.0MB in the beginning and 109.9MB in the end (delta: -28.9MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.49ms. Allocated memory is still 153.1MB. Free memory was 109.9MB in the beginning and 106.2MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.49ms. Allocated memory is still 153.1MB. Free memory was 106.2MB in the beginning and 102.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 748.72ms. Allocated memory is still 153.1MB. Free memory was 102.1MB in the beginning and 59.1MB in the end (delta: 43.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 5834.65ms. Allocated memory was 153.1MB in the beginning and 249.6MB in the end (delta: 96.5MB). Free memory was 58.0MB in the beginning and 121.2MB in the end (delta: -63.2MB). Peak memory consumption was 34.3MB. Max. memory is 16.1GB. * Witness Printer took 179.25ms. Allocated memory is still 249.6MB. Free memory was 121.2MB in the beginning and 107.6MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 602]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 602]: 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 7 procedures, 184 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 5.2s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1790 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1698 mSDsluCounter, 5399 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3848 mSDsCounter, 84 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 367 IncrementalHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 84 mSolverCounterUnsat, 1551 mSDtfsCounter, 367 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 717 GetRequests, 675 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=306occurred 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, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 950 NumberOfCodeBlocks, 950 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1079 ConstructedInterpolants, 0 QuantifiedInterpolants, 1805 SizeOfPredicates, 2 NumberOfNonLiveVariables, 2520 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 12 InterpolantComputations, 5 PerfectInterpolantSequences, 245/333 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: 578]: Location Invariant Derived location invariant: null - 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: 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: 608]: 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-17 05:03:27,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE