./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread-theta/unwind1-100.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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/pthread-theta/unwind1-100.i -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 d866fedd3df666b1282e36d0ae87b17d0a587658c87dddd4d2314d9586432757 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:31:57,248 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:31:57,312 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:31:57,315 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:31:57,317 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:31:57,341 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:31:57,342 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:31:57,342 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:31:57,343 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:31:57,343 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:31:57,343 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:31:57,344 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:31:57,344 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:31:57,344 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:31:57,344 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:31:57,344 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:31:57,344 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:31:57,344 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:31:57,344 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:31:57,344 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:31:57,344 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:31:57,344 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:31:57,344 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:31:57,344 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:31:57,345 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:31:57,345 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:31:57,345 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:31:57,345 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:31:57,345 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:31:57,345 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:31:57,345 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:31:57,345 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:31:57,346 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:31:57,346 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:31:57,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:31:57,346 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:31:57,346 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:31:57,346 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:31:57,347 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:31:57,347 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:31:57,347 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:31:57,347 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:31:57,347 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:31:57,347 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:31:57,347 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:31:57,347 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> d866fedd3df666b1282e36d0ae87b17d0a587658c87dddd4d2314d9586432757 [2025-03-04 15:31:57,593 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:31:57,598 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:31:57,601 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:31:57,602 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:31:57,602 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:31:57,603 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind1-100.i [2025-03-04 15:31:58,689 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a7bdc14f/748cd159b3824f10baec29ed7c69d23c/FLAG215253188 [2025-03-04 15:31:58,944 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:31:58,944 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind1-100.i [2025-03-04 15:31:58,953 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a7bdc14f/748cd159b3824f10baec29ed7c69d23c/FLAG215253188 [2025-03-04 15:31:59,257 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a7bdc14f/748cd159b3824f10baec29ed7c69d23c [2025-03-04 15:31:59,259 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:31:59,260 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:31:59,261 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:31:59,261 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:31:59,263 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:31:59,264 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:31:59" (1/1) ... [2025-03-04 15:31:59,264 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a05c36f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:31:59, skipping insertion in model container [2025-03-04 15:31:59,264 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:31:59" (1/1) ... [2025-03-04 15:31:59,284 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:31:59,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:31:59,528 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:31:59,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:31:59,608 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:31:59,608 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:31:59 WrapperNode [2025-03-04 15:31:59,609 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:31:59,610 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:31:59,610 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:31:59,610 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:31:59,615 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:31:59" (1/1) ... [2025-03-04 15:31:59,627 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:31:59" (1/1) ... [2025-03-04 15:31:59,641 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 55 [2025-03-04 15:31:59,642 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:31:59,643 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:31:59,643 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:31:59,643 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:31:59,647 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:31:59" (1/1) ... [2025-03-04 15:31:59,647 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:31:59" (1/1) ... [2025-03-04 15:31:59,652 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:31:59" (1/1) ... [2025-03-04 15:31:59,663 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]. [2025-03-04 15:31:59,663 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:31:59" (1/1) ... [2025-03-04 15:31:59,664 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:31:59" (1/1) ... [2025-03-04 15:31:59,667 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:31:59" (1/1) ... [2025-03-04 15:31:59,667 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:31:59" (1/1) ... [2025-03-04 15:31:59,668 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:31:59" (1/1) ... [2025-03-04 15:31:59,668 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:31:59" (1/1) ... [2025-03-04 15:31:59,669 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:31:59,670 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:31:59,670 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:31:59,670 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:31:59,671 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:31:59" (1/1) ... [2025-03-04 15:31:59,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:31:59,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:31:59,695 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) [2025-03-04 15:31:59,698 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 [2025-03-04 15:31:59,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:31:59,714 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-03-04 15:31:59,714 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-03-04 15:31:59,714 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-03-04 15:31:59,714 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-03-04 15:31:59,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:31:59,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:31:59,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:31:59,715 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 15:31:59,812 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:31:59,813 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:31:59,918 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:31:59,918 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:31:59,979 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:31:59,979 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:31:59,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:31:59 BoogieIcfgContainer [2025-03-04 15:31:59,979 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:31:59,980 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:31:59,981 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:31:59,983 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:31:59,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:31:59" (1/3) ... [2025-03-04 15:31:59,985 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63335970 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:31:59, skipping insertion in model container [2025-03-04 15:31:59,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:31:59" (2/3) ... [2025-03-04 15:31:59,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63335970 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:31:59, skipping insertion in model container [2025-03-04 15:31:59,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:31:59" (3/3) ... [2025-03-04 15:31:59,987 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind1-100.i [2025-03-04 15:31:59,997 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:31:59,998 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind1-100.i that has 3 procedures, 26 locations, 1 initial locations, 1 loop locations, and 4 error locations. [2025-03-04 15:31:59,999 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:32:00,035 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 15:32:00,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 27 transitions, 68 flow [2025-03-04 15:32:00,083 INFO L124 PetriNetUnfolderBase]: 2/25 cut-off events. [2025-03-04 15:32:00,084 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 15:32:00,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 25 events. 2/25 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 49 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 22. Up to 2 conditions per place. [2025-03-04 15:32:00,088 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 27 transitions, 68 flow [2025-03-04 15:32:00,090 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 23 transitions, 55 flow [2025-03-04 15:32:00,099 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:32:00,111 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;@77242503, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:32:00,111 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-04 15:32:00,118 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:32:00,119 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-03-04 15:32:00,119 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:32:00,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:00,120 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:32:00,120 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-03-04 15:32:00,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:00,125 INFO L85 PathProgramCache]: Analyzing trace with hash 184130288, now seen corresponding path program 1 times [2025-03-04 15:32:00,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:00,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594470300] [2025-03-04 15:32:00,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:00,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:00,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:32:00,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:32:00,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:00,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:00,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:32:00,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:00,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594470300] [2025-03-04 15:32:00,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594470300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:00,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:00,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:32:00,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562128843] [2025-03-04 15:32:00,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:00,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:32:00,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:00,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:32:00,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:32:00,355 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2025-03-04 15:32:00,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 23 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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) [2025-03-04 15:32:00,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:00,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2025-03-04 15:32:00,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:00,412 INFO L124 PetriNetUnfolderBase]: 103/224 cut-off events. [2025-03-04 15:32:00,413 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-03-04 15:32:00,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 426 conditions, 224 events. 103/224 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 934 event pairs, 78 based on Foata normal form. 10/191 useless extension candidates. Maximal degree in co-relation 396. Up to 178 conditions per place. [2025-03-04 15:32:00,417 INFO L140 encePairwiseOnDemand]: 25/27 looper letters, 16 selfloop transitions, 1 changer transitions 0/22 dead transitions. [2025-03-04 15:32:00,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 22 transitions, 87 flow [2025-03-04 15:32:00,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:32:00,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:32:00,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2025-03-04 15:32:00,426 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2025-03-04 15:32:00,427 INFO L175 Difference]: Start difference. First operand has 28 places, 23 transitions, 55 flow. Second operand 3 states and 39 transitions. [2025-03-04 15:32:00,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 22 transitions, 87 flow [2025-03-04 15:32:00,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 22 transitions, 82 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:32:00,431 INFO L231 Difference]: Finished difference. Result has 26 places, 22 transitions, 50 flow [2025-03-04 15:32:00,433 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=26, PETRI_TRANSITIONS=22} [2025-03-04 15:32:00,436 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, -2 predicate places. [2025-03-04 15:32:00,437 INFO L471 AbstractCegarLoop]: Abstraction has has 26 places, 22 transitions, 50 flow [2025-03-04 15:32:00,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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) [2025-03-04 15:32:00,437 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:00,437 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:32:00,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:32:00,439 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-03-04 15:32:00,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:00,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1413071781, now seen corresponding path program 1 times [2025-03-04 15:32:00,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:00,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728989962] [2025-03-04 15:32:00,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:00,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:00,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:32:00,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:32:00,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:00,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:00,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:32:00,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:00,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728989962] [2025-03-04 15:32:00,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728989962] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:00,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:00,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:32:00,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554696067] [2025-03-04 15:32:00,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:00,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:32:00,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:00,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:32:00,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:32:00,495 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2025-03-04 15:32:00,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 22 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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) [2025-03-04 15:32:00,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:00,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2025-03-04 15:32:00,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:00,536 INFO L124 PetriNetUnfolderBase]: 89/194 cut-off events. [2025-03-04 15:32:00,536 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 15:32:00,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 194 events. 89/194 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 747 event pairs, 66 based on Foata normal form. 9/165 useless extension candidates. Maximal degree in co-relation 359. Up to 154 conditions per place. [2025-03-04 15:32:00,541 INFO L140 encePairwiseOnDemand]: 25/27 looper letters, 14 selfloop transitions, 1 changer transitions 1/21 dead transitions. [2025-03-04 15:32:00,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 21 transitions, 80 flow [2025-03-04 15:32:00,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:32:00,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:32:00,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2025-03-04 15:32:00,542 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4691358024691358 [2025-03-04 15:32:00,542 INFO L175 Difference]: Start difference. First operand has 26 places, 22 transitions, 50 flow. Second operand 3 states and 38 transitions. [2025-03-04 15:32:00,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 21 transitions, 80 flow [2025-03-04 15:32:00,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 21 transitions, 79 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:32:00,543 INFO L231 Difference]: Finished difference. Result has 26 places, 20 transitions, 47 flow [2025-03-04 15:32:00,543 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=47, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=47, PETRI_PLACES=26, PETRI_TRANSITIONS=20} [2025-03-04 15:32:00,543 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, -2 predicate places. [2025-03-04 15:32:00,544 INFO L471 AbstractCegarLoop]: Abstraction has has 26 places, 20 transitions, 47 flow [2025-03-04 15:32:00,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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) [2025-03-04 15:32:00,544 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:00,544 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:00,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:32:00,544 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-03-04 15:32:00,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:00,545 INFO L85 PathProgramCache]: Analyzing trace with hash 842182137, now seen corresponding path program 1 times [2025-03-04 15:32:00,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:00,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129187613] [2025-03-04 15:32:00,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:00,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:00,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:32:00,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:32:00,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:00,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:00,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:32:00,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:00,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129187613] [2025-03-04 15:32:00,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129187613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:00,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:00,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:32:00,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799203077] [2025-03-04 15:32:00,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:00,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:32:00,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:00,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:32:00,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:32:00,685 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2025-03-04 15:32:00,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 47 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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) [2025-03-04 15:32:00,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:00,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2025-03-04 15:32:00,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:00,762 INFO L124 PetriNetUnfolderBase]: 48/113 cut-off events. [2025-03-04 15:32:00,763 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 15:32:00,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 113 events. 48/113 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 347 event pairs, 15 based on Foata normal form. 13/113 useless extension candidates. Maximal degree in co-relation 221. Up to 45 conditions per place. [2025-03-04 15:32:00,763 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 15 selfloop transitions, 3 changer transitions 10/33 dead transitions. [2025-03-04 15:32:00,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 33 transitions, 132 flow [2025-03-04 15:32:00,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:32:00,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:32:00,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2025-03-04 15:32:00,766 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-03-04 15:32:00,766 INFO L175 Difference]: Start difference. First operand has 26 places, 20 transitions, 47 flow. Second operand 5 states and 75 transitions. [2025-03-04 15:32:00,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 33 transitions, 132 flow [2025-03-04 15:32:00,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 33 transitions, 131 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:32:00,767 INFO L231 Difference]: Finished difference. Result has 31 places, 20 transitions, 61 flow [2025-03-04 15:32:00,767 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=61, PETRI_PLACES=31, PETRI_TRANSITIONS=20} [2025-03-04 15:32:00,768 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 3 predicate places. [2025-03-04 15:32:00,768 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 20 transitions, 61 flow [2025-03-04 15:32:00,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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) [2025-03-04 15:32:00,768 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:00,768 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:00,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:32:00,769 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-03-04 15:32:00,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:00,770 INFO L85 PathProgramCache]: Analyzing trace with hash -852743669, now seen corresponding path program 1 times [2025-03-04 15:32:00,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:00,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586784401] [2025-03-04 15:32:00,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:00,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:00,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:32:00,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:32:00,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:00,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:00,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:32:00,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:00,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586784401] [2025-03-04 15:32:00,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586784401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:00,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:00,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:32:00,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833190140] [2025-03-04 15:32:00,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:00,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:32:00,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:00,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:32:00,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:32:00,825 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2025-03-04 15:32:00,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 20 transitions, 61 flow. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:32:00,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:00,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2025-03-04 15:32:00,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:00,879 INFO L124 PetriNetUnfolderBase]: 54/124 cut-off events. [2025-03-04 15:32:00,879 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-03-04 15:32:00,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 297 conditions, 124 events. 54/124 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 321 event pairs, 35 based on Foata normal form. 5/118 useless extension candidates. Maximal degree in co-relation 286. Up to 91 conditions per place. [2025-03-04 15:32:00,880 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 22 selfloop transitions, 3 changer transitions 0/28 dead transitions. [2025-03-04 15:32:00,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 28 transitions, 133 flow [2025-03-04 15:32:00,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:32:00,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:32:00,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2025-03-04 15:32:00,881 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5092592592592593 [2025-03-04 15:32:00,881 INFO L175 Difference]: Start difference. First operand has 31 places, 20 transitions, 61 flow. Second operand 4 states and 55 transitions. [2025-03-04 15:32:00,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 28 transitions, 133 flow [2025-03-04 15:32:00,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 28 transitions, 119 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-04 15:32:00,882 INFO L231 Difference]: Finished difference. Result has 30 places, 22 transitions, 73 flow [2025-03-04 15:32:00,882 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=51, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=73, PETRI_PLACES=30, PETRI_TRANSITIONS=22} [2025-03-04 15:32:00,882 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 2 predicate places. [2025-03-04 15:32:00,882 INFO L471 AbstractCegarLoop]: Abstraction has has 30 places, 22 transitions, 73 flow [2025-03-04 15:32:00,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:32:00,883 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:00,883 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:00,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:32:00,883 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-03-04 15:32:00,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:00,883 INFO L85 PathProgramCache]: Analyzing trace with hash 645069397, now seen corresponding path program 1 times [2025-03-04 15:32:00,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:00,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775937141] [2025-03-04 15:32:00,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:00,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:00,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:32:00,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:32:00,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:00,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:00,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:32:00,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:00,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775937141] [2025-03-04 15:32:00,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775937141] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:32:00,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396689078] [2025-03-04 15:32:00,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:00,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:32:00,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:32:00,972 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) [2025-03-04 15:32:00,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 15:32:01,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:32:01,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:32:01,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:01,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:01,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:32:01,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:32:01,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:32:01,061 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:32:01,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396689078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:01,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:32:01,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 15:32:01,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994013014] [2025-03-04 15:32:01,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:01,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:32:01,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:01,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:32:01,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:32:01,068 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2025-03-04 15:32:01,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 22 transitions, 73 flow. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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) [2025-03-04 15:32:01,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:01,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2025-03-04 15:32:01,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:01,149 INFO L124 PetriNetUnfolderBase]: 49/114 cut-off events. [2025-03-04 15:32:01,150 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-03-04 15:32:01,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 288 conditions, 114 events. 49/114 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 279 event pairs, 15 based on Foata normal form. 5/108 useless extension candidates. Maximal degree in co-relation 278. Up to 46 conditions per place. [2025-03-04 15:32:01,151 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 25 selfloop transitions, 5 changer transitions 0/33 dead transitions. [2025-03-04 15:32:01,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 33 transitions, 157 flow [2025-03-04 15:32:01,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:32:01,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:32:01,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2025-03-04 15:32:01,154 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4506172839506173 [2025-03-04 15:32:01,154 INFO L175 Difference]: Start difference. First operand has 30 places, 22 transitions, 73 flow. Second operand 6 states and 73 transitions. [2025-03-04 15:32:01,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 33 transitions, 157 flow [2025-03-04 15:32:01,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 33 transitions, 155 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:32:01,155 INFO L231 Difference]: Finished difference. Result has 33 places, 21 transitions, 77 flow [2025-03-04 15:32:01,155 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=77, PETRI_PLACES=33, PETRI_TRANSITIONS=21} [2025-03-04 15:32:01,156 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 5 predicate places. [2025-03-04 15:32:01,156 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 21 transitions, 77 flow [2025-03-04 15:32:01,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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) [2025-03-04 15:32:01,156 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:01,156 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:01,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 15:32:01,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:32:01,357 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-03-04 15:32:01,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:01,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1477685017, now seen corresponding path program 1 times [2025-03-04 15:32:01,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:01,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378203556] [2025-03-04 15:32:01,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:01,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:01,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:32:01,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:32:01,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:01,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:01,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:32:01,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:01,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378203556] [2025-03-04 15:32:01,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378203556] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:32:01,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111215942] [2025-03-04 15:32:01,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:01,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:32:01,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:32:01,422 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) [2025-03-04 15:32:01,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 15:32:01,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:32:01,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:32:01,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:01,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:01,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:32:01,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:32:01,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:32:01,504 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:32:01,546 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:32:01,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111215942] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:32:01,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:32:01,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 15:32:01,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890576230] [2025-03-04 15:32:01,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:32:01,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:32:01,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:01,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:32:01,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:32:01,559 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2025-03-04 15:32:01,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 21 transitions, 77 flow. Second operand has 12 states, 12 states have (on average 8.666666666666666) internal successors, (104), 12 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:32:01,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:01,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2025-03-04 15:32:01,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:01,721 INFO L124 PetriNetUnfolderBase]: 79/189 cut-off events. [2025-03-04 15:32:01,721 INFO L125 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2025-03-04 15:32:01,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 503 conditions, 189 events. 79/189 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 475 event pairs, 30 based on Foata normal form. 15/198 useless extension candidates. Maximal degree in co-relation 493. Up to 81 conditions per place. [2025-03-04 15:32:01,722 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 39 selfloop transitions, 9 changer transitions 0/51 dead transitions. [2025-03-04 15:32:01,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 51 transitions, 265 flow [2025-03-04 15:32:01,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:32:01,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:32:01,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2025-03-04 15:32:01,727 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44814814814814813 [2025-03-04 15:32:01,727 INFO L175 Difference]: Start difference. First operand has 33 places, 21 transitions, 77 flow. Second operand 10 states and 121 transitions. [2025-03-04 15:32:01,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 51 transitions, 265 flow [2025-03-04 15:32:01,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 51 transitions, 239 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-03-04 15:32:01,731 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 121 flow [2025-03-04 15:32:01,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=121, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2025-03-04 15:32:01,731 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 12 predicate places. [2025-03-04 15:32:01,731 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 121 flow [2025-03-04 15:32:01,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.666666666666666) internal successors, (104), 12 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:32:01,733 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:01,733 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:01,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 15:32:01,933 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,SelfDestructingSolverStorable5 [2025-03-04 15:32:01,933 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-03-04 15:32:01,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:01,934 INFO L85 PathProgramCache]: Analyzing trace with hash 33722481, now seen corresponding path program 2 times [2025-03-04 15:32:01,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:01,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757644342] [2025-03-04 15:32:01,934 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:32:01,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:01,941 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-04 15:32:01,946 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 23 statements. [2025-03-04 15:32:01,947 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:32:01,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:02,001 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 15:32:02,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:02,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757644342] [2025-03-04 15:32:02,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757644342] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:32:02,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806430538] [2025-03-04 15:32:02,002 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:32:02,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:32:02,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:32:02,004 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) [2025-03-04 15:32:02,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 15:32:02,043 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-04 15:32:02,052 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 23 statements. [2025-03-04 15:32:02,052 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:32:02,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:02,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:32:02,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:32:02,094 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 15:32:02,094 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:32:02,154 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 15:32:02,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806430538] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:32:02,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:32:02,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-04 15:32:02,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626203311] [2025-03-04 15:32:02,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:32:02,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:32:02,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:02,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:32:02,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:32:02,196 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2025-03-04 15:32:02,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 121 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 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) [2025-03-04 15:32:02,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:02,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2025-03-04 15:32:02,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:02,309 INFO L124 PetriNetUnfolderBase]: 134/325 cut-off events. [2025-03-04 15:32:02,309 INFO L125 PetriNetUnfolderBase]: For 414/414 co-relation queries the response was YES. [2025-03-04 15:32:02,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 885 conditions, 325 events. 134/325 cut-off events. For 414/414 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1160 event pairs, 18 based on Foata normal form. 10/330 useless extension candidates. Maximal degree in co-relation 873. Up to 55 conditions per place. [2025-03-04 15:32:02,311 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 0 selfloop transitions, 0 changer transitions 54/54 dead transitions. [2025-03-04 15:32:02,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 54 transitions, 328 flow [2025-03-04 15:32:02,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 15:32:02,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 15:32:02,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 70 transitions. [2025-03-04 15:32:02,312 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32407407407407407 [2025-03-04 15:32:02,312 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 121 flow. Second operand 8 states and 70 transitions. [2025-03-04 15:32:02,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 54 transitions, 328 flow [2025-03-04 15:32:02,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 54 transitions, 288 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-03-04 15:32:02,314 INFO L231 Difference]: Finished difference. Result has 40 places, 0 transitions, 0 flow [2025-03-04 15:32:02,315 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=0, PETRI_PLACES=40, PETRI_TRANSITIONS=0} [2025-03-04 15:32:02,315 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 12 predicate places. [2025-03-04 15:32:02,315 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 0 transitions, 0 flow [2025-03-04 15:32:02,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 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) [2025-03-04 15:32:02,317 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-03-04 15:32:02,317 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 10 remaining) [2025-03-04 15:32:02,318 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2025-03-04 15:32:02,318 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2025-03-04 15:32:02,318 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2025-03-04 15:32:02,318 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2025-03-04 15:32:02,318 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2025-03-04 15:32:02,318 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2025-03-04 15:32:02,318 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2025-03-04 15:32:02,318 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2025-03-04 15:32:02,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 15:32:02,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:32:02,520 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2025-03-04 15:32:02,523 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 15:32:02,523 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 15:32:02,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 03:32:02 BasicIcfg [2025-03-04 15:32:02,526 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 15:32:02,527 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:32:02,527 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:32:02,527 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:32:02,527 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:31:59" (3/4) ... [2025-03-04 15:32:02,528 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 15:32:02,530 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure f1 [2025-03-04 15:32:02,530 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure f2 [2025-03-04 15:32:02,532 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2025-03-04 15:32:02,532 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-04 15:32:02,532 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-04 15:32:02,532 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 15:32:02,582 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 15:32:02,583 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 15:32:02,583 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:32:02,584 INFO L158 Benchmark]: Toolchain (without parser) took 3323.52ms. Allocated memory is still 167.8MB. Free memory was 131.4MB in the beginning and 77.5MB in the end (delta: 53.9MB). Peak memory consumption was 57.4MB. Max. memory is 16.1GB. [2025-03-04 15:32:02,584 INFO L158 Benchmark]: CDTParser took 0.73ms. Allocated memory is still 209.7MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:32:02,585 INFO L158 Benchmark]: CACSL2BoogieTranslator took 348.49ms. Allocated memory is still 167.8MB. Free memory was 131.4MB in the beginning and 111.6MB in the end (delta: 19.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 15:32:02,585 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.53ms. Allocated memory is still 167.8MB. Free memory was 111.6MB in the beginning and 109.9MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:32:02,586 INFO L158 Benchmark]: Boogie Preprocessor took 26.84ms. Allocated memory is still 167.8MB. Free memory was 109.9MB in the beginning and 108.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:32:02,586 INFO L158 Benchmark]: IcfgBuilder took 309.13ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 88.1MB in the end (delta: 20.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 15:32:02,586 INFO L158 Benchmark]: TraceAbstraction took 2545.89ms. Allocated memory is still 167.8MB. Free memory was 87.3MB in the beginning and 82.0MB in the end (delta: 5.4MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. [2025-03-04 15:32:02,586 INFO L158 Benchmark]: Witness Printer took 56.02ms. Allocated memory is still 167.8MB. Free memory was 82.0MB in the beginning and 77.5MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:32:02,588 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.73ms. Allocated memory is still 209.7MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 348.49ms. Allocated memory is still 167.8MB. Free memory was 131.4MB in the beginning and 111.6MB in the end (delta: 19.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.53ms. Allocated memory is still 167.8MB. Free memory was 111.6MB in the beginning and 109.9MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.84ms. Allocated memory is still 167.8MB. Free memory was 109.9MB in the beginning and 108.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 309.13ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 88.1MB in the end (delta: 20.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2545.89ms. Allocated memory is still 167.8MB. Free memory was 87.3MB in the beginning and 82.0MB in the end (delta: 5.4MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. * Witness Printer took 56.02ms. Allocated memory is still 167.8MB. Free memory was 82.0MB in the beginning and 77.5MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 760]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 760]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 767]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 767]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 45 locations, 10 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.5s, OverallIterations: 7, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 236 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 209 mSDsluCounter, 84 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 76 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 559 IncrementalHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 8 mSDtfsCounter, 559 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=121occurred in iteration=6, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 128 NumberOfCodeBlocks, 104 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 153 ConstructedInterpolants, 0 QuantifiedInterpolants, 377 SizeOfPredicates, 9 NumberOfNonLiveVariables, 235 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 12 InterpolantComputations, 5 PerfectInterpolantSequences, 68/103 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 15:32:02,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE