./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/13-privatized_69-refine-protected-loop-interval_true.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/13-privatized_69-refine-protected-loop-interval_true.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4a65477eb93c2031bed3e6d454d38e75e9833f23496d456d5084dd6ae5f38687 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:20:45,028 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:20:45,078 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:20:45,083 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:20:45,085 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:20:45,108 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:20:45,108 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:20:45,109 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:20:45,109 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:20:45,109 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:20:45,109 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:20:45,109 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:20:45,110 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:20:45,110 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:20:45,111 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:20:45,111 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:20:45,111 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:20:45,111 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:20:45,111 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:20:45,111 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:20:45,111 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:20:45,111 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:20:45,111 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:20:45,111 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:20:45,111 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:20:45,111 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:20:45,112 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:20:45,112 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:20:45,112 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:20:45,112 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:20:45,112 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:20:45,112 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:20:45,112 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:20:45,113 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:20:45,113 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:20:45,113 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:20:45,113 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:20:45,113 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:20:45,113 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:20:45,113 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:20:45,113 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:20:45,113 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:20:45,113 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:20:45,113 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:20:45,113 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:20:45,113 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 -> 4a65477eb93c2031bed3e6d454d38e75e9833f23496d456d5084dd6ae5f38687 [2025-03-04 15:20:45,305 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:20:45,310 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:20:45,312 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:20:45,312 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:20:45,313 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:20:45,313 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/13-privatized_69-refine-protected-loop-interval_true.i [2025-03-04 15:20:46,411 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6746f5a76/e8676bb6d56a4479aafd9ee8949050fd/FLAGcb964a9c9 [2025-03-04 15:20:46,668 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:20:46,668 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_69-refine-protected-loop-interval_true.i [2025-03-04 15:20:46,677 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6746f5a76/e8676bb6d56a4479aafd9ee8949050fd/FLAGcb964a9c9 [2025-03-04 15:20:46,964 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6746f5a76/e8676bb6d56a4479aafd9ee8949050fd [2025-03-04 15:20:46,966 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:20:46,967 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:20:46,968 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:20:46,968 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:20:46,971 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:20:46,971 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:20:46" (1/1) ... [2025-03-04 15:20:46,972 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20a751b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:46, skipping insertion in model container [2025-03-04 15:20:46,972 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:20:46" (1/1) ... [2025-03-04 15:20:46,995 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:20:47,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:20:47,220 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:20:47,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:20:47,271 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:20:47,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:47 WrapperNode [2025-03-04 15:20:47,273 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:20:47,274 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:20:47,274 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:20:47,274 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:20:47,278 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:20:47" (1/1) ... [2025-03-04 15:20:47,286 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:20:47" (1/1) ... [2025-03-04 15:20:47,298 INFO L138 Inliner]: procedures = 165, calls = 24, calls flagged for inlining = 8, calls inlined = 9, statements flattened = 100 [2025-03-04 15:20:47,299 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:20:47,299 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:20:47,299 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:20:47,299 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:20:47,305 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:47" (1/1) ... [2025-03-04 15:20:47,305 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:47" (1/1) ... [2025-03-04 15:20:47,308 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:47" (1/1) ... [2025-03-04 15:20:47,317 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5]. The 0 writes are split as follows [0, 0]. [2025-03-04 15:20:47,317 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:47" (1/1) ... [2025-03-04 15:20:47,318 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:47" (1/1) ... [2025-03-04 15:20:47,320 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:47" (1/1) ... [2025-03-04 15:20:47,321 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:47" (1/1) ... [2025-03-04 15:20:47,322 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:47" (1/1) ... [2025-03-04 15:20:47,322 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:47" (1/1) ... [2025-03-04 15:20:47,323 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:20:47,324 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:20:47,324 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:20:47,324 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:20:47,326 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:47" (1/1) ... [2025-03-04 15:20:47,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:20:47,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:20:47,348 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:20:47,349 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:20:47,363 INFO L130 BoogieDeclarations]: Found specification of procedure worker [2025-03-04 15:20:47,363 INFO L138 BoogieDeclarations]: Found implementation of procedure worker [2025-03-04 15:20:47,363 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 15:20:47,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:20:47,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:20:47,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:20:47,363 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 15:20:47,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:20:47,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:20:47,364 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:20:47,442 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:20:47,444 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:20:47,584 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:20:47,585 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:20:47,682 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:20:47,682 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:20:47,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:20:47 BoogieIcfgContainer [2025-03-04 15:20:47,683 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:20:47,685 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:20:47,685 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:20:47,688 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:20:47,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:20:46" (1/3) ... [2025-03-04 15:20:47,689 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3739c42d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:20:47, skipping insertion in model container [2025-03-04 15:20:47,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:20:47" (2/3) ... [2025-03-04 15:20:47,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3739c42d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:20:47, skipping insertion in model container [2025-03-04 15:20:47,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:20:47" (3/3) ... [2025-03-04 15:20:47,691 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_69-refine-protected-loop-interval_true.i [2025-03-04 15:20:47,701 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:20:47,702 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_69-refine-protected-loop-interval_true.i that has 2 procedures, 34 locations, 1 initial locations, 3 loop locations, and 6 error locations. [2025-03-04 15:20:47,702 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:20:47,744 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 15:20:47,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 38 transitions, 80 flow [2025-03-04 15:20:47,790 INFO L124 PetriNetUnfolderBase]: 5/37 cut-off events. [2025-03-04 15:20:47,792 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:20:47,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 37 events. 5/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 80 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 35. Up to 2 conditions per place. [2025-03-04 15:20:47,798 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 38 transitions, 80 flow [2025-03-04 15:20:47,800 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 37 transitions, 77 flow [2025-03-04 15:20:47,811 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:20:47,824 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;@570a77e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:20:47,824 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-04 15:20:47,830 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:20:47,830 INFO L124 PetriNetUnfolderBase]: 2/19 cut-off events. [2025-03-04 15:20:47,830 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:20:47,830 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:47,831 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:47,831 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:20:47,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:47,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1589185789, now seen corresponding path program 1 times [2025-03-04 15:20:47,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:47,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837809161] [2025-03-04 15:20:47,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:47,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:47,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:20:47,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:20:47,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:47,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:48,051 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:20:48,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:48,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837809161] [2025-03-04 15:20:48,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837809161] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:48,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:48,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:20:48,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751439277] [2025-03-04 15:20:48,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:48,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:20:48,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:48,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:20:48,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:20:48,089 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 38 [2025-03-04 15:20:48,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 37 transitions, 77 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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:20:48,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:48,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 38 [2025-03-04 15:20:48,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:48,251 INFO L124 PetriNetUnfolderBase]: 184/403 cut-off events. [2025-03-04 15:20:48,252 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:20:48,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 738 conditions, 403 events. 184/403 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1800 event pairs, 14 based on Foata normal form. 4/335 useless extension candidates. Maximal degree in co-relation 729. Up to 222 conditions per place. [2025-03-04 15:20:48,255 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 44 selfloop transitions, 8 changer transitions 1/66 dead transitions. [2025-03-04 15:20:48,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 66 transitions, 241 flow [2025-03-04 15:20:48,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:20:48,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:20:48,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 132 transitions. [2025-03-04 15:20:48,263 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6947368421052632 [2025-03-04 15:20:48,264 INFO L175 Difference]: Start difference. First operand has 36 places, 37 transitions, 77 flow. Second operand 5 states and 132 transitions. [2025-03-04 15:20:48,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 66 transitions, 241 flow [2025-03-04 15:20:48,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 66 transitions, 240 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:20:48,271 INFO L231 Difference]: Finished difference. Result has 42 places, 43 transitions, 142 flow [2025-03-04 15:20:48,272 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=142, PETRI_PLACES=42, PETRI_TRANSITIONS=43} [2025-03-04 15:20:48,276 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2025-03-04 15:20:48,277 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 43 transitions, 142 flow [2025-03-04 15:20:48,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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:20:48,277 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:48,277 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:48,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:20:48,277 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:20:48,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:48,278 INFO L85 PathProgramCache]: Analyzing trace with hash 296172038, now seen corresponding path program 1 times [2025-03-04 15:20:48,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:48,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183975567] [2025-03-04 15:20:48,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:48,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:48,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:20:48,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:20:48,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:48,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:48,355 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:20:48,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:48,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183975567] [2025-03-04 15:20:48,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183975567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:48,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:48,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:20:48,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578842070] [2025-03-04 15:20:48,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:48,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:20:48,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:48,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:20:48,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:20:48,363 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 38 [2025-03-04 15:20:48,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 43 transitions, 142 flow. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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:20:48,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:48,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 38 [2025-03-04 15:20:48,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:48,492 INFO L124 PetriNetUnfolderBase]: 212/481 cut-off events. [2025-03-04 15:20:48,493 INFO L125 PetriNetUnfolderBase]: For 248/250 co-relation queries the response was YES. [2025-03-04 15:20:48,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1148 conditions, 481 events. 212/481 cut-off events. For 248/250 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2225 event pairs, 43 based on Foata normal form. 11/463 useless extension candidates. Maximal degree in co-relation 1134. Up to 285 conditions per place. [2025-03-04 15:20:48,498 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 53 selfloop transitions, 4 changer transitions 1/72 dead transitions. [2025-03-04 15:20:48,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 72 transitions, 356 flow [2025-03-04 15:20:48,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:20:48,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:20:48,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2025-03-04 15:20:48,500 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7236842105263158 [2025-03-04 15:20:48,500 INFO L175 Difference]: Start difference. First operand has 42 places, 43 transitions, 142 flow. Second operand 4 states and 110 transitions. [2025-03-04 15:20:48,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 72 transitions, 356 flow [2025-03-04 15:20:48,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 72 transitions, 356 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:20:48,503 INFO L231 Difference]: Finished difference. Result has 47 places, 46 transitions, 182 flow [2025-03-04 15:20:48,503 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=182, PETRI_PLACES=47, PETRI_TRANSITIONS=46} [2025-03-04 15:20:48,505 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 11 predicate places. [2025-03-04 15:20:48,506 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 46 transitions, 182 flow [2025-03-04 15:20:48,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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:20:48,506 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:48,506 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:48,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:20:48,507 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting workerErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:20:48,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:48,509 INFO L85 PathProgramCache]: Analyzing trace with hash 750107572, now seen corresponding path program 1 times [2025-03-04 15:20:48,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:48,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541127614] [2025-03-04 15:20:48,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:48,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:48,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:20:48,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:20:48,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:48,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:48,605 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:20:48,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:48,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541127614] [2025-03-04 15:20:48,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541127614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:48,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:48,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:20:48,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27763768] [2025-03-04 15:20:48,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:48,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:20:48,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:48,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:20:48,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:20:48,608 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 38 [2025-03-04 15:20:48,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 46 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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:20:48,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:48,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 38 [2025-03-04 15:20:48,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:48,680 INFO L124 PetriNetUnfolderBase]: 96/281 cut-off events. [2025-03-04 15:20:48,680 INFO L125 PetriNetUnfolderBase]: For 211/219 co-relation queries the response was YES. [2025-03-04 15:20:48,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 679 conditions, 281 events. 96/281 cut-off events. For 211/219 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1204 event pairs, 27 based on Foata normal form. 11/283 useless extension candidates. Maximal degree in co-relation 662. Up to 110 conditions per place. [2025-03-04 15:20:48,683 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 28 selfloop transitions, 5 changer transitions 3/52 dead transitions. [2025-03-04 15:20:48,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 52 transitions, 272 flow [2025-03-04 15:20:48,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:20:48,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:20:48,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2025-03-04 15:20:48,685 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7017543859649122 [2025-03-04 15:20:48,685 INFO L175 Difference]: Start difference. First operand has 47 places, 46 transitions, 182 flow. Second operand 3 states and 80 transitions. [2025-03-04 15:20:48,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 52 transitions, 272 flow [2025-03-04 15:20:48,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 52 transitions, 263 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:20:48,688 INFO L231 Difference]: Finished difference. Result has 47 places, 41 transitions, 150 flow [2025-03-04 15:20:48,689 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=47, PETRI_TRANSITIONS=41} [2025-03-04 15:20:48,689 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 11 predicate places. [2025-03-04 15:20:48,690 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 41 transitions, 150 flow [2025-03-04 15:20:48,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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:20:48,690 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:48,690 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:48,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:20:48,690 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting workerErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:20:48,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:48,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1735218834, now seen corresponding path program 1 times [2025-03-04 15:20:48,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:48,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268808469] [2025-03-04 15:20:48,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:48,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:48,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:20:48,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:20:48,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:48,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:48,751 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:20:48,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:48,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268808469] [2025-03-04 15:20:48,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268808469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:48,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:48,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:20:48,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62920185] [2025-03-04 15:20:48,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:48,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:20:48,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:48,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:20:48,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:20:48,763 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 38 [2025-03-04 15:20:48,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 41 transitions, 150 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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:20:48,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:48,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 38 [2025-03-04 15:20:48,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:48,882 INFO L124 PetriNetUnfolderBase]: 131/354 cut-off events. [2025-03-04 15:20:48,882 INFO L125 PetriNetUnfolderBase]: For 232/245 co-relation queries the response was YES. [2025-03-04 15:20:48,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 898 conditions, 354 events. 131/354 cut-off events. For 232/245 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1454 event pairs, 46 based on Foata normal form. 12/350 useless extension candidates. Maximal degree in co-relation 881. Up to 153 conditions per place. [2025-03-04 15:20:48,884 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 42 selfloop transitions, 5 changer transitions 0/58 dead transitions. [2025-03-04 15:20:48,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 58 transitions, 326 flow [2025-03-04 15:20:48,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:20:48,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:20:48,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2025-03-04 15:20:48,885 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6118421052631579 [2025-03-04 15:20:48,885 INFO L175 Difference]: Start difference. First operand has 47 places, 41 transitions, 150 flow. Second operand 4 states and 93 transitions. [2025-03-04 15:20:48,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 58 transitions, 326 flow [2025-03-04 15:20:48,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 58 transitions, 319 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:20:48,887 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 176 flow [2025-03-04 15:20:48,887 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2025-03-04 15:20:48,888 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 12 predicate places. [2025-03-04 15:20:48,888 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 176 flow [2025-03-04 15:20:48,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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:20:48,888 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:48,888 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:48,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:20:48,888 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting workerErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:20:48,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:48,889 INFO L85 PathProgramCache]: Analyzing trace with hash -2042790742, now seen corresponding path program 1 times [2025-03-04 15:20:48,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:48,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146685224] [2025-03-04 15:20:48,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:48,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:48,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:20:48,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:20:48,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:48,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:48,957 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:20:48,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:48,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146685224] [2025-03-04 15:20:48,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146685224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:48,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:48,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:20:48,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851035669] [2025-03-04 15:20:48,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:48,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:20:48,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:48,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:20:48,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:20:48,973 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 38 [2025-03-04 15:20:48,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 176 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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:20:48,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:48,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 38 [2025-03-04 15:20:48,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:49,108 INFO L124 PetriNetUnfolderBase]: 176/442 cut-off events. [2025-03-04 15:20:49,109 INFO L125 PetriNetUnfolderBase]: For 493/505 co-relation queries the response was YES. [2025-03-04 15:20:49,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1188 conditions, 442 events. 176/442 cut-off events. For 493/505 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1714 event pairs, 36 based on Foata normal form. 9/451 useless extension candidates. Maximal degree in co-relation 1169. Up to 217 conditions per place. [2025-03-04 15:20:49,112 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 49 selfloop transitions, 11 changer transitions 7/76 dead transitions. [2025-03-04 15:20:49,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 76 transitions, 457 flow [2025-03-04 15:20:49,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 15:20:49,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 15:20:49,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2025-03-04 15:20:49,115 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.506578947368421 [2025-03-04 15:20:49,115 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 176 flow. Second operand 8 states and 154 transitions. [2025-03-04 15:20:49,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 76 transitions, 457 flow [2025-03-04 15:20:49,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 76 transitions, 451 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:20:49,118 INFO L231 Difference]: Finished difference. Result has 57 places, 46 transitions, 249 flow [2025-03-04 15:20:49,118 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=249, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2025-03-04 15:20:49,119 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 21 predicate places. [2025-03-04 15:20:49,119 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 249 flow [2025-03-04 15:20:49,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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:20:49,119 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:49,119 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:49,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:20:49,119 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:20:49,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:49,121 INFO L85 PathProgramCache]: Analyzing trace with hash -233064606, now seen corresponding path program 1 times [2025-03-04 15:20:49,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:49,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969830612] [2025-03-04 15:20:49,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:49,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:49,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:20:49,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:20:49,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:49,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:49,195 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:49,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:49,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969830612] [2025-03-04 15:20:49,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969830612] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:20:49,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919933131] [2025-03-04 15:20:49,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:49,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:20:49,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:20:49,198 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:20:49,199 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:20:49,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:20:49,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:20:49,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:49,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:49,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:20:49,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:20:49,320 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:49,320 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:20:49,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919933131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:49,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:20:49,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 15:20:49,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889480201] [2025-03-04 15:20:49,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:49,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:20:49,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:49,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:20:49,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:20:49,330 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 38 [2025-03-04 15:20:49,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 46 transitions, 249 flow. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 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:20:49,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:49,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 38 [2025-03-04 15:20:49,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:49,505 INFO L124 PetriNetUnfolderBase]: 210/557 cut-off events. [2025-03-04 15:20:49,505 INFO L125 PetriNetUnfolderBase]: For 912/919 co-relation queries the response was YES. [2025-03-04 15:20:49,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1570 conditions, 557 events. 210/557 cut-off events. For 912/919 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2309 event pairs, 49 based on Foata normal form. 15/572 useless extension candidates. Maximal degree in co-relation 1546. Up to 180 conditions per place. [2025-03-04 15:20:49,508 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 63 selfloop transitions, 21 changer transitions 3/97 dead transitions. [2025-03-04 15:20:49,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 97 transitions, 663 flow [2025-03-04 15:20:49,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:20:49,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:20:49,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 210 transitions. [2025-03-04 15:20:49,509 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5526315789473685 [2025-03-04 15:20:49,509 INFO L175 Difference]: Start difference. First operand has 57 places, 46 transitions, 249 flow. Second operand 10 states and 210 transitions. [2025-03-04 15:20:49,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 97 transitions, 663 flow [2025-03-04 15:20:49,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 97 transitions, 649 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-04 15:20:49,512 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 424 flow [2025-03-04 15:20:49,512 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=424, PETRI_PLACES=69, PETRI_TRANSITIONS=58} [2025-03-04 15:20:49,513 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 33 predicate places. [2025-03-04 15:20:49,513 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 424 flow [2025-03-04 15:20:49,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 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:20:49,513 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:49,513 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:49,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 15:20:49,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 15:20:49,717 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:20:49,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:49,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1364932023, now seen corresponding path program 1 times [2025-03-04 15:20:49,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:49,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563412460] [2025-03-04 15:20:49,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:49,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:49,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 15:20:49,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 15:20:49,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:49,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:49,746 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:20:49,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:49,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563412460] [2025-03-04 15:20:49,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563412460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:49,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:49,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:20:49,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950756697] [2025-03-04 15:20:49,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:49,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:20:49,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:49,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:20:49,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:20:49,750 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 38 [2025-03-04 15:20:49,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 424 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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:20:49,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:49,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 38 [2025-03-04 15:20:49,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:49,824 INFO L124 PetriNetUnfolderBase]: 205/546 cut-off events. [2025-03-04 15:20:49,824 INFO L125 PetriNetUnfolderBase]: For 1801/1810 co-relation queries the response was YES. [2025-03-04 15:20:49,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1780 conditions, 546 events. 205/546 cut-off events. For 1801/1810 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2217 event pairs, 82 based on Foata normal form. 16/558 useless extension candidates. Maximal degree in co-relation 1749. Up to 310 conditions per place. [2025-03-04 15:20:49,827 INFO L140 encePairwiseOnDemand]: 35/38 looper letters, 45 selfloop transitions, 10 changer transitions 0/68 dead transitions. [2025-03-04 15:20:49,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 68 transitions, 609 flow [2025-03-04 15:20:49,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:20:49,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:20:49,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2025-03-04 15:20:49,828 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-04 15:20:49,828 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 424 flow. Second operand 3 states and 76 transitions. [2025-03-04 15:20:49,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 68 transitions, 609 flow [2025-03-04 15:20:49,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 68 transitions, 584 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-03-04 15:20:49,833 INFO L231 Difference]: Finished difference. Result has 69 places, 57 transitions, 430 flow [2025-03-04 15:20:49,834 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=430, PETRI_PLACES=69, PETRI_TRANSITIONS=57} [2025-03-04 15:20:49,834 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 33 predicate places. [2025-03-04 15:20:49,834 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 57 transitions, 430 flow [2025-03-04 15:20:49,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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:20:49,834 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:49,834 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:49,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:20:49,834 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:20:49,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:49,836 INFO L85 PathProgramCache]: Analyzing trace with hash -2060178965, now seen corresponding path program 1 times [2025-03-04 15:20:49,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:49,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061487854] [2025-03-04 15:20:49,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:49,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:49,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 15:20:49,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 15:20:49,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:49,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:49,910 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:49,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:49,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061487854] [2025-03-04 15:20:49,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061487854] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:20:49,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875934197] [2025-03-04 15:20:49,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:49,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:20:49,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:20:49,916 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:20:49,924 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:20:49,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 15:20:49,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 15:20:49,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:49,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:49,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:20:49,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:20:50,016 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:50,017 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:20:50,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875934197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:50,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:20:50,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 15:20:50,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698821941] [2025-03-04 15:20:50,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:50,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:20:50,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:50,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:20:50,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:20:50,023 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 38 [2025-03-04 15:20:50,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 57 transitions, 430 flow. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 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:20:50,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:50,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 38 [2025-03-04 15:20:50,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:50,169 INFO L124 PetriNetUnfolderBase]: 221/556 cut-off events. [2025-03-04 15:20:50,170 INFO L125 PetriNetUnfolderBase]: For 2070/2070 co-relation queries the response was YES. [2025-03-04 15:20:50,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1909 conditions, 556 events. 221/556 cut-off events. For 2070/2070 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2227 event pairs, 17 based on Foata normal form. 18/556 useless extension candidates. Maximal degree in co-relation 1877. Up to 237 conditions per place. [2025-03-04 15:20:50,172 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 68 selfloop transitions, 12 changer transitions 5/97 dead transitions. [2025-03-04 15:20:50,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 97 transitions, 878 flow [2025-03-04 15:20:50,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:20:50,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:20:50,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2025-03-04 15:20:50,173 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6535087719298246 [2025-03-04 15:20:50,173 INFO L175 Difference]: Start difference. First operand has 69 places, 57 transitions, 430 flow. Second operand 6 states and 149 transitions. [2025-03-04 15:20:50,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 97 transitions, 878 flow [2025-03-04 15:20:50,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 97 transitions, 864 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-04 15:20:50,178 INFO L231 Difference]: Finished difference. Result has 72 places, 56 transitions, 436 flow [2025-03-04 15:20:50,178 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=436, PETRI_PLACES=72, PETRI_TRANSITIONS=56} [2025-03-04 15:20:50,178 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 36 predicate places. [2025-03-04 15:20:50,178 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 56 transitions, 436 flow [2025-03-04 15:20:50,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 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:20:50,178 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:50,179 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 15:20:50,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 15:20:50,379 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,SelfDestructingSolverStorable7 [2025-03-04 15:20:50,379 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:20:50,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:50,380 INFO L85 PathProgramCache]: Analyzing trace with hash 558961752, now seen corresponding path program 1 times [2025-03-04 15:20:50,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:50,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828296663] [2025-03-04 15:20:50,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:50,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:50,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 15:20:50,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 15:20:50,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:50,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:50,436 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:50,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:50,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828296663] [2025-03-04 15:20:50,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828296663] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:20:50,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982245891] [2025-03-04 15:20:50,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:50,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:20:50,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:20:50,438 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:20:50,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 15:20:50,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 15:20:50,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 15:20:50,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:50,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:50,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:20:50,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:20:50,526 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:50,526 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:20:50,575 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:50,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982245891] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:20:50,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:20:50,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 15:20:50,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956073064] [2025-03-04 15:20:50,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:20:50,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:20:50,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:50,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:20:50,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:20:50,586 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 38 [2025-03-04 15:20:50,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 56 transitions, 436 flow. Second operand has 12 states, 12 states have (on average 18.333333333333332) internal successors, (220), 12 states have internal predecessors, (220), 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:20:50,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:50,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 38 [2025-03-04 15:20:50,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:50,859 INFO L124 PetriNetUnfolderBase]: 476/1163 cut-off events. [2025-03-04 15:20:50,860 INFO L125 PetriNetUnfolderBase]: For 4991/4991 co-relation queries the response was YES. [2025-03-04 15:20:50,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4207 conditions, 1163 events. 476/1163 cut-off events. For 4991/4991 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 5761 event pairs, 47 based on Foata normal form. 45/1208 useless extension candidates. Maximal degree in co-relation 4175. Up to 374 conditions per place. [2025-03-04 15:20:50,867 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 131 selfloop transitions, 21 changer transitions 22/186 dead transitions. [2025-03-04 15:20:50,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 186 transitions, 1773 flow [2025-03-04 15:20:50,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:20:50,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:20:50,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 267 transitions. [2025-03-04 15:20:50,868 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7026315789473684 [2025-03-04 15:20:50,868 INFO L175 Difference]: Start difference. First operand has 72 places, 56 transitions, 436 flow. Second operand 10 states and 267 transitions. [2025-03-04 15:20:50,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 186 transitions, 1773 flow [2025-03-04 15:20:50,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 186 transitions, 1748 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-04 15:20:50,877 INFO L231 Difference]: Finished difference. Result has 83 places, 72 transitions, 678 flow [2025-03-04 15:20:50,878 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=678, PETRI_PLACES=83, PETRI_TRANSITIONS=72} [2025-03-04 15:20:50,879 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 47 predicate places. [2025-03-04 15:20:50,879 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 72 transitions, 678 flow [2025-03-04 15:20:50,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 18.333333333333332) internal successors, (220), 12 states have internal predecessors, (220), 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:20:50,879 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:50,880 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:50,886 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-04 15:20:51,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:20:51,080 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:20:51,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:51,081 INFO L85 PathProgramCache]: Analyzing trace with hash 559349844, now seen corresponding path program 1 times [2025-03-04 15:20:51,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:51,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708350996] [2025-03-04 15:20:51,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:51,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:51,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 15:20:51,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 15:20:51,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:51,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:51,127 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:20:51,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:51,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708350996] [2025-03-04 15:20:51,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708350996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:51,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:51,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:20:51,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528394140] [2025-03-04 15:20:51,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:51,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:20:51,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:51,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:20:51,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:20:51,141 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 38 [2025-03-04 15:20:51,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 72 transitions, 678 flow. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 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:20:51,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:51,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 38 [2025-03-04 15:20:51,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:51,342 INFO L124 PetriNetUnfolderBase]: 560/1342 cut-off events. [2025-03-04 15:20:51,343 INFO L125 PetriNetUnfolderBase]: For 8717/8724 co-relation queries the response was YES. [2025-03-04 15:20:51,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5332 conditions, 1342 events. 560/1342 cut-off events. For 8717/8724 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 6857 event pairs, 51 based on Foata normal form. 36/1373 useless extension candidates. Maximal degree in co-relation 5295. Up to 461 conditions per place. [2025-03-04 15:20:51,351 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 74 selfloop transitions, 50 changer transitions 0/132 dead transitions. [2025-03-04 15:20:51,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 132 transitions, 1522 flow [2025-03-04 15:20:51,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 15:20:51,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 15:20:51,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2025-03-04 15:20:51,353 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48026315789473684 [2025-03-04 15:20:51,353 INFO L175 Difference]: Start difference. First operand has 83 places, 72 transitions, 678 flow. Second operand 8 states and 146 transitions. [2025-03-04 15:20:51,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 132 transitions, 1522 flow [2025-03-04 15:20:51,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 132 transitions, 1494 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-03-04 15:20:51,365 INFO L231 Difference]: Finished difference. Result has 91 places, 91 transitions, 1143 flow [2025-03-04 15:20:51,365 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1143, PETRI_PLACES=91, PETRI_TRANSITIONS=91} [2025-03-04 15:20:51,366 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 55 predicate places. [2025-03-04 15:20:51,366 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 91 transitions, 1143 flow [2025-03-04 15:20:51,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 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:20:51,367 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:51,367 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:51,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 15:20:51,367 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting workerErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:20:51,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:51,367 INFO L85 PathProgramCache]: Analyzing trace with hash -545859697, now seen corresponding path program 1 times [2025-03-04 15:20:51,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:51,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429963816] [2025-03-04 15:20:51,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:51,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:51,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 15:20:51,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 15:20:51,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:51,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:51,462 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:51,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:51,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429963816] [2025-03-04 15:20:51,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429963816] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:20:51,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517520122] [2025-03-04 15:20:51,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:51,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:20:51,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:20:51,465 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:20:51,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 15:20:51,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 15:20:51,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 15:20:51,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:51,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:51,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:20:51,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:20:51,573 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:51,574 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:20:51,615 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:51,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517520122] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:20:51,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:20:51,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2025-03-04 15:20:51,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163692536] [2025-03-04 15:20:51,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:20:51,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:20:51,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:51,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:20:51,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:20:51,639 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 38 [2025-03-04 15:20:51,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 91 transitions, 1143 flow. Second operand has 12 states, 12 states have (on average 14.333333333333334) internal successors, (172), 12 states have internal predecessors, (172), 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:20:51,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:51,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 38 [2025-03-04 15:20:51,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:52,076 INFO L124 PetriNetUnfolderBase]: 667/1657 cut-off events. [2025-03-04 15:20:52,077 INFO L125 PetriNetUnfolderBase]: For 15803/15810 co-relation queries the response was YES. [2025-03-04 15:20:52,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7256 conditions, 1657 events. 667/1657 cut-off events. For 15803/15810 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 8222 event pairs, 78 based on Foata normal form. 68/1720 useless extension candidates. Maximal degree in co-relation 7213. Up to 430 conditions per place. [2025-03-04 15:20:52,090 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 104 selfloop transitions, 87 changer transitions 31/230 dead transitions. [2025-03-04 15:20:52,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 230 transitions, 3012 flow [2025-03-04 15:20:52,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 15:20:52,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-04 15:20:52,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 352 transitions. [2025-03-04 15:20:52,092 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44110275689223055 [2025-03-04 15:20:52,092 INFO L175 Difference]: Start difference. First operand has 91 places, 91 transitions, 1143 flow. Second operand 21 states and 352 transitions. [2025-03-04 15:20:52,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 230 transitions, 3012 flow [2025-03-04 15:20:52,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 230 transitions, 2813 flow, removed 65 selfloop flow, removed 4 redundant places. [2025-03-04 15:20:52,112 INFO L231 Difference]: Finished difference. Result has 110 places, 126 transitions, 1855 flow [2025-03-04 15:20:52,112 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=1032, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1855, PETRI_PLACES=110, PETRI_TRANSITIONS=126} [2025-03-04 15:20:52,113 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 74 predicate places. [2025-03-04 15:20:52,113 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 126 transitions, 1855 flow [2025-03-04 15:20:52,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 14.333333333333334) internal successors, (172), 12 states have internal predecessors, (172), 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:20:52,114 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:52,114 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 1, 1, 1, 1] [2025-03-04 15:20:52,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 15:20:52,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:20:52,315 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:20:52,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:52,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1370270165, now seen corresponding path program 1 times [2025-03-04 15:20:52,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:52,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490142095] [2025-03-04 15:20:52,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:52,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:52,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 15:20:52,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 15:20:52,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:52,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:52,456 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 40 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:20:52,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:52,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490142095] [2025-03-04 15:20:52,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490142095] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:20:52,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047486935] [2025-03-04 15:20:52,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:52,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:20:52,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:20:52,458 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:20:52,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 15:20:52,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 15:20:52,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 15:20:52,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:52,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:52,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:20:52,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:20:52,602 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 40 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:20:52,603 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:20:52,697 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 40 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:20:52,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047486935] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:20:52,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:20:52,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-03-04 15:20:52,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760554235] [2025-03-04 15:20:52,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:20:52,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 15:20:52,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:52,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 15:20:52,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-04 15:20:52,716 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 38 [2025-03-04 15:20:52,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 126 transitions, 1855 flow. Second operand has 18 states, 18 states have (on average 16.72222222222222) internal successors, (301), 18 states have internal predecessors, (301), 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:20:52,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:52,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 38 [2025-03-04 15:20:52,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:53,191 INFO L124 PetriNetUnfolderBase]: 660/1764 cut-off events. [2025-03-04 15:20:53,192 INFO L125 PetriNetUnfolderBase]: For 17688/17695 co-relation queries the response was YES. [2025-03-04 15:20:53,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8242 conditions, 1764 events. 660/1764 cut-off events. For 17688/17695 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 9302 event pairs, 230 based on Foata normal form. 8/1771 useless extension candidates. Maximal degree in co-relation 8196. Up to 931 conditions per place. [2025-03-04 15:20:53,203 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 205 selfloop transitions, 75 changer transitions 10/298 dead transitions. [2025-03-04 15:20:53,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 298 transitions, 3923 flow [2025-03-04 15:20:53,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-04 15:20:53,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-03-04 15:20:53,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 601 transitions. [2025-03-04 15:20:53,208 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5101867572156197 [2025-03-04 15:20:53,209 INFO L175 Difference]: Start difference. First operand has 110 places, 126 transitions, 1855 flow. Second operand 31 states and 601 transitions. [2025-03-04 15:20:53,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 298 transitions, 3923 flow [2025-03-04 15:20:53,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 298 transitions, 3594 flow, removed 96 selfloop flow, removed 8 redundant places. [2025-03-04 15:20:53,234 INFO L231 Difference]: Finished difference. Result has 142 places, 165 transitions, 2452 flow [2025-03-04 15:20:53,235 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=1647, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=2452, PETRI_PLACES=142, PETRI_TRANSITIONS=165} [2025-03-04 15:20:53,235 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 106 predicate places. [2025-03-04 15:20:53,235 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 165 transitions, 2452 flow [2025-03-04 15:20:53,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 16.72222222222222) internal successors, (301), 18 states have internal predecessors, (301), 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:20:53,235 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:53,235 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1] [2025-03-04 15:20:53,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 15:20:53,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 15:20:53,436 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:20:53,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:53,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1642174455, now seen corresponding path program 2 times [2025-03-04 15:20:53,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:53,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652664571] [2025-03-04 15:20:53,437 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:20:53,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:53,444 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-03-04 15:20:53,453 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 15:20:53,453 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:20:53,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:53,576 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:53,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:53,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652664571] [2025-03-04 15:20:53,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652664571] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:20:53,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117787064] [2025-03-04 15:20:53,577 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:20:53,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:20:53,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:20:53,579 INFO L229 MonitoredProcess]: Starting monitored process 7 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:20:53,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 15:20:53,624 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-03-04 15:20:53,645 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 15:20:53,645 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:20:53,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:53,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:20:53,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:20:53,712 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:53,712 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:20:53,867 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:53,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117787064] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:20:53,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:20:53,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-03-04 15:20:53,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737804021] [2025-03-04 15:20:53,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:20:53,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 15:20:53,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:53,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 15:20:53,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-03-04 15:20:53,889 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 38 [2025-03-04 15:20:53,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 165 transitions, 2452 flow. Second operand has 24 states, 24 states have (on average 18.416666666666668) internal successors, (442), 24 states have internal predecessors, (442), 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:20:53,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:53,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 38 [2025-03-04 15:20:53,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:54,908 INFO L124 PetriNetUnfolderBase]: 1837/4646 cut-off events. [2025-03-04 15:20:54,908 INFO L125 PetriNetUnfolderBase]: For 46394/46394 co-relation queries the response was YES. [2025-03-04 15:20:54,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20986 conditions, 4646 events. 1837/4646 cut-off events. For 46394/46394 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 25474 event pairs, 101 based on Foata normal form. 215/4861 useless extension candidates. Maximal degree in co-relation 20930. Up to 661 conditions per place. [2025-03-04 15:20:54,979 INFO L140 encePairwiseOnDemand]: 34/38 looper letters, 531 selfloop transitions, 135 changer transitions 96/773 dead transitions. [2025-03-04 15:20:54,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 773 transitions, 11322 flow [2025-03-04 15:20:54,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 15:20:54,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-04 15:20:54,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 584 transitions. [2025-03-04 15:20:54,982 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6985645933014354 [2025-03-04 15:20:54,982 INFO L175 Difference]: Start difference. First operand has 142 places, 165 transitions, 2452 flow. Second operand 22 states and 584 transitions. [2025-03-04 15:20:54,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 773 transitions, 11322 flow [2025-03-04 15:20:55,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 773 transitions, 11077 flow, removed 73 selfloop flow, removed 4 redundant places. [2025-03-04 15:20:55,058 INFO L231 Difference]: Finished difference. Result has 169 places, 239 transitions, 4022 flow [2025-03-04 15:20:55,059 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=2326, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=4022, PETRI_PLACES=169, PETRI_TRANSITIONS=239} [2025-03-04 15:20:55,060 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 133 predicate places. [2025-03-04 15:20:55,060 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 239 transitions, 4022 flow [2025-03-04 15:20:55,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 18.416666666666668) internal successors, (442), 24 states have internal predecessors, (442), 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:20:55,060 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:55,060 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 11, 11, 11, 11, 11, 10, 7, 7, 7, 4, 1, 1, 1, 1] [2025-03-04 15:20:55,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 15:20:55,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:20:55,265 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:20:55,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:55,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1310034799, now seen corresponding path program 2 times [2025-03-04 15:20:55,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:55,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333806463] [2025-03-04 15:20:55,266 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:20:55,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:55,282 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 105 statements into 2 equivalence classes. [2025-03-04 15:20:55,298 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 15:20:55,298 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:20:55,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:55,593 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 40 proven. 394 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-04 15:20:55,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:55,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333806463] [2025-03-04 15:20:55,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333806463] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:20:55,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846804341] [2025-03-04 15:20:55,594 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:20:55,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:20:55,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:20:55,596 INFO L229 MonitoredProcess]: Starting monitored process 8 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:20:55,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 15:20:55,651 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 105 statements into 2 equivalence classes. [2025-03-04 15:20:55,691 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 15:20:55,691 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:20:55,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:55,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 15:20:55,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:20:55,806 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 40 proven. 394 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-04 15:20:55,806 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:20:56,082 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 40 proven. 394 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-04 15:20:56,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846804341] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:20:56,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:20:56,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 33 [2025-03-04 15:20:56,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004239255] [2025-03-04 15:20:56,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:20:56,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 15:20:56,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:56,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 15:20:56,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 15:20:56,121 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 38 [2025-03-04 15:20:56,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 239 transitions, 4022 flow. Second operand has 34 states, 34 states have (on average 16.558823529411764) internal successors, (563), 34 states have internal predecessors, (563), 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:20:56,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:56,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 38 [2025-03-04 15:20:56,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:57,708 INFO L124 PetriNetUnfolderBase]: 1978/5172 cut-off events. [2025-03-04 15:20:57,708 INFO L125 PetriNetUnfolderBase]: For 61633/61634 co-relation queries the response was YES. [2025-03-04 15:20:57,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25135 conditions, 5172 events. 1978/5172 cut-off events. For 61633/61634 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 29636 event pairs, 834 based on Foata normal form. 16/5187 useless extension candidates. Maximal degree in co-relation 25069. Up to 2980 conditions per place. [2025-03-04 15:20:57,742 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 445 selfloop transitions, 151 changer transitions 26/630 dead transitions. [2025-03-04 15:20:57,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 630 transitions, 8937 flow [2025-03-04 15:20:57,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2025-03-04 15:20:57,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2025-03-04 15:20:57,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 1291 transitions. [2025-03-04 15:20:57,750 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.507069913589945 [2025-03-04 15:20:57,750 INFO L175 Difference]: Start difference. First operand has 169 places, 239 transitions, 4022 flow. Second operand 67 states and 1291 transitions. [2025-03-04 15:20:57,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 630 transitions, 8937 flow [2025-03-04 15:20:57,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 630 transitions, 8538 flow, removed 139 selfloop flow, removed 9 redundant places. [2025-03-04 15:20:57,866 INFO L231 Difference]: Finished difference. Result has 244 places, 319 transitions, 5697 flow [2025-03-04 15:20:57,868 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=3753, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=67, PETRI_FLOW=5697, PETRI_PLACES=244, PETRI_TRANSITIONS=319} [2025-03-04 15:20:57,868 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 208 predicate places. [2025-03-04 15:20:57,869 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 319 transitions, 5697 flow [2025-03-04 15:20:57,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 16.558823529411764) internal successors, (563), 34 states have internal predecessors, (563), 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:20:57,869 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:57,869 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 11, 11, 11, 11, 11, 10, 8, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:57,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 15:20:58,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:20:58,070 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:20:58,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:58,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1242702273, now seen corresponding path program 1 times [2025-03-04 15:20:58,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:58,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470919315] [2025-03-04 15:20:58,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:58,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:58,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 15:20:58,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 15:20:58,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:58,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:58,241 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 141 proven. 16 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2025-03-04 15:20:58,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:58,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470919315] [2025-03-04 15:20:58,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470919315] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:20:58,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442142527] [2025-03-04 15:20:58,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:58,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:20:58,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:20:58,244 INFO L229 MonitoredProcess]: Starting monitored process 9 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:20:58,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 15:20:58,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 15:20:58,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 15:20:58,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:58,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:58,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:20:58,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:20:58,391 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 141 proven. 16 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2025-03-04 15:20:58,392 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:20:58,476 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 141 proven. 16 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2025-03-04 15:20:58,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442142527] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:20:58,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:20:58,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2025-03-04 15:20:58,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832595843] [2025-03-04 15:20:58,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:20:58,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 15:20:58,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:58,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 15:20:58,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2025-03-04 15:20:58,505 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 38 [2025-03-04 15:20:58,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 319 transitions, 5697 flow. Second operand has 16 states, 16 states have (on average 15.125) internal successors, (242), 16 states have internal predecessors, (242), 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:20:58,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:58,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 38 [2025-03-04 15:20:58,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:21:00,308 INFO L124 PetriNetUnfolderBase]: 3266/8681 cut-off events. [2025-03-04 15:21:00,309 INFO L125 PetriNetUnfolderBase]: For 108013/108031 co-relation queries the response was YES. [2025-03-04 15:21:00,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41469 conditions, 8681 events. 3266/8681 cut-off events. For 108013/108031 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 56553 event pairs, 611 based on Foata normal form. 132/8812 useless extension candidates. Maximal degree in co-relation 41382. Up to 2115 conditions per place. [2025-03-04 15:21:00,369 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 373 selfloop transitions, 331 changer transitions 18/730 dead transitions. [2025-03-04 15:21:00,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 730 transitions, 11847 flow [2025-03-04 15:21:00,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-04 15:21:00,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-03-04 15:21:00,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 614 transitions. [2025-03-04 15:21:00,371 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4366998577524893 [2025-03-04 15:21:00,371 INFO L175 Difference]: Start difference. First operand has 244 places, 319 transitions, 5697 flow. Second operand 37 states and 614 transitions. [2025-03-04 15:21:00,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 730 transitions, 11847 flow [2025-03-04 15:21:00,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 730 transitions, 11389 flow, removed 185 selfloop flow, removed 26 redundant places. [2025-03-04 15:21:00,606 INFO L231 Difference]: Finished difference. Result has 257 places, 503 transitions, 9272 flow [2025-03-04 15:21:00,606 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=5045, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=167, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=9272, PETRI_PLACES=257, PETRI_TRANSITIONS=503} [2025-03-04 15:21:00,607 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 221 predicate places. [2025-03-04 15:21:00,607 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 503 transitions, 9272 flow [2025-03-04 15:21:00,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 15.125) internal successors, (242), 16 states have internal predecessors, (242), 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:21:00,607 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:00,607 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 11, 11, 11, 11, 11, 10, 7, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:21:00,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 15:21:00,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 15:21:00,808 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:21:00,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:00,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1532118798, now seen corresponding path program 2 times [2025-03-04 15:21:00,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:00,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924831775] [2025-03-04 15:21:00,808 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:21:00,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:00,819 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 108 statements into 2 equivalence classes. [2025-03-04 15:21:00,823 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 108 statements. [2025-03-04 15:21:00,823 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:21:00,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:00,863 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-04 15:21:00,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:00,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924831775] [2025-03-04 15:21:00,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924831775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:21:00,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:21:00,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 15:21:00,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370294448] [2025-03-04 15:21:00,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:21:00,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:21:00,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:21:00,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:21:00,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:21:00,878 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 38 [2025-03-04 15:21:00,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 503 transitions, 9272 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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:21:00,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:21:00,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 38 [2025-03-04 15:21:00,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:21:02,695 INFO L124 PetriNetUnfolderBase]: 3242/8735 cut-off events. [2025-03-04 15:21:02,695 INFO L125 PetriNetUnfolderBase]: For 123649/123661 co-relation queries the response was YES. [2025-03-04 15:21:02,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44213 conditions, 8735 events. 3242/8735 cut-off events. For 123649/123661 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 57738 event pairs, 353 based on Foata normal form. 21/8718 useless extension candidates. Maximal degree in co-relation 44119. Up to 2276 conditions per place. [2025-03-04 15:21:02,766 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 119 selfloop transitions, 468 changer transitions 0/595 dead transitions. [2025-03-04 15:21:02,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 595 transitions, 11539 flow [2025-03-04 15:21:02,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:21:02,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:21:02,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 166 transitions. [2025-03-04 15:21:02,768 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4368421052631579 [2025-03-04 15:21:02,768 INFO L175 Difference]: Start difference. First operand has 257 places, 503 transitions, 9272 flow. Second operand 10 states and 166 transitions. [2025-03-04 15:21:02,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 595 transitions, 11539 flow [2025-03-04 15:21:03,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 595 transitions, 11220 flow, removed 93 selfloop flow, removed 8 redundant places. [2025-03-04 15:21:03,091 INFO L231 Difference]: Finished difference. Result has 258 places, 527 transitions, 10366 flow [2025-03-04 15:21:03,091 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=8854, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=498, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=439, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10366, PETRI_PLACES=258, PETRI_TRANSITIONS=527} [2025-03-04 15:21:03,092 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 222 predicate places. [2025-03-04 15:21:03,092 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 527 transitions, 10366 flow [2025-03-04 15:21:03,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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:21:03,092 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:03,092 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 11, 11, 11, 11, 11, 10, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:21:03,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 15:21:03,092 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:21:03,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:03,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1258841827, now seen corresponding path program 3 times [2025-03-04 15:21:03,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:03,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120051772] [2025-03-04 15:21:03,093 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:21:03,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:03,104 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 110 statements into 8 equivalence classes. [2025-03-04 15:21:03,149 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 15:21:03,151 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-04 15:21:03,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:03,406 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 27 proven. 96 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-04 15:21:03,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:03,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120051772] [2025-03-04 15:21:03,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120051772] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:21:03,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838722956] [2025-03-04 15:21:03,406 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:21:03,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:21:03,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:21:03,409 INFO L229 MonitoredProcess]: Starting monitored process 10 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:21:03,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 15:21:03,472 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 110 statements into 8 equivalence classes. [2025-03-04 15:21:03,523 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 15:21:03,524 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-04 15:21:03,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:03,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 15:21:03,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:21:03,622 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 27 proven. 96 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-04 15:21:03,622 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:21:03,766 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 27 proven. 96 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-04 15:21:03,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838722956] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:21:03,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:21:03,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-03-04 15:21:03,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036489536] [2025-03-04 15:21:03,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:21:03,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 15:21:03,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:21:03,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 15:21:03,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552 [2025-03-04 15:21:03,804 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 38 [2025-03-04 15:21:03,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 527 transitions, 10366 flow. Second operand has 24 states, 24 states have (on average 14.833333333333334) internal successors, (356), 24 states have internal predecessors, (356), 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:21:03,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:21:03,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 38 [2025-03-04 15:21:03,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:21:07,423 INFO L124 PetriNetUnfolderBase]: 5730/15433 cut-off events. [2025-03-04 15:21:07,424 INFO L125 PetriNetUnfolderBase]: For 231409/231449 co-relation queries the response was YES. [2025-03-04 15:21:07,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80584 conditions, 15433 events. 5730/15433 cut-off events. For 231409/231449 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 119066 event pairs, 800 based on Foata normal form. 84/15516 useless extension candidates. Maximal degree in co-relation 80491. Up to 2093 conditions per place. [2025-03-04 15:21:07,544 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 458 selfloop transitions, 748 changer transitions 16/1230 dead transitions. [2025-03-04 15:21:07,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 1230 transitions, 23488 flow [2025-03-04 15:21:07,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-03-04 15:21:07,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2025-03-04 15:21:07,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 911 transitions. [2025-03-04 15:21:07,547 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42059095106186517 [2025-03-04 15:21:07,547 INFO L175 Difference]: Start difference. First operand has 258 places, 527 transitions, 10366 flow. Second operand 57 states and 911 transitions. [2025-03-04 15:21:07,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 1230 transitions, 23488 flow [2025-03-04 15:21:08,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 1230 transitions, 23323 flow, removed 80 selfloop flow, removed 2 redundant places. [2025-03-04 15:21:08,131 INFO L231 Difference]: Finished difference. Result has 317 places, 944 transitions, 20841 flow [2025-03-04 15:21:08,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=10192, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=521, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=409, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=57, PETRI_FLOW=20841, PETRI_PLACES=317, PETRI_TRANSITIONS=944} [2025-03-04 15:21:08,131 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 281 predicate places. [2025-03-04 15:21:08,132 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 944 transitions, 20841 flow [2025-03-04 15:21:08,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 14.833333333333334) internal successors, (356), 24 states have internal predecessors, (356), 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:21:08,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:08,132 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1] [2025-03-04 15:21:08,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 15:21:08,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 15:21:08,332 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:21:08,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:08,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1974844459, now seen corresponding path program 3 times [2025-03-04 15:21:08,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:08,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18989616] [2025-03-04 15:21:08,333 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:21:08,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:08,344 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 113 statements into 11 equivalence classes. [2025-03-04 15:21:08,383 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 15:21:08,384 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 15:21:08,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:08,904 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 0 proven. 550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:21:08,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:08,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18989616] [2025-03-04 15:21:08,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18989616] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:21:08,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430551352] [2025-03-04 15:21:08,905 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:21:08,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:21:08,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:21:08,907 INFO L229 MonitoredProcess]: Starting monitored process 11 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:21:08,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 15:21:08,977 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 113 statements into 11 equivalence classes. [2025-03-04 15:21:09,046 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 15:21:09,047 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 15:21:09,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:09,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 15:21:09,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:21:09,176 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 0 proven. 550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:21:09,177 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:21:09,641 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 0 proven. 550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:21:09,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430551352] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:21:09,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:21:09,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 47 [2025-03-04 15:21:09,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663531498] [2025-03-04 15:21:09,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:21:09,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-04 15:21:09,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:21:09,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-04 15:21:09,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=1657, Unknown=0, NotChecked=0, Total=2256 [2025-03-04 15:21:09,671 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 38 [2025-03-04 15:21:09,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 944 transitions, 20841 flow. Second operand has 48 states, 48 states have (on average 18.458333333333332) internal successors, (886), 48 states have internal predecessors, (886), 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:21:09,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:21:09,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 38 [2025-03-04 15:21:09,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:21:22,798 INFO L124 PetriNetUnfolderBase]: 15134/39291 cut-off events. [2025-03-04 15:21:22,798 INFO L125 PetriNetUnfolderBase]: For 832758/832758 co-relation queries the response was YES. [2025-03-04 15:21:23,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222663 conditions, 39291 events. 15134/39291 cut-off events. For 832758/832758 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 302543 event pairs, 402 based on Foata normal form. 1787/41078 useless extension candidates. Maximal degree in co-relation 222565. Up to 5491 conditions per place. [2025-03-04 15:21:23,282 INFO L140 encePairwiseOnDemand]: 34/38 looper letters, 4212 selfloop transitions, 1530 changer transitions 805/6557 dead transitions. [2025-03-04 15:21:23,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 6557 transitions, 142179 flow [2025-03-04 15:21:23,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-04 15:21:23,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2025-03-04 15:21:23,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 1226 transitions. [2025-03-04 15:21:23,284 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7013729977116705 [2025-03-04 15:21:23,285 INFO L175 Difference]: Start difference. First operand has 317 places, 944 transitions, 20841 flow. Second operand 46 states and 1226 transitions. [2025-03-04 15:21:23,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 6557 transitions, 142179 flow [2025-03-04 15:21:26,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 6557 transitions, 141000 flow, removed 571 selfloop flow, removed 11 redundant places. [2025-03-04 15:21:26,057 INFO L231 Difference]: Finished difference. Result has 375 places, 1896 transitions, 48728 flow [2025-03-04 15:21:26,058 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=20740, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=944, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=650, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=48728, PETRI_PLACES=375, PETRI_TRANSITIONS=1896} [2025-03-04 15:21:26,058 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 339 predicate places. [2025-03-04 15:21:26,058 INFO L471 AbstractCegarLoop]: Abstraction has has 375 places, 1896 transitions, 48728 flow [2025-03-04 15:21:26,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 18.458333333333332) internal successors, (886), 48 states have internal predecessors, (886), 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:21:26,059 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:26,059 INFO L206 CegarLoopForPetriNet]: trace histogram [23, 23, 23, 23, 23, 23, 22, 16, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:21:26,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 15:21:26,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 15:21:26,259 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:21:26,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:26,260 INFO L85 PathProgramCache]: Analyzing trace with hash -101448907, now seen corresponding path program 4 times [2025-03-04 15:21:26,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:26,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145585933] [2025-03-04 15:21:26,260 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:21:26,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:26,275 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 210 statements into 2 equivalence classes. [2025-03-04 15:21:26,302 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 210 of 210 statements. [2025-03-04 15:21:26,305 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:21:26,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:27,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1900 backedges. 0 proven. 1900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:21:27,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:27,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145585933] [2025-03-04 15:21:27,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145585933] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:21:27,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941039316] [2025-03-04 15:21:27,480 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:21:27,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:21:27,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:21:27,484 INFO L229 MonitoredProcess]: Starting monitored process 12 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:21:27,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 15:21:27,568 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 210 statements into 2 equivalence classes. [2025-03-04 15:21:27,655 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 210 of 210 statements. [2025-03-04 15:21:27,655 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:21:27,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:27,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 766 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 15:21:27,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:21:28,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1900 backedges. 820 proven. 180 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2025-03-04 15:21:28,010 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:21:28,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1900 backedges. 820 proven. 180 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2025-03-04 15:21:28,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941039316] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:21:28,428 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:21:28,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 15, 15] total 76 [2025-03-04 15:21:28,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675067575] [2025-03-04 15:21:28,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:21:28,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2025-03-04 15:21:28,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:21:28,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2025-03-04 15:21:28,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=813, Invalid=4887, Unknown=0, NotChecked=0, Total=5700 [2025-03-04 15:21:28,530 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2025-03-04 15:21:28,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 1896 transitions, 48728 flow. Second operand has 76 states, 76 states have (on average 12.56578947368421) internal successors, (955), 76 states have internal predecessors, (955), 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:21:28,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:21:28,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2025-03-04 15:21:28,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand