./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/goblint-regression/06-symbeq_07-tricky_address2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version da043454 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 ../../../trunk/examples/svcomp/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-wip.fs.system-includes-da04345-m [2025-04-30 10:18:50,465 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:18:50,514 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-04-30 10:18:50,517 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:18:50,520 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:18:50,541 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:18:50,543 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:18:50,543 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:18:50,543 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:18:50,543 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:18:50,544 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:18:50,544 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:18:50,544 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:18:50,545 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:18:50,545 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:18:50,545 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:18:50,545 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:18:50,545 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:18:50,545 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:18:50,546 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:18:50,546 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:18:50,546 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:18:50,546 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:18:50,546 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:18:50,546 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-04-30 10:18:50,546 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:18:50,546 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:18:50,546 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:18:50,546 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:18:50,546 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:18:50,546 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:18:50,546 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:18:50,547 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:18:50,547 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:18:50,547 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:18:50,547 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:18:50,547 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:18:50,547 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:18:50,547 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:18:50,547 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:18:50,548 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:18:50,548 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:18:50,548 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:18:50,548 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:18:50,548 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:18:50,548 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:18:50,548 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:18:50,548 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:18:50,548 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:18:50,548 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-04-30 10:18:50,770 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:18:50,777 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:18:50,778 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:18:50,779 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:18:50,779 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:18:50,781 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/06-symbeq_07-tricky_address2.i [2025-04-30 10:18:52,011 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/403e42a31/714c183ab2d749d0b7b104ae868e451a/FLAGf968bb26b [2025-04-30 10:18:52,284 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:18:52,286 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_07-tricky_address2.i [2025-04-30 10:18:52,300 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/403e42a31/714c183ab2d749d0b7b104ae868e451a/FLAGf968bb26b [2025-04-30 10:18:53,011 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/403e42a31/714c183ab2d749d0b7b104ae868e451a [2025-04-30 10:18:53,013 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:18:53,014 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:18:53,016 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:18:53,016 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:18:53,019 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:18:53,019 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:18:53" (1/1) ... [2025-04-30 10:18:53,020 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@789c3224 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:53, skipping insertion in model container [2025-04-30 10:18:53,020 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:18:53" (1/1) ... [2025-04-30 10:18:53,046 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:18:53,369 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:18:53,399 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:18:53,447 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:18:53,483 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:18:53,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:53 WrapperNode [2025-04-30 10:18:53,484 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:18:53,484 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:18:53,485 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:18:53,485 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:18:53,489 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:53" (1/1) ... [2025-04-30 10:18:53,507 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:53" (1/1) ... [2025-04-30 10:18:53,537 INFO L138 Inliner]: procedures = 265, calls = 74, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 130 [2025-04-30 10:18:53,540 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:18:53,541 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:18:53,541 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:18:53,541 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:18:53,548 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:53" (1/1) ... [2025-04-30 10:18:53,548 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:53" (1/1) ... [2025-04-30 10:18:53,556 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:53" (1/1) ... [2025-04-30 10:18:53,577 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-04-30 10:18:53,578 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:53" (1/1) ... [2025-04-30 10:18:53,578 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:53" (1/1) ... [2025-04-30 10:18:53,583 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:53" (1/1) ... [2025-04-30 10:18:53,583 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:53" (1/1) ... [2025-04-30 10:18:53,585 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:53" (1/1) ... [2025-04-30 10:18:53,586 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:53" (1/1) ... [2025-04-30 10:18:53,587 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:53" (1/1) ... [2025-04-30 10:18:53,589 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:18:53,590 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:18:53,590 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:18:53,590 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:18:53,591 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:53" (1/1) ... [2025-04-30 10:18:53,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:18:53,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:18:53,628 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-04-30 10:18:53,629 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-04-30 10:18:53,643 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-30 10:18:53,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-30 10:18:53,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-30 10:18:53,644 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-30 10:18:53,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:18:53,644 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-30 10:18:53,644 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-30 10:18:53,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:18:53,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:18:53,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:18:53,645 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-30 10:18:53,731 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:18:53,732 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:18:53,954 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-30 10:18:53,954 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:18:54,236 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:18:54,237 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:18:54,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:18:54 BoogieIcfgContainer [2025-04-30 10:18:54,237 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:18:54,239 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:18:54,239 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:18:54,242 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:18:54,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:18:53" (1/3) ... [2025-04-30 10:18:54,243 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7336e215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:18:54, skipping insertion in model container [2025-04-30 10:18:54,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:53" (2/3) ... [2025-04-30 10:18:54,244 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7336e215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:18:54, skipping insertion in model container [2025-04-30 10:18:54,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:18:54" (3/3) ... [2025-04-30 10:18:54,245 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_07-tricky_address2.i [2025-04-30 10:18:54,254 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:18:54,256 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_07-tricky_address2.i that has 2 procedures, 27 locations, 26 edges, 1 initial locations, 1 loop locations, and 6 error locations. [2025-04-30 10:18:54,256 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-30 10:18:54,307 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-30 10:18:54,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 27 transitions, 58 flow [2025-04-30 10:18:54,359 INFO L116 PetriNetUnfolderBase]: 1/26 cut-off events. [2025-04-30 10:18:54,361 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:18:54,363 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 4. Compared 42 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-04-30 10:18:54,364 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 27 transitions, 58 flow [2025-04-30 10:18:54,366 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 26 transitions, 55 flow [2025-04-30 10:18:54,374 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:18:54,386 INFO L340 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;@13bf36be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:18:54,389 INFO L341 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-04-30 10:18:54,392 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:18:54,392 INFO L116 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-04-30 10:18:54,393 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:18:54,393 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:18:54,393 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-04-30 10:18:54,393 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-30 10:18:54,398 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:54,398 INFO L85 PathProgramCache]: Analyzing trace with hash 334666, now seen corresponding path program 1 times [2025-04-30 10:18:54,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:54,403 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310958033] [2025-04-30 10:18:54,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:54,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:54,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-30 10:18:54,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-30 10:18:54,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:54,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:54,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:18:54,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:54,617 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310958033] [2025-04-30 10:18:54,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310958033] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:18:54,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:18:54,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:18:54,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631549206] [2025-04-30 10:18:54,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:18:54,623 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:18:54,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:54,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:18:54,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:18:54,660 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-04-30 10:18:54,661 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-04-30 10:18:54,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:18:54,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-04-30 10:18:54,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:18:54,724 INFO L116 PetriNetUnfolderBase]: 37/119 cut-off events. [2025-04-30 10:18:54,724 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:18:54,724 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 13. Compared 398 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-04-30 10:18:54,725 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 18 selfloop transitions, 3 changer transitions 0/28 dead transitions. [2025-04-30 10:18:54,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 28 transitions, 101 flow [2025-04-30 10:18:54,726 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:18:54,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-30 10:18:54,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2025-04-30 10:18:54,734 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2025-04-30 10:18:54,735 INFO L175 Difference]: Start difference. First operand has 29 places, 26 transitions, 55 flow. Second operand 4 states and 56 transitions. [2025-04-30 10:18:54,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 28 transitions, 101 flow [2025-04-30 10:18:54,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 28 transitions, 100 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:18:54,739 INFO L231 Difference]: Finished difference. Result has 33 places, 28 transitions, 78 flow [2025-04-30 10:18:54,741 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-04-30 10:18:54,743 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 4 predicate places. [2025-04-30 10:18:54,743 INFO L485 AbstractCegarLoop]: Abstraction has has 33 places, 28 transitions, 78 flow [2025-04-30 10:18:54,743 INFO L486 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-04-30 10:18:54,743 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:18:54,743 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-04-30 10:18:54,744 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:18:54,744 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-30 10:18:54,744 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:54,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1380424309, now seen corresponding path program 1 times [2025-04-30 10:18:54,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:54,744 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585018539] [2025-04-30 10:18:54,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:54,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:54,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-30 10:18:54,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-30 10:18:54,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:54,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:54,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:18:54,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:54,895 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585018539] [2025-04-30 10:18:54,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585018539] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:18:54,895 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726834281] [2025-04-30 10:18:54,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:54,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:18:54,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:18:54,898 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-04-30 10:18:54,900 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-04-30 10:18:54,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-30 10:18:54,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-30 10:18:54,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:54,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:54,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-30 10:18:54,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:18:55,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:18:55,017 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:18:55,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726834281] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:18:55,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:18:55,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-04-30 10:18:55,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209699663] [2025-04-30 10:18:55,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:18:55,019 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:18:55,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:55,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:18:55,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:18:55,037 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-04-30 10:18:55,038 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-04-30 10:18:55,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:18:55,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-04-30 10:18:55,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:18:55,160 INFO L116 PetriNetUnfolderBase]: 37/118 cut-off events. [2025-04-30 10:18:55,160 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-30 10:18:55,161 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 13. Compared 394 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-04-30 10:18:55,162 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 14 selfloop transitions, 6 changer transitions 0/27 dead transitions. [2025-04-30 10:18:55,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 27 transitions, 114 flow [2025-04-30 10:18:55,163 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:18:55,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:18:55,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2025-04-30 10:18:55,165 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42592592592592593 [2025-04-30 10:18:55,165 INFO L175 Difference]: Start difference. First operand has 33 places, 28 transitions, 78 flow. Second operand 6 states and 69 transitions. [2025-04-30 10:18:55,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 27 transitions, 114 flow [2025-04-30 10:18:55,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 27 transitions, 112 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:18:55,167 INFO L231 Difference]: Finished difference. Result has 36 places, 27 transitions, 84 flow [2025-04-30 10:18:55,168 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-04-30 10:18:55,168 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 7 predicate places. [2025-04-30 10:18:55,168 INFO L485 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 84 flow [2025-04-30 10:18:55,168 INFO L486 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-04-30 10:18:55,168 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:18:55,168 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-04-30 10:18:55,176 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-04-30 10:18:55,374 WARN L466 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-04-30 10:18:55,374 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-30 10:18:55,375 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:55,376 INFO L85 PathProgramCache]: Analyzing trace with hash -156519055, now seen corresponding path program 1 times [2025-04-30 10:18:55,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:55,376 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948768733] [2025-04-30 10:18:55,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:55,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:55,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:18:55,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:18:55,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:55,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:55,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:18:55,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:55,460 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948768733] [2025-04-30 10:18:55,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948768733] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:18:55,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:18:55,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:18:55,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069395352] [2025-04-30 10:18:55,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:18:55,461 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:18:55,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:55,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:18:55,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:18:55,464 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-04-30 10:18:55,465 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-04-30 10:18:55,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:18:55,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-04-30 10:18:55,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:18:55,514 INFO L116 PetriNetUnfolderBase]: 37/117 cut-off events. [2025-04-30 10:18:55,514 INFO L117 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-04-30 10:18:55,515 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 391 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-04-30 10:18:55,515 INFO L140 encePairwiseOnDemand]: 24/27 looper letters, 15 selfloop transitions, 4 changer transitions 0/26 dead transitions. [2025-04-30 10:18:55,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 118 flow [2025-04-30 10:18:55,515 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:18:55,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:18:55,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2025-04-30 10:18:55,516 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2025-04-30 10:18:55,516 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 84 flow. Second operand 3 states and 42 transitions. [2025-04-30 10:18:55,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 118 flow [2025-04-30 10:18:55,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 26 transitions, 96 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-04-30 10:18:55,517 INFO L231 Difference]: Finished difference. Result has 31 places, 26 transitions, 66 flow [2025-04-30 10:18:55,517 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-04-30 10:18:55,518 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2025-04-30 10:18:55,518 INFO L485 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 66 flow [2025-04-30 10:18:55,519 INFO L486 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-04-30 10:18:55,519 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:18:55,519 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:55,519 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:18:55,519 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-30 10:18:55,519 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:55,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1527202598, now seen corresponding path program 1 times [2025-04-30 10:18:55,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:55,520 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759390227] [2025-04-30 10:18:55,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:55,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:55,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:18:55,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:18:55,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:55,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:55,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:18:55,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:55,619 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759390227] [2025-04-30 10:18:55,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759390227] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:18:55,619 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038169625] [2025-04-30 10:18:55,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:55,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:18:55,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:18:55,621 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-04-30 10:18:55,623 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-04-30 10:18:55,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:18:55,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:18:55,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:55,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:55,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-30 10:18:55,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:18:55,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:18:55,709 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:18:55,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:18:55,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038169625] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:18:55,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:18:55,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-04-30 10:18:55,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019036996] [2025-04-30 10:18:55,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:18:55,736 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:18:55,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:55,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:18:55,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:18:55,748 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-04-30 10:18:55,748 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-04-30 10:18:55,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:18:55,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-04-30 10:18:55,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:18:55,850 INFO L116 PetriNetUnfolderBase]: 37/121 cut-off events. [2025-04-30 10:18:55,851 INFO L117 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-04-30 10:18:55,851 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 388 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-04-30 10:18:55,852 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 15 selfloop transitions, 7 changer transitions 0/29 dead transitions. [2025-04-30 10:18:55,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 29 transitions, 125 flow [2025-04-30 10:18:55,853 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:18:55,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-30 10:18:55,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2025-04-30 10:18:55,853 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42328042328042326 [2025-04-30 10:18:55,853 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 66 flow. Second operand 7 states and 80 transitions. [2025-04-30 10:18:55,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 29 transitions, 125 flow [2025-04-30 10:18:55,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 29 transitions, 111 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:18:55,854 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 92 flow [2025-04-30 10:18:55,854 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-04-30 10:18:55,855 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 8 predicate places. [2025-04-30 10:18:55,855 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 92 flow [2025-04-30 10:18:55,855 INFO L486 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-04-30 10:18:55,855 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:18:55,855 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:55,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-30 10:18:56,055 WARN L466 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-04-30 10:18:56,056 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-30 10:18:56,056 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:56,057 INFO L85 PathProgramCache]: Analyzing trace with hash -512478458, now seen corresponding path program 2 times [2025-04-30 10:18:56,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:56,057 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69856410] [2025-04-30 10:18:56,057 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:18:56,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:56,068 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-30 10:18:56,094 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 16 statements. [2025-04-30 10:18:56,094 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:18:56,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:56,805 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-30 10:18:56,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:56,805 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69856410] [2025-04-30 10:18:56,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69856410] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:18:56,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:18:56,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:18:56,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053376807] [2025-04-30 10:18:56,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:18:56,806 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:18:56,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:56,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:18:56,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:18:56,817 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-04-30 10:18:56,817 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-04-30 10:18:56,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:18:56,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-04-30 10:18:56,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:18:57,021 INFO L116 PetriNetUnfolderBase]: 43/128 cut-off events. [2025-04-30 10:18:57,021 INFO L117 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-04-30 10:18:57,022 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 10. Compared 382 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-04-30 10:18:57,022 INFO L140 encePairwiseOnDemand]: 20/27 looper letters, 28 selfloop transitions, 5 changer transitions 6/44 dead transitions. [2025-04-30 10:18:57,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 44 transitions, 200 flow [2025-04-30 10:18:57,023 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:18:57,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:18:57,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2025-04-30 10:18:57,024 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5308641975308642 [2025-04-30 10:18:57,024 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 92 flow. Second operand 6 states and 86 transitions. [2025-04-30 10:18:57,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 44 transitions, 200 flow [2025-04-30 10:18:57,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 44 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:18:57,025 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 115 flow [2025-04-30 10:18:57,025 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-04-30 10:18:57,026 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 14 predicate places. [2025-04-30 10:18:57,026 INFO L485 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 115 flow [2025-04-30 10:18:57,026 INFO L486 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-04-30 10:18:57,026 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:18:57,026 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:57,026 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:18:57,027 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-30 10:18:57,027 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:57,027 INFO L85 PathProgramCache]: Analyzing trace with hash -511707504, now seen corresponding path program 1 times [2025-04-30 10:18:57,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:57,027 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327526021] [2025-04-30 10:18:57,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:57,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:57,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:18:57,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:18:57,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:57,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:57,145 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:18:57,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:57,146 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327526021] [2025-04-30 10:18:57,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327526021] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:18:57,146 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622038986] [2025-04-30 10:18:57,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:57,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:18:57,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:18:57,148 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-04-30 10:18:57,150 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-04-30 10:18:57,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:18:57,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:18:57,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:57,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:57,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-30 10:18:57,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:18:57,241 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:18:57,242 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:18:57,312 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:18:57,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622038986] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:18:57,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:18:57,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-04-30 10:18:57,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497412905] [2025-04-30 10:18:57,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:18:57,313 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-30 10:18:57,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:57,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-30 10:18:57,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-04-30 10:18:57,333 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-04-30 10:18:57,333 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-04-30 10:18:57,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:18:57,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-04-30 10:18:57,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:18:57,489 INFO L116 PetriNetUnfolderBase]: 27/117 cut-off events. [2025-04-30 10:18:57,489 INFO L117 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-04-30 10:18:57,491 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 11. Compared 324 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-04-30 10:18:57,491 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 16 selfloop transitions, 15 changer transitions 0/38 dead transitions. [2025-04-30 10:18:57,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 38 transitions, 225 flow [2025-04-30 10:18:57,492 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-30 10:18:57,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-30 10:18:57,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 154 transitions. [2025-04-30 10:18:57,494 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3802469135802469 [2025-04-30 10:18:57,494 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 115 flow. Second operand 15 states and 154 transitions. [2025-04-30 10:18:57,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 38 transitions, 225 flow [2025-04-30 10:18:57,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 38 transitions, 216 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-04-30 10:18:57,496 INFO L231 Difference]: Finished difference. Result has 57 places, 38 transitions, 203 flow [2025-04-30 10:18:57,496 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-04-30 10:18:57,498 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 28 predicate places. [2025-04-30 10:18:57,499 INFO L485 AbstractCegarLoop]: Abstraction has has 57 places, 38 transitions, 203 flow [2025-04-30 10:18:57,499 INFO L486 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-04-30 10:18:57,499 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:18:57,499 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:57,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-30 10:18:57,703 WARN L466 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-04-30 10:18:57,703 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-30 10:18:57,704 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:57,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1809161808, now seen corresponding path program 2 times [2025-04-30 10:18:57,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:57,704 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612211444] [2025-04-30 10:18:57,704 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:18:57,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:57,716 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-30 10:18:57,742 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 28 statements. [2025-04-30 10:18:57,742 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:18:57,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:58,247 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-04-30 10:18:58,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:58,247 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612211444] [2025-04-30 10:18:58,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612211444] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:18:58,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:18:58,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:18:58,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645916621] [2025-04-30 10:18:58,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:18:58,248 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:18:58,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:58,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:18:58,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:18:58,254 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-04-30 10:18:58,255 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-04-30 10:18:58,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:18:58,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-04-30 10:18:58,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:18:58,419 INFO L116 PetriNetUnfolderBase]: 30/119 cut-off events. [2025-04-30 10:18:58,419 INFO L117 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2025-04-30 10:18:58,419 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 317 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-04-30 10:18:58,420 INFO L140 encePairwiseOnDemand]: 20/27 looper letters, 38 selfloop transitions, 6 changer transitions 4/53 dead transitions. [2025-04-30 10:18:58,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 53 transitions, 341 flow [2025-04-30 10:18:58,420 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:18:58,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:18:58,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2025-04-30 10:18:58,421 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5370370370370371 [2025-04-30 10:18:58,421 INFO L175 Difference]: Start difference. First operand has 57 places, 38 transitions, 203 flow. Second operand 6 states and 87 transitions. [2025-04-30 10:18:58,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 53 transitions, 341 flow [2025-04-30 10:18:58,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 53 transitions, 331 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-04-30 10:18:58,423 INFO L231 Difference]: Finished difference. Result has 62 places, 41 transitions, 233 flow [2025-04-30 10:18:58,423 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-04-30 10:18:58,424 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 33 predicate places. [2025-04-30 10:18:58,424 INFO L485 AbstractCegarLoop]: Abstraction has has 62 places, 41 transitions, 233 flow [2025-04-30 10:18:58,424 INFO L486 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-04-30 10:18:58,424 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:18:58,424 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:58,424 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:18:58,424 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-30 10:18:58,425 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:58,425 INFO L85 PathProgramCache]: Analyzing trace with hash 44720774, now seen corresponding path program 1 times [2025-04-30 10:18:58,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:58,425 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701275655] [2025-04-30 10:18:58,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:58,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:58,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-30 10:18:58,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-30 10:18:58,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:58,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:58,643 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:18:58,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:58,644 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701275655] [2025-04-30 10:18:58,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701275655] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:18:58,644 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565785396] [2025-04-30 10:18:58,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:58,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:18:58,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:18:58,646 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-04-30 10:18:58,648 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-04-30 10:18:58,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-30 10:18:58,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-30 10:18:58,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:58,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:58,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-30 10:18:58,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:18:58,768 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:18:58,769 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:18:58,904 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:18:58,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565785396] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:18:58,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:18:58,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 22 [2025-04-30 10:18:58,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134484333] [2025-04-30 10:18:58,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:18:58,905 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-30 10:18:58,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:58,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-30 10:18:58,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-04-30 10:18:58,923 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-04-30 10:18:58,924 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-04-30 10:18:58,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:18:58,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-04-30 10:18:58,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:18:59,097 INFO L116 PetriNetUnfolderBase]: 26/123 cut-off events. [2025-04-30 10:18:59,098 INFO L117 PetriNetUnfolderBase]: For 168/169 co-relation queries the response was YES. [2025-04-30 10:18:59,098 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-04-30 10:18:59,098 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 19 selfloop transitions, 21 changer transitions 0/47 dead transitions. [2025-04-30 10:18:59,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 47 transitions, 367 flow [2025-04-30 10:18:59,099 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-30 10:18:59,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-30 10:18:59,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 207 transitions. [2025-04-30 10:18:59,100 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.36507936507936506 [2025-04-30 10:18:59,100 INFO L175 Difference]: Start difference. First operand has 62 places, 41 transitions, 233 flow. Second operand 21 states and 207 transitions. [2025-04-30 10:18:59,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 47 transitions, 367 flow [2025-04-30 10:18:59,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 47 transitions, 359 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-30 10:18:59,105 INFO L231 Difference]: Finished difference. Result has 82 places, 47 transitions, 336 flow [2025-04-30 10:18:59,105 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-04-30 10:18:59,106 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 53 predicate places. [2025-04-30 10:18:59,106 INFO L485 AbstractCegarLoop]: Abstraction has has 82 places, 47 transitions, 336 flow [2025-04-30 10:18:59,106 INFO L486 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-04-30 10:18:59,106 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:18:59,106 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:59,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-30 10:18:59,306 WARN L466 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-04-30 10:18:59,307 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-30 10:18:59,307 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:59,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1741088197, now seen corresponding path program 2 times [2025-04-30 10:18:59,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:59,307 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303543085] [2025-04-30 10:18:59,307 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:18:59,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:59,314 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-04-30 10:18:59,344 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 42 statements. [2025-04-30 10:18:59,344 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:18:59,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:01,391 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-04-30 10:19:01,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:01,391 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303543085] [2025-04-30 10:19:01,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303543085] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:19:01,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:19:01,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:19:01,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820664891] [2025-04-30 10:19:01,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:19:01,393 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:19:01,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:01,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:19:01,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:19:01,439 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2025-04-30 10:19:01,439 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-04-30 10:19:01,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:19:01,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2025-04-30 10:19:01,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:19:02,332 INFO L116 PetriNetUnfolderBase]: 58/184 cut-off events. [2025-04-30 10:19:02,332 INFO L117 PetriNetUnfolderBase]: For 221/221 co-relation queries the response was YES. [2025-04-30 10:19:02,333 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 583 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-04-30 10:19:02,334 INFO L140 encePairwiseOnDemand]: 17/27 looper letters, 60 selfloop transitions, 19 changer transitions 6/86 dead transitions. [2025-04-30 10:19:02,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 86 transitions, 632 flow [2025-04-30 10:19:02,334 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-30 10:19:02,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-30 10:19:02,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 119 transitions. [2025-04-30 10:19:02,335 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.33903133903133903 [2025-04-30 10:19:02,335 INFO L175 Difference]: Start difference. First operand has 82 places, 47 transitions, 336 flow. Second operand 13 states and 119 transitions. [2025-04-30 10:19:02,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 86 transitions, 632 flow [2025-04-30 10:19:02,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 86 transitions, 589 flow, removed 1 selfloop flow, removed 13 redundant places. [2025-04-30 10:19:02,339 INFO L231 Difference]: Finished difference. Result has 86 places, 61 transitions, 416 flow [2025-04-30 10:19:02,339 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-04-30 10:19:02,339 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 57 predicate places. [2025-04-30 10:19:02,340 INFO L485 AbstractCegarLoop]: Abstraction has has 86 places, 61 transitions, 416 flow [2025-04-30 10:19:02,340 INFO L486 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-04-30 10:19:02,340 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:19:02,340 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:19:02,340 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:19:02,340 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-30 10:19:02,341 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:02,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1309616751, now seen corresponding path program 3 times [2025-04-30 10:19:02,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:02,341 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118900667] [2025-04-30 10:19:02,341 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:19:02,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:02,352 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 11 equivalence classes. [2025-04-30 10:19:02,382 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 12 of 42 statements. [2025-04-30 10:19:02,383 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-30 10:19:02,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:03,656 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-04-30 10:19:03,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:03,657 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118900667] [2025-04-30 10:19:03,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118900667] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:19:03,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:19:03,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:19:03,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610802963] [2025-04-30 10:19:03,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:19:03,657 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:19:03,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:03,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:19:03,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:19:03,709 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2025-04-30 10:19:03,709 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-04-30 10:19:03,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:19:03,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2025-04-30 10:19:03,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:19:04,454 INFO L116 PetriNetUnfolderBase]: 62/202 cut-off events. [2025-04-30 10:19:04,454 INFO L117 PetriNetUnfolderBase]: For 324/324 co-relation queries the response was YES. [2025-04-30 10:19:04,454 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-04-30 10:19:04,455 INFO L140 encePairwiseOnDemand]: 17/27 looper letters, 59 selfloop transitions, 28 changer transitions 7/95 dead transitions. [2025-04-30 10:19:04,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 95 transitions, 777 flow [2025-04-30 10:19:04,455 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-30 10:19:04,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-30 10:19:04,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 132 transitions. [2025-04-30 10:19:04,456 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2875816993464052 [2025-04-30 10:19:04,456 INFO L175 Difference]: Start difference. First operand has 86 places, 61 transitions, 416 flow. Second operand 17 states and 132 transitions. [2025-04-30 10:19:04,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 95 transitions, 777 flow [2025-04-30 10:19:04,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 95 transitions, 746 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-04-30 10:19:04,460 INFO L231 Difference]: Finished difference. Result has 102 places, 73 transitions, 559 flow [2025-04-30 10:19:04,460 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-04-30 10:19:04,460 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 73 predicate places. [2025-04-30 10:19:04,460 INFO L485 AbstractCegarLoop]: Abstraction has has 102 places, 73 transitions, 559 flow [2025-04-30 10:19:04,460 INFO L486 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-04-30 10:19:04,460 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:19:04,460 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:19:04,460 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:19:04,461 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-30 10:19:04,461 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:04,461 INFO L85 PathProgramCache]: Analyzing trace with hash 783190556, now seen corresponding path program 1 times [2025-04-30 10:19:04,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:04,461 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720386341] [2025-04-30 10:19:04,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:19:04,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:04,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-30 10:19:04,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-30 10:19:04,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:19:04,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:05,598 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-04-30 10:19:05,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:05,598 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720386341] [2025-04-30 10:19:05,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720386341] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:19:05,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:19:05,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:19:05,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514166361] [2025-04-30 10:19:05,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:19:05,600 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:19:05,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:05,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:19:05,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:19:05,612 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2025-04-30 10:19:05,612 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-04-30 10:19:05,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:19:05,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2025-04-30 10:19:05,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:19:05,883 INFO L116 PetriNetUnfolderBase]: 58/189 cut-off events. [2025-04-30 10:19:05,883 INFO L117 PetriNetUnfolderBase]: For 388/388 co-relation queries the response was YES. [2025-04-30 10:19:05,883 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 626 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-04-30 10:19:05,884 INFO L140 encePairwiseOnDemand]: 19/27 looper letters, 73 selfloop transitions, 16 changer transitions 4/94 dead transitions. [2025-04-30 10:19:05,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 94 transitions, 871 flow [2025-04-30 10:19:05,885 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:19:05,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-30 10:19:05,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 82 transitions. [2025-04-30 10:19:05,886 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3374485596707819 [2025-04-30 10:19:05,886 INFO L175 Difference]: Start difference. First operand has 102 places, 73 transitions, 559 flow. Second operand 9 states and 82 transitions. [2025-04-30 10:19:05,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 94 transitions, 871 flow [2025-04-30 10:19:05,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 94 transitions, 831 flow, removed 10 selfloop flow, removed 3 redundant places. [2025-04-30 10:19:05,892 INFO L231 Difference]: Finished difference. Result has 104 places, 72 transitions, 555 flow [2025-04-30 10:19:05,892 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-04-30 10:19:05,892 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 75 predicate places. [2025-04-30 10:19:05,892 INFO L485 AbstractCegarLoop]: Abstraction has has 104 places, 72 transitions, 555 flow [2025-04-30 10:19:05,893 INFO L486 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-04-30 10:19:05,893 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:19:05,893 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:19:05,893 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-30 10:19:05,893 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-30 10:19:05,894 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:05,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1918046737, now seen corresponding path program 4 times [2025-04-30 10:19:05,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:05,894 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036204782] [2025-04-30 10:19:05,894 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:19:05,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:05,903 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-04-30 10:19:05,938 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-04-30 10:19:05,938 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-30 10:19:05,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:18,360 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-04-30 10:19:18,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:18,361 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036204782] [2025-04-30 10:19:18,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036204782] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:19:18,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:19:18,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-30 10:19:18,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033815976] [2025-04-30 10:19:18,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:19:18,361 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:19:18,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:18,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:19:18,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:19:18,391 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-04-30 10:19:18,391 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-04-30 10:19:18,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:19:18,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-04-30 10:19:18,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:19:28,155 INFO L116 PetriNetUnfolderBase]: 46/179 cut-off events. [2025-04-30 10:19:28,155 INFO L117 PetriNetUnfolderBase]: For 423/430 co-relation queries the response was YES. [2025-04-30 10:19:28,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 706 conditions, 179 events. 46/179 cut-off events. For 423/430 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 641 event pairs, 2 based on Foata normal form. 13/192 useless extension candidates. Maximal degree in co-relation 630. Up to 42 conditions per place. [2025-04-30 10:19:28,157 INFO L140 encePairwiseOnDemand]: 15/27 looper letters, 51 selfloop transitions, 28 changer transitions 18/105 dead transitions. [2025-04-30 10:19:28,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 105 transitions, 912 flow [2025-04-30 10:19:28,157 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-30 10:19:28,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-30 10:19:28,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 212 transitions. [2025-04-30 10:19:28,158 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43621399176954734 [2025-04-30 10:19:28,158 INFO L175 Difference]: Start difference. First operand has 104 places, 72 transitions, 555 flow. Second operand 18 states and 212 transitions. [2025-04-30 10:19:28,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 105 transitions, 912 flow [2025-04-30 10:19:28,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 105 transitions, 865 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-04-30 10:19:28,165 INFO L231 Difference]: Finished difference. Result has 124 places, 72 transitions, 600 flow [2025-04-30 10:19:28,165 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-04-30 10:19:28,166 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 95 predicate places. [2025-04-30 10:19:28,166 INFO L485 AbstractCegarLoop]: Abstraction has has 124 places, 72 transitions, 600 flow [2025-04-30 10:19:28,166 INFO L486 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-04-30 10:19:28,166 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:19:28,166 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:19:28,166 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-30 10:19:28,166 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-30 10:19:28,167 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:28,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1625103441, now seen corresponding path program 5 times [2025-04-30 10:19:28,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:28,167 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413055932] [2025-04-30 10:19:28,167 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:19:28,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:28,180 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 42 statements into 11 equivalence classes. [2025-04-30 10:19:28,211 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 42 of 42 statements. [2025-04-30 10:19:28,211 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-04-30 10:19:28,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:30,393 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 117 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:19:30,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:30,393 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413055932] [2025-04-30 10:19:30,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413055932] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:19:30,393 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543789888] [2025-04-30 10:19:30,393 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:19:30,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:19:30,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:19:30,395 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-04-30 10:19:30,396 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-04-30 10:19:30,438 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 42 statements into 11 equivalence classes. [2025-04-30 10:19:30,521 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 42 of 42 statements. [2025-04-30 10:19:30,521 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-04-30 10:19:30,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:30,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-04-30 10:19:30,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:19:31,816 INFO L354 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-04-30 10:19:32,024 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:19:32,024 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 11 [2025-04-30 10:19:32,200 INFO L325 Elim1Store]: treesize reduction 180, result has 38.1 percent of original size [2025-04-30 10:19:32,201 INFO L354 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 55 case distinctions, treesize of input 90 treesize of output 141 [2025-04-30 10:19:32,858 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:19:32,859 INFO L354 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 455 treesize of output 313 [2025-04-30 10:19:33,920 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:19:33,920 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:19:34,253 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2025-04-30 10:19:34,258 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2025-04-30 10:19:35,316 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-04-30 10:19:35,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543789888] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-30 10:19:35,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:19:35,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [26, 24] total 55 [2025-04-30 10:19:35,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614884118] [2025-04-30 10:19:35,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:19:35,316 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:19:35,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:35,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:19:35,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=426, Invalid=2766, Unknown=0, NotChecked=0, Total=3192 [2025-04-30 10:19:35,322 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2025-04-30 10:19:35,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 72 transitions, 600 flow. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 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-04-30 10:19:35,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:19:35,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2025-04-30 10:19:35,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:19:36,158 INFO L116 PetriNetUnfolderBase]: 45/185 cut-off events. [2025-04-30 10:19:36,158 INFO L117 PetriNetUnfolderBase]: For 668/672 co-relation queries the response was YES. [2025-04-30 10:19:36,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 835 conditions, 185 events. 45/185 cut-off events. For 668/672 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 660 event pairs, 0 based on Foata normal form. 7/192 useless extension candidates. Maximal degree in co-relation 772. Up to 25 conditions per place. [2025-04-30 10:19:36,159 INFO L140 encePairwiseOnDemand]: 15/27 looper letters, 61 selfloop transitions, 50 changer transitions 2/118 dead transitions. [2025-04-30 10:19:36,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 118 transitions, 1132 flow [2025-04-30 10:19:36,160 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-30 10:19:36,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-04-30 10:19:36,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 246 transitions. [2025-04-30 10:19:36,161 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37962962962962965 [2025-04-30 10:19:36,161 INFO L175 Difference]: Start difference. First operand has 124 places, 72 transitions, 600 flow. Second operand 24 states and 246 transitions. [2025-04-30 10:19:36,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 118 transitions, 1132 flow [2025-04-30 10:19:36,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 118 transitions, 981 flow, removed 45 selfloop flow, removed 14 redundant places. [2025-04-30 10:19:36,165 INFO L231 Difference]: Finished difference. Result has 130 places, 93 transitions, 798 flow [2025-04-30 10:19:36,165 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=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=798, PETRI_PLACES=130, PETRI_TRANSITIONS=93} [2025-04-30 10:19:36,166 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 101 predicate places. [2025-04-30 10:19:36,166 INFO L485 AbstractCegarLoop]: Abstraction has has 130 places, 93 transitions, 798 flow [2025-04-30 10:19:36,166 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 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-04-30 10:19:36,166 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:19:36,166 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:19:36,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-30 10:19:36,366 WARN L466 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-04-30 10:19:36,367 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-30 10:19:36,367 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:36,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1490896211, now seen corresponding path program 1 times [2025-04-30 10:19:36,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:36,367 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196356099] [2025-04-30 10:19:36,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:19:36,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:36,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-30 10:19:36,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-30 10:19:36,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:19:36,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:38,145 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-04-30 10:19:38,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:38,146 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196356099] [2025-04-30 10:19:38,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196356099] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:19:38,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:19:38,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:19:38,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606198935] [2025-04-30 10:19:38,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:19:38,146 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:19:38,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:38,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:19:38,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:19:38,192 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2025-04-30 10:19:38,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 93 transitions, 798 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-04-30 10:19:38,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:19:38,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2025-04-30 10:19:38,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:19:39,078 INFO L116 PetriNetUnfolderBase]: 45/199 cut-off events. [2025-04-30 10:19:39,078 INFO L117 PetriNetUnfolderBase]: For 555/555 co-relation queries the response was YES. [2025-04-30 10:19:39,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 855 conditions, 199 events. 45/199 cut-off events. For 555/555 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 819 event pairs, 13 based on Foata normal form. 3/200 useless extension candidates. Maximal degree in co-relation 796. Up to 101 conditions per place. [2025-04-30 10:19:39,079 INFO L140 encePairwiseOnDemand]: 17/27 looper letters, 64 selfloop transitions, 27 changer transitions 12/112 dead transitions. [2025-04-30 10:19:39,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 112 transitions, 1102 flow [2025-04-30 10:19:39,080 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-30 10:19:39,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-30 10:19:39,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 147 transitions. [2025-04-30 10:19:39,081 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3402777777777778 [2025-04-30 10:19:39,081 INFO L175 Difference]: Start difference. First operand has 130 places, 93 transitions, 798 flow. Second operand 16 states and 147 transitions. [2025-04-30 10:19:39,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 112 transitions, 1102 flow [2025-04-30 10:19:39,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 112 transitions, 1013 flow, removed 17 selfloop flow, removed 10 redundant places. [2025-04-30 10:19:39,085 INFO L231 Difference]: Finished difference. Result has 137 places, 96 transitions, 797 flow [2025-04-30 10:19:39,086 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=719, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=797, PETRI_PLACES=137, PETRI_TRANSITIONS=96} [2025-04-30 10:19:39,086 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 108 predicate places. [2025-04-30 10:19:39,086 INFO L485 AbstractCegarLoop]: Abstraction has has 137 places, 96 transitions, 797 flow [2025-04-30 10:19:39,086 INFO L486 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-04-30 10:19:39,086 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:19:39,086 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:19:39,086 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-30 10:19:39,087 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-30 10:19:39,087 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:39,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1462296851, now seen corresponding path program 2 times [2025-04-30 10:19:39,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:39,087 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712900396] [2025-04-30 10:19:39,087 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:19:39,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:39,093 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-04-30 10:19:39,102 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 43 statements. [2025-04-30 10:19:39,102 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:19:39,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:40,510 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-04-30 10:19:40,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:40,510 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712900396] [2025-04-30 10:19:40,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712900396] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:19:40,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:19:40,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:19:40,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311090876] [2025-04-30 10:19:40,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:19:40,511 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:19:40,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:40,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:19:40,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:19:40,541 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2025-04-30 10:19:40,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 96 transitions, 797 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-04-30 10:19:40,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:19:40,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2025-04-30 10:19:40,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:19:41,076 INFO L116 PetriNetUnfolderBase]: 42/193 cut-off events. [2025-04-30 10:19:41,076 INFO L117 PetriNetUnfolderBase]: For 530/530 co-relation queries the response was YES. [2025-04-30 10:19:41,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 834 conditions, 193 events. 42/193 cut-off events. For 530/530 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 777 event pairs, 7 based on Foata normal form. 3/196 useless extension candidates. Maximal degree in co-relation 768. Up to 91 conditions per place. [2025-04-30 10:19:41,077 INFO L140 encePairwiseOnDemand]: 16/27 looper letters, 63 selfloop transitions, 30 changer transitions 7/109 dead transitions. [2025-04-30 10:19:41,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 109 transitions, 1044 flow [2025-04-30 10:19:41,078 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-30 10:19:41,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-30 10:19:41,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 134 transitions. [2025-04-30 10:19:41,079 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3544973544973545 [2025-04-30 10:19:41,079 INFO L175 Difference]: Start difference. First operand has 137 places, 96 transitions, 797 flow. Second operand 14 states and 134 transitions. [2025-04-30 10:19:41,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 109 transitions, 1044 flow [2025-04-30 10:19:41,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 109 transitions, 994 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-04-30 10:19:41,084 INFO L231 Difference]: Finished difference. Result has 139 places, 95 transitions, 811 flow [2025-04-30 10:19:41,084 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=753, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=811, PETRI_PLACES=139, PETRI_TRANSITIONS=95} [2025-04-30 10:19:41,084 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 110 predicate places. [2025-04-30 10:19:41,084 INFO L485 AbstractCegarLoop]: Abstraction has has 139 places, 95 transitions, 811 flow [2025-04-30 10:19:41,084 INFO L486 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-04-30 10:19:41,084 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:19:41,085 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:19:41,085 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-30 10:19:41,085 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-30 10:19:41,085 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:41,085 INFO L85 PathProgramCache]: Analyzing trace with hash -600748175, now seen corresponding path program 3 times [2025-04-30 10:19:41,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:41,085 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621539202] [2025-04-30 10:19:41,085 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:19:41,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:41,091 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 11 equivalence classes. [2025-04-30 10:19:41,100 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 13 of 43 statements. [2025-04-30 10:19:41,100 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-30 10:19:41,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:42,775 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-04-30 10:19:42,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:42,776 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621539202] [2025-04-30 10:19:42,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621539202] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:19:42,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:19:42,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:19:42,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526550868] [2025-04-30 10:19:42,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:19:42,776 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:19:42,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:42,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:19:42,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:19:42,820 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2025-04-30 10:19:42,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 95 transitions, 811 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-04-30 10:19:42,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:19:42,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2025-04-30 10:19:42,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:19:43,417 INFO L116 PetriNetUnfolderBase]: 38/180 cut-off events. [2025-04-30 10:19:43,417 INFO L117 PetriNetUnfolderBase]: For 507/507 co-relation queries the response was YES. [2025-04-30 10:19:43,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 807 conditions, 180 events. 38/180 cut-off events. For 507/507 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 671 event pairs, 9 based on Foata normal form. 3/183 useless extension candidates. Maximal degree in co-relation 745. Up to 87 conditions per place. [2025-04-30 10:19:43,418 INFO L140 encePairwiseOnDemand]: 17/27 looper letters, 61 selfloop transitions, 23 changer transitions 11/104 dead transitions. [2025-04-30 10:19:43,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 104 transitions, 1038 flow [2025-04-30 10:19:43,419 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-30 10:19:43,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-30 10:19:43,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 138 transitions. [2025-04-30 10:19:43,419 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.34074074074074073 [2025-04-30 10:19:43,419 INFO L175 Difference]: Start difference. First operand has 139 places, 95 transitions, 811 flow. Second operand 15 states and 138 transitions. [2025-04-30 10:19:43,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 104 transitions, 1038 flow [2025-04-30 10:19:43,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 104 transitions, 968 flow, removed 3 selfloop flow, removed 13 redundant places. [2025-04-30 10:19:43,424 INFO L231 Difference]: Finished difference. Result has 140 places, 90 transitions, 758 flow [2025-04-30 10:19:43,424 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=747, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=758, PETRI_PLACES=140, PETRI_TRANSITIONS=90} [2025-04-30 10:19:43,425 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 111 predicate places. [2025-04-30 10:19:43,425 INFO L485 AbstractCegarLoop]: Abstraction has has 140 places, 90 transitions, 758 flow [2025-04-30 10:19:43,425 INFO L486 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-04-30 10:19:43,425 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:19:43,425 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:19:43,425 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-30 10:19:43,425 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-30 10:19:43,426 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:43,426 INFO L85 PathProgramCache]: Analyzing trace with hash 653260709, now seen corresponding path program 1 times [2025-04-30 10:19:43,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:43,426 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178198851] [2025-04-30 10:19:43,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:19:43,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:43,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-30 10:19:43,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-30 10:19:43,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:19:43,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:45,208 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-04-30 10:19:45,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:45,209 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178198851] [2025-04-30 10:19:45,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178198851] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:19:45,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:19:45,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-30 10:19:45,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168857790] [2025-04-30 10:19:45,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:19:45,209 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:19:45,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:45,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:19:45,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:19:45,242 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 27 [2025-04-30 10:19:45,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 90 transitions, 758 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-04-30 10:19:45,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:19:45,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 27 [2025-04-30 10:19:45,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:19:45,714 INFO L116 PetriNetUnfolderBase]: 44/199 cut-off events. [2025-04-30 10:19:45,714 INFO L117 PetriNetUnfolderBase]: For 562/562 co-relation queries the response was YES. [2025-04-30 10:19:45,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 900 conditions, 199 events. 44/199 cut-off events. For 562/562 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 808 event pairs, 11 based on Foata normal form. 3/202 useless extension candidates. Maximal degree in co-relation 839. Up to 43 conditions per place. [2025-04-30 10:19:45,715 INFO L140 encePairwiseOnDemand]: 18/27 looper letters, 82 selfloop transitions, 29 changer transitions 0/117 dead transitions. [2025-04-30 10:19:45,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 117 transitions, 1157 flow [2025-04-30 10:19:45,715 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-30 10:19:45,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-30 10:19:45,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 105 transitions. [2025-04-30 10:19:45,716 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35353535353535354 [2025-04-30 10:19:45,716 INFO L175 Difference]: Start difference. First operand has 140 places, 90 transitions, 758 flow. Second operand 11 states and 105 transitions. [2025-04-30 10:19:45,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 117 transitions, 1157 flow [2025-04-30 10:19:45,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 117 transitions, 1092 flow, removed 3 selfloop flow, removed 13 redundant places. [2025-04-30 10:19:45,721 INFO L231 Difference]: Finished difference. Result has 135 places, 103 transitions, 899 flow [2025-04-30 10:19:45,721 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=899, PETRI_PLACES=135, PETRI_TRANSITIONS=103} [2025-04-30 10:19:45,721 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 106 predicate places. [2025-04-30 10:19:45,721 INFO L485 AbstractCegarLoop]: Abstraction has has 135 places, 103 transitions, 899 flow [2025-04-30 10:19:45,721 INFO L486 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-04-30 10:19:45,721 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:19:45,721 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:19:45,721 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-30 10:19:45,722 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-30 10:19:45,722 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:45,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1161400529, now seen corresponding path program 1 times [2025-04-30 10:19:45,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:45,722 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38325011] [2025-04-30 10:19:45,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:19:45,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:45,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-30 10:19:45,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-30 10:19:45,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:19:45,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:49,429 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-04-30 10:19:49,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:49,430 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38325011] [2025-04-30 10:19:49,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38325011] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:19:49,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:19:49,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:19:49,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537650361] [2025-04-30 10:19:49,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:19:49,430 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:19:49,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:49,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:19:49,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:19:49,514 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2025-04-30 10:19:49,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 103 transitions, 899 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-04-30 10:19:49,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:19:49,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2025-04-30 10:19:49,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:19:50,486 INFO L116 PetriNetUnfolderBase]: 40/203 cut-off events. [2025-04-30 10:19:50,487 INFO L117 PetriNetUnfolderBase]: For 806/806 co-relation queries the response was YES. [2025-04-30 10:19:50,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 989 conditions, 203 events. 40/203 cut-off events. For 806/806 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 898 event pairs, 8 based on Foata normal form. 6/208 useless extension candidates. Maximal degree in co-relation 885. Up to 98 conditions per place. [2025-04-30 10:19:50,488 INFO L140 encePairwiseOnDemand]: 16/27 looper letters, 72 selfloop transitions, 22 changer transitions 17/119 dead transitions. [2025-04-30 10:19:50,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 119 transitions, 1267 flow [2025-04-30 10:19:50,489 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-30 10:19:50,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-30 10:19:50,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 143 transitions. [2025-04-30 10:19:50,489 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.33101851851851855 [2025-04-30 10:19:50,489 INFO L175 Difference]: Start difference. First operand has 135 places, 103 transitions, 899 flow. Second operand 16 states and 143 transitions. [2025-04-30 10:19:50,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 119 transitions, 1267 flow [2025-04-30 10:19:50,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 119 transitions, 1230 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-04-30 10:19:50,495 INFO L231 Difference]: Finished difference. Result has 149 places, 98 transitions, 888 flow [2025-04-30 10:19:50,495 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=888, PETRI_PLACES=149, PETRI_TRANSITIONS=98} [2025-04-30 10:19:50,496 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 120 predicate places. [2025-04-30 10:19:50,496 INFO L485 AbstractCegarLoop]: Abstraction has has 149 places, 98 transitions, 888 flow [2025-04-30 10:19:50,496 INFO L486 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-04-30 10:19:50,496 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:19:50,496 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:19:50,496 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-30 10:19:50,496 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-30 10:19:50,497 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:50,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1509955229, now seen corresponding path program 2 times [2025-04-30 10:19:50,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:50,497 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630629894] [2025-04-30 10:19:50,497 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:19:50,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:50,502 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-04-30 10:19:50,512 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 43 statements. [2025-04-30 10:19:50,512 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:19:50,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:51,680 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-04-30 10:19:51,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:51,681 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630629894] [2025-04-30 10:19:51,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630629894] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:19:51,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:19:51,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:19:51,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342513995] [2025-04-30 10:19:51,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:19:51,681 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:19:51,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:51,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:19:51,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:19:51,724 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2025-04-30 10:19:51,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 98 transitions, 888 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-04-30 10:19:51,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:19:51,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2025-04-30 10:19:51,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:19:52,410 INFO L116 PetriNetUnfolderBase]: 40/198 cut-off events. [2025-04-30 10:19:52,410 INFO L117 PetriNetUnfolderBase]: For 860/860 co-relation queries the response was YES. [2025-04-30 10:19:52,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 991 conditions, 198 events. 40/198 cut-off events. For 860/860 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 858 event pairs, 10 based on Foata normal form. 6/203 useless extension candidates. Maximal degree in co-relation 916. Up to 98 conditions per place. [2025-04-30 10:19:52,412 INFO L140 encePairwiseOnDemand]: 16/27 looper letters, 73 selfloop transitions, 22 changer transitions 13/116 dead transitions. [2025-04-30 10:19:52,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 116 transitions, 1253 flow [2025-04-30 10:19:52,412 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-30 10:19:52,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-30 10:19:52,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 137 transitions. [2025-04-30 10:19:52,414 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.33827160493827163 [2025-04-30 10:19:52,414 INFO L175 Difference]: Start difference. First operand has 149 places, 98 transitions, 888 flow. Second operand 15 states and 137 transitions. [2025-04-30 10:19:52,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 116 transitions, 1253 flow [2025-04-30 10:19:52,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 116 transitions, 1188 flow, removed 16 selfloop flow, removed 13 redundant places. [2025-04-30 10:19:52,420 INFO L231 Difference]: Finished difference. Result has 147 places, 99 transitions, 906 flow [2025-04-30 10:19:52,420 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=835, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=906, PETRI_PLACES=147, PETRI_TRANSITIONS=99} [2025-04-30 10:19:52,420 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 118 predicate places. [2025-04-30 10:19:52,420 INFO L485 AbstractCegarLoop]: Abstraction has has 147 places, 99 transitions, 906 flow [2025-04-30 10:19:52,421 INFO L486 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-04-30 10:19:52,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:19:52,421 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:19:52,421 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-30 10:19:52,421 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-30 10:19:52,421 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:52,421 INFO L85 PathProgramCache]: Analyzing trace with hash -321554671, now seen corresponding path program 3 times [2025-04-30 10:19:52,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:52,422 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334694829] [2025-04-30 10:19:52,422 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:19:52,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:52,428 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 11 equivalence classes. [2025-04-30 10:19:52,437 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 13 of 43 statements. [2025-04-30 10:19:52,437 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-30 10:19:52,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15