./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/clever.wvr.c --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/weaver/clever.wvr.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 f1b460e4dbdd0bf3097d690d1720c7a2141566e2aa4ca1ed003c7fa25661851d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:26:12,386 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:26:12,444 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:26:12,449 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:26:12,450 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:26:12,472 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:26:12,472 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:26:12,472 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:26:12,473 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:26:12,473 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:26:12,473 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:26:12,473 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:26:12,473 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:26:12,473 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:26:12,473 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:26:12,473 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:26:12,473 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:26:12,473 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:26:12,474 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:26:12,474 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:26:12,474 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:26:12,475 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:26:12,475 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:26:12,475 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:26:12,475 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:26:12,475 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:26:12,475 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:26:12,475 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:26:12,475 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:26:12,475 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:26:12,475 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:26:12,475 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:26:12,475 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:26:12,475 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:26:12,475 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:26:12,475 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:26:12,475 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:26:12,475 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:26:12,475 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:26:12,475 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:26:12,475 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:26:12,475 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:26:12,476 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:26:12,476 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:26:12,476 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:26:12,476 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 -> f1b460e4dbdd0bf3097d690d1720c7a2141566e2aa4ca1ed003c7fa25661851d [2025-03-04 15:26:12,709 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:26:12,718 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:26:12,720 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:26:12,722 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:26:12,722 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:26:12,723 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/clever.wvr.c [2025-03-04 15:26:13,892 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/378de72e5/b6e1c8a009eb4077b4cff8e414a5e4cc/FLAG1d9d5977c [2025-03-04 15:26:14,123 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:26:14,129 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/clever.wvr.c [2025-03-04 15:26:14,139 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/378de72e5/b6e1c8a009eb4077b4cff8e414a5e4cc/FLAG1d9d5977c [2025-03-04 15:26:14,463 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/378de72e5/b6e1c8a009eb4077b4cff8e414a5e4cc [2025-03-04 15:26:14,465 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:26:14,466 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:26:14,467 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:26:14,467 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:26:14,470 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:26:14,471 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:26:14" (1/1) ... [2025-03-04 15:26:14,472 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67918629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:14, skipping insertion in model container [2025-03-04 15:26:14,472 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:26:14" (1/1) ... [2025-03-04 15:26:14,483 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:26:14,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:26:14,595 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:26:14,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:26:14,614 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:26:14,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:14 WrapperNode [2025-03-04 15:26:14,614 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:26:14,615 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:26:14,615 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:26:14,615 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:26:14,619 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:26:14" (1/1) ... [2025-03-04 15:26:14,625 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:26:14" (1/1) ... [2025-03-04 15:26:14,637 INFO L138 Inliner]: procedures = 18, calls = 12, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 74 [2025-03-04 15:26:14,637 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:26:14,638 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:26:14,638 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:26:14,638 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:26:14,643 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:14" (1/1) ... [2025-03-04 15:26:14,644 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:14" (1/1) ... [2025-03-04 15:26:14,648 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:14" (1/1) ... [2025-03-04 15:26:14,665 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:26:14,665 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:14" (1/1) ... [2025-03-04 15:26:14,665 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:14" (1/1) ... [2025-03-04 15:26:14,668 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:14" (1/1) ... [2025-03-04 15:26:14,669 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:14" (1/1) ... [2025-03-04 15:26:14,669 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:14" (1/1) ... [2025-03-04 15:26:14,670 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:14" (1/1) ... [2025-03-04 15:26:14,671 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:26:14,672 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:26:14,672 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:26:14,672 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:26:14,673 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:14" (1/1) ... [2025-03-04 15:26:14,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:26:14,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:14,705 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:26:14,708 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:26:14,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:26:14,725 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 15:26:14,725 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 15:26:14,725 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 15:26:14,725 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 15:26:14,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:26:14,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:26:14,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:26:14,727 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:26:14,795 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:26:14,797 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:26:14,946 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:26:14,946 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:26:15,102 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:26:15,102 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:26:15,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:26:15 BoogieIcfgContainer [2025-03-04 15:26:15,103 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:26:15,105 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:26:15,105 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:26:15,109 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:26:15,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:26:14" (1/3) ... [2025-03-04 15:26:15,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@272917c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:26:15, skipping insertion in model container [2025-03-04 15:26:15,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:14" (2/3) ... [2025-03-04 15:26:15,111 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@272917c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:26:15, skipping insertion in model container [2025-03-04 15:26:15,112 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:26:15" (3/3) ... [2025-03-04 15:26:15,112 INFO L128 eAbstractionObserver]: Analyzing ICFG clever.wvr.c [2025-03-04 15:26:15,122 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:26:15,123 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG clever.wvr.c that has 3 procedures, 28 locations, 1 initial locations, 3 loop locations, and 6 error locations. [2025-03-04 15:26:15,124 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:26:15,164 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 15:26:15,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 30 transitions, 74 flow [2025-03-04 15:26:15,213 INFO L124 PetriNetUnfolderBase]: 3/28 cut-off events. [2025-03-04 15:26:15,217 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 15:26:15,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 28 events. 3/28 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 63 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2025-03-04 15:26:15,220 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 30 transitions, 74 flow [2025-03-04 15:26:15,222 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 26 transitions, 61 flow [2025-03-04 15:26:15,231 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:26:15,245 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;@65da4261, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:26:15,245 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-04 15:26:15,251 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:26:15,252 INFO L124 PetriNetUnfolderBase]: 1/13 cut-off events. [2025-03-04 15:26:15,252 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 15:26:15,252 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:15,252 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:26:15,253 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 15:26:15,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:15,258 INFO L85 PathProgramCache]: Analyzing trace with hash -568690934, now seen corresponding path program 1 times [2025-03-04 15:26:15,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:15,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901973144] [2025-03-04 15:26:15,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:15,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:15,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:26:15,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:26:15,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:15,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:15,471 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:26:15,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:15,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901973144] [2025-03-04 15:26:15,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901973144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:15,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:15,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:26:15,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068550147] [2025-03-04 15:26:15,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:15,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:26:15,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:15,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:26:15,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:26:15,511 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 30 [2025-03-04 15:26:15,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 26 transitions, 61 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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:26:15,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:15,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 30 [2025-03-04 15:26:15,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:15,643 INFO L124 PetriNetUnfolderBase]: 126/234 cut-off events. [2025-03-04 15:26:15,646 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-04 15:26:15,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 234 events. 126/234 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 959 event pairs, 47 based on Foata normal form. 10/164 useless extension candidates. Maximal degree in co-relation 423. Up to 146 conditions per place. [2025-03-04 15:26:15,654 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 19 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2025-03-04 15:26:15,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 31 transitions, 118 flow [2025-03-04 15:26:15,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:26:15,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:26:15,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2025-03-04 15:26:15,663 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5583333333333333 [2025-03-04 15:26:15,664 INFO L175 Difference]: Start difference. First operand has 30 places, 26 transitions, 61 flow. Second operand 4 states and 67 transitions. [2025-03-04 15:26:15,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 31 transitions, 118 flow [2025-03-04 15:26:15,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 31 transitions, 112 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:26:15,671 INFO L231 Difference]: Finished difference. Result has 29 places, 25 transitions, 60 flow [2025-03-04 15:26:15,673 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=60, PETRI_PLACES=29, PETRI_TRANSITIONS=25} [2025-03-04 15:26:15,676 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, -1 predicate places. [2025-03-04 15:26:15,676 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 25 transitions, 60 flow [2025-03-04 15:26:15,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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:26:15,677 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:15,677 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:26:15,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:26:15,677 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 15:26:15,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:15,679 INFO L85 PathProgramCache]: Analyzing trace with hash -568690901, now seen corresponding path program 1 times [2025-03-04 15:26:15,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:15,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679107782] [2025-03-04 15:26:15,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:15,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:15,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:26:15,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:26:15,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:15,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:15,771 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:26:15,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:15,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679107782] [2025-03-04 15:26:15,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679107782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:15,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:15,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:26:15,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213633769] [2025-03-04 15:26:15,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:15,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:26:15,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:15,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:26:15,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:26:15,780 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 30 [2025-03-04 15:26:15,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 25 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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:26:15,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:15,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 30 [2025-03-04 15:26:15,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:15,908 INFO L124 PetriNetUnfolderBase]: 237/437 cut-off events. [2025-03-04 15:26:15,909 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-04 15:26:15,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 879 conditions, 437 events. 237/437 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2032 event pairs, 85 based on Foata normal form. 10/350 useless extension candidates. Maximal degree in co-relation 460. Up to 216 conditions per place. [2025-03-04 15:26:15,913 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 33 selfloop transitions, 3 changer transitions 0/44 dead transitions. [2025-03-04 15:26:15,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 44 transitions, 179 flow [2025-03-04 15:26:15,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:26:15,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:26:15,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2025-03-04 15:26:15,915 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6833333333333333 [2025-03-04 15:26:15,915 INFO L175 Difference]: Start difference. First operand has 29 places, 25 transitions, 60 flow. Second operand 4 states and 82 transitions. [2025-03-04 15:26:15,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 44 transitions, 179 flow [2025-03-04 15:26:15,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 44 transitions, 169 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:26:15,916 INFO L231 Difference]: Finished difference. Result has 32 places, 28 transitions, 82 flow [2025-03-04 15:26:15,917 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=82, PETRI_PLACES=32, PETRI_TRANSITIONS=28} [2025-03-04 15:26:15,917 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 2 predicate places. [2025-03-04 15:26:15,917 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 28 transitions, 82 flow [2025-03-04 15:26:15,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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:26:15,917 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:15,917 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:15,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:26:15,918 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 15:26:15,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:15,918 INFO L85 PathProgramCache]: Analyzing trace with hash -449549537, now seen corresponding path program 1 times [2025-03-04 15:26:15,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:15,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232317467] [2025-03-04 15:26:15,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:15,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:15,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:26:15,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:26:15,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:15,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:15,994 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:26:15,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:15,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232317467] [2025-03-04 15:26:15,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232317467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:15,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:15,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:26:15,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658606257] [2025-03-04 15:26:15,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:15,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:26:15,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:15,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:26:15,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:26:16,001 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 30 [2025-03-04 15:26:16,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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:26:16,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:16,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 30 [2025-03-04 15:26:16,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:16,098 INFO L124 PetriNetUnfolderBase]: 366/697 cut-off events. [2025-03-04 15:26:16,098 INFO L125 PetriNetUnfolderBase]: For 157/161 co-relation queries the response was YES. [2025-03-04 15:26:16,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1521 conditions, 697 events. 366/697 cut-off events. For 157/161 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3580 event pairs, 60 based on Foata normal form. 0/583 useless extension candidates. Maximal degree in co-relation 1116. Up to 371 conditions per place. [2025-03-04 15:26:16,102 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 37 selfloop transitions, 3 changer transitions 0/49 dead transitions. [2025-03-04 15:26:16,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 49 transitions, 225 flow [2025-03-04 15:26:16,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:26:16,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:26:16,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2025-03-04 15:26:16,103 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-04 15:26:16,103 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 82 flow. Second operand 4 states and 80 transitions. [2025-03-04 15:26:16,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 49 transitions, 225 flow [2025-03-04 15:26:16,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 49 transitions, 225 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:26:16,105 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 102 flow [2025-03-04 15:26:16,105 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=102, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2025-03-04 15:26:16,106 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 7 predicate places. [2025-03-04 15:26:16,106 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 102 flow [2025-03-04 15:26:16,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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:26:16,106 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:16,106 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:16,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:26:16,106 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 15:26:16,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:16,107 INFO L85 PathProgramCache]: Analyzing trace with hash -451684592, now seen corresponding path program 1 times [2025-03-04 15:26:16,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:16,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254303801] [2025-03-04 15:26:16,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:16,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:16,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:26:16,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:26:16,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:16,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:16,155 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:26:16,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:16,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254303801] [2025-03-04 15:26:16,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254303801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:16,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:16,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:26:16,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207789225] [2025-03-04 15:26:16,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:16,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:26:16,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:16,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:26:16,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:26:16,162 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 30 [2025-03-04 15:26:16,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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:26:16,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:16,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 30 [2025-03-04 15:26:16,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:16,259 INFO L124 PetriNetUnfolderBase]: 399/771 cut-off events. [2025-03-04 15:26:16,259 INFO L125 PetriNetUnfolderBase]: For 351/367 co-relation queries the response was YES. [2025-03-04 15:26:16,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1835 conditions, 771 events. 399/771 cut-off events. For 351/367 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3989 event pairs, 154 based on Foata normal form. 39/688 useless extension candidates. Maximal degree in co-relation 1387. Up to 384 conditions per place. [2025-03-04 15:26:16,263 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 31 selfloop transitions, 3 changer transitions 0/42 dead transitions. [2025-03-04 15:26:16,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 42 transitions, 224 flow [2025-03-04 15:26:16,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:26:16,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:26:16,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2025-03-04 15:26:16,266 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.575 [2025-03-04 15:26:16,266 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 102 flow. Second operand 4 states and 69 transitions. [2025-03-04 15:26:16,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 42 transitions, 224 flow [2025-03-04 15:26:16,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 42 transitions, 221 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:26:16,268 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 104 flow [2025-03-04 15:26:16,268 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=104, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2025-03-04 15:26:16,268 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 8 predicate places. [2025-03-04 15:26:16,268 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 104 flow [2025-03-04 15:26:16,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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:26:16,270 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:16,270 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:16,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:26:16,270 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 15:26:16,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:16,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1117320222, now seen corresponding path program 1 times [2025-03-04 15:26:16,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:16,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115697856] [2025-03-04 15:26:16,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:16,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:16,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:26:16,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:26:16,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:16,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:16,333 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:26:16,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:16,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115697856] [2025-03-04 15:26:16,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115697856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:16,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:16,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:26:16,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867009856] [2025-03-04 15:26:16,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:16,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:26:16,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:16,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:26:16,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:26:16,343 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 30 [2025-03-04 15:26:16,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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:26:16,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:16,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 30 [2025-03-04 15:26:16,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:16,452 INFO L124 PetriNetUnfolderBase]: 500/970 cut-off events. [2025-03-04 15:26:16,452 INFO L125 PetriNetUnfolderBase]: For 633/685 co-relation queries the response was YES. [2025-03-04 15:26:16,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2451 conditions, 970 events. 500/970 cut-off events. For 633/685 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5270 event pairs, 106 based on Foata normal form. 39/999 useless extension candidates. Maximal degree in co-relation 1917. Up to 456 conditions per place. [2025-03-04 15:26:16,458 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 47 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2025-03-04 15:26:16,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 58 transitions, 324 flow [2025-03-04 15:26:16,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:26:16,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:26:16,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2025-03-04 15:26:16,459 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-04 15:26:16,459 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 104 flow. Second operand 4 states and 80 transitions. [2025-03-04 15:26:16,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 58 transitions, 324 flow [2025-03-04 15:26:16,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 58 transitions, 314 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:26:16,463 INFO L231 Difference]: Finished difference. Result has 40 places, 31 transitions, 118 flow [2025-03-04 15:26:16,463 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2025-03-04 15:26:16,463 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 10 predicate places. [2025-03-04 15:26:16,463 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 118 flow [2025-03-04 15:26:16,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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:26:16,463 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:16,464 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:16,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:26:16,464 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 15:26:16,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:16,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1775586117, now seen corresponding path program 1 times [2025-03-04 15:26:16,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:16,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310753022] [2025-03-04 15:26:16,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:16,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:16,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:26:16,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:26:16,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:16,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:16,535 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:26:16,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:16,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310753022] [2025-03-04 15:26:16,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310753022] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:16,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913176474] [2025-03-04 15:26:16,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:16,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:16,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:16,538 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:26:16,540 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:26:16,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:26:16,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:26:16,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:16,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:16,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:26:16,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:16,613 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:26:16,613 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:26:16,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913176474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:16,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:26:16,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 15:26:16,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013677487] [2025-03-04 15:26:16,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:16,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:26:16,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:16,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:26:16,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:26:16,621 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 30 [2025-03-04 15:26:16,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 118 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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:26:16,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:16,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 30 [2025-03-04 15:26:16,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:16,759 INFO L124 PetriNetUnfolderBase]: 475/929 cut-off events. [2025-03-04 15:26:16,759 INFO L125 PetriNetUnfolderBase]: For 524/560 co-relation queries the response was YES. [2025-03-04 15:26:16,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2453 conditions, 929 events. 475/929 cut-off events. For 524/560 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5162 event pairs, 28 based on Foata normal form. 28/927 useless extension candidates. Maximal degree in co-relation 2049. Up to 258 conditions per place. [2025-03-04 15:26:16,764 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 58 selfloop transitions, 6 changer transitions 0/71 dead transitions. [2025-03-04 15:26:16,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 71 transitions, 392 flow [2025-03-04 15:26:16,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:26:16,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:26:16,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2025-03-04 15:26:16,765 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65 [2025-03-04 15:26:16,766 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 118 flow. Second operand 6 states and 117 transitions. [2025-03-04 15:26:16,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 71 transitions, 392 flow [2025-03-04 15:26:16,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 71 transitions, 386 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:26:16,769 INFO L231 Difference]: Finished difference. Result has 43 places, 31 transitions, 130 flow [2025-03-04 15:26:16,770 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=130, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2025-03-04 15:26:16,770 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 13 predicate places. [2025-03-04 15:26:16,770 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 130 flow [2025-03-04 15:26:16,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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:26:16,770 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:16,770 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:16,778 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:26:16,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 15:26:16,977 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 15:26:16,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:16,978 INFO L85 PathProgramCache]: Analyzing trace with hash -791404986, now seen corresponding path program 1 times [2025-03-04 15:26:16,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:16,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321339530] [2025-03-04 15:26:16,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:16,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:16,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:26:16,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:26:16,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:16,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:17,041 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:26:17,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:17,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321339530] [2025-03-04 15:26:17,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321339530] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:17,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934501069] [2025-03-04 15:26:17,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:17,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:17,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:17,043 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:26:17,045 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:26:17,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:26:17,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:26:17,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:17,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:17,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:26:17,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:17,106 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:26:17,107 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:26:17,145 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:26:17,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934501069] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:26:17,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:26:17,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 15:26:17,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186920893] [2025-03-04 15:26:17,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:26:17,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:26:17,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:17,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:26:17,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:26:17,157 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 30 [2025-03-04 15:26:17,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 130 flow. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 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:26:17,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:17,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 30 [2025-03-04 15:26:17,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:17,487 INFO L124 PetriNetUnfolderBase]: 1057/2087 cut-off events. [2025-03-04 15:26:17,487 INFO L125 PetriNetUnfolderBase]: For 1799/1874 co-relation queries the response was YES. [2025-03-04 15:26:17,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5665 conditions, 2087 events. 1057/2087 cut-off events. For 1799/1874 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 12802 event pairs, 213 based on Foata normal form. 84/2167 useless extension candidates. Maximal degree in co-relation 3767. Up to 463 conditions per place. [2025-03-04 15:26:17,500 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 108 selfloop transitions, 13 changer transitions 0/128 dead transitions. [2025-03-04 15:26:17,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 128 transitions, 748 flow [2025-03-04 15:26:17,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:26:17,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:26:17,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 205 transitions. [2025-03-04 15:26:17,502 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6833333333333333 [2025-03-04 15:26:17,502 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 130 flow. Second operand 10 states and 205 transitions. [2025-03-04 15:26:17,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 128 transitions, 748 flow [2025-03-04 15:26:17,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 128 transitions, 720 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-04 15:26:17,508 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 204 flow [2025-03-04 15:26:17,509 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=204, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2025-03-04 15:26:17,509 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 21 predicate places. [2025-03-04 15:26:17,509 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 204 flow [2025-03-04 15:26:17,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 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:26:17,511 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:17,511 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 15:26:17,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 15:26:17,711 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,SelfDestructingSolverStorable6 [2025-03-04 15:26:17,712 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 15:26:17,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:17,713 INFO L85 PathProgramCache]: Analyzing trace with hash 289576837, now seen corresponding path program 1 times [2025-03-04 15:26:17,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:17,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76343516] [2025-03-04 15:26:17,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:17,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:17,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:26:17,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:26:17,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:17,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:17,778 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:26:17,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:17,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76343516] [2025-03-04 15:26:17,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76343516] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:17,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806117333] [2025-03-04 15:26:17,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:17,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:17,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:17,781 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:26:17,783 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:26:17,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:26:17,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:26:17,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:17,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:17,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:26:17,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:17,845 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:26:17,845 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:26:17,868 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:26:17,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806117333] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:26:17,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:26:17,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2025-03-04 15:26:17,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136721288] [2025-03-04 15:26:17,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:26:17,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 15:26:17,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:17,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 15:26:17,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:26:17,878 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 30 [2025-03-04 15:26:17,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 204 flow. Second operand has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:26:17,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:17,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 30 [2025-03-04 15:26:17,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:18,257 INFO L124 PetriNetUnfolderBase]: 1847/3511 cut-off events. [2025-03-04 15:26:18,257 INFO L125 PetriNetUnfolderBase]: For 3289/3436 co-relation queries the response was YES. [2025-03-04 15:26:18,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9989 conditions, 3511 events. 1847/3511 cut-off events. For 3289/3436 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 22681 event pairs, 208 based on Foata normal form. 0/3501 useless extension candidates. Maximal degree in co-relation 8503. Up to 880 conditions per place. [2025-03-04 15:26:18,279 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 106 selfloop transitions, 12 changer transitions 0/125 dead transitions. [2025-03-04 15:26:18,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 125 transitions, 845 flow [2025-03-04 15:26:18,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 15:26:18,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 15:26:18,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2025-03-04 15:26:18,280 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6259259259259259 [2025-03-04 15:26:18,280 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 204 flow. Second operand 9 states and 169 transitions. [2025-03-04 15:26:18,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 125 transitions, 845 flow [2025-03-04 15:26:18,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 125 transitions, 805 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-03-04 15:26:18,290 INFO L231 Difference]: Finished difference. Result has 57 places, 46 transitions, 262 flow [2025-03-04 15:26:18,290 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=262, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2025-03-04 15:26:18,291 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 27 predicate places. [2025-03-04 15:26:18,291 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 262 flow [2025-03-04 15:26:18,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:26:18,291 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:18,291 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:18,299 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:26:18,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:18,492 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 15:26:18,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:18,492 INFO L85 PathProgramCache]: Analyzing trace with hash -89892628, now seen corresponding path program 1 times [2025-03-04 15:26:18,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:18,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308626873] [2025-03-04 15:26:18,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:18,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:18,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:26:18,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:26:18,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:18,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:18,560 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:26:18,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:18,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308626873] [2025-03-04 15:26:18,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308626873] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:18,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182597718] [2025-03-04 15:26:18,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:18,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:18,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:18,563 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) [2025-03-04 15:26:18,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 15:26:18,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:26:18,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:26:18,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:18,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:18,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:26:18,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:18,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:26:18,626 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:26:18,642 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:26:18,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182597718] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:26:18,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:26:18,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 2, 2] total 6 [2025-03-04 15:26:18,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586694677] [2025-03-04 15:26:18,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:26:18,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 15:26:18,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:18,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:26:18,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:26:18,651 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 30 [2025-03-04 15:26:18,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 46 transitions, 262 flow. Second operand has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 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:26:18,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:18,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 30 [2025-03-04 15:26:18,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:19,013 INFO L124 PetriNetUnfolderBase]: 2678/5069 cut-off events. [2025-03-04 15:26:19,014 INFO L125 PetriNetUnfolderBase]: For 7106/7142 co-relation queries the response was YES. [2025-03-04 15:26:19,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14586 conditions, 5069 events. 2678/5069 cut-off events. For 7106/7142 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 34815 event pairs, 473 based on Foata normal form. 0/5059 useless extension candidates. Maximal degree in co-relation 12967. Up to 1064 conditions per place. [2025-03-04 15:26:19,038 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 174 selfloop transitions, 7 changer transitions 12/199 dead transitions. [2025-03-04 15:26:19,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 199 transitions, 1661 flow [2025-03-04 15:26:19,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 15:26:19,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 15:26:19,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2025-03-04 15:26:19,040 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6291666666666667 [2025-03-04 15:26:19,040 INFO L175 Difference]: Start difference. First operand has 57 places, 46 transitions, 262 flow. Second operand 8 states and 151 transitions. [2025-03-04 15:26:19,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 199 transitions, 1661 flow [2025-03-04 15:26:19,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 199 transitions, 1574 flow, removed 24 selfloop flow, removed 5 redundant places. [2025-03-04 15:26:19,050 INFO L231 Difference]: Finished difference. Result has 58 places, 45 transitions, 258 flow [2025-03-04 15:26:19,050 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=258, PETRI_PLACES=58, PETRI_TRANSITIONS=45} [2025-03-04 15:26:19,050 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 28 predicate places. [2025-03-04 15:26:19,050 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 45 transitions, 258 flow [2025-03-04 15:26:19,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 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:26:19,051 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:19,051 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1] [2025-03-04 15:26:19,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 15:26:19,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:19,255 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-04 15:26:19,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:19,255 INFO L85 PathProgramCache]: Analyzing trace with hash 2147257248, now seen corresponding path program 2 times [2025-03-04 15:26:19,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:19,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111262878] [2025-03-04 15:26:19,256 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:26:19,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:19,264 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 15:26:19,267 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 19 statements. [2025-03-04 15:26:19,267 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:26:19,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:19,283 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:26:19,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:19,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111262878] [2025-03-04 15:26:19,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111262878] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:19,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004559164] [2025-03-04 15:26:19,283 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:26:19,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:19,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:19,285 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) [2025-03-04 15:26:19,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 15:26:19,310 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 15:26:19,315 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 19 statements. [2025-03-04 15:26:19,316 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:26:19,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:19,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:26:19,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:19,336 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:26:19,336 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:26:19,356 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:26:19,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004559164] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:26:19,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:26:19,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2025-03-04 15:26:19,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076617123] [2025-03-04 15:26:19,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:26:19,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:26:19,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:19,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:26:19,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:26:19,360 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 30 [2025-03-04 15:26:19,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 45 transitions, 258 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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:26:19,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:19,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 30 [2025-03-04 15:26:19,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:19,564 INFO L124 PetriNetUnfolderBase]: 2070/3934 cut-off events. [2025-03-04 15:26:19,565 INFO L125 PetriNetUnfolderBase]: For 6018/6018 co-relation queries the response was YES. [2025-03-04 15:26:19,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11969 conditions, 3934 events. 2070/3934 cut-off events. For 6018/6018 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 26003 event pairs, 1223 based on Foata normal form. 60/3981 useless extension candidates. Maximal degree in co-relation 10758. Up to 2556 conditions per place. [2025-03-04 15:26:19,574 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 0 selfloop transitions, 0 changer transitions 54/54 dead transitions. [2025-03-04 15:26:19,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 54 transitions, 394 flow [2025-03-04 15:26:19,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:26:19,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:26:19,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2025-03-04 15:26:19,579 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-03-04 15:26:19,579 INFO L175 Difference]: Start difference. First operand has 58 places, 45 transitions, 258 flow. Second operand 4 states and 64 transitions. [2025-03-04 15:26:19,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 54 transitions, 394 flow [2025-03-04 15:26:19,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 54 transitions, 353 flow, removed 9 selfloop flow, removed 9 redundant places. [2025-03-04 15:26:19,589 INFO L231 Difference]: Finished difference. Result has 49 places, 0 transitions, 0 flow [2025-03-04 15:26:19,590 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=49, PETRI_TRANSITIONS=0} [2025-03-04 15:26:19,590 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 19 predicate places. [2025-03-04 15:26:19,590 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 0 transitions, 0 flow [2025-03-04 15:26:19,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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:26:19,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2025-03-04 15:26:19,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2025-03-04 15:26:19,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2025-03-04 15:26:19,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2025-03-04 15:26:19,593 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2025-03-04 15:26:19,593 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2025-03-04 15:26:19,593 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 14 remaining) [2025-03-04 15:26:19,593 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 14 remaining) [2025-03-04 15:26:19,593 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2025-03-04 15:26:19,593 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2025-03-04 15:26:19,593 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2025-03-04 15:26:19,593 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2025-03-04 15:26:19,593 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2025-03-04 15:26:19,593 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2025-03-04 15:26:19,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 15:26:19,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-04 15:26:19,794 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:19,797 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 15:26:19,798 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 15:26:19,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 03:26:19 BasicIcfg [2025-03-04 15:26:19,802 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 15:26:19,802 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:26:19,802 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:26:19,802 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:26:19,802 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:26:15" (3/4) ... [2025-03-04 15:26:19,803 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 15:26:19,805 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-04 15:26:19,805 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-04 15:26:19,808 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 57 nodes and edges [2025-03-04 15:26:19,808 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2025-03-04 15:26:19,808 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-04 15:26:19,808 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 15:26:19,862 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 15:26:19,862 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 15:26:19,862 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:26:19,863 INFO L158 Benchmark]: Toolchain (without parser) took 5397.42ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 105.8MB in the beginning and 180.6MB in the end (delta: -74.8MB). Peak memory consumption was 66.1MB. Max. memory is 16.1GB. [2025-03-04 15:26:19,864 INFO L158 Benchmark]: CDTParser took 1.01ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:26:19,864 INFO L158 Benchmark]: CACSL2BoogieTranslator took 147.66ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 94.9MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:26:19,864 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.32ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 93.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:26:19,865 INFO L158 Benchmark]: Boogie Preprocessor took 33.88ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 91.7MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:26:19,866 INFO L158 Benchmark]: IcfgBuilder took 430.84ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 61.5MB in the end (delta: 30.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 15:26:19,866 INFO L158 Benchmark]: TraceAbstraction took 4696.63ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 61.5MB in the beginning and 186.6MB in the end (delta: -125.2MB). Peak memory consumption was 126.8MB. Max. memory is 16.1GB. [2025-03-04 15:26:19,866 INFO L158 Benchmark]: Witness Printer took 60.57ms. Allocated memory is still 285.2MB. Free memory was 186.6MB in the beginning and 180.6MB in the end (delta: 6.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:26:19,867 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.01ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 147.66ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 94.9MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.32ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 93.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.88ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 91.7MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 430.84ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 61.5MB in the end (delta: 30.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4696.63ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 61.5MB in the beginning and 186.6MB in the end (delta: -125.2MB). Peak memory consumption was 126.8MB. Max. memory is 16.1GB. * Witness Printer took 60.57ms. Allocated memory is still 285.2MB. Free memory was 186.6MB in the beginning and 180.6MB in the end (delta: 6.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: 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, 49 locations, 14 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: 4.6s, OverallIterations: 10, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 465 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 431 mSDsluCounter, 58 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 956 IncrementalHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 20 mSDtfsCounter, 956 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 156 GetRequests, 88 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=262occurred in iteration=8, InterpolantAutomatonStates: 57, 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.8s InterpolantComputationTime, 154 NumberOfCodeBlocks, 130 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 186 ConstructedInterpolants, 0 QuantifiedInterpolants, 534 SizeOfPredicates, 13 NumberOfNonLiveVariables, 332 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 19 InterpolantComputations, 6 PerfectInterpolantSequences, 72/124 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 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 15:26:19,880 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