./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/parallel-misc-3-extended.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed 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-3-extended.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 8cea87724a542982ff884c708bfc22195aa1904db80300e5b965108c3d86cb2f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 06:40:03,794 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:40:03,840 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 06:40:03,845 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:40:03,845 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:40:03,868 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:40:03,869 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:40:03,869 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:40:03,869 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:40:03,869 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:40:03,869 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 06:40:03,870 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 06:40:03,870 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:40:03,870 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:40:03,870 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:40:03,870 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:40:03,871 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 06:40:03,871 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 06:40:03,871 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:40:03,871 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 06:40:03,871 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:40:03,871 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 06:40:03,871 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 06:40:03,871 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 06:40:03,871 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 06:40:03,871 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:40:03,872 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 06:40:03,872 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:40:03,872 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:40:03,872 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:40:03,872 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:40:03,872 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:40:03,872 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 06:40:03,873 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 06:40:03,873 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:40:03,873 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:40:03,873 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 06:40:03,873 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 06:40:03,873 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 06:40:03,873 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:40:03,873 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 06:40:03,873 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 06:40:03,873 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 06:40:03,873 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 06:40:03,873 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 06:40:03,873 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 -> 8cea87724a542982ff884c708bfc22195aa1904db80300e5b965108c3d86cb2f [2025-03-09 06:40:04,082 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:40:04,090 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:40:04,091 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:40:04,092 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:40:04,092 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:40:04,094 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-misc-3-extended.wvr.c [2025-03-09 06:40:05,258 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b16834ffe/087a168233f34f95b02f30f94cce122c/FLAG646620e11 [2025-03-09 06:40:05,485 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:40:05,486 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-3-extended.wvr.c [2025-03-09 06:40:05,494 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b16834ffe/087a168233f34f95b02f30f94cce122c/FLAG646620e11 [2025-03-09 06:40:05,804 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b16834ffe/087a168233f34f95b02f30f94cce122c [2025-03-09 06:40:05,807 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:40:05,809 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:40:05,810 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:40:05,811 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:40:05,815 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:40:05,815 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:40:05" (1/1) ... [2025-03-09 06:40:05,816 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53da7ba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:40:05, skipping insertion in model container [2025-03-09 06:40:05,817 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:40:05" (1/1) ... [2025-03-09 06:40:05,831 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:40:05,966 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:40:05,978 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:40:05,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:40:06,010 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:40:06,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:40:06 WrapperNode [2025-03-09 06:40:06,011 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:40:06,012 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:40:06,013 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:40:06,013 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:40:06,017 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:40:06" (1/1) ... [2025-03-09 06:40:06,022 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:40:06" (1/1) ... [2025-03-09 06:40:06,035 INFO L138 Inliner]: procedures = 19, calls = 11, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 54 [2025-03-09 06:40:06,036 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:40:06,037 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:40:06,037 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:40:06,037 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:40:06,043 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:40:06" (1/1) ... [2025-03-09 06:40:06,043 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:40:06" (1/1) ... [2025-03-09 06:40:06,044 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:40:06" (1/1) ... [2025-03-09 06:40:06,062 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-09 06:40:06,063 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:40:06" (1/1) ... [2025-03-09 06:40:06,063 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:40:06" (1/1) ... [2025-03-09 06:40:06,069 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:40:06" (1/1) ... [2025-03-09 06:40:06,070 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:40:06" (1/1) ... [2025-03-09 06:40:06,074 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:40:06" (1/1) ... [2025-03-09 06:40:06,075 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:40:06" (1/1) ... [2025-03-09 06:40:06,076 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:40:06,077 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:40:06,077 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:40:06,077 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:40:06,081 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:40:06" (1/1) ... [2025-03-09 06:40:06,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:40:06,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:40:06,108 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-09 06:40:06,111 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-09 06:40:06,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 06:40:06,130 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 06:40:06,130 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 06:40:06,130 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 06:40:06,130 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 06:40:06,130 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-09 06:40:06,130 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-09 06:40:06,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 06:40:06,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:40:06,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:40:06,132 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 06:40:06,198 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:40:06,200 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:40:06,370 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 06:40:06,370 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:40:06,493 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:40:06,494 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 06:40:06,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:40:06 BoogieIcfgContainer [2025-03-09 06:40:06,494 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:40:06,496 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 06:40:06,498 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 06:40:06,501 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 06:40:06,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 06:40:05" (1/3) ... [2025-03-09 06:40:06,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70a38d31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:40:06, skipping insertion in model container [2025-03-09 06:40:06,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:40:06" (2/3) ... [2025-03-09 06:40:06,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70a38d31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:40:06, skipping insertion in model container [2025-03-09 06:40:06,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:40:06" (3/3) ... [2025-03-09 06:40:06,504 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-3-extended.wvr.c [2025-03-09 06:40:06,514 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 06:40:06,515 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-3-extended.wvr.c that has 4 procedures, 47 locations, 1 initial locations, 3 loop locations, and 12 error locations. [2025-03-09 06:40:06,515 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 06:40:06,577 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-09 06:40:06,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 52 transitions, 125 flow [2025-03-09 06:40:06,624 INFO L124 PetriNetUnfolderBase]: 6/49 cut-off events. [2025-03-09 06:40:06,627 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-09 06:40:06,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 49 events. 6/49 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 154 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2025-03-09 06:40:06,630 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 52 transitions, 125 flow [2025-03-09 06:40:06,633 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 47 transitions, 109 flow [2025-03-09 06:40:06,643 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:40:06,652 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;@44c4445a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:40:06,652 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2025-03-09 06:40:06,658 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 06:40:06,658 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-03-09 06:40:06,658 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:40:06,659 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:40:06,659 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 06:40:06,660 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2025-03-09 06:40:06,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:40:06,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1203852741, now seen corresponding path program 1 times [2025-03-09 06:40:06,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:40:06,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541797641] [2025-03-09 06:40:06,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:40:06,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:40:06,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:40:06,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:40:06,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:40:06,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:40:06,811 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-09 06:40:06,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:40:06,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541797641] [2025-03-09 06:40:06,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541797641] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:40:06,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:40:06,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 06:40:06,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923960373] [2025-03-09 06:40:06,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:40:06,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:40:06,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:40:06,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:40:06,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:40:06,855 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 52 [2025-03-09 06:40:06,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 47 transitions, 109 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:40:06,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:40:06,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 52 [2025-03-09 06:40:06,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:40:07,633 INFO L124 PetriNetUnfolderBase]: 6500/8815 cut-off events. [2025-03-09 06:40:07,634 INFO L125 PetriNetUnfolderBase]: For 295/295 co-relation queries the response was YES. [2025-03-09 06:40:07,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16971 conditions, 8815 events. 6500/8815 cut-off events. For 295/295 co-relation queries the response was YES. Maximal size of possible extension queue 801. Compared 47839 event pairs, 1294 based on Foata normal form. 0/4758 useless extension candidates. Maximal degree in co-relation 16153. Up to 7835 conditions per place. [2025-03-09 06:40:07,721 INFO L140 encePairwiseOnDemand]: 33/52 looper letters, 42 selfloop transitions, 7 changer transitions 0/63 dead transitions. [2025-03-09 06:40:07,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 63 transitions, 251 flow [2025-03-09 06:40:07,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:40:07,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:40:07,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2025-03-09 06:40:07,738 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.717948717948718 [2025-03-09 06:40:07,739 INFO L175 Difference]: Start difference. First operand has 51 places, 47 transitions, 109 flow. Second operand 3 states and 112 transitions. [2025-03-09 06:40:07,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 63 transitions, 251 flow [2025-03-09 06:40:07,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 63 transitions, 235 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-09 06:40:07,749 INFO L231 Difference]: Finished difference. Result has 49 places, 53 transitions, 169 flow [2025-03-09 06:40:07,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=169, PETRI_PLACES=49, PETRI_TRANSITIONS=53} [2025-03-09 06:40:07,753 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -2 predicate places. [2025-03-09 06:40:07,754 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 53 transitions, 169 flow [2025-03-09 06:40:07,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:40:07,754 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:40:07,754 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:40:07,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 06:40:07,754 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2025-03-09 06:40:07,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:40:07,755 INFO L85 PathProgramCache]: Analyzing trace with hash -612524513, now seen corresponding path program 1 times [2025-03-09 06:40:07,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:40:07,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348440836] [2025-03-09 06:40:07,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:40:07,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:40:07,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 06:40:07,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 06:40:07,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:40:07,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:40:07,881 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:40:07,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:40:07,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348440836] [2025-03-09 06:40:07,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348440836] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:40:07,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235932099] [2025-03-09 06:40:07,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:40:07,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:40:07,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:40:07,883 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-09 06:40:07,885 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-09 06:40:07,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 06:40:07,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 06:40:07,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:40:07,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:40:07,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:40:07,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:40:07,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:40:07,979 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:40:07,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235932099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:40:07,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:40:07,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2025-03-09 06:40:07,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392149741] [2025-03-09 06:40:07,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:40:07,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:40:07,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:40:07,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:40:07,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:40:07,983 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 52 [2025-03-09 06:40:07,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 53 transitions, 169 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-09 06:40:07,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:40:07,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 52 [2025-03-09 06:40:07,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:40:08,360 INFO L124 PetriNetUnfolderBase]: 4081/5611 cut-off events. [2025-03-09 06:40:08,361 INFO L125 PetriNetUnfolderBase]: For 947/947 co-relation queries the response was YES. [2025-03-09 06:40:08,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14276 conditions, 5611 events. 4081/5611 cut-off events. For 947/947 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 29522 event pairs, 1597 based on Foata normal form. 0/3278 useless extension candidates. Maximal degree in co-relation 4427. Up to 5046 conditions per place. [2025-03-09 06:40:08,410 INFO L140 encePairwiseOnDemand]: 48/52 looper letters, 35 selfloop transitions, 1 changer transitions 0/50 dead transitions. [2025-03-09 06:40:08,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 50 transitions, 229 flow [2025-03-09 06:40:08,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:40:08,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:40:08,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2025-03-09 06:40:08,413 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5384615384615384 [2025-03-09 06:40:08,413 INFO L175 Difference]: Start difference. First operand has 49 places, 53 transitions, 169 flow. Second operand 3 states and 84 transitions. [2025-03-09 06:40:08,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 50 transitions, 229 flow [2025-03-09 06:40:08,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 50 transitions, 222 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:40:08,415 INFO L231 Difference]: Finished difference. Result has 47 places, 50 transitions, 152 flow [2025-03-09 06:40:08,415 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=47, PETRI_TRANSITIONS=50} [2025-03-09 06:40:08,417 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -4 predicate places. [2025-03-09 06:40:08,417 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 50 transitions, 152 flow [2025-03-09 06:40:08,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-09 06:40:08,417 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:40:08,418 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:40:08,424 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-09 06:40:08,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:40:08,619 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2025-03-09 06:40:08,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:40:08,619 INFO L85 PathProgramCache]: Analyzing trace with hash -612524512, now seen corresponding path program 1 times [2025-03-09 06:40:08,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:40:08,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406707192] [2025-03-09 06:40:08,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:40:08,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:40:08,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 06:40:08,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 06:40:08,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:40:08,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:40:08,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:40:08,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:40:08,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406707192] [2025-03-09 06:40:08,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406707192] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:40:08,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806554293] [2025-03-09 06:40:08,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:40:08,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:40:08,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:40:08,697 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-09 06:40:08,698 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-09 06:40:08,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 06:40:08,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 06:40:08,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:40:08,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:40:08,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:40:08,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:40:08,761 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:40:08,761 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:40:08,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:40:08,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806554293] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:40:08,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:40:08,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2025-03-09 06:40:08,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534812384] [2025-03-09 06:40:08,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:40:08,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 06:40:08,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:40:08,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 06:40:08,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 06:40:08,794 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 52 [2025-03-09 06:40:08,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 50 transitions, 152 flow. Second operand has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 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-09 06:40:08,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:40:08,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 52 [2025-03-09 06:40:08,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:40:09,628 INFO L124 PetriNetUnfolderBase]: 10503/15266 cut-off events. [2025-03-09 06:40:09,629 INFO L125 PetriNetUnfolderBase]: For 2852/2852 co-relation queries the response was YES. [2025-03-09 06:40:09,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36621 conditions, 15266 events. 10503/15266 cut-off events. For 2852/2852 co-relation queries the response was YES. Maximal size of possible extension queue 720. Compared 90908 event pairs, 531 based on Foata normal form. 0/10871 useless extension candidates. Maximal degree in co-relation 36613. Up to 7945 conditions per place. [2025-03-09 06:40:09,770 INFO L140 encePairwiseOnDemand]: 36/52 looper letters, 99 selfloop transitions, 37 changer transitions 0/150 dead transitions. [2025-03-09 06:40:09,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 150 transitions, 725 flow [2025-03-09 06:40:09,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 06:40:09,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 06:40:09,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 277 transitions. [2025-03-09 06:40:09,774 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.760989010989011 [2025-03-09 06:40:09,774 INFO L175 Difference]: Start difference. First operand has 47 places, 50 transitions, 152 flow. Second operand 7 states and 277 transitions. [2025-03-09 06:40:09,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 150 transitions, 725 flow [2025-03-09 06:40:09,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 150 transitions, 724 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:40:09,776 INFO L231 Difference]: Finished difference. Result has 56 places, 80 transitions, 471 flow [2025-03-09 06:40:09,776 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=471, PETRI_PLACES=56, PETRI_TRANSITIONS=80} [2025-03-09 06:40:09,778 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 5 predicate places. [2025-03-09 06:40:09,778 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 80 transitions, 471 flow [2025-03-09 06:40:09,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 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-09 06:40:09,779 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:40:09,779 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:40:09,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 06:40:09,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-09 06:40:09,980 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2025-03-09 06:40:09,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:40:09,980 INFO L85 PathProgramCache]: Analyzing trace with hash -2030228349, now seen corresponding path program 1 times [2025-03-09 06:40:09,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:40:09,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572935669] [2025-03-09 06:40:09,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:40:09,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:40:09,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:40:09,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:40:09,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:40:09,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:40:10,031 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-09 06:40:10,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:40:10,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572935669] [2025-03-09 06:40:10,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572935669] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:40:10,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:40:10,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:40:10,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726158626] [2025-03-09 06:40:10,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:40:10,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:40:10,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:40:10,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:40:10,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:40:10,033 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 52 [2025-03-09 06:40:10,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 80 transitions, 471 flow. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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-09 06:40:10,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:40:10,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 52 [2025-03-09 06:40:10,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:40:11,461 INFO L124 PetriNetUnfolderBase]: 15658/23344 cut-off events. [2025-03-09 06:40:11,462 INFO L125 PetriNetUnfolderBase]: For 62283/62283 co-relation queries the response was YES. [2025-03-09 06:40:11,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79982 conditions, 23344 events. 15658/23344 cut-off events. For 62283/62283 co-relation queries the response was YES. Maximal size of possible extension queue 1019. Compared 150373 event pairs, 1078 based on Foata normal form. 1149/22826 useless extension candidates. Maximal degree in co-relation 79969. Up to 12242 conditions per place. [2025-03-09 06:40:11,607 INFO L140 encePairwiseOnDemand]: 36/52 looper letters, 97 selfloop transitions, 22 changer transitions 0/133 dead transitions. [2025-03-09 06:40:11,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 133 transitions, 1014 flow [2025-03-09 06:40:11,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:40:11,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:40:11,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2025-03-09 06:40:11,609 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6826923076923077 [2025-03-09 06:40:11,609 INFO L175 Difference]: Start difference. First operand has 56 places, 80 transitions, 471 flow. Second operand 4 states and 142 transitions. [2025-03-09 06:40:11,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 133 transitions, 1014 flow [2025-03-09 06:40:11,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 133 transitions, 977 flow, removed 15 selfloop flow, removed 1 redundant places. [2025-03-09 06:40:11,666 INFO L231 Difference]: Finished difference. Result has 60 places, 95 transitions, 721 flow [2025-03-09 06:40:11,666 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=721, PETRI_PLACES=60, PETRI_TRANSITIONS=95} [2025-03-09 06:40:11,667 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 9 predicate places. [2025-03-09 06:40:11,667 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 95 transitions, 721 flow [2025-03-09 06:40:11,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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-09 06:40:11,668 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:40:11,668 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:40:11,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 06:40:11,668 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2025-03-09 06:40:11,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:40:11,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1454362783, now seen corresponding path program 1 times [2025-03-09 06:40:11,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:40:11,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127760334] [2025-03-09 06:40:11,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:40:11,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:40:11,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 06:40:11,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 06:40:11,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:40:11,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:40:11,747 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-09 06:40:11,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:40:11,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127760334] [2025-03-09 06:40:11,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127760334] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:40:11,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528960180] [2025-03-09 06:40:11,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:40:11,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:40:11,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:40:11,752 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:40:11,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 06:40:11,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 06:40:11,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 06:40:11,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:40:11,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:40:11,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:40:11,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:40:11,818 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-09 06:40:11,818 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:40:11,858 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-09 06:40:11,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528960180] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:40:11,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:40:11,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-03-09 06:40:11,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155163364] [2025-03-09 06:40:11,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:40:11,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 06:40:11,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:40:11,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 06:40:11,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-09 06:40:11,861 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 52 [2025-03-09 06:40:11,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 95 transitions, 721 flow. Second operand has 9 states, 9 states have (on average 19.333333333333332) internal successors, (174), 9 states have internal predecessors, (174), 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-09 06:40:11,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:40:11,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 52 [2025-03-09 06:40:11,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:40:16,582 INFO L124 PetriNetUnfolderBase]: 54296/82338 cut-off events. [2025-03-09 06:40:16,582 INFO L125 PetriNetUnfolderBase]: For 416451/416451 co-relation queries the response was YES. [2025-03-09 06:40:16,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310885 conditions, 82338 events. 54296/82338 cut-off events. For 416451/416451 co-relation queries the response was YES. Maximal size of possible extension queue 1624. Compared 599403 event pairs, 2559 based on Foata normal form. 6541/83410 useless extension candidates. Maximal degree in co-relation 310869. Up to 35551 conditions per place. [2025-03-09 06:40:17,261 INFO L140 encePairwiseOnDemand]: 36/52 looper letters, 210 selfloop transitions, 158 changer transitions 0/382 dead transitions. [2025-03-09 06:40:17,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 382 transitions, 3566 flow [2025-03-09 06:40:17,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 06:40:17,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 06:40:17,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 367 transitions. [2025-03-09 06:40:17,263 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7841880341880342 [2025-03-09 06:40:17,263 INFO L175 Difference]: Start difference. First operand has 60 places, 95 transitions, 721 flow. Second operand 9 states and 367 transitions. [2025-03-09 06:40:17,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 382 transitions, 3566 flow [2025-03-09 06:40:17,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 382 transitions, 3559 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:40:17,570 INFO L231 Difference]: Finished difference. Result has 73 places, 255 transitions, 3175 flow [2025-03-09 06:40:17,570 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=714, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3175, PETRI_PLACES=73, PETRI_TRANSITIONS=255} [2025-03-09 06:40:17,571 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 22 predicate places. [2025-03-09 06:40:17,571 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 255 transitions, 3175 flow [2025-03-09 06:40:17,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.333333333333332) internal successors, (174), 9 states have internal predecessors, (174), 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-09 06:40:17,571 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:40:17,571 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:40:17,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 06:40:17,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:40:17,772 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2025-03-09 06:40:17,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:40:17,772 INFO L85 PathProgramCache]: Analyzing trace with hash -2121808454, now seen corresponding path program 1 times [2025-03-09 06:40:17,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:40:17,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166133571] [2025-03-09 06:40:17,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:40:17,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:40:17,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 06:40:17,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 06:40:17,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:40:17,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:40:17,836 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-09 06:40:17,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:40:17,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166133571] [2025-03-09 06:40:17,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166133571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:40:17,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:40:17,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:40:17,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516304195] [2025-03-09 06:40:17,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:40:17,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 06:40:17,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:40:17,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:40:17,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:40:17,837 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 52 [2025-03-09 06:40:17,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 255 transitions, 3175 flow. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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-09 06:40:17,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:40:17,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 52 [2025-03-09 06:40:17,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:40:25,395 INFO L124 PetriNetUnfolderBase]: 64387/97229 cut-off events. [2025-03-09 06:40:25,395 INFO L125 PetriNetUnfolderBase]: For 845123/845123 co-relation queries the response was YES. [2025-03-09 06:40:25,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 442877 conditions, 97229 events. 64387/97229 cut-off events. For 845123/845123 co-relation queries the response was YES. Maximal size of possible extension queue 1946. Compared 720561 event pairs, 3389 based on Foata normal form. 834/92129 useless extension candidates. Maximal degree in co-relation 442854. Up to 55772 conditions per place. [2025-03-09 06:40:26,151 INFO L140 encePairwiseOnDemand]: 40/52 looper letters, 236 selfloop transitions, 129 changer transitions 0/379 dead transitions. [2025-03-09 06:40:26,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 379 transitions, 5125 flow [2025-03-09 06:40:26,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:40:26,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 06:40:26,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 177 transitions. [2025-03-09 06:40:26,153 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6807692307692308 [2025-03-09 06:40:26,153 INFO L175 Difference]: Start difference. First operand has 73 places, 255 transitions, 3175 flow. Second operand 5 states and 177 transitions. [2025-03-09 06:40:26,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 379 transitions, 5125 flow [2025-03-09 06:40:27,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 379 transitions, 5028 flow, removed 45 selfloop flow, removed 1 redundant places. [2025-03-09 06:40:27,822 INFO L231 Difference]: Finished difference. Result has 79 places, 319 transitions, 4541 flow [2025-03-09 06:40:27,822 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=3114, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4541, PETRI_PLACES=79, PETRI_TRANSITIONS=319} [2025-03-09 06:40:27,823 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 28 predicate places. [2025-03-09 06:40:27,823 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 319 transitions, 4541 flow [2025-03-09 06:40:27,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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-09 06:40:27,823 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:40:27,823 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:40:27,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 06:40:27,823 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2025-03-09 06:40:27,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:40:27,824 INFO L85 PathProgramCache]: Analyzing trace with hash -799402572, now seen corresponding path program 1 times [2025-03-09 06:40:27,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:40:27,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994206102] [2025-03-09 06:40:27,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:40:27,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:40:27,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:40:27,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:40:27,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:40:27,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:40:27,847 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 06:40:27,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:40:27,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994206102] [2025-03-09 06:40:27,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994206102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:40:27,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:40:27,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:40:27,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939065459] [2025-03-09 06:40:27,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:40:27,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:40:27,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:40:27,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:40:27,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:40:27,849 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 52 [2025-03-09 06:40:27,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 319 transitions, 4541 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-09 06:40:27,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:40:27,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 52 [2025-03-09 06:40:27,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:40:34,751 INFO L124 PetriNetUnfolderBase]: 51562/80298 cut-off events. [2025-03-09 06:40:34,752 INFO L125 PetriNetUnfolderBase]: For 829335/829390 co-relation queries the response was YES. [2025-03-09 06:40:35,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 360358 conditions, 80298 events. 51562/80298 cut-off events. For 829335/829390 co-relation queries the response was YES. Maximal size of possible extension queue 1744. Compared 628099 event pairs, 16737 based on Foata normal form. 3174/77298 useless extension candidates. Maximal degree in co-relation 360331. Up to 65041 conditions per place. [2025-03-09 06:40:35,515 INFO L140 encePairwiseOnDemand]: 48/52 looper letters, 277 selfloop transitions, 1 changer transitions 0/292 dead transitions. [2025-03-09 06:40:35,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 292 transitions, 4584 flow [2025-03-09 06:40:35,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:40:35,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:40:35,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2025-03-09 06:40:35,516 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5192307692307693 [2025-03-09 06:40:35,517 INFO L175 Difference]: Start difference. First operand has 79 places, 319 transitions, 4541 flow. Second operand 3 states and 81 transitions. [2025-03-09 06:40:35,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 292 transitions, 4584 flow [2025-03-09 06:40:37,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 292 transitions, 4487 flow, removed 45 selfloop flow, removed 1 redundant places. [2025-03-09 06:40:37,622 INFO L231 Difference]: Finished difference. Result has 77 places, 292 transitions, 3933 flow [2025-03-09 06:40:37,622 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=3931, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3933, PETRI_PLACES=77, PETRI_TRANSITIONS=292} [2025-03-09 06:40:37,623 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 26 predicate places. [2025-03-09 06:40:37,623 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 292 transitions, 3933 flow [2025-03-09 06:40:37,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-09 06:40:37,623 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:40:37,623 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:40:37,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 06:40:37,623 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2025-03-09 06:40:37,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:40:37,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1548094662, now seen corresponding path program 1 times [2025-03-09 06:40:37,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:40:37,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426903054] [2025-03-09 06:40:37,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:40:37,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:40:37,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 06:40:37,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 06:40:37,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:40:37,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:40:37,677 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-09 06:40:37,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:40:37,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426903054] [2025-03-09 06:40:37,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426903054] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:40:37,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102513287] [2025-03-09 06:40:37,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:40:37,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:40:37,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:40:37,680 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:40:37,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 06:40:37,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 06:40:37,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 06:40:37,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:40:37,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:40:37,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:40:37,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:40:37,737 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-09 06:40:37,737 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:40:37,777 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-09 06:40:37,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102513287] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:40:37,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:40:37,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-03-09 06:40:37,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595033508] [2025-03-09 06:40:37,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:40:37,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 06:40:37,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:40:37,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 06:40:37,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-09 06:40:37,779 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 52 [2025-03-09 06:40:37,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 292 transitions, 3933 flow. Second operand has 9 states, 9 states have (on average 19.333333333333332) internal successors, (174), 9 states have internal predecessors, (174), 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-09 06:40:37,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:40:37,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 52 [2025-03-09 06:40:37,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand