./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/06-symbeq_07-tricky_address2.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/06-symbeq_07-tricky_address2.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 c18dd13658bb5739ed2db8c4c80ae330682b7c3cebd2ad85657518c27ca325b9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:19:56,949 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:19:56,999 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:19:57,004 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:19:57,004 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:19:57,025 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:19:57,026 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:19:57,026 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:19:57,027 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:19:57,027 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:19:57,027 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:19:57,027 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:19:57,028 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:19:57,028 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:19:57,028 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:19:57,028 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:19:57,029 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:19:57,029 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:19:57,029 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:19:57,029 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:19:57,029 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:19:57,029 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:19:57,029 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:19:57,029 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:19:57,029 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:19:57,029 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:19:57,029 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:19:57,029 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:19:57,029 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:19:57,030 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:19:57,030 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:19:57,030 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:19:57,030 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:19:57,030 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:19:57,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:19:57,031 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:19:57,031 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:19:57,031 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:19:57,031 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:19:57,031 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:19:57,031 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:19:57,031 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:19:57,031 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:19:57,031 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:19:57,031 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:19:57,031 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 -> c18dd13658bb5739ed2db8c4c80ae330682b7c3cebd2ad85657518c27ca325b9 [2025-03-04 15:19:57,265 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:19:57,271 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:19:57,272 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:19:57,273 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:19:57,273 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:19:57,274 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/06-symbeq_07-tricky_address2.i [2025-03-04 15:19:58,403 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a13908849/c76aa3ba36c248bfb02a7f3a722bcc2c/FLAGecf6ba8c2 [2025-03-04 15:19:58,646 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:19:58,649 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/06-symbeq_07-tricky_address2.i [2025-03-04 15:19:58,664 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a13908849/c76aa3ba36c248bfb02a7f3a722bcc2c/FLAGecf6ba8c2 [2025-03-04 15:19:58,675 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a13908849/c76aa3ba36c248bfb02a7f3a722bcc2c [2025-03-04 15:19:58,677 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:19:58,678 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:19:58,679 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:19:58,679 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:19:58,684 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:19:58,685 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:19:58" (1/1) ... [2025-03-04 15:19:58,686 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ac3fc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:19:58, skipping insertion in model container [2025-03-04 15:19:58,686 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:19:58" (1/1) ... [2025-03-04 15:19:58,712 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:19:59,056 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:19:59,085 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:19:59,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:19:59,163 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:19:59,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:19:59 WrapperNode [2025-03-04 15:19:59,164 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:19:59,165 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:19:59,165 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:19:59,165 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:19:59,169 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:19:59" (1/1) ... [2025-03-04 15:19:59,178 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:19:59" (1/1) ... [2025-03-04 15:19:59,197 INFO L138 Inliner]: procedures = 265, calls = 74, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 130 [2025-03-04 15:19:59,197 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:19:59,198 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:19:59,198 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:19:59,198 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:19:59,203 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:19:59" (1/1) ... [2025-03-04 15:19:59,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:19:59" (1/1) ... [2025-03-04 15:19:59,206 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:19:59" (1/1) ... [2025-03-04 15:19:59,214 INFO L175 MemorySlicer]: Split 64 memory accesses to 1 slices as follows [64]. 100 percent of accesses are in the largest equivalence class. The 60 initializations are split as follows [60]. The 2 writes are split as follows [2]. [2025-03-04 15:19:59,214 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:19:59" (1/1) ... [2025-03-04 15:19:59,215 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:19:59" (1/1) ... [2025-03-04 15:19:59,219 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:19:59" (1/1) ... [2025-03-04 15:19:59,220 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:19:59" (1/1) ... [2025-03-04 15:19:59,221 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:19:59" (1/1) ... [2025-03-04 15:19:59,221 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:19:59" (1/1) ... [2025-03-04 15:19:59,222 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:19:59,228 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:19:59,228 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:19:59,228 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:19:59,229 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:19:59" (1/1) ... [2025-03-04 15:19:59,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:19:59,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:19:59,252 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:19:59,258 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:19:59,275 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 15:19:59,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:19:59,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:19:59,275 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 15:19:59,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:19:59,275 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 15:19:59,275 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 15:19:59,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:19:59,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:19:59,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:19:59,277 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:19:59,366 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:19:59,368 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:19:59,524 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:19:59,524 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:19:59,771 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:19:59,771 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:19:59,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:19:59 BoogieIcfgContainer [2025-03-04 15:19:59,771 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:19:59,773 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:19:59,773 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:19:59,777 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:19:59,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:19:58" (1/3) ... [2025-03-04 15:19:59,777 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@619fc310 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:19:59, skipping insertion in model container [2025-03-04 15:19:59,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:19:59" (2/3) ... [2025-03-04 15:19:59,778 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@619fc310 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:19:59, skipping insertion in model container [2025-03-04 15:19:59,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:19:59" (3/3) ... [2025-03-04 15:19:59,779 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_07-tricky_address2.i [2025-03-04 15:19:59,788 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:19:59,789 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_07-tricky_address2.i that has 2 procedures, 27 locations, 1 initial locations, 1 loop locations, and 6 error locations. [2025-03-04 15:19:59,789 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:19:59,820 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 15:19:59,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 27 transitions, 58 flow [2025-03-04 15:19:59,884 INFO L124 PetriNetUnfolderBase]: 1/26 cut-off events. [2025-03-04 15:19:59,886 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:19:59,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 26 events. 1/26 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 47 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 7. Up to 2 conditions per place. [2025-03-04 15:19:59,888 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 27 transitions, 58 flow [2025-03-04 15:19:59,890 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 26 transitions, 55 flow [2025-03-04 15:19:59,897 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:19:59,909 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;@220e52a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:19:59,909 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-04 15:19:59,913 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:19:59,913 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-04 15:19:59,913 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:19:59,913 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:19:59,913 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:19:59,914 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:19:59,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:19:59,918 INFO L85 PathProgramCache]: Analyzing trace with hash 318374, now seen corresponding path program 1 times [2025-03-04 15:19:59,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:19:59,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024607520] [2025-03-04 15:19:59,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:19:59,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:19:59,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:20:00,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:20:00,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:00,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:00,142 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:00,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:00,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024607520] [2025-03-04 15:20:00,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024607520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:00,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:00,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:20:00,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434794968] [2025-03-04 15:20:00,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:00,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:20:00,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:00,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:20:00,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:20:00,182 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-03-04 15:20:00,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 26 transitions, 55 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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:00,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:00,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-03-04 15:20:00,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:00,283 INFO L124 PetriNetUnfolderBase]: 37/119 cut-off events. [2025-03-04 15:20:00,283 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:20:00,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 119 events. 37/119 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 402 event pairs, 36 based on Foata normal form. 1/109 useless extension candidates. Maximal degree in co-relation 192. Up to 92 conditions per place. [2025-03-04 15:20:00,285 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 18 selfloop transitions, 3 changer transitions 0/28 dead transitions. [2025-03-04 15:20:00,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 28 transitions, 101 flow [2025-03-04 15:20:00,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:20:00,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:20:00,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2025-03-04 15:20:00,295 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2025-03-04 15:20:00,296 INFO L175 Difference]: Start difference. First operand has 29 places, 26 transitions, 55 flow. Second operand 4 states and 56 transitions. [2025-03-04 15:20:00,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 28 transitions, 101 flow [2025-03-04 15:20:00,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 28 transitions, 100 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:20:00,301 INFO L231 Difference]: Finished difference. Result has 33 places, 28 transitions, 78 flow [2025-03-04 15:20:00,303 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=78, PETRI_PLACES=33, PETRI_TRANSITIONS=28} [2025-03-04 15:20:00,306 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 4 predicate places. [2025-03-04 15:20:00,306 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 28 transitions, 78 flow [2025-03-04 15:20:00,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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:00,306 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:00,306 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 15:20:00,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:20:00,306 INFO L396 AbstractCegarLoop]: === Iteration 2 === 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:00,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:00,307 INFO L85 PathProgramCache]: Analyzing trace with hash 895001151, now seen corresponding path program 1 times [2025-03-04 15:20:00,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:00,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165860433] [2025-03-04 15:20:00,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:00,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:00,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:20:00,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:20:00,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:00,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:00,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:00,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:00,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165860433] [2025-03-04 15:20:00,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165860433] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:20:00,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290906189] [2025-03-04 15:20:00,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:00,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:20:00,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:20:00,449 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:00,451 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:00,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:20:00,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:20:00,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:00,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:00,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:20:00,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:20:00,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:00,549 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:20:00,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290906189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:00,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:20:00,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 15:20:00,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536559240] [2025-03-04 15:20:00,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:00,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:20:00,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:00,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:20:00,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:20:00,562 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-03-04 15:20:00,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 28 transitions, 78 flow. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:20:00,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:00,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-03-04 15:20:00,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:00,659 INFO L124 PetriNetUnfolderBase]: 37/118 cut-off events. [2025-03-04 15:20:00,660 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 15:20:00,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226 conditions, 118 events. 37/118 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 398 event pairs, 36 based on Foata normal form. 1/108 useless extension candidates. Maximal degree in co-relation 209. Up to 87 conditions per place. [2025-03-04 15:20:00,662 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 14 selfloop transitions, 6 changer transitions 0/27 dead transitions. [2025-03-04 15:20:00,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 27 transitions, 114 flow [2025-03-04 15:20:00,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:20:00,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:20:00,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2025-03-04 15:20:00,663 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42592592592592593 [2025-03-04 15:20:00,663 INFO L175 Difference]: Start difference. First operand has 33 places, 28 transitions, 78 flow. Second operand 6 states and 69 transitions. [2025-03-04 15:20:00,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 27 transitions, 114 flow [2025-03-04 15:20:00,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 27 transitions, 112 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:20:00,664 INFO L231 Difference]: Finished difference. Result has 36 places, 27 transitions, 84 flow [2025-03-04 15:20:00,664 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=84, PETRI_PLACES=36, PETRI_TRANSITIONS=27} [2025-03-04 15:20:00,665 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 7 predicate places. [2025-03-04 15:20:00,665 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 84 flow [2025-03-04 15:20:00,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:20:00,665 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:00,665 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-04 15:20:00,672 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:00,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:20:00,866 INFO L396 AbstractCegarLoop]: === Iteration 3 === 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:00,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:00,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1975232161, now seen corresponding path program 1 times [2025-03-04 15:20:00,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:00,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780208797] [2025-03-04 15:20:00,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:00,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:00,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:20:00,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:20:00,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:00,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:00,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:20:00,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:00,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780208797] [2025-03-04 15:20:00,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780208797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:00,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:00,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:20:00,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577419213] [2025-03-04 15:20:00,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:00,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:20:00,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:00,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:20:00,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:20:00,944 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-03-04 15:20:00,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:00,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:00,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-03-04 15:20:00,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:01,002 INFO L124 PetriNetUnfolderBase]: 37/117 cut-off events. [2025-03-04 15:20:01,005 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 15:20:01,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 117 events. 37/117 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 393 event pairs, 36 based on Foata normal form. 1/108 useless extension candidates. Maximal degree in co-relation 205. Up to 90 conditions per place. [2025-03-04 15:20:01,006 INFO L140 encePairwiseOnDemand]: 24/27 looper letters, 15 selfloop transitions, 4 changer transitions 0/26 dead transitions. [2025-03-04 15:20:01,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 118 flow [2025-03-04 15:20:01,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:20:01,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:20:01,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2025-03-04 15:20:01,008 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2025-03-04 15:20:01,008 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 84 flow. Second operand 3 states and 42 transitions. [2025-03-04 15:20:01,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 118 flow [2025-03-04 15:20:01,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 26 transitions, 96 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-04 15:20:01,009 INFO L231 Difference]: Finished difference. Result has 31 places, 26 transitions, 66 flow [2025-03-04 15:20:01,010 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=31, PETRI_TRANSITIONS=26} [2025-03-04 15:20:01,010 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2025-03-04 15:20:01,010 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 66 flow [2025-03-04 15:20:01,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:01,010 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:01,010 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:01,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:20:01,010 INFO L396 AbstractCegarLoop]: === Iteration 4 === 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:01,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:01,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1147853000, now seen corresponding path program 1 times [2025-03-04 15:20:01,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:01,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792717136] [2025-03-04 15:20:01,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:01,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:01,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:20:01,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:20:01,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:01,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:01,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:01,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:01,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792717136] [2025-03-04 15:20:01,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792717136] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:20:01,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819846705] [2025-03-04 15:20:01,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:01,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:20:01,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:20:01,110 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:01,111 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:01,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:20:01,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:20:01,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:01,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:01,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:20:01,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:20:01,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:01,202 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:20:01,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:01,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819846705] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:20:01,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:20:01,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-04 15:20:01,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904407016] [2025-03-04 15:20:01,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:20:01,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:20:01,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:01,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:20:01,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:20:01,238 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-03-04 15:20:01,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 66 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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:01,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:01,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-03-04 15:20:01,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:01,327 INFO L124 PetriNetUnfolderBase]: 37/121 cut-off events. [2025-03-04 15:20:01,327 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-04 15:20:01,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231 conditions, 121 events. 37/121 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 390 event pairs, 36 based on Foata normal form. 2/114 useless extension candidates. Maximal degree in co-relation 198. Up to 88 conditions per place. [2025-03-04 15:20:01,328 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 15 selfloop transitions, 7 changer transitions 0/29 dead transitions. [2025-03-04 15:20:01,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 29 transitions, 125 flow [2025-03-04 15:20:01,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:20:01,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:20:01,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2025-03-04 15:20:01,330 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42328042328042326 [2025-03-04 15:20:01,330 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 66 flow. Second operand 7 states and 80 transitions. [2025-03-04 15:20:01,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 29 transitions, 125 flow [2025-03-04 15:20:01,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 29 transitions, 111 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:20:01,331 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 92 flow [2025-03-04 15:20:01,331 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=92, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2025-03-04 15:20:01,332 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 8 predicate places. [2025-03-04 15:20:01,332 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 92 flow [2025-03-04 15:20:01,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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:01,332 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:01,332 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:01,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 15:20:01,536 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,SelfDestructingSolverStorable3 [2025-03-04 15:20:01,536 INFO L396 AbstractCegarLoop]: === Iteration 5 === 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:01,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:01,537 INFO L85 PathProgramCache]: Analyzing trace with hash 2041417176, now seen corresponding path program 2 times [2025-03-04 15:20:01,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:01,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996180736] [2025-03-04 15:20:01,537 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:20:01,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:01,549 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:20:01,568 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 16 statements. [2025-03-04 15:20:01,568 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:20:01,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:02,332 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 15:20:02,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:02,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996180736] [2025-03-04 15:20:02,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996180736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:02,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:02,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:20:02,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16249344] [2025-03-04 15:20:02,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:02,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:20:02,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:02,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:20:02,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:20:02,344 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-03-04 15:20:02,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 92 flow. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:20:02,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:02,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-03-04 15:20:02,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:02,532 INFO L124 PetriNetUnfolderBase]: 43/128 cut-off events. [2025-03-04 15:20:02,532 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-04 15:20:02,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 128 events. 43/128 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 386 event pairs, 18 based on Foata normal form. 7/129 useless extension candidates. Maximal degree in co-relation 222. Up to 73 conditions per place. [2025-03-04 15:20:02,533 INFO L140 encePairwiseOnDemand]: 20/27 looper letters, 28 selfloop transitions, 5 changer transitions 6/44 dead transitions. [2025-03-04 15:20:02,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 44 transitions, 200 flow [2025-03-04 15:20:02,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:20:02,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:20:02,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2025-03-04 15:20:02,535 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5308641975308642 [2025-03-04 15:20:02,535 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 92 flow. Second operand 6 states and 86 transitions. [2025-03-04 15:20:02,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 44 transitions, 200 flow [2025-03-04 15:20:02,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 44 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:20:02,537 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 115 flow [2025-03-04 15:20:02,538 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=115, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2025-03-04 15:20:02,539 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 14 predicate places. [2025-03-04 15:20:02,540 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 115 flow [2025-03-04 15:20:02,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:20:02,540 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:02,540 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:02,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:20:02,540 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:20:02,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:02,541 INFO L85 PathProgramCache]: Analyzing trace with hash 2041692895, now seen corresponding path program 1 times [2025-03-04 15:20:02,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:02,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289106933] [2025-03-04 15:20:02,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:02,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:02,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:20:02,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:20:02,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:02,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:02,644 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:02,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:02,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289106933] [2025-03-04 15:20:02,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289106933] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:20:02,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641236060] [2025-03-04 15:20:02,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:02,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:20:02,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:20:02,646 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:02,648 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:02,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:20:02,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:20:02,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:02,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:02,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:20:02,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:20:02,740 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:02,740 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:20:02,806 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:02,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641236060] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:20:02,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:20:02,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-03-04 15:20:02,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048787383] [2025-03-04 15:20:02,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:20:02,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 15:20:02,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:02,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 15:20:02,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-04 15:20:02,830 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-03-04 15:20:02,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 115 flow. Second operand has 18 states, 18 states have (on average 9.277777777777779) internal successors, (167), 18 states have internal predecessors, (167), 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:02,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:02,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-03-04 15:20:02,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:02,962 INFO L124 PetriNetUnfolderBase]: 27/117 cut-off events. [2025-03-04 15:20:02,963 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-03-04 15:20:02,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 117 events. 27/117 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 326 event pairs, 26 based on Foata normal form. 4/115 useless extension candidates. Maximal degree in co-relation 253. Up to 69 conditions per place. [2025-03-04 15:20:02,965 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 16 selfloop transitions, 15 changer transitions 0/38 dead transitions. [2025-03-04 15:20:02,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 38 transitions, 225 flow [2025-03-04 15:20:02,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 15:20:02,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 15:20:02,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 154 transitions. [2025-03-04 15:20:02,968 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3802469135802469 [2025-03-04 15:20:02,968 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 115 flow. Second operand 15 states and 154 transitions. [2025-03-04 15:20:02,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 38 transitions, 225 flow [2025-03-04 15:20:02,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 38 transitions, 216 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-04 15:20:02,971 INFO L231 Difference]: Finished difference. Result has 57 places, 38 transitions, 203 flow [2025-03-04 15:20:02,971 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=203, PETRI_PLACES=57, PETRI_TRANSITIONS=38} [2025-03-04 15:20:02,971 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 28 predicate places. [2025-03-04 15:20:02,972 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 38 transitions, 203 flow [2025-03-04 15:20:02,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 9.277777777777779) internal successors, (167), 18 states have internal predecessors, (167), 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:02,972 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:02,972 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:02,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 15:20:03,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:20:03,173 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:20:03,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:03,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1310840801, now seen corresponding path program 2 times [2025-03-04 15:20:03,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:03,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963687508] [2025-03-04 15:20:03,173 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:20:03,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:03,180 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-04 15:20:03,194 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 28 statements. [2025-03-04 15:20:03,195 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:20:03,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:03,630 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 15:20:03,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:03,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963687508] [2025-03-04 15:20:03,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963687508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:03,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:03,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:20:03,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556333310] [2025-03-04 15:20:03,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:03,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:20:03,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:03,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:20:03,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:20:03,639 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-03-04 15:20:03,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 38 transitions, 203 flow. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:20:03,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:03,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-03-04 15:20:03,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:03,800 INFO L124 PetriNetUnfolderBase]: 30/119 cut-off events. [2025-03-04 15:20:03,800 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2025-03-04 15:20:03,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 307 conditions, 119 events. 30/119 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 320 event pairs, 8 based on Foata normal form. 14/133 useless extension candidates. Maximal degree in co-relation 208. Up to 51 conditions per place. [2025-03-04 15:20:03,802 INFO L140 encePairwiseOnDemand]: 20/27 looper letters, 38 selfloop transitions, 6 changer transitions 4/53 dead transitions. [2025-03-04 15:20:03,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 53 transitions, 341 flow [2025-03-04 15:20:03,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:20:03,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:20:03,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2025-03-04 15:20:03,804 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5370370370370371 [2025-03-04 15:20:03,804 INFO L175 Difference]: Start difference. First operand has 57 places, 38 transitions, 203 flow. Second operand 6 states and 87 transitions. [2025-03-04 15:20:03,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 53 transitions, 341 flow [2025-03-04 15:20:03,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 53 transitions, 331 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-04 15:20:03,807 INFO L231 Difference]: Finished difference. Result has 62 places, 41 transitions, 233 flow [2025-03-04 15:20:03,807 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=233, PETRI_PLACES=62, PETRI_TRANSITIONS=41} [2025-03-04 15:20:03,808 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 33 predicate places. [2025-03-04 15:20:03,809 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 41 transitions, 233 flow [2025-03-04 15:20:03,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:20:03,809 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:03,809 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:03,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:20:03,810 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:20:03,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:03,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1935157546, now seen corresponding path program 1 times [2025-03-04 15:20:03,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:03,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054793096] [2025-03-04 15:20:03,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:03,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:03,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 15:20:03,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 15:20:03,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:03,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:04,053 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:04,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:04,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054793096] [2025-03-04 15:20:04,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054793096] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:20:04,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910627579] [2025-03-04 15:20:04,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:04,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:20:04,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:20:04,055 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:04,057 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:04,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 15:20:04,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 15:20:04,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:04,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:04,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 15:20:04,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:20:04,166 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:04,167 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:20:04,302 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:04,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910627579] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:20:04,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:20:04,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 22 [2025-03-04 15:20:04,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846123289] [2025-03-04 15:20:04,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:20:04,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 15:20:04,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:04,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 15:20:04,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-04 15:20:04,319 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-03-04 15:20:04,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 41 transitions, 233 flow. Second operand has 23 states, 23 states have (on average 9.434782608695652) internal successors, (217), 23 states have internal predecessors, (217), 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:04,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:04,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-03-04 15:20:04,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:04,462 INFO L124 PetriNetUnfolderBase]: 26/123 cut-off events. [2025-03-04 15:20:04,463 INFO L125 PetriNetUnfolderBase]: For 168/169 co-relation queries the response was YES. [2025-03-04 15:20:04,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 371 conditions, 123 events. 26/123 cut-off events. For 168/169 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 296 event pairs, 22 based on Foata normal form. 3/126 useless extension candidates. Maximal degree in co-relation 336. Up to 68 conditions per place. [2025-03-04 15:20:04,463 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 19 selfloop transitions, 21 changer transitions 0/47 dead transitions. [2025-03-04 15:20:04,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 47 transitions, 367 flow [2025-03-04 15:20:04,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 15:20:04,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-04 15:20:04,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 207 transitions. [2025-03-04 15:20:04,465 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36507936507936506 [2025-03-04 15:20:04,465 INFO L175 Difference]: Start difference. First operand has 62 places, 41 transitions, 233 flow. Second operand 21 states and 207 transitions. [2025-03-04 15:20:04,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 47 transitions, 367 flow [2025-03-04 15:20:04,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 47 transitions, 359 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-04 15:20:04,467 INFO L231 Difference]: Finished difference. Result has 82 places, 47 transitions, 336 flow [2025-03-04 15:20:04,467 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=336, PETRI_PLACES=82, PETRI_TRANSITIONS=47} [2025-03-04 15:20:04,468 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 53 predicate places. [2025-03-04 15:20:04,468 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 47 transitions, 336 flow [2025-03-04 15:20:04,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.434782608695652) internal successors, (217), 23 states have internal predecessors, (217), 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:04,468 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:04,468 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:04,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 15:20:04,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:20:04,669 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:20:04,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:04,670 INFO L85 PathProgramCache]: Analyzing trace with hash -531068683, now seen corresponding path program 2 times [2025-03-04 15:20:04,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:04,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340198003] [2025-03-04 15:20:04,670 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:20:04,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:04,678 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-04 15:20:04,707 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 42 statements. [2025-03-04 15:20:04,707 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:20:04,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:06,791 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 15:20:06,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:06,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340198003] [2025-03-04 15:20:06,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340198003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:06,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:06,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 15:20:06,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392476834] [2025-03-04 15:20:06,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:06,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:20:06,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:06,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:20:06,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:20:06,843 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2025-03-04 15:20:06,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 47 transitions, 336 flow. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:20:06,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:06,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2025-03-04 15:20:06,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:07,737 INFO L124 PetriNetUnfolderBase]: 58/184 cut-off events. [2025-03-04 15:20:07,737 INFO L125 PetriNetUnfolderBase]: For 221/221 co-relation queries the response was YES. [2025-03-04 15:20:07,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 572 conditions, 184 events. 58/184 cut-off events. For 221/221 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 582 event pairs, 12 based on Foata normal form. 3/187 useless extension candidates. Maximal degree in co-relation 409. Up to 64 conditions per place. [2025-03-04 15:20:07,738 INFO L140 encePairwiseOnDemand]: 17/27 looper letters, 60 selfloop transitions, 19 changer transitions 6/86 dead transitions. [2025-03-04 15:20:07,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 86 transitions, 632 flow [2025-03-04 15:20:07,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 15:20:07,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 15:20:07,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 119 transitions. [2025-03-04 15:20:07,742 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33903133903133903 [2025-03-04 15:20:07,742 INFO L175 Difference]: Start difference. First operand has 82 places, 47 transitions, 336 flow. Second operand 13 states and 119 transitions. [2025-03-04 15:20:07,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 86 transitions, 632 flow [2025-03-04 15:20:07,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 86 transitions, 589 flow, removed 1 selfloop flow, removed 13 redundant places. [2025-03-04 15:20:07,745 INFO L231 Difference]: Finished difference. Result has 86 places, 61 transitions, 416 flow [2025-03-04 15:20:07,745 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=416, PETRI_PLACES=86, PETRI_TRANSITIONS=61} [2025-03-04 15:20:07,746 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 57 predicate places. [2025-03-04 15:20:07,746 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 61 transitions, 416 flow [2025-03-04 15:20:07,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:20:07,746 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:07,746 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:07,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:20:07,746 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:20:07,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:07,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1264980225, now seen corresponding path program 3 times [2025-03-04 15:20:07,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:07,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868032615] [2025-03-04 15:20:07,747 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:20:07,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:07,761 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 11 equivalence classes. [2025-03-04 15:20:07,779 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 12 of 42 statements. [2025-03-04 15:20:07,779 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:20:07,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:09,092 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 15:20:09,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:09,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868032615] [2025-03-04 15:20:09,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868032615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:09,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:09,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 15:20:09,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916484266] [2025-03-04 15:20:09,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:09,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:20:09,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:09,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:20:09,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:20:09,148 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2025-03-04 15:20:09,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 61 transitions, 416 flow. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:20:09,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:09,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2025-03-04 15:20:09,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:09,880 INFO L124 PetriNetUnfolderBase]: 62/202 cut-off events. [2025-03-04 15:20:09,880 INFO L125 PetriNetUnfolderBase]: For 324/324 co-relation queries the response was YES. [2025-03-04 15:20:09,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 713 conditions, 202 events. 62/202 cut-off events. For 324/324 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 693 event pairs, 14 based on Foata normal form. 3/205 useless extension candidates. Maximal degree in co-relation 629. Up to 73 conditions per place. [2025-03-04 15:20:09,881 INFO L140 encePairwiseOnDemand]: 17/27 looper letters, 59 selfloop transitions, 28 changer transitions 7/95 dead transitions. [2025-03-04 15:20:09,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 95 transitions, 777 flow [2025-03-04 15:20:09,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 15:20:09,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 15:20:09,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 132 transitions. [2025-03-04 15:20:09,883 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2875816993464052 [2025-03-04 15:20:09,883 INFO L175 Difference]: Start difference. First operand has 86 places, 61 transitions, 416 flow. Second operand 17 states and 132 transitions. [2025-03-04 15:20:09,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 95 transitions, 777 flow [2025-03-04 15:20:09,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 95 transitions, 746 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-04 15:20:09,886 INFO L231 Difference]: Finished difference. Result has 102 places, 73 transitions, 559 flow [2025-03-04 15:20:09,888 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=559, PETRI_PLACES=102, PETRI_TRANSITIONS=73} [2025-03-04 15:20:09,888 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 73 predicate places. [2025-03-04 15:20:09,888 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 73 transitions, 559 flow [2025-03-04 15:20:09,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:20:09,889 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:09,889 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:09,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 15:20:09,889 INFO L396 AbstractCegarLoop]: === Iteration 11 === 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:09,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:09,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1441803114, now seen corresponding path program 1 times [2025-03-04 15:20:09,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:09,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375869772] [2025-03-04 15:20:09,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:09,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:09,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 15:20:09,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 15:20:09,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:09,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:11,089 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 15:20:11,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:11,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375869772] [2025-03-04 15:20:11,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375869772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:11,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:11,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 15:20:11,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677046227] [2025-03-04 15:20:11,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:11,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 15:20:11,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:11,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:20:11,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:20:11,103 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2025-03-04 15:20:11,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 73 transitions, 559 flow. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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:11,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:11,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2025-03-04 15:20:11,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:11,392 INFO L124 PetriNetUnfolderBase]: 58/189 cut-off events. [2025-03-04 15:20:11,392 INFO L125 PetriNetUnfolderBase]: For 388/388 co-relation queries the response was YES. [2025-03-04 15:20:11,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 735 conditions, 189 events. 58/189 cut-off events. For 388/388 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 617 event pairs, 13 based on Foata normal form. 3/192 useless extension candidates. Maximal degree in co-relation 641. Up to 63 conditions per place. [2025-03-04 15:20:11,393 INFO L140 encePairwiseOnDemand]: 19/27 looper letters, 73 selfloop transitions, 16 changer transitions 4/94 dead transitions. [2025-03-04 15:20:11,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 94 transitions, 871 flow [2025-03-04 15:20:11,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 15:20:11,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 15:20:11,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 82 transitions. [2025-03-04 15:20:11,397 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3374485596707819 [2025-03-04 15:20:11,397 INFO L175 Difference]: Start difference. First operand has 102 places, 73 transitions, 559 flow. Second operand 9 states and 82 transitions. [2025-03-04 15:20:11,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 94 transitions, 871 flow [2025-03-04 15:20:11,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 94 transitions, 831 flow, removed 10 selfloop flow, removed 3 redundant places. [2025-03-04 15:20:11,402 INFO L231 Difference]: Finished difference. Result has 104 places, 72 transitions, 555 flow [2025-03-04 15:20:11,402 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=555, PETRI_PLACES=104, PETRI_TRANSITIONS=72} [2025-03-04 15:20:11,402 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 75 predicate places. [2025-03-04 15:20:11,402 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 72 transitions, 555 flow [2025-03-04 15:20:11,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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:11,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:11,403 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:11,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 15:20:11,403 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:20:11,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:11,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1281801883, now seen corresponding path program 4 times [2025-03-04 15:20:11,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:11,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063208070] [2025-03-04 15:20:11,404 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:20:11,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:11,411 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-03-04 15:20:11,460 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 15:20:11,460 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:20:11,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:24,189 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 15:20:24,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:24,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063208070] [2025-03-04 15:20:24,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063208070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:24,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:24,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 15:20:24,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991472391] [2025-03-04 15:20:24,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:24,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 15:20:24,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:24,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 15:20:24,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:20:24,221 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-03-04 15:20:24,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 72 transitions, 555 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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:24,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:24,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-03-04 15:20:24,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:34,207 INFO L124 PetriNetUnfolderBase]: 46/181 cut-off events. [2025-03-04 15:20:34,207 INFO L125 PetriNetUnfolderBase]: For 427/434 co-relation queries the response was YES. [2025-03-04 15:20:34,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 714 conditions, 181 events. 46/181 cut-off events. For 427/434 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 661 event pairs, 2 based on Foata normal form. 13/194 useless extension candidates. Maximal degree in co-relation 630. Up to 42 conditions per place. [2025-03-04 15:20:34,209 INFO L140 encePairwiseOnDemand]: 15/27 looper letters, 51 selfloop transitions, 28 changer transitions 18/105 dead transitions. [2025-03-04 15:20:34,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 105 transitions, 912 flow [2025-03-04 15:20:34,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 15:20:34,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-04 15:20:34,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 212 transitions. [2025-03-04 15:20:34,210 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43621399176954734 [2025-03-04 15:20:34,210 INFO L175 Difference]: Start difference. First operand has 104 places, 72 transitions, 555 flow. Second operand 18 states and 212 transitions. [2025-03-04 15:20:34,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 105 transitions, 912 flow [2025-03-04 15:20:34,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 105 transitions, 865 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-03-04 15:20:34,216 INFO L231 Difference]: Finished difference. Result has 124 places, 72 transitions, 600 flow [2025-03-04 15:20:34,216 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=527, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=600, PETRI_PLACES=124, PETRI_TRANSITIONS=72} [2025-03-04 15:20:34,216 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 95 predicate places. [2025-03-04 15:20:34,217 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 72 transitions, 600 flow [2025-03-04 15:20:34,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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:34,217 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:34,218 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:34,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 15:20:34,218 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:20:34,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:34,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1323072675, now seen corresponding path program 5 times [2025-03-04 15:20:34,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:34,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107059318] [2025-03-04 15:20:34,218 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:20:34,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:34,227 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 42 statements into 11 equivalence classes. [2025-03-04 15:20:34,257 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 15:20:34,257 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-04 15:20:34,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:36,442 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 117 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:20:36,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:36,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107059318] [2025-03-04 15:20:36,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107059318] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:20:36,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732119646] [2025-03-04 15:20:36,443 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:20:36,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:20:36,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:20:36,445 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:36,446 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:36,491 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 42 statements into 11 equivalence classes. [2025-03-04 15:20:36,577 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 15:20:36,577 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-04 15:20:36,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:36,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-03-04 15:20:36,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:20:38,258 INFO L349 Elim1Store]: treesize reduction 180, result has 38.1 percent of original size [2025-03-04 15:20:38,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 90 treesize of output 141 [2025-03-04 15:20:38,837 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:20:38,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 505 treesize of output 323 [2025-03-04 15:20:40,812 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:20:40,812 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:20:41,260 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 15:20:41,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732119646] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 15:20:41,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 15:20:41,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [26, 23] total 51 [2025-03-04 15:20:41,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444568813] [2025-03-04 15:20:41,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:41,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:20:41,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:41,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:20:41,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=407, Invalid=2349, Unknown=0, NotChecked=0, Total=2756 [2025-03-04 15:20:41,284 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 27 [2025-03-04 15:20:41,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 72 transitions, 600 flow. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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:41,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:41,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 27 [2025-03-04 15:20:41,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:41,515 INFO L124 PetriNetUnfolderBase]: 63/204 cut-off events. [2025-03-04 15:20:41,515 INFO L125 PetriNetUnfolderBase]: For 767/767 co-relation queries the response was YES. [2025-03-04 15:20:41,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 958 conditions, 204 events. 63/204 cut-off events. For 767/767 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 690 event pairs, 9 based on Foata normal form. 4/208 useless extension candidates. Maximal degree in co-relation 892. Up to 53 conditions per place. [2025-03-04 15:20:41,517 INFO L140 encePairwiseOnDemand]: 19/27 looper letters, 72 selfloop transitions, 20 changer transitions 2/95 dead transitions. [2025-03-04 15:20:41,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 95 transitions, 929 flow [2025-03-04 15:20:41,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:20:41,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:20:41,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2025-03-04 15:20:41,518 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2025-03-04 15:20:41,518 INFO L175 Difference]: Start difference. First operand has 124 places, 72 transitions, 600 flow. Second operand 7 states and 81 transitions. [2025-03-04 15:20:41,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 95 transitions, 929 flow [2025-03-04 15:20:41,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 95 transitions, 832 flow, removed 19 selfloop flow, removed 14 redundant places. [2025-03-04 15:20:41,523 INFO L231 Difference]: Finished difference. Result has 110 places, 74 transitions, 616 flow [2025-03-04 15:20:41,523 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=616, PETRI_PLACES=110, PETRI_TRANSITIONS=74} [2025-03-04 15:20:41,524 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 81 predicate places. [2025-03-04 15:20:41,524 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 74 transitions, 616 flow [2025-03-04 15:20:41,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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:41,524 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:41,524 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:41,531 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:41,724 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,SelfDestructingSolverStorable12 [2025-03-04 15:20:41,725 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:20:41,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:41,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1264461285, now seen corresponding path program 6 times [2025-03-04 15:20:41,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:41,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946368574] [2025-03-04 15:20:41,725 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 15:20:41,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:41,733 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 42 statements into 11 equivalence classes. [2025-03-04 15:20:41,743 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 12 of 42 statements. [2025-03-04 15:20:41,743 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 15:20:41,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:42,850 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 15:20:42,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:42,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946368574] [2025-03-04 15:20:42,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946368574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:42,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:42,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 15:20:42,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521879335] [2025-03-04 15:20:42,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:42,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:20:42,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:42,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:20:42,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:20:42,890 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2025-03-04 15:20:42,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 74 transitions, 616 flow. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:20:42,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:42,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2025-03-04 15:20:42,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:43,562 INFO L124 PetriNetUnfolderBase]: 69/223 cut-off events. [2025-03-04 15:20:43,562 INFO L125 PetriNetUnfolderBase]: For 629/629 co-relation queries the response was YES. [2025-03-04 15:20:43,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 969 conditions, 223 events. 69/223 cut-off events. For 629/629 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 813 event pairs, 12 based on Foata normal form. 3/226 useless extension candidates. Maximal degree in co-relation 848. Up to 86 conditions per place. [2025-03-04 15:20:43,564 INFO L140 encePairwiseOnDemand]: 16/27 looper letters, 67 selfloop transitions, 30 changer transitions 2/100 dead transitions. [2025-03-04 15:20:43,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 100 transitions, 956 flow [2025-03-04 15:20:43,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 15:20:43,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-04 15:20:43,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 127 transitions. [2025-03-04 15:20:43,565 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.29398148148148145 [2025-03-04 15:20:43,565 INFO L175 Difference]: Start difference. First operand has 110 places, 74 transitions, 616 flow. Second operand 16 states and 127 transitions. [2025-03-04 15:20:43,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 100 transitions, 956 flow [2025-03-04 15:20:43,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 100 transitions, 930 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-03-04 15:20:43,569 INFO L231 Difference]: Finished difference. Result has 125 places, 81 transitions, 742 flow [2025-03-04 15:20:43,570 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=742, PETRI_PLACES=125, PETRI_TRANSITIONS=81} [2025-03-04 15:20:43,570 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 96 predicate places. [2025-03-04 15:20:43,570 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 81 transitions, 742 flow [2025-03-04 15:20:43,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:20:43,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:43,570 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:43,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 15:20:43,571 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:20:43,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:43,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1249267875, now seen corresponding path program 7 times [2025-03-04 15:20:43,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:43,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440792945] [2025-03-04 15:20:43,571 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 15:20:43,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:43,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 15:20:43,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 15:20:43,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:43,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:44,635 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 15:20:44,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:44,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440792945] [2025-03-04 15:20:44,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440792945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:44,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:44,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 15:20:44,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337312501] [2025-03-04 15:20:44,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:44,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:20:44,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:44,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:20:44,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:20:44,644 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2025-03-04 15:20:44,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 81 transitions, 742 flow. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:20:44,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:44,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2025-03-04 15:20:44,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:45,201 INFO L124 PetriNetUnfolderBase]: 66/222 cut-off events. [2025-03-04 15:20:45,201 INFO L125 PetriNetUnfolderBase]: For 857/857 co-relation queries the response was YES. [2025-03-04 15:20:45,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1058 conditions, 222 events. 66/222 cut-off events. For 857/857 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 826 event pairs, 7 based on Foata normal form. 3/225 useless extension candidates. Maximal degree in co-relation 937. Up to 74 conditions per place. [2025-03-04 15:20:45,204 INFO L140 encePairwiseOnDemand]: 16/27 looper letters, 69 selfloop transitions, 41 changer transitions 2/113 dead transitions. [2025-03-04 15:20:45,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 113 transitions, 1190 flow [2025-03-04 15:20:45,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 15:20:45,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-04 15:20:45,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 138 transitions. [2025-03-04 15:20:45,206 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2839506172839506 [2025-03-04 15:20:45,206 INFO L175 Difference]: Start difference. First operand has 125 places, 81 transitions, 742 flow. Second operand 18 states and 138 transitions. [2025-03-04 15:20:45,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 113 transitions, 1190 flow [2025-03-04 15:20:45,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 113 transitions, 1143 flow, removed 7 selfloop flow, removed 9 redundant places. [2025-03-04 15:20:45,211 INFO L231 Difference]: Finished difference. Result has 138 places, 92 transitions, 937 flow [2025-03-04 15:20:45,212 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=937, PETRI_PLACES=138, PETRI_TRANSITIONS=92} [2025-03-04 15:20:45,212 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 109 predicate places. [2025-03-04 15:20:45,212 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 92 transitions, 937 flow [2025-03-04 15:20:45,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:20:45,212 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:45,212 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:45,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 15:20:45,213 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:20:45,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:45,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1746223828, now seen corresponding path program 1 times [2025-03-04 15:20:45,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:45,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564397369] [2025-03-04 15:20:45,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:45,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:45,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 15:20:45,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 15:20:45,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:45,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:46,967 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 15:20:46,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:46,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564397369] [2025-03-04 15:20:46,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564397369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:46,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:46,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 15:20:46,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893587635] [2025-03-04 15:20:46,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:46,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:20:46,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:46,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:20:46,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:20:47,010 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2025-03-04 15:20:47,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 92 transitions, 937 flow. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:20:47,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:47,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2025-03-04 15:20:47,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:47,845 INFO L124 PetriNetUnfolderBase]: 55/220 cut-off events. [2025-03-04 15:20:47,845 INFO L125 PetriNetUnfolderBase]: For 1109/1109 co-relation queries the response was YES. [2025-03-04 15:20:47,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1096 conditions, 220 events. 55/220 cut-off events. For 1109/1109 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 920 event pairs, 20 based on Foata normal form. 3/221 useless extension candidates. Maximal degree in co-relation 1003. Up to 117 conditions per place. [2025-03-04 15:20:47,847 INFO L140 encePairwiseOnDemand]: 17/27 looper letters, 61 selfloop transitions, 25 changer transitions 12/111 dead transitions. [2025-03-04 15:20:47,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 111 transitions, 1237 flow [2025-03-04 15:20:47,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 15:20:47,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-04 15:20:47,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 147 transitions. [2025-03-04 15:20:47,848 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3402777777777778 [2025-03-04 15:20:47,848 INFO L175 Difference]: Start difference. First operand has 138 places, 92 transitions, 937 flow. Second operand 16 states and 147 transitions. [2025-03-04 15:20:47,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 111 transitions, 1237 flow [2025-03-04 15:20:47,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 111 transitions, 1147 flow, removed 18 selfloop flow, removed 9 redundant places. [2025-03-04 15:20:47,854 INFO L231 Difference]: Finished difference. Result has 146 places, 95 transitions, 926 flow [2025-03-04 15:20:47,854 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=926, PETRI_PLACES=146, PETRI_TRANSITIONS=95} [2025-03-04 15:20:47,855 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 117 predicate places. [2025-03-04 15:20:47,855 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 95 transitions, 926 flow [2025-03-04 15:20:47,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:20:47,855 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:47,855 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:47,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 15:20:47,855 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:20:47,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:47,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1756948588, now seen corresponding path program 2 times [2025-03-04 15:20:47,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:47,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131513953] [2025-03-04 15:20:47,856 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:20:47,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:47,861 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-03-04 15:20:47,870 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 43 statements. [2025-03-04 15:20:47,870 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:20:47,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:49,396 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 15:20:49,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:49,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131513953] [2025-03-04 15:20:49,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131513953] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:49,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:49,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 15:20:49,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309222623] [2025-03-04 15:20:49,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:49,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:20:49,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:49,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:20:49,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:20:49,429 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2025-03-04 15:20:49,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 95 transitions, 926 flow. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:20:49,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:49,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2025-03-04 15:20:49,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:49,968 INFO L124 PetriNetUnfolderBase]: 52/213 cut-off events. [2025-03-04 15:20:49,968 INFO L125 PetriNetUnfolderBase]: For 912/912 co-relation queries the response was YES. [2025-03-04 15:20:49,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1051 conditions, 213 events. 52/213 cut-off events. For 912/912 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 878 event pairs, 17 based on Foata normal form. 3/214 useless extension candidates. Maximal degree in co-relation 993. Up to 109 conditions per place. [2025-03-04 15:20:49,970 INFO L140 encePairwiseOnDemand]: 16/27 looper letters, 63 selfloop transitions, 26 changer transitions 7/109 dead transitions. [2025-03-04 15:20:49,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 109 transitions, 1163 flow [2025-03-04 15:20:49,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 15:20:49,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 15:20:49,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 134 transitions. [2025-03-04 15:20:49,971 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3544973544973545 [2025-03-04 15:20:49,971 INFO L175 Difference]: Start difference. First operand has 146 places, 95 transitions, 926 flow. Second operand 14 states and 134 transitions. [2025-03-04 15:20:49,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 109 transitions, 1163 flow [2025-03-04 15:20:49,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 109 transitions, 1115 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-03-04 15:20:49,977 INFO L231 Difference]: Finished difference. Result has 149 places, 95 transitions, 946 flow [2025-03-04 15:20:49,977 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=884, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=946, PETRI_PLACES=149, PETRI_TRANSITIONS=95} [2025-03-04 15:20:49,978 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 120 predicate places. [2025-03-04 15:20:49,978 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 95 transitions, 946 flow [2025-03-04 15:20:49,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:20:49,978 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:49,978 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:49,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 15:20:49,978 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:20:49,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:49,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1079155786, now seen corresponding path program 3 times [2025-03-04 15:20:49,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:49,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297469993] [2025-03-04 15:20:49,979 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:20:49,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:49,996 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 11 equivalence classes. [2025-03-04 15:20:50,021 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 13 of 43 statements. [2025-03-04 15:20:50,023 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:20:50,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:51,954 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 15:20:51,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:51,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297469993] [2025-03-04 15:20:51,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297469993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:51,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:51,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 15:20:51,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15285154] [2025-03-04 15:20:51,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:51,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:20:51,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:51,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:20:51,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:20:51,997 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2025-03-04 15:20:51,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 95 transitions, 946 flow. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:20:51,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:51,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2025-03-04 15:20:51,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:52,677 INFO L124 PetriNetUnfolderBase]: 51/212 cut-off events. [2025-03-04 15:20:52,677 INFO L125 PetriNetUnfolderBase]: For 958/958 co-relation queries the response was YES. [2025-03-04 15:20:52,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1073 conditions, 212 events. 51/212 cut-off events. For 958/958 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 872 event pairs, 17 based on Foata normal form. 3/213 useless extension candidates. Maximal degree in co-relation 1012. Up to 115 conditions per place. [2025-03-04 15:20:52,679 INFO L140 encePairwiseOnDemand]: 17/27 looper letters, 60 selfloop transitions, 21 changer transitions 11/105 dead transitions. [2025-03-04 15:20:52,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 105 transitions, 1169 flow [2025-03-04 15:20:52,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 15:20:52,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 15:20:52,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 138 transitions. [2025-03-04 15:20:52,680 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34074074074074073 [2025-03-04 15:20:52,680 INFO L175 Difference]: Start difference. First operand has 149 places, 95 transitions, 946 flow. Second operand 15 states and 138 transitions. [2025-03-04 15:20:52,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 105 transitions, 1169 flow [2025-03-04 15:20:52,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 105 transitions, 1105 flow, removed 3 selfloop flow, removed 13 redundant places. [2025-03-04 15:20:52,688 INFO L231 Difference]: Finished difference. Result has 150 places, 91 transitions, 893 flow [2025-03-04 15:20:52,688 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=893, PETRI_PLACES=150, PETRI_TRANSITIONS=91} [2025-03-04 15:20:52,688 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 121 predicate places. [2025-03-04 15:20:52,689 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 91 transitions, 893 flow [2025-03-04 15:20:52,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:20:52,689 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:52,689 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:52,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 15:20:52,690 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:20:52,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:52,690 INFO L85 PathProgramCache]: Analyzing trace with hash 543492596, now seen corresponding path program 1 times [2025-03-04 15:20:52,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:52,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618542431] [2025-03-04 15:20:52,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:20:52,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:52,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 15:20:52,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 15:20:52,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:20:52,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:56,211 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 15:20:56,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:56,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618542431] [2025-03-04 15:20:56,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618542431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:56,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:56,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 15:20:56,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639022371] [2025-03-04 15:20:56,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:56,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:20:56,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:56,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:20:56,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:20:56,274 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2025-03-04 15:20:56,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 91 transitions, 893 flow. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:20:56,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:56,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2025-03-04 15:20:56,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:57,180 INFO L124 PetriNetUnfolderBase]: 49/206 cut-off events. [2025-03-04 15:20:57,180 INFO L125 PetriNetUnfolderBase]: For 959/959 co-relation queries the response was YES. [2025-03-04 15:20:57,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1070 conditions, 206 events. 49/206 cut-off events. For 959/959 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 854 event pairs, 16 based on Foata normal form. 3/207 useless extension candidates. Maximal degree in co-relation 1010. Up to 112 conditions per place. [2025-03-04 15:20:57,182 INFO L140 encePairwiseOnDemand]: 16/27 looper letters, 62 selfloop transitions, 22 changer transitions 8/105 dead transitions. [2025-03-04 15:20:57,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 105 transitions, 1191 flow [2025-03-04 15:20:57,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 15:20:57,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 15:20:57,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 137 transitions. [2025-03-04 15:20:57,183 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33827160493827163 [2025-03-04 15:20:57,183 INFO L175 Difference]: Start difference. First operand has 150 places, 91 transitions, 893 flow. Second operand 15 states and 137 transitions. [2025-03-04 15:20:57,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 105 transitions, 1191 flow [2025-03-04 15:20:57,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 105 transitions, 1120 flow, removed 3 selfloop flow, removed 14 redundant places. [2025-03-04 15:20:57,189 INFO L231 Difference]: Finished difference. Result has 147 places, 93 transitions, 920 flow [2025-03-04 15:20:57,189 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=833, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=920, PETRI_PLACES=147, PETRI_TRANSITIONS=93} [2025-03-04 15:20:57,190 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 118 predicate places. [2025-03-04 15:20:57,190 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 93 transitions, 920 flow [2025-03-04 15:20:57,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:20:57,190 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:57,190 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:57,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 15:20:57,190 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:20:57,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:57,191 INFO L85 PathProgramCache]: Analyzing trace with hash 72598738, now seen corresponding path program 2 times [2025-03-04 15:20:57,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:57,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582133110] [2025-03-04 15:20:57,191 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:20:57,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:57,197 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-03-04 15:20:57,207 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 43 statements. [2025-03-04 15:20:57,207 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:20:57,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:20:58,210 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 15:20:58,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:20:58,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582133110] [2025-03-04 15:20:58,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582133110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:20:58,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:20:58,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 15:20:58,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232834426] [2025-03-04 15:20:58,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:20:58,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:20:58,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:20:58,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:20:58,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:20:58,249 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2025-03-04 15:20:58,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 93 transitions, 920 flow. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:20:58,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:20:58,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2025-03-04 15:20:58,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:20:58,973 INFO L124 PetriNetUnfolderBase]: 44/186 cut-off events. [2025-03-04 15:20:58,973 INFO L125 PetriNetUnfolderBase]: For 870/870 co-relation queries the response was YES. [2025-03-04 15:20:58,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 970 conditions, 186 events. 44/186 cut-off events. For 870/870 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 714 event pairs, 9 based on Foata normal form. 3/186 useless extension candidates. Maximal degree in co-relation 887. Up to 84 conditions per place. [2025-03-04 15:20:58,974 INFO L140 encePairwiseOnDemand]: 16/27 looper letters, 55 selfloop transitions, 29 changer transitions 8/104 dead transitions. [2025-03-04 15:20:58,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 104 transitions, 1162 flow [2025-03-04 15:20:58,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 15:20:58,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 15:20:58,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 154 transitions. [2025-03-04 15:20:58,976 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3355119825708061 [2025-03-04 15:20:58,976 INFO L175 Difference]: Start difference. First operand has 147 places, 93 transitions, 920 flow. Second operand 17 states and 154 transitions. [2025-03-04 15:20:58,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 104 transitions, 1162 flow [2025-03-04 15:20:58,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 104 transitions, 1137 flow, removed 4 selfloop flow, removed 8 redundant places. [2025-03-04 15:20:58,982 INFO L231 Difference]: Finished difference. Result has 154 places, 87 transitions, 911 flow [2025-03-04 15:20:58,982 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=899, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=911, PETRI_PLACES=154, PETRI_TRANSITIONS=87} [2025-03-04 15:20:58,982 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 125 predicate places. [2025-03-04 15:20:58,982 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 87 transitions, 911 flow [2025-03-04 15:20:58,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:20:58,983 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:20:58,983 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:20:58,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 15:20:58,983 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:20:58,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:20:58,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1934419758, now seen corresponding path program 3 times [2025-03-04 15:20:58,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:20:58,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743295482] [2025-03-04 15:20:58,984 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:20:58,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:20:58,992 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 11 equivalence classes. [2025-03-04 15:20:59,003 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 13 of 43 statements. [2025-03-04 15:20:59,003 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:20:59,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:00,307 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 15:21:00,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:00,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743295482] [2025-03-04 15:21:00,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743295482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:21:00,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:21:00,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 15:21:00,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940424268] [2025-03-04 15:21:00,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:21:00,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:21:00,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:21:00,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:21:00,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:21:00,370 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2025-03-04 15:21:00,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 87 transitions, 911 flow. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:21:00,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:21:00,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2025-03-04 15:21:00,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:21:01,095 INFO L124 PetriNetUnfolderBase]: 43/187 cut-off events. [2025-03-04 15:21:01,096 INFO L125 PetriNetUnfolderBase]: For 1099/1099 co-relation queries the response was YES. [2025-03-04 15:21:01,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1050 conditions, 187 events. 43/187 cut-off events. For 1099/1099 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 700 event pairs, 11 based on Foata normal form. 6/192 useless extension candidates. Maximal degree in co-relation 982. Up to 86 conditions per place. [2025-03-04 15:21:01,097 INFO L140 encePairwiseOnDemand]: 17/27 looper letters, 54 selfloop transitions, 21 changer transitions 16/101 dead transitions. [2025-03-04 15:21:01,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 101 transitions, 1223 flow [2025-03-04 15:21:01,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 15:21:01,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 15:21:01,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 137 transitions. [2025-03-04 15:21:01,098 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33827160493827163 [2025-03-04 15:21:01,098 INFO L175 Difference]: Start difference. First operand has 154 places, 87 transitions, 911 flow. Second operand 15 states and 137 transitions. [2025-03-04 15:21:01,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 101 transitions, 1223 flow [2025-03-04 15:21:01,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 101 transitions, 1139 flow, removed 4 selfloop flow, removed 15 redundant places. [2025-03-04 15:21:01,104 INFO L231 Difference]: Finished difference. Result has 148 places, 81 transitions, 819 flow [2025-03-04 15:21:01,105 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=840, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=819, PETRI_PLACES=148, PETRI_TRANSITIONS=81} [2025-03-04 15:21:01,105 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 119 predicate places. [2025-03-04 15:21:01,105 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 81 transitions, 819 flow [2025-03-04 15:21:01,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:21:01,105 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:01,105 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:21:01,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 15:21:01,106 INFO L396 AbstractCegarLoop]: === Iteration 22 === 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:01,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:01,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1350384536, now seen corresponding path program 4 times [2025-03-04 15:21:01,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:01,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785319507] [2025-03-04 15:21:01,107 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:21:01,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:01,116 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 43 statements into 2 equivalence classes. [2025-03-04 15:21:01,134 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 15:21:01,135 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:21:01,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:03,187 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 15:21:03,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:03,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785319507] [2025-03-04 15:21:03,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785319507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:21:03,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:21:03,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 15:21:03,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401606968] [2025-03-04 15:21:03,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:21:03,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 15:21:03,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:21:03,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:21:03,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:21:03,205 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-03-04 15:21:03,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 81 transitions, 819 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:21:03,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:21:03,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-03-04 15:21:03,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:21:04,480 INFO L124 PetriNetUnfolderBase]: 29/157 cut-off events. [2025-03-04 15:21:04,480 INFO L125 PetriNetUnfolderBase]: For 729/729 co-relation queries the response was YES. [2025-03-04 15:21:04,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 821 conditions, 157 events. 29/157 cut-off events. For 729/729 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 550 event pairs, 11 based on Foata normal form. 3/160 useless extension candidates. Maximal degree in co-relation 763. Up to 65 conditions per place. [2025-03-04 15:21:04,481 INFO L140 encePairwiseOnDemand]: 17/27 looper letters, 49 selfloop transitions, 18 changer transitions 9/88 dead transitions. [2025-03-04 15:21:04,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 88 transitions, 991 flow [2025-03-04 15:21:04,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 15:21:04,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 15:21:04,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 153 transitions. [2025-03-04 15:21:04,482 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2025-03-04 15:21:04,482 INFO L175 Difference]: Start difference. First operand has 148 places, 81 transitions, 819 flow. Second operand 14 states and 153 transitions. [2025-03-04 15:21:04,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 88 transitions, 991 flow [2025-03-04 15:21:04,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 88 transitions, 927 flow, removed 8 selfloop flow, removed 15 redundant places. [2025-03-04 15:21:04,486 INFO L231 Difference]: Finished difference. Result has 143 places, 78 transitions, 766 flow [2025-03-04 15:21:04,487 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=755, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=766, PETRI_PLACES=143, PETRI_TRANSITIONS=78} [2025-03-04 15:21:04,487 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 114 predicate places. [2025-03-04 15:21:04,487 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 78 transitions, 766 flow [2025-03-04 15:21:04,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:21:04,487 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:04,487 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:21:04,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 15:21:04,488 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:21:04,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:04,488 INFO L85 PathProgramCache]: Analyzing trace with hash 66103307, now seen corresponding path program 1 times [2025-03-04 15:21:04,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:04,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602279868] [2025-03-04 15:21:04,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:21:04,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:04,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 15:21:04,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 15:21:04,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:21:04,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:05,502 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 15:21:05,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:05,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602279868] [2025-03-04 15:21:05,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602279868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:21:05,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:21:05,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 15:21:05,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670236013] [2025-03-04 15:21:05,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:21:05,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 15:21:05,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:21:05,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 15:21:05,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:21:05,520 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 27 [2025-03-04 15:21:05,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 78 transitions, 766 flow. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 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:05,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:21:05,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 27 [2025-03-04 15:21:05,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:21:06,084 INFO L124 PetriNetUnfolderBase]: 35/151 cut-off events. [2025-03-04 15:21:06,084 INFO L125 PetriNetUnfolderBase]: For 599/599 co-relation queries the response was YES. [2025-03-04 15:21:06,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 784 conditions, 151 events. 35/151 cut-off events. For 599/599 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 450 event pairs, 4 based on Foata normal form. 2/153 useless extension candidates. Maximal degree in co-relation 730. Up to 30 conditions per place. [2025-03-04 15:21:06,085 INFO L140 encePairwiseOnDemand]: 19/27 looper letters, 53 selfloop transitions, 29 changer transitions 0/89 dead transitions. [2025-03-04 15:21:06,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 89 transitions, 991 flow [2025-03-04 15:21:06,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 15:21:06,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 15:21:06,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 110 transitions. [2025-03-04 15:21:06,086 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31339031339031337 [2025-03-04 15:21:06,086 INFO L175 Difference]: Start difference. First operand has 143 places, 78 transitions, 766 flow. Second operand 13 states and 110 transitions. [2025-03-04 15:21:06,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 89 transitions, 991 flow [2025-03-04 15:21:06,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 89 transitions, 924 flow, removed 7 selfloop flow, removed 15 redundant places. [2025-03-04 15:21:06,090 INFO L231 Difference]: Finished difference. Result has 130 places, 82 transitions, 784 flow [2025-03-04 15:21:06,090 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=784, PETRI_PLACES=130, PETRI_TRANSITIONS=82} [2025-03-04 15:21:06,090 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 101 predicate places. [2025-03-04 15:21:06,090 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 82 transitions, 784 flow [2025-03-04 15:21:06,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 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:06,091 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:06,091 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:21:06,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 15:21:06,091 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:21:06,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:06,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1171283234, now seen corresponding path program 4 times [2025-03-04 15:21:06,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:06,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652474300] [2025-03-04 15:21:06,091 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:21:06,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:06,097 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 43 statements into 2 equivalence classes. [2025-03-04 15:21:06,111 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 15:21:06,111 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:21:06,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:07,852 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 15:21:07,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:07,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652474300] [2025-03-04 15:21:07,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652474300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:21:07,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:21:07,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 15:21:07,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438030308] [2025-03-04 15:21:07,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:21:07,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:21:07,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:21:07,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:21:07,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:21:07,920 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-03-04 15:21:07,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 82 transitions, 784 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:21:07,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:21:07,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-03-04 15:21:07,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:21:08,538 INFO L124 PetriNetUnfolderBase]: 34/157 cut-off events. [2025-03-04 15:21:08,538 INFO L125 PetriNetUnfolderBase]: For 630/630 co-relation queries the response was YES. [2025-03-04 15:21:08,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 805 conditions, 157 events. 34/157 cut-off events. For 630/630 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 512 event pairs, 5 based on Foata normal form. 3/160 useless extension candidates. Maximal degree in co-relation 707. Up to 76 conditions per place. [2025-03-04 15:21:08,539 INFO L140 encePairwiseOnDemand]: 18/27 looper letters, 57 selfloop transitions, 15 changer transitions 9/92 dead transitions. [2025-03-04 15:21:08,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 92 transitions, 1005 flow [2025-03-04 15:21:08,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 15:21:08,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 15:21:08,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 136 transitions. [2025-03-04 15:21:08,540 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41975308641975306 [2025-03-04 15:21:08,540 INFO L175 Difference]: Start difference. First operand has 130 places, 82 transitions, 784 flow. Second operand 12 states and 136 transitions. [2025-03-04 15:21:08,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 92 transitions, 1005 flow [2025-03-04 15:21:08,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 92 transitions, 940 flow, removed 9 selfloop flow, removed 10 redundant places. [2025-03-04 15:21:08,544 INFO L231 Difference]: Finished difference. Result has 133 places, 80 transitions, 733 flow [2025-03-04 15:21:08,544 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=723, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=733, PETRI_PLACES=133, PETRI_TRANSITIONS=80} [2025-03-04 15:21:08,545 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 104 predicate places. [2025-03-04 15:21:08,545 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 80 transitions, 733 flow [2025-03-04 15:21:08,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:21:08,545 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:21:08,545 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:21:08,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 15:21:08,545 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:21:08,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:21:08,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1270487264, now seen corresponding path program 5 times [2025-03-04 15:21:08,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:21:08,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71764608] [2025-03-04 15:21:08,545 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:21:08,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:21:08,551 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 43 statements into 11 equivalence classes. [2025-03-04 15:21:08,567 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 15:21:08,567 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-04 15:21:08,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:10,573 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 117 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:21:10,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:21:10,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71764608] [2025-03-04 15:21:10,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71764608] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:21:10,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762233098] [2025-03-04 15:21:10,573 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:21:10,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:21:10,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:21:10,575 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:21:10,577 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:21:10,626 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 43 statements into 11 equivalence classes. [2025-03-04 15:21:10,711 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 15:21:10,711 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-04 15:21:10,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:21:10,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-03-04 15:21:10,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:21:11,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-03-04 15:21:12,256 INFO L349 Elim1Store]: treesize reduction 180, result has 38.1 percent of original size [2025-03-04 15:21:12,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 90 treesize of output 141 [2025-03-04 15:21:12,903 INFO L349 Elim1Store]: treesize reduction 8, result has 95.3 percent of original size [2025-03-04 15:21:12,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 45 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 507 treesize of output 611