./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/parallel-misc-2-unrolled-atomic.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/parallel-misc-2-unrolled-atomic.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 9010a499ef96f31ef98b99a567d66bd11342d64ef955a852686bd9085f4ce268 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:26:30,347 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:26:30,386 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:30,391 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:26:30,391 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:26:30,415 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:26:30,415 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:26:30,415 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:26:30,415 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:26:30,416 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:26:30,416 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:26:30,416 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:26:30,416 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:26:30,416 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:26:30,416 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:26:30,416 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:26:30,416 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:26:30,416 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:26:30,416 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:26:30,416 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:26:30,416 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:26:30,416 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:26:30,416 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:26:30,416 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:26:30,416 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:26:30,417 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:26:30,417 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:26:30,417 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:26:30,417 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:26:30,417 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:26:30,417 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:26:30,418 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:26:30,418 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:26:30,418 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:26:30,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:26:30,418 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:26:30,418 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:26:30,418 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:26:30,418 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:26:30,418 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:26:30,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:26:30,418 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:26:30,419 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:26:30,419 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:26:30,419 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:26:30,419 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 -> 9010a499ef96f31ef98b99a567d66bd11342d64ef955a852686bd9085f4ce268 [2025-03-04 15:26:30,651 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:26:30,657 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:26:30,659 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:26:30,659 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:26:30,660 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:26:30,661 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-misc-2-unrolled-atomic.wvr.c [2025-03-04 15:26:31,743 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee8026ecb/f84e8cacd75f4fcfb334268bf60abe93/FLAG4ddf3c624 [2025-03-04 15:26:31,961 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:26:31,962 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-2-unrolled-atomic.wvr.c [2025-03-04 15:26:31,990 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee8026ecb/f84e8cacd75f4fcfb334268bf60abe93/FLAG4ddf3c624 [2025-03-04 15:26:32,014 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee8026ecb/f84e8cacd75f4fcfb334268bf60abe93 [2025-03-04 15:26:32,016 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:26:32,017 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:26:32,019 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:26:32,020 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:26:32,023 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:26:32,024 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:26:32" (1/1) ... [2025-03-04 15:26:32,025 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1aac93d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:32, skipping insertion in model container [2025-03-04 15:26:32,025 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:26:32" (1/1) ... [2025-03-04 15:26:32,039 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:26:32,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:26:32,156 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:26:32,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:26:32,189 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:26:32,190 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:32 WrapperNode [2025-03-04 15:26:32,191 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:26:32,192 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:26:32,192 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:26:32,192 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:26:32,198 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:32" (1/1) ... [2025-03-04 15:26:32,203 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:32" (1/1) ... [2025-03-04 15:26:32,215 INFO L138 Inliner]: procedures = 19, calls = 16, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 61 [2025-03-04 15:26:32,216 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:26:32,216 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:26:32,216 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:26:32,216 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:26:32,222 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:32" (1/1) ... [2025-03-04 15:26:32,222 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:32" (1/1) ... [2025-03-04 15:26:32,223 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:32" (1/1) ... [2025-03-04 15:26:32,232 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:32,232 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:32" (1/1) ... [2025-03-04 15:26:32,233 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:32" (1/1) ... [2025-03-04 15:26:32,235 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:32" (1/1) ... [2025-03-04 15:26:32,236 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:32" (1/1) ... [2025-03-04 15:26:32,237 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:32" (1/1) ... [2025-03-04 15:26:32,237 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:32" (1/1) ... [2025-03-04 15:26:32,238 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:26:32,239 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:26:32,239 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:26:32,239 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:26:32,240 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:32" (1/1) ... [2025-03-04 15:26:32,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:26:32,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:32,264 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:32,266 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:32,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:26:32,283 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 15:26:32,283 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 15:26:32,283 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 15:26:32,283 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 15:26:32,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:26:32,283 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 15:26:32,283 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 15:26:32,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:26:32,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:26:32,284 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:32,352 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:26:32,354 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:26:32,559 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:26:32,559 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:26:32,728 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:26:32,729 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:26:32,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:26:32 BoogieIcfgContainer [2025-03-04 15:26:32,730 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:26:32,732 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:26:32,733 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:26:32,736 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:26:32,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:26:32" (1/3) ... [2025-03-04 15:26:32,737 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18c3596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:26:32, skipping insertion in model container [2025-03-04 15:26:32,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:32" (2/3) ... [2025-03-04 15:26:32,738 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18c3596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:26:32, skipping insertion in model container [2025-03-04 15:26:32,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:26:32" (3/3) ... [2025-03-04 15:26:32,739 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-2-unrolled-atomic.wvr.c [2025-03-04 15:26:32,751 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:26:32,753 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-2-unrolled-atomic.wvr.c that has 3 procedures, 43 locations, 1 initial locations, 2 loop locations, and 20 error locations. [2025-03-04 15:26:32,753 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:26:32,790 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 15:26:32,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 46 transitions, 106 flow [2025-03-04 15:26:32,841 INFO L124 PetriNetUnfolderBase]: 4/44 cut-off events. [2025-03-04 15:26:32,844 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 15:26:32,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 44 events. 4/44 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 146 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place. [2025-03-04 15:26:32,847 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 46 transitions, 106 flow [2025-03-04 15:26:32,849 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 42 transitions, 93 flow [2025-03-04 15:26:32,854 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:26:32,867 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;@3bfd615b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:26:32,867 INFO L334 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2025-03-04 15:26:32,871 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:26:32,872 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2025-03-04 15:26:32,872 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:26:32,872 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:32,872 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 15:26:32,873 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-04 15:26:32,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:32,876 INFO L85 PathProgramCache]: Analyzing trace with hash 10576597, now seen corresponding path program 1 times [2025-03-04 15:26:32,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:32,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915891100] [2025-03-04 15:26:32,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:32,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:32,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:26:32,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:26:32,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:32,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:33,055 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:33,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:33,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915891100] [2025-03-04 15:26:33,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915891100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:33,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:33,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:26:33,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925875947] [2025-03-04 15:26:33,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:33,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:26:33,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:33,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:26:33,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:26:33,112 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2025-03-04 15:26:33,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 42 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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:33,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:33,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2025-03-04 15:26:33,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:33,298 INFO L124 PetriNetUnfolderBase]: 558/877 cut-off events. [2025-03-04 15:26:33,298 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-03-04 15:26:33,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1691 conditions, 877 events. 558/877 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 4870 event pairs, 268 based on Foata normal form. 73/445 useless extension candidates. Maximal degree in co-relation 1615. Up to 778 conditions per place. [2025-03-04 15:26:33,306 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 23 selfloop transitions, 1 changer transitions 0/34 dead transitions. [2025-03-04 15:26:33,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 34 transitions, 125 flow [2025-03-04 15:26:33,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:26:33,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:26:33,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2025-03-04 15:26:33,318 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4927536231884058 [2025-03-04 15:26:33,319 INFO L175 Difference]: Start difference. First operand has 45 places, 42 transitions, 93 flow. Second operand 3 states and 68 transitions. [2025-03-04 15:26:33,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 34 transitions, 125 flow [2025-03-04 15:26:33,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 34 transitions, 120 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:26:33,326 INFO L231 Difference]: Finished difference. Result has 38 places, 34 transitions, 74 flow [2025-03-04 15:26:33,327 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=38, PETRI_TRANSITIONS=34} [2025-03-04 15:26:33,330 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -7 predicate places. [2025-03-04 15:26:33,330 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 34 transitions, 74 flow [2025-03-04 15:26:33,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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:33,331 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:33,331 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:26:33,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:26:33,331 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-04 15:26:33,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:33,332 INFO L85 PathProgramCache]: Analyzing trace with hash 327874806, now seen corresponding path program 1 times [2025-03-04 15:26:33,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:33,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357358267] [2025-03-04 15:26:33,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:33,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:33,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:26:33,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:26:33,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:33,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:33,372 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:33,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:33,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357358267] [2025-03-04 15:26:33,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357358267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:33,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:33,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:26:33,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592168139] [2025-03-04 15:26:33,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:33,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:26:33,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:33,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:26:33,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:26:33,391 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-03-04 15:26:33,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 34 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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:33,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:33,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-03-04 15:26:33,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:33,455 INFO L124 PetriNetUnfolderBase]: 312/603 cut-off events. [2025-03-04 15:26:33,455 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 15:26:33,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1161 conditions, 603 events. 312/603 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 4089 event pairs, 269 based on Foata normal form. 0/311 useless extension candidates. Maximal degree in co-relation 1155. Up to 533 conditions per place. [2025-03-04 15:26:33,458 INFO L140 encePairwiseOnDemand]: 43/46 looper letters, 23 selfloop transitions, 1 changer transitions 0/32 dead transitions. [2025-03-04 15:26:33,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 32 transitions, 118 flow [2025-03-04 15:26:33,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:26:33,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:26:33,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2025-03-04 15:26:33,459 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4057971014492754 [2025-03-04 15:26:33,459 INFO L175 Difference]: Start difference. First operand has 38 places, 34 transitions, 74 flow. Second operand 3 states and 56 transitions. [2025-03-04 15:26:33,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 32 transitions, 118 flow [2025-03-04 15:26:33,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 32 transitions, 117 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:26:33,460 INFO L231 Difference]: Finished difference. Result has 37 places, 32 transitions, 71 flow [2025-03-04 15:26:33,461 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=71, PETRI_PLACES=37, PETRI_TRANSITIONS=32} [2025-03-04 15:26:33,461 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -8 predicate places. [2025-03-04 15:26:33,461 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 71 flow [2025-03-04 15:26:33,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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:33,461 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:33,462 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:33,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:26:33,462 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-04 15:26:33,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:33,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1555085626, now seen corresponding path program 1 times [2025-03-04 15:26:33,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:33,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324849463] [2025-03-04 15:26:33,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:33,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:33,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:26:33,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:26:33,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:33,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:33,550 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:33,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:33,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324849463] [2025-03-04 15:26:33,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324849463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:33,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:33,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:26:33,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666029489] [2025-03-04 15:26:33,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:33,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:26:33,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:33,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:26:33,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:26:33,557 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 46 [2025-03-04 15:26:33,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 71 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 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:33,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:33,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 46 [2025-03-04 15:26:33,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:33,651 INFO L124 PetriNetUnfolderBase]: 543/951 cut-off events. [2025-03-04 15:26:33,651 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 15:26:33,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1778 conditions, 951 events. 543/951 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 5876 event pairs, 120 based on Foata normal form. 0/416 useless extension candidates. Maximal degree in co-relation 1771. Up to 505 conditions per place. [2025-03-04 15:26:33,656 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 36 selfloop transitions, 4 changer transitions 0/50 dead transitions. [2025-03-04 15:26:33,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 50 transitions, 190 flow [2025-03-04 15:26:33,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:26:33,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:26:33,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2025-03-04 15:26:33,657 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6521739130434783 [2025-03-04 15:26:33,657 INFO L175 Difference]: Start difference. First operand has 37 places, 32 transitions, 71 flow. Second operand 3 states and 90 transitions. [2025-03-04 15:26:33,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 50 transitions, 190 flow [2025-03-04 15:26:33,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 50 transitions, 189 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:26:33,659 INFO L231 Difference]: Finished difference. Result has 40 places, 35 transitions, 102 flow [2025-03-04 15:26:33,659 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=40, PETRI_TRANSITIONS=35} [2025-03-04 15:26:33,660 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -5 predicate places. [2025-03-04 15:26:33,660 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 102 flow [2025-03-04 15:26:33,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 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:33,660 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:33,660 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:33,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:26:33,660 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-04 15:26:33,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:33,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1555085623, now seen corresponding path program 1 times [2025-03-04 15:26:33,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:33,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188500875] [2025-03-04 15:26:33,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:33,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:33,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:26:33,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:26:33,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:33,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:33,705 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:33,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:33,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188500875] [2025-03-04 15:26:33,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188500875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:33,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:33,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:26:33,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130025330] [2025-03-04 15:26:33,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:33,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:26:33,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:33,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:26:33,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:26:33,706 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 46 [2025-03-04 15:26:33,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 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:33,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:33,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 46 [2025-03-04 15:26:33,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:33,757 INFO L124 PetriNetUnfolderBase]: 274/514 cut-off events. [2025-03-04 15:26:33,757 INFO L125 PetriNetUnfolderBase]: For 122/122 co-relation queries the response was YES. [2025-03-04 15:26:33,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1085 conditions, 514 events. 274/514 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 2958 event pairs, 169 based on Foata normal form. 0/290 useless extension candidates. Maximal degree in co-relation 1075. Up to 424 conditions per place. [2025-03-04 15:26:33,761 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 19 selfloop transitions, 1 changer transitions 0/30 dead transitions. [2025-03-04 15:26:33,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 30 transitions, 126 flow [2025-03-04 15:26:33,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:26:33,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:26:33,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2025-03-04 15:26:33,762 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5072463768115942 [2025-03-04 15:26:33,762 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 102 flow. Second operand 3 states and 70 transitions. [2025-03-04 15:26:33,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 30 transitions, 126 flow [2025-03-04 15:26:33,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:26:33,763 INFO L231 Difference]: Finished difference. Result has 36 places, 30 transitions, 82 flow [2025-03-04 15:26:33,763 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=36, PETRI_TRANSITIONS=30} [2025-03-04 15:26:33,764 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -9 predicate places. [2025-03-04 15:26:33,764 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 30 transitions, 82 flow [2025-03-04 15:26:33,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 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:33,764 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:33,764 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:33,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:26:33,764 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-04 15:26:33,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:33,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1555085625, now seen corresponding path program 1 times [2025-03-04 15:26:33,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:33,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299389186] [2025-03-04 15:26:33,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:33,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:33,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:26:33,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:26:33,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:33,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:33,798 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:33,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:33,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299389186] [2025-03-04 15:26:33,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299389186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:33,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:33,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:26:33,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362517358] [2025-03-04 15:26:33,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:33,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:26:33,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:33,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:26:33,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:26:33,802 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 46 [2025-03-04 15:26:33,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 30 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 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:33,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:33,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 46 [2025-03-04 15:26:33,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:33,844 INFO L124 PetriNetUnfolderBase]: 233/449 cut-off events. [2025-03-04 15:26:33,845 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-03-04 15:26:33,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 902 conditions, 449 events. 233/449 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 2620 event pairs, 150 based on Foata normal form. 0/247 useless extension candidates. Maximal degree in co-relation 892. Up to 368 conditions per place. [2025-03-04 15:26:33,847 INFO L140 encePairwiseOnDemand]: 44/46 looper letters, 17 selfloop transitions, 1 changer transitions 0/28 dead transitions. [2025-03-04 15:26:33,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 28 transitions, 110 flow [2025-03-04 15:26:33,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:26:33,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:26:33,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2025-03-04 15:26:33,850 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4782608695652174 [2025-03-04 15:26:33,850 INFO L175 Difference]: Start difference. First operand has 36 places, 30 transitions, 82 flow. Second operand 3 states and 66 transitions. [2025-03-04 15:26:33,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 28 transitions, 110 flow [2025-03-04 15:26:33,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 28 transitions, 109 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:26:33,851 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 75 flow [2025-03-04 15:26:33,853 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2025-03-04 15:26:33,853 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -9 predicate places. [2025-03-04 15:26:33,853 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 75 flow [2025-03-04 15:26:33,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 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:33,853 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:33,854 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:33,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:26:33,854 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-04 15:26:33,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:33,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1555085624, now seen corresponding path program 1 times [2025-03-04 15:26:33,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:33,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882642980] [2025-03-04 15:26:33,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:33,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:33,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:26:33,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:26:33,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:33,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:33,895 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:33,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:33,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882642980] [2025-03-04 15:26:33,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882642980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:33,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:33,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:26:33,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135650941] [2025-03-04 15:26:33,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:33,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:26:33,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:33,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:26:33,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:26:33,898 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 46 [2025-03-04 15:26:33,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 75 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 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:33,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:33,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 46 [2025-03-04 15:26:33,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:33,959 INFO L124 PetriNetUnfolderBase]: 165/325 cut-off events. [2025-03-04 15:26:33,960 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-03-04 15:26:33,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 666 conditions, 325 events. 165/325 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 1655 event pairs, 48 based on Foata normal form. 12/195 useless extension candidates. Maximal degree in co-relation 655. Up to 137 conditions per place. [2025-03-04 15:26:33,963 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 28 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2025-03-04 15:26:33,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 42 transitions, 178 flow [2025-03-04 15:26:33,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:26:33,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:26:33,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2025-03-04 15:26:33,965 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5797101449275363 [2025-03-04 15:26:33,966 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 75 flow. Second operand 3 states and 80 transitions. [2025-03-04 15:26:33,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 42 transitions, 178 flow [2025-03-04 15:26:33,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 42 transitions, 177 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:26:33,967 INFO L231 Difference]: Finished difference. Result has 38 places, 31 transitions, 104 flow [2025-03-04 15:26:33,967 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=38, PETRI_TRANSITIONS=31} [2025-03-04 15:26:33,968 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -7 predicate places. [2025-03-04 15:26:33,969 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 104 flow [2025-03-04 15:26:33,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 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:33,969 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:33,969 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:33,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:26:33,969 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-04 15:26:33,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:33,970 INFO L85 PathProgramCache]: Analyzing trace with hash -282722983, now seen corresponding path program 1 times [2025-03-04 15:26:33,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:33,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925175135] [2025-03-04 15:26:33,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:33,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:33,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:26:33,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:26:33,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:33,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:34,020 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:34,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:34,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925175135] [2025-03-04 15:26:34,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925175135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:34,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:34,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:26:34,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395132714] [2025-03-04 15:26:34,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:34,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:26:34,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:34,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:26:34,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:26:34,024 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 46 [2025-03-04 15:26:34,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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:34,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:34,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 46 [2025-03-04 15:26:34,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:34,066 INFO L124 PetriNetUnfolderBase]: 129/275 cut-off events. [2025-03-04 15:26:34,066 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2025-03-04 15:26:34,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 623 conditions, 275 events. 129/275 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1404 event pairs, 77 based on Foata normal form. 0/180 useless extension candidates. Maximal degree in co-relation 610. Up to 212 conditions per place. [2025-03-04 15:26:34,068 INFO L140 encePairwiseOnDemand]: 44/46 looper letters, 18 selfloop transitions, 1 changer transitions 0/29 dead transitions. [2025-03-04 15:26:34,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 29 transitions, 133 flow [2025-03-04 15:26:34,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:26:34,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:26:34,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2025-03-04 15:26:34,070 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47101449275362317 [2025-03-04 15:26:34,070 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 104 flow. Second operand 3 states and 65 transitions. [2025-03-04 15:26:34,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 29 transitions, 133 flow [2025-03-04 15:26:34,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 29 transitions, 130 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:26:34,072 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 94 flow [2025-03-04 15:26:34,072 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2025-03-04 15:26:34,072 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -7 predicate places. [2025-03-04 15:26:34,072 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 94 flow [2025-03-04 15:26:34,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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:34,073 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:34,073 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:34,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:26:34,073 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-04 15:26:34,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:34,073 INFO L85 PathProgramCache]: Analyzing trace with hash -282722978, now seen corresponding path program 1 times [2025-03-04 15:26:34,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:34,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592207963] [2025-03-04 15:26:34,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:34,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:34,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:26:34,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:26:34,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:34,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:34,115 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:34,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:34,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592207963] [2025-03-04 15:26:34,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592207963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:34,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:34,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:26:34,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496967705] [2025-03-04 15:26:34,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:34,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:26:34,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:34,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:26:34,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:26:34,120 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 46 [2025-03-04 15:26:34,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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:34,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:34,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 46 [2025-03-04 15:26:34,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:34,165 INFO L124 PetriNetUnfolderBase]: 137/337 cut-off events. [2025-03-04 15:26:34,165 INFO L125 PetriNetUnfolderBase]: For 102/102 co-relation queries the response was YES. [2025-03-04 15:26:34,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 696 conditions, 337 events. 137/337 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1933 event pairs, 34 based on Foata normal form. 5/258 useless extension candidates. Maximal degree in co-relation 682. Up to 160 conditions per place. [2025-03-04 15:26:34,166 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 27 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2025-03-04 15:26:34,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 39 transitions, 185 flow [2025-03-04 15:26:34,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:26:34,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:26:34,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2025-03-04 15:26:34,168 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5434782608695652 [2025-03-04 15:26:34,168 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 94 flow. Second operand 3 states and 75 transitions. [2025-03-04 15:26:34,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 39 transitions, 185 flow [2025-03-04 15:26:34,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 39 transitions, 184 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:26:34,169 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 109 flow [2025-03-04 15:26:34,169 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2025-03-04 15:26:34,169 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -5 predicate places. [2025-03-04 15:26:34,169 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 109 flow [2025-03-04 15:26:34,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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:34,170 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:34,170 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 15:26:34,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:26:34,170 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-04 15:26:34,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:34,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1212338357, now seen corresponding path program 1 times [2025-03-04 15:26:34,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:34,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388334790] [2025-03-04 15:26:34,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:34,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:34,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:26:34,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:26:34,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:34,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:34,247 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:34,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:34,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388334790] [2025-03-04 15:26:34,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388334790] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:34,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583100873] [2025-03-04 15:26:34,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:34,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:34,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:34,250 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:34,251 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:34,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:26:34,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:26:34,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:34,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:34,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:26:34,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:34,371 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:26:34,372 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:26:34,404 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:26:34,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583100873] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:26:34,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:26:34,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2025-03-04 15:26:34,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069855339] [2025-03-04 15:26:34,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:26:34,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 15:26:34,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:34,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 15:26:34,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:26:34,437 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 46 [2025-03-04 15:26:34,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 109 flow. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 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:34,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:34,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 46 [2025-03-04 15:26:34,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:34,577 INFO L124 PetriNetUnfolderBase]: 530/981 cut-off events. [2025-03-04 15:26:34,577 INFO L125 PetriNetUnfolderBase]: For 246/246 co-relation queries the response was YES. [2025-03-04 15:26:34,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2257 conditions, 981 events. 530/981 cut-off events. For 246/246 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5493 event pairs, 111 based on Foata normal form. 36/870 useless extension candidates. Maximal degree in co-relation 2241. Up to 257 conditions per place. [2025-03-04 15:26:34,581 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 55 selfloop transitions, 5 changer transitions 4/70 dead transitions. [2025-03-04 15:26:34,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 70 transitions, 349 flow [2025-03-04 15:26:34,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:26:34,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:26:34,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2025-03-04 15:26:34,582 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4057971014492754 [2025-03-04 15:26:34,582 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 109 flow. Second operand 6 states and 112 transitions. [2025-03-04 15:26:34,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 70 transitions, 349 flow [2025-03-04 15:26:34,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 70 transitions, 339 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:26:34,584 INFO L231 Difference]: Finished difference. Result has 41 places, 26 transitions, 97 flow [2025-03-04 15:26:34,584 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=97, PETRI_PLACES=41, PETRI_TRANSITIONS=26} [2025-03-04 15:26:34,584 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -4 predicate places. [2025-03-04 15:26:34,584 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 26 transitions, 97 flow [2025-03-04 15:26:34,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 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:34,585 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:34,585 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:34,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 15:26:34,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:34,789 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-04 15:26:34,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:34,789 INFO L85 PathProgramCache]: Analyzing trace with hash -943990805, now seen corresponding path program 1 times [2025-03-04 15:26:34,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:34,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817766703] [2025-03-04 15:26:34,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:34,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:34,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:26:34,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:26:34,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:34,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:34,837 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:34,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:34,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817766703] [2025-03-04 15:26:34,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817766703] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:34,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818934860] [2025-03-04 15:26:34,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:34,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:34,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:34,839 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:34,840 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:34,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:26:34,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:26:34,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:34,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:34,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:26:34,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:34,954 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:26:34,954 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:26:34,981 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:26:34,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818934860] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:26:34,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:26:34,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2025-03-04 15:26:34,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429435059] [2025-03-04 15:26:34,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:26:34,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 15:26:34,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:34,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 15:26:34,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:26:35,016 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 46 [2025-03-04 15:26:35,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 26 transitions, 97 flow. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 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:35,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:35,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 46 [2025-03-04 15:26:35,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:35,159 INFO L124 PetriNetUnfolderBase]: 594/1159 cut-off events. [2025-03-04 15:26:35,159 INFO L125 PetriNetUnfolderBase]: For 554/584 co-relation queries the response was YES. [2025-03-04 15:26:35,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2518 conditions, 1159 events. 594/1159 cut-off events. For 554/584 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 6608 event pairs, 147 based on Foata normal form. 0/1024 useless extension candidates. Maximal degree in co-relation 2501. Up to 292 conditions per place. [2025-03-04 15:26:35,163 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 0 selfloop transitions, 0 changer transitions 54/54 dead transitions. [2025-03-04 15:26:35,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 54 transitions, 284 flow [2025-03-04 15:26:35,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:26:35,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:26:35,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2025-03-04 15:26:35,164 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32971014492753625 [2025-03-04 15:26:35,164 INFO L175 Difference]: Start difference. First operand has 41 places, 26 transitions, 97 flow. Second operand 6 states and 91 transitions. [2025-03-04 15:26:35,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 54 transitions, 284 flow [2025-03-04 15:26:35,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 54 transitions, 256 flow, removed 8 selfloop flow, removed 4 redundant places. [2025-03-04 15:26:35,166 INFO L231 Difference]: Finished difference. Result has 38 places, 0 transitions, 0 flow [2025-03-04 15:26:35,166 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=38, PETRI_TRANSITIONS=0} [2025-03-04 15:26:35,167 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -7 predicate places. [2025-03-04 15:26:35,167 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 0 transitions, 0 flow [2025-03-04 15:26:35,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 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:35,169 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 42 remaining) [2025-03-04 15:26:35,170 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 42 remaining) [2025-03-04 15:26:35,170 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 42 remaining) [2025-03-04 15:26:35,170 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 42 remaining) [2025-03-04 15:26:35,170 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 42 remaining) [2025-03-04 15:26:35,170 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 42 remaining) [2025-03-04 15:26:35,170 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 42 remaining) [2025-03-04 15:26:35,170 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 42 remaining) [2025-03-04 15:26:35,170 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 42 remaining) [2025-03-04 15:26:35,170 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 42 remaining) [2025-03-04 15:26:35,170 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 42 remaining) [2025-03-04 15:26:35,170 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 42 remaining) [2025-03-04 15:26:35,170 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 42 remaining) [2025-03-04 15:26:35,170 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 42 remaining) [2025-03-04 15:26:35,170 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 42 remaining) [2025-03-04 15:26:35,170 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 42 remaining) [2025-03-04 15:26:35,170 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 42 remaining) [2025-03-04 15:26:35,170 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 42 remaining) [2025-03-04 15:26:35,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 42 remaining) [2025-03-04 15:26:35,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 42 remaining) [2025-03-04 15:26:35,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 42 remaining) [2025-03-04 15:26:35,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 42 remaining) [2025-03-04 15:26:35,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 42 remaining) [2025-03-04 15:26:35,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 42 remaining) [2025-03-04 15:26:35,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 42 remaining) [2025-03-04 15:26:35,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 42 remaining) [2025-03-04 15:26:35,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 42 remaining) [2025-03-04 15:26:35,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 42 remaining) [2025-03-04 15:26:35,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 42 remaining) [2025-03-04 15:26:35,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 42 remaining) [2025-03-04 15:26:35,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 42 remaining) [2025-03-04 15:26:35,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 42 remaining) [2025-03-04 15:26:35,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 42 remaining) [2025-03-04 15:26:35,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 42 remaining) [2025-03-04 15:26:35,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 42 remaining) [2025-03-04 15:26:35,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 42 remaining) [2025-03-04 15:26:35,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 42 remaining) [2025-03-04 15:26:35,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 42 remaining) [2025-03-04 15:26:35,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 42 remaining) [2025-03-04 15:26:35,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 42 remaining) [2025-03-04 15:26:35,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 42 remaining) [2025-03-04 15:26:35,172 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 42 remaining) [2025-03-04 15:26:35,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 15:26:35,376 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,SelfDestructingSolverStorable9 [2025-03-04 15:26:35,376 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:35,380 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 15:26:35,380 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 15:26:35,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 03:26:35 BasicIcfg [2025-03-04 15:26:35,385 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 15:26:35,386 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:26:35,386 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:26:35,386 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:26:35,387 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:32" (3/4) ... [2025-03-04 15:26:35,389 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 15:26:35,391 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-04 15:26:35,391 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-04 15:26:35,395 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 50 nodes and edges [2025-03-04 15:26:35,395 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2025-03-04 15:26:35,395 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-04 15:26:35,396 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 15:26:35,452 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 15:26:35,452 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 15:26:35,452 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:26:35,453 INFO L158 Benchmark]: Toolchain (without parser) took 3436.44ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 106.7MB in the beginning and 232.7MB in the end (delta: -126.0MB). Peak memory consumption was 52.0MB. Max. memory is 16.1GB. [2025-03-04 15:26:35,453 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 129.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:26:35,453 INFO L158 Benchmark]: CACSL2BoogieTranslator took 172.79ms. Allocated memory is still 142.6MB. Free memory was 106.7MB in the beginning and 95.5MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:26:35,454 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.61ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 93.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:26:35,454 INFO L158 Benchmark]: Boogie Preprocessor took 22.26ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 92.3MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:26:35,454 INFO L158 Benchmark]: IcfgBuilder took 491.72ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 53.5MB in the end (delta: 38.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 15:26:35,454 INFO L158 Benchmark]: TraceAbstraction took 2653.22ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 53.5MB in the beginning and 238.1MB in the end (delta: -184.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:26:35,454 INFO L158 Benchmark]: Witness Printer took 66.50ms. Allocated memory is still 318.8MB. Free memory was 238.1MB in the beginning and 232.7MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:26:35,455 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 129.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 172.79ms. Allocated memory is still 142.6MB. Free memory was 106.7MB in the beginning and 95.5MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.61ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 93.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.26ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 92.3MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 491.72ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 53.5MB in the end (delta: 38.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2653.22ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 53.5MB in the beginning and 238.1MB in the end (delta: -184.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 66.50ms. Allocated memory is still 318.8MB. Free memory was 238.1MB in the beginning and 232.7MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: 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: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: 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 - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: 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, 79 locations, 42 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.6s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 458 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 375 mSDsluCounter, 62 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 48 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 432 IncrementalHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 14 mSDtfsCounter, 432 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=8, InterpolantAutomatonStates: 36, 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.7s InterpolantComputationTime, 103 NumberOfCodeBlocks, 103 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 113 ConstructedInterpolants, 0 QuantifiedInterpolants, 447 SizeOfPredicates, 4 NumberOfNonLiveVariables, 170 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 14 InterpolantComputations, 8 PerfectInterpolantSequences, 12/24 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 20 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 15:26:35,469 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