./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/goblint-regression/06-symbeq_06-tricky_address1.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_06-tricky_address1.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 99f794c04b6feffb38c1e5c415a278bf34dda5287d389b184a9a7d818ab0b70e --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:18:49,703 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:18:49,759 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:49,762 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:18:49,763 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:18:49,783 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:18:49,784 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:18:49,784 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:18:49,784 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:18:49,784 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:18:49,784 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:18:49,784 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:18:49,786 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:18:49,786 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:18:49,786 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:18:49,786 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:18:49,787 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:18:49,787 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:18:49,787 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:18:49,787 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:18:49,787 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:18:49,787 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:18:49,787 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:18:49,787 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:18:49,787 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-04-30 10:18:49,787 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:18:49,787 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:18:49,788 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:18:49,788 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:18:49,788 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:18:49,788 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:18:49,788 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:18:49,788 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:18:49,788 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:18:49,789 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:18:49,789 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:18:49,789 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:18:49,789 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:18:49,789 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:18:49,789 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:18:49,789 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:18:49,789 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:18:49,789 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:18:49,789 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:18:49,789 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:18:49,789 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:18:49,789 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:18:49,790 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:18:49,790 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:18:49,790 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 -> 99f794c04b6feffb38c1e5c415a278bf34dda5287d389b184a9a7d818ab0b70e [2025-04-30 10:18:50,009 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:18:50,019 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:18:50,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:18:50,022 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:18:50,022 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:18:50,024 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/06-symbeq_06-tricky_address1.i [2025-04-30 10:18:51,320 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57e647a00/2110db7dd33b46df83bc5dafb736dec3/FLAG2e847c300 [2025-04-30 10:18:51,606 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:18:51,608 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_06-tricky_address1.i [2025-04-30 10:18:51,624 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57e647a00/2110db7dd33b46df83bc5dafb736dec3/FLAG2e847c300 [2025-04-30 10:18:52,321 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57e647a00/2110db7dd33b46df83bc5dafb736dec3 [2025-04-30 10:18:52,323 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:18:52,324 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:18:52,326 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:18:52,326 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:18:52,328 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:18:52,330 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:18:52" (1/1) ... [2025-04-30 10:18:52,330 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d3ca17d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:52, skipping insertion in model container [2025-04-30 10:18:52,331 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:18:52" (1/1) ... [2025-04-30 10:18:52,357 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:18:52,675 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:18:52,698 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:18:52,739 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:18:52,775 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:18:52,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:52 WrapperNode [2025-04-30 10:18:52,776 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:18:52,776 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:18:52,776 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:18:52,776 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:18:52,780 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:52" (1/1) ... [2025-04-30 10:18:52,790 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:52" (1/1) ... [2025-04-30 10:18:52,810 INFO L138 Inliner]: procedures = 265, calls = 74, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 130 [2025-04-30 10:18:52,810 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:18:52,811 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:18:52,811 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:18:52,811 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:18:52,817 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:52" (1/1) ... [2025-04-30 10:18:52,817 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:52" (1/1) ... [2025-04-30 10:18:52,820 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:52" (1/1) ... [2025-04-30 10:18:52,835 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:52,836 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:52" (1/1) ... [2025-04-30 10:18:52,836 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:52" (1/1) ... [2025-04-30 10:18:52,844 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:52" (1/1) ... [2025-04-30 10:18:52,845 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:52" (1/1) ... [2025-04-30 10:18:52,850 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:52" (1/1) ... [2025-04-30 10:18:52,851 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:52" (1/1) ... [2025-04-30 10:18:52,851 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:52" (1/1) ... [2025-04-30 10:18:52,859 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:18:52,860 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:18:52,860 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:18:52,860 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:18:52,864 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:52" (1/1) ... [2025-04-30 10:18:52,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:18:52,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:18:52,893 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:52,895 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:52,911 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-30 10:18:52,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-30 10:18:52,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-30 10:18:52,911 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-30 10:18:52,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:18:52,911 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-30 10:18:52,911 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-30 10:18:52,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:18:52,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:18:52,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:18:52,912 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,006 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:18:53,007 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:18:53,219 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-30 10:18:53,219 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:18:53,466 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:18:53,467 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:18:53,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:18:53 BoogieIcfgContainer [2025-04-30 10:18:53,467 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:18:53,469 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:18:53,469 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:18:53,472 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:18:53,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:18:52" (1/3) ... [2025-04-30 10:18:53,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e4899c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:18:53, skipping insertion in model container [2025-04-30 10:18:53,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:52" (2/3) ... [2025-04-30 10:18:53,476 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e4899c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:18:53, skipping insertion in model container [2025-04-30 10:18:53,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:18:53" (3/3) ... [2025-04-30 10:18:53,477 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_06-tricky_address1.i [2025-04-30 10:18:53,487 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:18:53,488 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_06-tricky_address1.i that has 2 procedures, 27 locations, 26 edges, 1 initial locations, 1 loop locations, and 6 error locations. [2025-04-30 10:18:53,488 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-30 10:18:53,520 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-30 10:18:53,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 27 transitions, 58 flow [2025-04-30 10:18:53,566 INFO L116 PetriNetUnfolderBase]: 1/26 cut-off events. [2025-04-30 10:18:53,568 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:18:53,571 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:53,571 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 27 transitions, 58 flow [2025-04-30 10:18:53,573 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 26 transitions, 55 flow [2025-04-30 10:18:53,582 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:18:53,590 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;@6262db5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:18:53,590 INFO L341 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-04-30 10:18:53,595 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:18:53,595 INFO L116 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-04-30 10:18:53,595 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:18:53,595 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:18:53,596 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-04-30 10:18:53,596 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:53,600 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:53,600 INFO L85 PathProgramCache]: Analyzing trace with hash 334666, now seen corresponding path program 1 times [2025-04-30 10:18:53,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:53,606 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178748424] [2025-04-30 10:18:53,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:53,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:53,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-30 10:18:53,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-30 10:18:53,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:53,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:53,847 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:53,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:53,849 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178748424] [2025-04-30 10:18:53,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178748424] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:18:53,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:18:53,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:18:53,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555371892] [2025-04-30 10:18:53,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:18:53,856 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:18:53,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:53,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:18:53,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:18:53,917 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-04-30 10:18:53,919 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:53,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:18:53,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-04-30 10:18:53,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:18:54,022 INFO L116 PetriNetUnfolderBase]: 37/119 cut-off events. [2025-04-30 10:18:54,022 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:18:54,023 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,025 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 18 selfloop transitions, 3 changer transitions 0/28 dead transitions. [2025-04-30 10:18:54,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 28 transitions, 101 flow [2025-04-30 10:18:54,027 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:18:54,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-30 10:18:54,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2025-04-30 10:18:54,036 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2025-04-30 10:18:54,038 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,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 28 transitions, 101 flow [2025-04-30 10:18:54,042 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,044 INFO L231 Difference]: Finished difference. Result has 33 places, 28 transitions, 78 flow [2025-04-30 10:18:54,046 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,049 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 4 predicate places. [2025-04-30 10:18:54,050 INFO L485 AbstractCegarLoop]: Abstraction has has 33 places, 28 transitions, 78 flow [2025-04-30 10:18:54,051 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,051 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:18:54,051 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-04-30 10:18:54,051 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:18:54,052 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,052 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:54,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1380424309, now seen corresponding path program 1 times [2025-04-30 10:18:54,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:54,053 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935894487] [2025-04-30 10:18:54,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:54,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:54,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-30 10:18:54,080 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,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:54,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:54,194 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,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:54,194 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935894487] [2025-04-30 10:18:54,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935894487] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:18:54,195 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064187342] [2025-04-30 10:18:54,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:54,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:18:54,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:18:54,197 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,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-30 10:18:54,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-30 10:18:54,267 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,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:54,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:54,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-30 10:18:54,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:18:54,307 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:54,308 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:18:54,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064187342] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:18:54,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:18:54,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-04-30 10:18:54,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121837101] [2025-04-30 10:18:54,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:18:54,309 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:18:54,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:54,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:18:54,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:18:54,319 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-04-30 10:18:54,320 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:54,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:18:54,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-04-30 10:18:54,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:18:54,397 INFO L116 PetriNetUnfolderBase]: 37/118 cut-off events. [2025-04-30 10:18:54,398 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-30 10:18:54,399 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:54,400 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 14 selfloop transitions, 6 changer transitions 0/27 dead transitions. [2025-04-30 10:18:54,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 27 transitions, 114 flow [2025-04-30 10:18:54,402 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:18:54,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:18:54,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2025-04-30 10:18:54,404 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42592592592592593 [2025-04-30 10:18:54,404 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:54,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 27 transitions, 114 flow [2025-04-30 10:18:54,405 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:54,406 INFO L231 Difference]: Finished difference. Result has 36 places, 27 transitions, 84 flow [2025-04-30 10:18:54,407 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:54,407 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 7 predicate places. [2025-04-30 10:18:54,407 INFO L485 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 84 flow [2025-04-30 10:18:54,407 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:54,407 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:18:54,407 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-04-30 10:18:54,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-30 10:18:54,608 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:54,608 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:54,608 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:54,608 INFO L85 PathProgramCache]: Analyzing trace with hash -156519055, now seen corresponding path program 1 times [2025-04-30 10:18:54,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:54,609 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032209322] [2025-04-30 10:18:54,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:54,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:54,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:18:54,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:18:54,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:54,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:54,651 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:54,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:54,652 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032209322] [2025-04-30 10:18:54,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032209322] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:18:54,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:18:54,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:18:54,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455097442] [2025-04-30 10:18:54,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:18:54,652 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:18:54,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:54,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:18:54,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:18:54,656 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-04-30 10:18:54,656 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:54,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:18:54,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-04-30 10:18:54,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:18:54,700 INFO L116 PetriNetUnfolderBase]: 37/117 cut-off events. [2025-04-30 10:18:54,700 INFO L117 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-04-30 10:18:54,700 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:54,701 INFO L140 encePairwiseOnDemand]: 24/27 looper letters, 15 selfloop transitions, 4 changer transitions 0/26 dead transitions. [2025-04-30 10:18:54,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 118 flow [2025-04-30 10:18:54,701 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:18:54,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:18:54,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2025-04-30 10:18:54,702 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2025-04-30 10:18:54,702 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:54,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 118 flow [2025-04-30 10:18:54,702 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:54,703 INFO L231 Difference]: Finished difference. Result has 31 places, 26 transitions, 66 flow [2025-04-30 10:18:54,703 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:54,703 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2025-04-30 10:18:54,704 INFO L485 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 66 flow [2025-04-30 10:18:54,704 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:54,704 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:18:54,704 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:54,704 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:18:54,704 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:54,704 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:54,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1527202598, now seen corresponding path program 1 times [2025-04-30 10:18:54,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:54,704 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479356968] [2025-04-30 10:18:54,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:54,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:54,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:18:54,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:18:54,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:54,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:54,765 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:54,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:54,766 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479356968] [2025-04-30 10:18:54,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479356968] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:18:54,766 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026423291] [2025-04-30 10:18:54,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:54,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:18:54,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:18:54,768 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:54,769 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:54,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:18:54,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:18:54,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:54,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:54,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-30 10:18:54,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:18:54,851 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:54,852 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:18:54,876 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:54,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026423291] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:18:54,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:18:54,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-04-30 10:18:54,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670970777] [2025-04-30 10:18:54,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:18:54,877 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:18:54,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:54,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:18:54,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:18:54,888 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-04-30 10:18:54,888 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:54,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:18:54,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-04-30 10:18:54,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:18:55,008 INFO L116 PetriNetUnfolderBase]: 37/121 cut-off events. [2025-04-30 10:18:55,008 INFO L117 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-04-30 10:18:55,008 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,010 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 15 selfloop transitions, 7 changer transitions 0/29 dead transitions. [2025-04-30 10:18:55,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 29 transitions, 125 flow [2025-04-30 10:18:55,011 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:18:55,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-30 10:18:55,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2025-04-30 10:18:55,012 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42328042328042326 [2025-04-30 10:18:55,012 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,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 29 transitions, 125 flow [2025-04-30 10:18:55,013 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,013 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 92 flow [2025-04-30 10:18:55,013 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,014 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 8 predicate places. [2025-04-30 10:18:55,014 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 92 flow [2025-04-30 10:18:55,014 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,014 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:18:55,014 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:55,023 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:55,214 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:55,215 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:55,215 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:55,215 INFO L85 PathProgramCache]: Analyzing trace with hash -512478458, now seen corresponding path program 2 times [2025-04-30 10:18:55,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:55,216 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350707674] [2025-04-30 10:18:55,216 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:18:55,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:55,226 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-30 10:18:55,260 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:55,260 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:18:55,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:56,066 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,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:56,067 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350707674] [2025-04-30 10:18:56,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350707674] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:18:56,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:18:56,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:18:56,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978882385] [2025-04-30 10:18:56,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:18:56,069 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:18:56,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:56,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:18:56,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:18:56,083 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-04-30 10:18:56,083 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,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:18:56,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-04-30 10:18:56,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:18:56,266 INFO L116 PetriNetUnfolderBase]: 43/128 cut-off events. [2025-04-30 10:18:56,267 INFO L117 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-04-30 10:18:56,267 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:56,267 INFO L140 encePairwiseOnDemand]: 20/27 looper letters, 28 selfloop transitions, 5 changer transitions 6/44 dead transitions. [2025-04-30 10:18:56,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 44 transitions, 200 flow [2025-04-30 10:18:56,268 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:18:56,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:18:56,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2025-04-30 10:18:56,269 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5308641975308642 [2025-04-30 10:18:56,269 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:56,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 44 transitions, 200 flow [2025-04-30 10:18:56,269 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:56,270 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 115 flow [2025-04-30 10:18:56,270 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:56,274 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 14 predicate places. [2025-04-30 10:18:56,274 INFO L485 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 115 flow [2025-04-30 10:18:56,274 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:56,274 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:18:56,274 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:56,274 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:18:56,274 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:56,274 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:56,274 INFO L85 PathProgramCache]: Analyzing trace with hash -511707504, now seen corresponding path program 1 times [2025-04-30 10:18:56,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:56,274 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086444229] [2025-04-30 10:18:56,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:56,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:56,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:18:56,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:18:56,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:56,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:56,392 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:56,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:56,392 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086444229] [2025-04-30 10:18:56,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086444229] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:18:56,392 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597540306] [2025-04-30 10:18:56,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:56,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:18:56,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:18:56,395 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:56,397 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:56,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:18:56,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:18:56,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:56,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:56,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-30 10:18:56,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:18:56,482 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:56,483 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:18:56,562 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:56,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597540306] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:18:56,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:18:56,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-04-30 10:18:56,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783186076] [2025-04-30 10:18:56,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:18:56,563 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-30 10:18:56,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:56,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-30 10:18:56,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-04-30 10:18:56,580 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-04-30 10:18:56,581 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:56,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:18:56,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-04-30 10:18:56,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:18:56,697 INFO L116 PetriNetUnfolderBase]: 27/117 cut-off events. [2025-04-30 10:18:56,698 INFO L117 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-04-30 10:18:56,698 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:56,698 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 16 selfloop transitions, 15 changer transitions 0/38 dead transitions. [2025-04-30 10:18:56,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 38 transitions, 225 flow [2025-04-30 10:18:56,699 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-30 10:18:56,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-30 10:18:56,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 154 transitions. [2025-04-30 10:18:56,700 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3802469135802469 [2025-04-30 10:18:56,700 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:56,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 38 transitions, 225 flow [2025-04-30 10:18:56,701 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:56,702 INFO L231 Difference]: Finished difference. Result has 57 places, 38 transitions, 203 flow [2025-04-30 10:18:56,702 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:56,703 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 28 predicate places. [2025-04-30 10:18:56,703 INFO L485 AbstractCegarLoop]: Abstraction has has 57 places, 38 transitions, 203 flow [2025-04-30 10:18:56,703 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:56,703 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:18:56,703 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:56,710 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:56,907 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:56,907 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:56,908 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:56,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1809161808, now seen corresponding path program 2 times [2025-04-30 10:18:56,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:56,908 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126825454] [2025-04-30 10:18:56,908 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:18:56,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:56,917 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-30 10:18:56,952 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:56,952 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:18:56,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:57,259 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:57,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:57,260 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126825454] [2025-04-30 10:18:57,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126825454] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:18:57,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:18:57,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:18:57,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714594213] [2025-04-30 10:18:57,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:18:57,260 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:18:57,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:57,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:18:57,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:18:57,266 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-04-30 10:18:57,266 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:57,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:18:57,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-04-30 10:18:57,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:18:57,408 INFO L116 PetriNetUnfolderBase]: 30/119 cut-off events. [2025-04-30 10:18:57,408 INFO L117 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2025-04-30 10:18:57,409 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:57,409 INFO L140 encePairwiseOnDemand]: 20/27 looper letters, 38 selfloop transitions, 6 changer transitions 4/53 dead transitions. [2025-04-30 10:18:57,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 53 transitions, 341 flow [2025-04-30 10:18:57,410 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:18:57,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:18:57,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2025-04-30 10:18:57,411 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5370370370370371 [2025-04-30 10:18:57,411 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:57,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 53 transitions, 341 flow [2025-04-30 10:18:57,413 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:57,414 INFO L231 Difference]: Finished difference. Result has 62 places, 41 transitions, 233 flow [2025-04-30 10:18:57,414 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:57,415 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 33 predicate places. [2025-04-30 10:18:57,415 INFO L485 AbstractCegarLoop]: Abstraction has has 62 places, 41 transitions, 233 flow [2025-04-30 10:18:57,415 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,415 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:18:57,415 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:57,415 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:18:57,415 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:57,416 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:57,416 INFO L85 PathProgramCache]: Analyzing trace with hash 44720774, now seen corresponding path program 1 times [2025-04-30 10:18:57,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:57,416 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934075873] [2025-04-30 10:18:57,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:57,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:57,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-30 10:18:57,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-30 10:18:57,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:57,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:57,639 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:57,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:57,639 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934075873] [2025-04-30 10:18:57,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934075873] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:18:57,639 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315881804] [2025-04-30 10:18:57,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:57,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:18:57,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:18:57,643 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:57,644 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:57,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-30 10:18:57,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-30 10:18:57,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:57,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:57,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-30 10:18:57,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:18:57,752 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:57,753 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:18:57,885 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:57,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315881804] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:18:57,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:18:57,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 22 [2025-04-30 10:18:57,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469792620] [2025-04-30 10:18:57,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:18:57,885 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-30 10:18:57,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:57,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-30 10:18:57,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-04-30 10:18:57,902 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-04-30 10:18:57,903 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:57,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:18:57,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-04-30 10:18:57,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:18:58,049 INFO L116 PetriNetUnfolderBase]: 26/123 cut-off events. [2025-04-30 10:18:58,049 INFO L117 PetriNetUnfolderBase]: For 168/169 co-relation queries the response was YES. [2025-04-30 10:18:58,050 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:58,050 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 19 selfloop transitions, 21 changer transitions 0/47 dead transitions. [2025-04-30 10:18:58,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 47 transitions, 367 flow [2025-04-30 10:18:58,051 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-30 10:18:58,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-30 10:18:58,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 207 transitions. [2025-04-30 10:18:58,053 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.36507936507936506 [2025-04-30 10:18:58,053 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:58,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 47 transitions, 367 flow [2025-04-30 10:18:58,055 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:58,056 INFO L231 Difference]: Finished difference. Result has 82 places, 47 transitions, 336 flow [2025-04-30 10:18:58,059 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:58,061 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 53 predicate places. [2025-04-30 10:18:58,061 INFO L485 AbstractCegarLoop]: Abstraction has has 82 places, 47 transitions, 336 flow [2025-04-30 10:18:58,061 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:58,061 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:18:58,062 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:58,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-30 10:18:58,262 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:58,262 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:58,263 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:58,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1741088197, now seen corresponding path program 2 times [2025-04-30 10:18:58,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:58,264 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239829613] [2025-04-30 10:18:58,264 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:18:58,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:58,272 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-04-30 10:18:58,317 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:58,318 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:18:58,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:00,437 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:00,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:00,438 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239829613] [2025-04-30 10:19:00,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239829613] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:19:00,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:19:00,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:19:00,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496745518] [2025-04-30 10:19:00,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:19:00,439 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:19:00,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:00,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:19:00,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:19:00,478 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2025-04-30 10:19:00,478 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:00,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:19:00,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2025-04-30 10:19:00,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:19:02,191 INFO L116 PetriNetUnfolderBase]: 58/184 cut-off events. [2025-04-30 10:19:02,191 INFO L117 PetriNetUnfolderBase]: For 221/221 co-relation queries the response was YES. [2025-04-30 10:19:02,193 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 39 conditions per place. [2025-04-30 10:19:02,193 INFO L140 encePairwiseOnDemand]: 17/27 looper letters, 60 selfloop transitions, 19 changer transitions 6/86 dead transitions. [2025-04-30 10:19:02,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 86 transitions, 632 flow [2025-04-30 10:19:02,194 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-30 10:19:02,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-30 10:19:02,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 119 transitions. [2025-04-30 10:19:02,195 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.33903133903133903 [2025-04-30 10:19:02,195 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,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 86 transitions, 632 flow [2025-04-30 10:19:02,198 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,199 INFO L231 Difference]: Finished difference. Result has 86 places, 61 transitions, 416 flow [2025-04-30 10:19:02,199 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,199 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 57 predicate places. [2025-04-30 10:19:02,199 INFO L485 AbstractCegarLoop]: Abstraction has has 86 places, 61 transitions, 416 flow [2025-04-30 10:19:02,199 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,199 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:19:02,200 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,200 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:19:02,200 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,200 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:02,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1309616751, now seen corresponding path program 3 times [2025-04-30 10:19:02,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:02,200 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582023793] [2025-04-30 10:19:02,200 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:19:02,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:02,213 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 11 equivalence classes. [2025-04-30 10:19:02,247 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,248 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-30 10:19:02,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:03,542 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,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:03,543 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582023793] [2025-04-30 10:19:03,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582023793] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:19:03,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:19:03,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:19:03,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950958711] [2025-04-30 10:19:03,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:19:03,543 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:19:03,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:03,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:19:03,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:19:03,569 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2025-04-30 10:19:03,569 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,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:19:03,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2025-04-30 10:19:03,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:19:04,518 INFO L116 PetriNetUnfolderBase]: 64/207 cut-off events. [2025-04-30 10:19:04,518 INFO L117 PetriNetUnfolderBase]: For 333/333 co-relation queries the response was YES. [2025-04-30 10:19:04,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 207 events. 64/207 cut-off events. For 333/333 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 721 event pairs, 16 based on Foata normal form. 3/210 useless extension candidates. Maximal degree in co-relation 642. Up to 52 conditions per place. [2025-04-30 10:19:04,519 INFO L140 encePairwiseOnDemand]: 17/27 looper letters, 60 selfloop transitions, 28 changer transitions 7/96 dead transitions. [2025-04-30 10:19:04,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 96 transitions, 783 flow [2025-04-30 10:19:04,520 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-30 10:19:04,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-30 10:19:04,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 133 transitions. [2025-04-30 10:19:04,521 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.289760348583878 [2025-04-30 10:19:04,521 INFO L175 Difference]: Start difference. First operand has 86 places, 61 transitions, 416 flow. Second operand 17 states and 133 transitions. [2025-04-30 10:19:04,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 96 transitions, 783 flow [2025-04-30 10:19:04,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 96 transitions, 752 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-04-30 10:19:04,525 INFO L231 Difference]: Finished difference. Result has 102 places, 72 transitions, 554 flow [2025-04-30 10:19:04,525 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=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=554, PETRI_PLACES=102, PETRI_TRANSITIONS=72} [2025-04-30 10:19:04,525 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 73 predicate places. [2025-04-30 10:19:04,525 INFO L485 AbstractCegarLoop]: Abstraction has has 102 places, 72 transitions, 554 flow [2025-04-30 10:19:04,525 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,525 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:19:04,525 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,525 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:19:04,526 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,526 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:04,526 INFO L85 PathProgramCache]: Analyzing trace with hash 783190556, now seen corresponding path program 1 times [2025-04-30 10:19:04,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:04,526 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379663838] [2025-04-30 10:19:04,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:19:04,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:04,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-30 10:19:04,576 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,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:19:04,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:06,592 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:06,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:06,592 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379663838] [2025-04-30 10:19:06,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379663838] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:19:06,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:19:06,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:19:06,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640278694] [2025-04-30 10:19:06,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:19:06,593 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:19:06,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:06,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:19:06,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:19:06,630 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2025-04-30 10:19:06,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 72 transitions, 554 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:06,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:19:06,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2025-04-30 10:19:06,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:19:07,425 INFO L116 PetriNetUnfolderBase]: 67/218 cut-off events. [2025-04-30 10:19:07,425 INFO L117 PetriNetUnfolderBase]: For 425/425 co-relation queries the response was YES. [2025-04-30 10:19:07,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 815 conditions, 218 events. 67/218 cut-off events. For 425/425 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 789 event pairs, 28 based on Foata normal form. 3/221 useless extension candidates. Maximal degree in co-relation 721. Up to 106 conditions per place. [2025-04-30 10:19:07,429 INFO L140 encePairwiseOnDemand]: 16/27 looper letters, 65 selfloop transitions, 28 changer transitions 5/99 dead transitions. [2025-04-30 10:19:07,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 99 transitions, 882 flow [2025-04-30 10:19:07,429 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-30 10:19:07,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-30 10:19:07,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 126 transitions. [2025-04-30 10:19:07,430 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2916666666666667 [2025-04-30 10:19:07,430 INFO L175 Difference]: Start difference. First operand has 102 places, 72 transitions, 554 flow. Second operand 16 states and 126 transitions. [2025-04-30 10:19:07,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 99 transitions, 882 flow [2025-04-30 10:19:07,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 99 transitions, 833 flow, removed 12 selfloop flow, removed 4 redundant places. [2025-04-30 10:19:07,435 INFO L231 Difference]: Finished difference. Result has 117 places, 81 transitions, 670 flow [2025-04-30 10:19:07,435 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=670, PETRI_PLACES=117, PETRI_TRANSITIONS=81} [2025-04-30 10:19:07,437 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 88 predicate places. [2025-04-30 10:19:07,437 INFO L485 AbstractCegarLoop]: Abstraction has has 117 places, 81 transitions, 670 flow [2025-04-30 10:19:07,437 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:07,437 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:19:07,438 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:07,438 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-30 10:19:07,438 INFO L403 AbstractCegarLoop]: === Iteration 12 === 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:07,438 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:07,438 INFO L85 PathProgramCache]: Analyzing trace with hash 756378656, now seen corresponding path program 2 times [2025-04-30 10:19:07,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:07,438 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759787089] [2025-04-30 10:19:07,438 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:19:07,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:07,447 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-04-30 10:19:07,466 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 42 statements. [2025-04-30 10:19:07,467 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:19:07,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:11,134 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:11,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:11,134 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759787089] [2025-04-30 10:19:11,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759787089] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:19:11,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:19:11,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:19:11,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763603248] [2025-04-30 10:19:11,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:19:11,134 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:19:11,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:11,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:19:11,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:19:11,146 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2025-04-30 10:19:11,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 81 transitions, 670 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:11,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:19:11,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2025-04-30 10:19:11,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:19:11,993 INFO L116 PetriNetUnfolderBase]: 70/230 cut-off events. [2025-04-30 10:19:11,993 INFO L117 PetriNetUnfolderBase]: For 487/487 co-relation queries the response was YES. [2025-04-30 10:19:11,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 903 conditions, 230 events. 70/230 cut-off events. For 487/487 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 889 event pairs, 32 based on Foata normal form. 3/233 useless extension candidates. Maximal degree in co-relation 808. Up to 113 conditions per place. [2025-04-30 10:19:11,995 INFO L140 encePairwiseOnDemand]: 16/27 looper letters, 62 selfloop transitions, 34 changer transitions 2/99 dead transitions. [2025-04-30 10:19:11,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 99 transitions, 946 flow [2025-04-30 10:19:11,995 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-30 10:19:11,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-30 10:19:11,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 124 transitions. [2025-04-30 10:19:11,996 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30617283950617286 [2025-04-30 10:19:11,996 INFO L175 Difference]: Start difference. First operand has 117 places, 81 transitions, 670 flow. Second operand 15 states and 124 transitions. [2025-04-30 10:19:11,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 99 transitions, 946 flow [2025-04-30 10:19:12,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 99 transitions, 917 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-04-30 10:19:12,002 INFO L231 Difference]: Finished difference. Result has 130 places, 86 transitions, 775 flow [2025-04-30 10:19:12,003 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=775, PETRI_PLACES=130, PETRI_TRANSITIONS=86} [2025-04-30 10:19:12,003 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 101 predicate places. [2025-04-30 10:19:12,003 INFO L485 AbstractCegarLoop]: Abstraction has has 130 places, 86 transitions, 775 flow [2025-04-30 10:19:12,004 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:12,004 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:19:12,004 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:12,004 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-30 10:19:12,004 INFO L403 AbstractCegarLoop]: === Iteration 13 === 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:12,004 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:12,004 INFO L85 PathProgramCache]: Analyzing trace with hash 784113116, now seen corresponding path program 3 times [2025-04-30 10:19:12,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:12,004 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429562297] [2025-04-30 10:19:12,004 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:19:12,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:12,019 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 11 equivalence classes. [2025-04-30 10:19:12,033 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:12,034 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-30 10:19:12,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:15,268 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:15,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:15,268 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429562297] [2025-04-30 10:19:15,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429562297] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:19:15,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:19:15,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:19:15,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566810061] [2025-04-30 10:19:15,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:19:15,269 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:19:15,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:15,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:19:15,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:19:15,307 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2025-04-30 10:19:15,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 86 transitions, 775 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:15,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:19:15,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2025-04-30 10:19:15,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:19:16,094 INFO L116 PetriNetUnfolderBase]: 75/247 cut-off events. [2025-04-30 10:19:16,094 INFO L117 PetriNetUnfolderBase]: For 655/655 co-relation queries the response was YES. [2025-04-30 10:19:16,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1027 conditions, 247 events. 75/247 cut-off events. For 655/655 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1021 event pairs, 27 based on Foata normal form. 3/250 useless extension candidates. Maximal degree in co-relation 949. Up to 110 conditions per place. [2025-04-30 10:19:16,095 INFO L140 encePairwiseOnDemand]: 15/27 looper letters, 72 selfloop transitions, 37 changer transitions 2/112 dead transitions. [2025-04-30 10:19:16,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 112 transitions, 1132 flow [2025-04-30 10:19:16,096 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-30 10:19:16,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-30 10:19:16,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 124 transitions. [2025-04-30 10:19:16,096 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30617283950617286 [2025-04-30 10:19:16,097 INFO L175 Difference]: Start difference. First operand has 130 places, 86 transitions, 775 flow. Second operand 15 states and 124 transitions. [2025-04-30 10:19:16,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 112 transitions, 1132 flow [2025-04-30 10:19:16,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 112 transitions, 1088 flow, removed 4 selfloop flow, removed 7 redundant places. [2025-04-30 10:19:16,101 INFO L231 Difference]: Finished difference. Result has 141 places, 94 transitions, 892 flow [2025-04-30 10:19:16,102 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=892, PETRI_PLACES=141, PETRI_TRANSITIONS=94} [2025-04-30 10:19:16,102 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 112 predicate places. [2025-04-30 10:19:16,102 INFO L485 AbstractCegarLoop]: Abstraction has has 141 places, 94 transitions, 892 flow [2025-04-30 10:19:16,102 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:16,102 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:19:16,102 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:16,102 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-30 10:19:16,103 INFO L403 AbstractCegarLoop]: === Iteration 14 === 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:16,103 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:16,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1797675958, now seen corresponding path program 4 times [2025-04-30 10:19:16,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:16,103 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968402601] [2025-04-30 10:19:16,103 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:19:16,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:16,110 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-04-30 10:19:16,157 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:16,157 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-30 10:19:16,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:18,816 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,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:18,817 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968402601] [2025-04-30 10:19:18,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968402601] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:19:18,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:19:18,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:19:18,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615687963] [2025-04-30 10:19:18,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:19:18,817 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:19:18,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:18,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:19:18,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:19:18,826 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 27 [2025-04-30 10:19:18,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 94 transitions, 892 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 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,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:19:18,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 27 [2025-04-30 10:19:18,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:19:19,560 INFO L116 PetriNetUnfolderBase]: 74/253 cut-off events. [2025-04-30 10:19:19,561 INFO L117 PetriNetUnfolderBase]: For 804/804 co-relation queries the response was YES. [2025-04-30 10:19:19,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1137 conditions, 253 events. 74/253 cut-off events. For 804/804 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1072 event pairs, 35 based on Foata normal form. 3/256 useless extension candidates. Maximal degree in co-relation 1033. Up to 117 conditions per place. [2025-04-30 10:19:19,562 INFO L140 encePairwiseOnDemand]: 16/27 looper letters, 71 selfloop transitions, 38 changer transitions 2/113 dead transitions. [2025-04-30 10:19:19,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 113 transitions, 1245 flow [2025-04-30 10:19:19,563 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-30 10:19:19,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-30 10:19:19,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 130 transitions. [2025-04-30 10:19:19,563 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3439153439153439 [2025-04-30 10:19:19,563 INFO L175 Difference]: Start difference. First operand has 141 places, 94 transitions, 892 flow. Second operand 14 states and 130 transitions. [2025-04-30 10:19:19,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 113 transitions, 1245 flow [2025-04-30 10:19:19,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 113 transitions, 1180 flow, removed 8 selfloop flow, removed 8 redundant places. [2025-04-30 10:19:19,570 INFO L231 Difference]: Finished difference. Result has 151 places, 100 transitions, 1010 flow [2025-04-30 10:19:19,570 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1010, PETRI_PLACES=151, PETRI_TRANSITIONS=100} [2025-04-30 10:19:19,570 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 122 predicate places. [2025-04-30 10:19:19,570 INFO L485 AbstractCegarLoop]: Abstraction has has 151 places, 100 transitions, 1010 flow [2025-04-30 10:19:19,571 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 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:19,571 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:19:19,571 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:19,571 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-30 10:19:19,571 INFO L403 AbstractCegarLoop]: === Iteration 15 === 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:19,571 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:19,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1293904401, now seen corresponding path program 4 times [2025-04-30 10:19:19,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:19,572 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818952284] [2025-04-30 10:19:19,572 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:19:19,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:19,578 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-04-30 10:19:19,618 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:19,618 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-30 10:19:19,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:20,218 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:20,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:20,218 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818952284] [2025-04-30 10:19:20,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818952284] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:19:20,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:19:20,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-30 10:19:20,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380890669] [2025-04-30 10:19:20,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:19:20,219 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:19:20,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:20,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:19:20,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:19:20,231 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-04-30 10:19:20,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 100 transitions, 1010 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:20,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:19:20,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-04-30 10:19:20,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:19:20,635 INFO L116 PetriNetUnfolderBase]: 52/245 cut-off events. [2025-04-30 10:19:20,635 INFO L117 PetriNetUnfolderBase]: For 1032/1032 co-relation queries the response was YES. [2025-04-30 10:19:20,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1126 conditions, 245 events. 52/245 cut-off events. For 1032/1032 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1218 event pairs, 12 based on Foata normal form. 9/254 useless extension candidates. Maximal degree in co-relation 1024. Up to 79 conditions per place. [2025-04-30 10:19:20,637 INFO L140 encePairwiseOnDemand]: 16/27 looper letters, 61 selfloop transitions, 30 changer transitions 11/122 dead transitions. [2025-04-30 10:19:20,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 122 transitions, 1325 flow [2025-04-30 10:19:20,637 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-30 10:19:20,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-30 10:19:20,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 182 transitions. [2025-04-30 10:19:20,638 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4212962962962963 [2025-04-30 10:19:20,638 INFO L175 Difference]: Start difference. First operand has 151 places, 100 transitions, 1010 flow. Second operand 16 states and 182 transitions. [2025-04-30 10:19:20,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 122 transitions, 1325 flow [2025-04-30 10:19:20,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 122 transitions, 1293 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-04-30 10:19:20,646 INFO L231 Difference]: Finished difference. Result has 167 places, 102 transitions, 1065 flow [2025-04-30 10:19:20,647 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=978, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1065, PETRI_PLACES=167, PETRI_TRANSITIONS=102} [2025-04-30 10:19:20,647 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 138 predicate places. [2025-04-30 10:19:20,648 INFO L485 AbstractCegarLoop]: Abstraction has has 167 places, 102 transitions, 1065 flow [2025-04-30 10:19:20,648 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:20,648 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:19:20,648 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:20,648 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-30 10:19:20,648 INFO L403 AbstractCegarLoop]: === Iteration 16 === 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:20,649 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:20,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1461333737, now seen corresponding path program 1 times [2025-04-30 10:19:20,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:20,649 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916019030] [2025-04-30 10:19:20,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:19:20,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:20,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-30 10:19:20,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-30 10:19:20,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:19:20,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:22,657 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:22,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:22,658 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916019030] [2025-04-30 10:19:22,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916019030] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:19:22,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:19:22,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:19:22,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419052853] [2025-04-30 10:19:22,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:19:22,658 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:19:22,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:22,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:19:22,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:19:22,692 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 27 [2025-04-30 10:19:22,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 102 transitions, 1065 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:22,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:19:22,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 27 [2025-04-30 10:19:22,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:19:23,174 INFO L116 PetriNetUnfolderBase]: 64/243 cut-off events. [2025-04-30 10:19:23,174 INFO L117 PetriNetUnfolderBase]: For 1108/1108 co-relation queries the response was YES. [2025-04-30 10:19:23,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1198 conditions, 243 events. 64/243 cut-off events. For 1108/1108 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1070 event pairs, 22 based on Foata normal form. 2/245 useless extension candidates. Maximal degree in co-relation 1090. Up to 79 conditions per place. [2025-04-30 10:19:23,176 INFO L140 encePairwiseOnDemand]: 18/27 looper letters, 62 selfloop transitions, 34 changer transitions 4/112 dead transitions. [2025-04-30 10:19:23,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 112 transitions, 1315 flow [2025-04-30 10:19:23,176 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:19:23,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-30 10:19:23,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 103 transitions. [2025-04-30 10:19:23,177 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31790123456790126 [2025-04-30 10:19:23,177 INFO L175 Difference]: Start difference. First operand has 167 places, 102 transitions, 1065 flow. Second operand 12 states and 103 transitions. [2025-04-30 10:19:23,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 112 transitions, 1315 flow [2025-04-30 10:19:23,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 112 transitions, 1233 flow, removed 9 selfloop flow, removed 17 redundant places. [2025-04-30 10:19:23,184 INFO L231 Difference]: Finished difference. Result has 156 places, 101 transitions, 1043 flow [2025-04-30 10:19:23,185 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=975, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1043, PETRI_PLACES=156, PETRI_TRANSITIONS=101} [2025-04-30 10:19:23,189 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 127 predicate places. [2025-04-30 10:19:23,189 INFO L485 AbstractCegarLoop]: Abstraction has has 156 places, 101 transitions, 1043 flow [2025-04-30 10:19:23,189 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:23,189 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:19:23,189 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:23,189 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-30 10:19:23,189 INFO L403 AbstractCegarLoop]: === Iteration 17 === 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:23,189 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:23,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1462296851, now seen corresponding path program 1 times [2025-04-30 10:19:23,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:23,189 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761195430] [2025-04-30 10:19:23,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:19:23,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:23,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-30 10:19:23,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-30 10:19:23,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:19:23,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:25,249 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:25,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:25,250 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761195430] [2025-04-30 10:19:25,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761195430] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:19:25,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:19:25,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:19:25,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538276089] [2025-04-30 10:19:25,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:19:25,250 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:19:25,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:25,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:19:25,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:19:25,315 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2025-04-30 10:19:25,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 101 transitions, 1043 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:25,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:19:25,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2025-04-30 10:19:25,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:19:26,202 INFO L116 PetriNetUnfolderBase]: 53/224 cut-off events. [2025-04-30 10:19:26,202 INFO L117 PetriNetUnfolderBase]: For 924/924 co-relation queries the response was YES. [2025-04-30 10:19:26,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1082 conditions, 224 events. 53/224 cut-off events. For 924/924 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1007 event pairs, 22 based on Foata normal form. 3/224 useless extension candidates. Maximal degree in co-relation 983. Up to 111 conditions per place. [2025-04-30 10:19:26,204 INFO L140 encePairwiseOnDemand]: 16/27 looper letters, 56 selfloop transitions, 33 changer transitions 7/113 dead transitions. [2025-04-30 10:19:26,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 113 transitions, 1278 flow [2025-04-30 10:19:26,204 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-30 10:19:26,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-30 10:19:26,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 128 transitions. [2025-04-30 10:19:26,205 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3646723646723647 [2025-04-30 10:19:26,205 INFO L175 Difference]: Start difference. First operand has 156 places, 101 transitions, 1043 flow. Second operand 13 states and 128 transitions. [2025-04-30 10:19:26,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 113 transitions, 1278 flow [2025-04-30 10:19:26,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 113 transitions, 1215 flow, removed 2 selfloop flow, removed 8 redundant places. [2025-04-30 10:19:26,211 INFO L231 Difference]: Finished difference. Result has 160 places, 97 transitions, 1016 flow [2025-04-30 10:19:26,211 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=980, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1016, PETRI_PLACES=160, PETRI_TRANSITIONS=97} [2025-04-30 10:19:26,211 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 131 predicate places. [2025-04-30 10:19:26,212 INFO L485 AbstractCegarLoop]: Abstraction has has 160 places, 97 transitions, 1016 flow [2025-04-30 10:19:26,212 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:26,212 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:19:26,212 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:26,212 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-30 10:19:26,212 INFO L403 AbstractCegarLoop]: === Iteration 18 === 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:26,212 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:26,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1490896211, now seen corresponding path program 2 times [2025-04-30 10:19:26,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:26,213 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656785352] [2025-04-30 10:19:26,213 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:19:26,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:26,218 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-04-30 10:19:26,227 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:26,227 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:19:26,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:28,745 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:28,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:28,745 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656785352] [2025-04-30 10:19:28,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656785352] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:19:28,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:19:28,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:19:28,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428768590] [2025-04-30 10:19:28,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:19:28,746 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:19:28,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:28,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:19:28,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:19:28,790 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2025-04-30 10:19:28,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 97 transitions, 1016 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:28,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:19:28,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2025-04-30 10:19:28,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:19:29,716 INFO L116 PetriNetUnfolderBase]: 51/224 cut-off events. [2025-04-30 10:19:29,716 INFO L117 PetriNetUnfolderBase]: For 1053/1053 co-relation queries the response was YES. [2025-04-30 10:19:29,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1126 conditions, 224 events. 51/224 cut-off events. For 1053/1053 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 990 event pairs, 25 based on Foata normal form. 6/230 useless extension candidates. Maximal degree in co-relation 1039. Up to 109 conditions per place. [2025-04-30 10:19:29,718 INFO L140 encePairwiseOnDemand]: 17/27 looper letters, 50 selfloop transitions, 30 changer transitions 13/108 dead transitions. [2025-04-30 10:19:29,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 108 transitions, 1261 flow [2025-04-30 10:19:29,718 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-30 10:19:29,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-30 10:19:29,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 125 transitions. [2025-04-30 10:19:29,719 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3561253561253561 [2025-04-30 10:19:29,719 INFO L175 Difference]: Start difference. First operand has 160 places, 97 transitions, 1016 flow. Second operand 13 states and 125 transitions. [2025-04-30 10:19:29,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 108 transitions, 1261 flow [2025-04-30 10:19:29,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 108 transitions, 1159 flow, removed 2 selfloop flow, removed 15 redundant places. [2025-04-30 10:19:29,725 INFO L231 Difference]: Finished difference. Result has 155 places, 91 transitions, 918 flow [2025-04-30 10:19:29,725 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=927, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=918, PETRI_PLACES=155, PETRI_TRANSITIONS=91} [2025-04-30 10:19:29,725 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 126 predicate places. [2025-04-30 10:19:29,725 INFO L485 AbstractCegarLoop]: Abstraction has has 155 places, 91 transitions, 918 flow [2025-04-30 10:19:29,725 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:29,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:19:29,726 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:29,726 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-30 10:19:29,726 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:29,726 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:29,726 INFO L85 PathProgramCache]: Analyzing trace with hash -815683025, now seen corresponding path program 1 times [2025-04-30 10:19:29,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:29,726 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250689962] [2025-04-30 10:19:29,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:19:29,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:29,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-30 10:19:29,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-30 10:19:29,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:19:29,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:30,977 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:30,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:30,977 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250689962] [2025-04-30 10:19:30,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250689962] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:19:30,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:19:30,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:19:30,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795154399] [2025-04-30 10:19:30,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:19:30,978 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:19:30,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:30,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:19:30,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:19:31,027 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2025-04-30 10:19:31,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 91 transitions, 918 flow. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 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:31,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:19:31,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2025-04-30 10:19:31,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:19:31,815 INFO L116 PetriNetUnfolderBase]: 46/217 cut-off events. [2025-04-30 10:19:31,816 INFO L117 PetriNetUnfolderBase]: For 935/935 co-relation queries the response was YES. [2025-04-30 10:19:31,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1040 conditions, 217 events. 46/217 cut-off events. For 935/935 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 960 event pairs, 21 based on Foata normal form. 8/225 useless extension candidates. Maximal degree in co-relation 956. Up to 91 conditions per place. [2025-04-30 10:19:31,817 INFO L140 encePairwiseOnDemand]: 19/27 looper letters, 54 selfloop transitions, 17 changer transitions 20/104 dead transitions. [2025-04-30 10:19:31,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 104 transitions, 1178 flow [2025-04-30 10:19:31,817 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:19:31,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-30 10:19:31,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2025-04-30 10:19:31,818 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.39094650205761317 [2025-04-30 10:19:31,819 INFO L175 Difference]: Start difference. First operand has 155 places, 91 transitions, 918 flow. Second operand 9 states and 95 transitions. [2025-04-30 10:19:31,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 104 transitions, 1178 flow [2025-04-30 10:19:31,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 104 transitions, 1062 flow, removed 3 selfloop flow, removed 15 redundant places. [2025-04-30 10:19:31,824 INFO L231 Difference]: Finished difference. Result has 144 places, 80 transitions, 733 flow [2025-04-30 10:19:31,825 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=812, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=733, PETRI_PLACES=144, PETRI_TRANSITIONS=80} [2025-04-30 10:19:31,825 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 115 predicate places. [2025-04-30 10:19:31,825 INFO L485 AbstractCegarLoop]: Abstraction has has 144 places, 80 transitions, 733 flow [2025-04-30 10:19:31,825 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 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:31,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:19:31,825 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:31,826 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-30 10:19:31,826 INFO L403 AbstractCegarLoop]: === Iteration 20 === 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:31,826 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:31,826 INFO L85 PathProgramCache]: Analyzing trace with hash -600748175, now seen corresponding path program 3 times [2025-04-30 10:19:31,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:31,826 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628751445] [2025-04-30 10:19:31,826 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:19:31,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:31,834 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 11 equivalence classes. [2025-04-30 10:19:31,842 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:31,842 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-30 10:19:31,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:34,225 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:34,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:34,225 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628751445] [2025-04-30 10:19:34,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628751445] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:19:34,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:19:34,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:19:34,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775532208] [2025-04-30 10:19:34,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:19:34,226 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:19:34,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:34,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:19:34,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:19:34,270 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2025-04-30 10:19:34,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 80 transitions, 733 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:34,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:19:34,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2025-04-30 10:19:34,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:19:35,102 INFO L116 PetriNetUnfolderBase]: 34/166 cut-off events. [2025-04-30 10:19:35,103 INFO L117 PetriNetUnfolderBase]: For 589/589 co-relation queries the response was YES. [2025-04-30 10:19:35,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 776 conditions, 166 events. 34/166 cut-off events. For 589/589 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 581 event pairs, 18 based on Foata normal form. 3/169 useless extension candidates. Maximal degree in co-relation 700. Up to 80 conditions per place. [2025-04-30 10:19:35,103 INFO L140 encePairwiseOnDemand]: 17/27 looper letters, 46 selfloop transitions, 18 changer transitions 14/88 dead transitions. [2025-04-30 10:19:35,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 88 transitions, 904 flow [2025-04-30 10:19:35,108 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-30 10:19:35,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-30 10:19:35,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 121 transitions. [2025-04-30 10:19:35,108 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.34472934472934474 [2025-04-30 10:19:35,108 INFO L175 Difference]: Start difference. First operand has 144 places, 80 transitions, 733 flow. Second operand 13 states and 121 transitions. [2025-04-30 10:19:35,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 88 transitions, 904 flow [2025-04-30 10:19:35,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 88 transitions, 845 flow, removed 4 selfloop flow, removed 11 redundant places. [2025-04-30 10:19:35,112 INFO L231 Difference]: Finished difference. Result has 140 places, 71 transitions, 624 flow [2025-04-30 10:19:35,112 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=624, PETRI_PLACES=140, PETRI_TRANSITIONS=71} [2025-04-30 10:19:35,113 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 111 predicate places. [2025-04-30 10:19:35,113 INFO L485 AbstractCegarLoop]: Abstraction has has 140 places, 71 transitions, 624 flow [2025-04-30 10:19:35,113 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:35,113 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:19:35,113 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:35,113 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-30 10:19:35,113 INFO L403 AbstractCegarLoop]: === Iteration 21 === 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:35,114 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:35,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1434135799, now seen corresponding path program 1 times [2025-04-30 10:19:35,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:35,114 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796600226] [2025-04-30 10:19:35,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:19:35,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:35,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-30 10:19:35,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-30 10:19:35,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:19:35,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:35,953 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,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:35,953 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796600226] [2025-04-30 10:19:35,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796600226] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:19:35,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:19:35,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-30 10:19:35,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782794050] [2025-04-30 10:19:35,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:19:35,953 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:19:35,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:35,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:19:35,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:19:35,975 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 27 [2025-04-30 10:19:35,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 71 transitions, 624 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:35,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:19:35,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 27 [2025-04-30 10:19:35,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:19:36,362 INFO L116 PetriNetUnfolderBase]: 32/148 cut-off events. [2025-04-30 10:19:36,362 INFO L117 PetriNetUnfolderBase]: For 395/395 co-relation queries the response was YES. [2025-04-30 10:19:36,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 671 conditions, 148 events. 32/148 cut-off events. For 395/395 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 456 event pairs, 8 based on Foata normal form. 2/150 useless extension candidates. Maximal degree in co-relation 608. Up to 47 conditions per place. [2025-04-30 10:19:36,363 INFO L140 encePairwiseOnDemand]: 19/27 looper letters, 51 selfloop transitions, 26 changer transitions 0/82 dead transitions. [2025-04-30 10:19:36,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 82 transitions, 820 flow [2025-04-30 10:19:36,363 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-30 10:19:36,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-30 10:19:36,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 108 transitions. [2025-04-30 10:19:36,363 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3076923076923077 [2025-04-30 10:19:36,363 INFO L175 Difference]: Start difference. First operand has 140 places, 71 transitions, 624 flow. Second operand 13 states and 108 transitions. [2025-04-30 10:19:36,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 82 transitions, 820 flow [2025-04-30 10:19:36,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 82 transitions, 727 flow, removed 3 selfloop flow, removed 18 redundant places. [2025-04-30 10:19:36,366 INFO L231 Difference]: Finished difference. Result has 123 places, 75 transitions, 600 flow [2025-04-30 10:19:36,366 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=527, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=600, PETRI_PLACES=123, PETRI_TRANSITIONS=75} [2025-04-30 10:19:36,366 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 94 predicate places. [2025-04-30 10:19:36,366 INFO L485 AbstractCegarLoop]: Abstraction has has 123 places, 75 transitions, 600 flow [2025-04-30 10:19:36,366 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:36,366 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:19:36,367 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,367 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-30 10:19:36,367 INFO L403 AbstractCegarLoop]: === Iteration 22 === 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 -106619821, now seen corresponding path program 4 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 [1555624513] [2025-04-30 10:19:36,367 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:19:36,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:36,375 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 43 statements into 2 equivalence classes. [2025-04-30 10:19:36,402 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-04-30 10:19:36,402 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-30 10:19:36,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:37,898 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:37,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:37,898 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555624513] [2025-04-30 10:19:37,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555624513] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:19:37,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:19:37,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-30 10:19:37,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353375044] [2025-04-30 10:19:37,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:19:37,899 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:19:37,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:37,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:19:37,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:19:37,917 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-04-30 10:19:37,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 75 transitions, 600 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:37,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:19:37,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-04-30 10:19:37,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:19:38,662 INFO L116 PetriNetUnfolderBase]: 23/133 cut-off events. [2025-04-30 10:19:38,662 INFO L117 PetriNetUnfolderBase]: For 300/300 co-relation queries the response was YES. [2025-04-30 10:19:38,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 588 conditions, 133 events. 23/133 cut-off events. For 300/300 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 391 event pairs, 9 based on Foata normal form. 3/136 useless extension candidates. Maximal degree in co-relation 485. Up to 52 conditions per place. [2025-04-30 10:19:38,663 INFO L140 encePairwiseOnDemand]: 18/27 looper letters, 45 selfloop transitions, 14 changer transitions 13/80 dead transitions. [2025-04-30 10:19:38,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 80 transitions, 752 flow [2025-04-30 10:19:38,664 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:19:38,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-30 10:19:38,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 134 transitions. [2025-04-30 10:19:38,664 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.41358024691358025 [2025-04-30 10:19:38,664 INFO L175 Difference]: Start difference. First operand has 123 places, 75 transitions, 600 flow. Second operand 12 states and 134 transitions. [2025-04-30 10:19:38,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 80 transitions, 752 flow [2025-04-30 10:19:38,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 80 transitions, 701 flow, removed 5 selfloop flow, removed 8 redundant places. [2025-04-30 10:19:38,667 INFO L231 Difference]: Finished difference. Result has 127 places, 66 transitions, 509 flow [2025-04-30 10:19:38,667 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=549, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=509, PETRI_PLACES=127, PETRI_TRANSITIONS=66} [2025-04-30 10:19:38,667 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 98 predicate places. [2025-04-30 10:19:38,667 INFO L485 AbstractCegarLoop]: Abstraction has has 127 places, 66 transitions, 509 flow [2025-04-30 10:19:38,668 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:38,668 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:19:38,668 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:38,668 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-30 10:19:38,668 INFO L403 AbstractCegarLoop]: === Iteration 23 === 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:38,668 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:38,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1493868089, now seen corresponding path program 2 times [2025-04-30 10:19:38,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:38,668 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289523891] [2025-04-30 10:19:38,668 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:19:38,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:38,675 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-04-30 10:19:38,684 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:38,684 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:19:38,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:40,108 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,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:40,108 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289523891] [2025-04-30 10:19:40,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289523891] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:19:40,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:19:40,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:19:40,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144444607] [2025-04-30 10:19:40,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:19:40,108 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:19:40,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:40,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:19:40,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:19:40,156 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2025-04-30 10:19:40,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 66 transitions, 509 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,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:19:40,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2025-04-30 10:19:40,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:19:40,841 INFO L116 PetriNetUnfolderBase]: 22/119 cut-off events. [2025-04-30 10:19:40,841 INFO L117 PetriNetUnfolderBase]: For 263/265 co-relation queries the response was YES. [2025-04-30 10:19:40,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 513 conditions, 119 events. 22/119 cut-off events. For 263/265 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 290 event pairs, 5 based on Foata normal form. 5/124 useless extension candidates. Maximal degree in co-relation 474. Up to 49 conditions per place. [2025-04-30 10:19:40,842 INFO L140 encePairwiseOnDemand]: 18/27 looper letters, 47 selfloop transitions, 11 changer transitions 10/75 dead transitions. [2025-04-30 10:19:40,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 75 transitions, 679 flow [2025-04-30 10:19:40,842 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-30 10:19:40,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-30 10:19:40,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 103 transitions. [2025-04-30 10:19:40,843 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3468013468013468 [2025-04-30 10:19:40,843 INFO L175 Difference]: Start difference. First operand has 127 places, 66 transitions, 509 flow. Second operand 11 states and 103 transitions. [2025-04-30 10:19:40,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 75 transitions, 679 flow [2025-04-30 10:19:40,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 75 transitions, 623 flow, removed 4 selfloop flow, removed 15 redundant places. [2025-04-30 10:19:40,845 INFO L231 Difference]: Finished difference. Result has 114 places, 62 transitions, 448 flow [2025-04-30 10:19:40,845 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=448, PETRI_PLACES=114, PETRI_TRANSITIONS=62} [2025-04-30 10:19:40,845 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 85 predicate places. [2025-04-30 10:19:40,845 INFO L485 AbstractCegarLoop]: Abstraction has has 114 places, 62 transitions, 448 flow [2025-04-30 10:19:40,846 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:40,846 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:19:40,846 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:19:40,846 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-30 10:19:40,846 INFO L403 AbstractCegarLoop]: === Iteration 24 === 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:40,846 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:40,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1943294738, now seen corresponding path program 1 times [2025-04-30 10:19:40,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:40,846 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455387901] [2025-04-30 10:19:40,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:19:40,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:40,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-30 10:19:40,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-30 10:19:40,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:19:40,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:42,818 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-04-30 10:19:42,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:42,818 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455387901] [2025-04-30 10:19:42,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455387901] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:19:42,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:19:42,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-30 10:19:42,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852593131] [2025-04-30 10:19:42,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:19:42,819 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:19:42,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:42,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:19:42,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:19:42,863 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2025-04-30 10:19:42,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 62 transitions, 448 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:19:42,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2025-04-30 10:19:42,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:19:43,238 INFO L116 PetriNetUnfolderBase]: 18/103 cut-off events. [2025-04-30 10:19:43,238 INFO L117 PetriNetUnfolderBase]: For 211/211 co-relation queries the response was YES. [2025-04-30 10:19:43,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 429 conditions, 103 events. 18/103 cut-off events. For 211/211 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 196 event pairs, 3 based on Foata normal form. 2/105 useless extension candidates. Maximal degree in co-relation 389. Up to 31 conditions per place. [2025-04-30 10:19:43,239 INFO L140 encePairwiseOnDemand]: 19/27 looper letters, 38 selfloop transitions, 8 changer transitions 14/65 dead transitions. [2025-04-30 10:19:43,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 65 transitions, 568 flow [2025-04-30 10:19:43,240 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:19:43,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-30 10:19:43,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 90 transitions. [2025-04-30 10:19:43,240 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2025-04-30 10:19:43,240 INFO L175 Difference]: Start difference. First operand has 114 places, 62 transitions, 448 flow. Second operand 10 states and 90 transitions. [2025-04-30 10:19:43,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 65 transitions, 568 flow [2025-04-30 10:19:43,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 65 transitions, 524 flow, removed 3 selfloop flow, removed 13 redundant places. [2025-04-30 10:19:43,245 INFO L231 Difference]: Finished difference. Result has 104 places, 51 transitions, 364 flow [2025-04-30 10:19:43,245 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=364, PETRI_PLACES=104, PETRI_TRANSITIONS=51} [2025-04-30 10:19:43,245 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 75 predicate places. [2025-04-30 10:19:43,245 INFO L485 AbstractCegarLoop]: Abstraction has has 104 places, 51 transitions, 364 flow [2025-04-30 10:19:43,245 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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,246 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:19:43,246 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:19:43,246 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-30 10:19:43,246 INFO L403 AbstractCegarLoop]: === Iteration 25 === 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:43,246 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:43,246 INFO L85 PathProgramCache]: Analyzing trace with hash 412908709, now seen corresponding path program 1 times [2025-04-30 10:19:43,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:43,246 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945056107] [2025-04-30 10:19:43,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:19:43,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:43,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-30 10:19:43,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-30 10:19:43,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:19:43,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:45,023 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-04-30 10:19:45,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:45,023 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945056107] [2025-04-30 10:19:45,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945056107] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:19:45,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:19:45,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:19:45,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768760716] [2025-04-30 10:19:45,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:19:45,023 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:19:45,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:45,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:19:45,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:19:45,075 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2025-04-30 10:19:45,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 51 transitions, 364 flow. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:45,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:19:45,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2025-04-30 10:19:45,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:19:45,594 INFO L116 PetriNetUnfolderBase]: 9/72 cut-off events. [2025-04-30 10:19:45,594 INFO L117 PetriNetUnfolderBase]: For 169/169 co-relation queries the response was YES. [2025-04-30 10:19:45,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 72 events. 9/72 cut-off events. For 169/169 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 73 event pairs, 1 based on Foata normal form. 2/74 useless extension candidates. Maximal degree in co-relation 282. Up to 26 conditions per place. [2025-04-30 10:19:45,595 INFO L140 encePairwiseOnDemand]: 20/27 looper letters, 37 selfloop transitions, 3 changer transitions 13/56 dead transitions. [2025-04-30 10:19:45,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 56 transitions, 489 flow [2025-04-30 10:19:45,595 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:19:45,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-30 10:19:45,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 80 transitions. [2025-04-30 10:19:45,595 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3292181069958848 [2025-04-30 10:19:45,595 INFO L175 Difference]: Start difference. First operand has 104 places, 51 transitions, 364 flow. Second operand 9 states and 80 transitions. [2025-04-30 10:19:45,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 56 transitions, 489 flow [2025-04-30 10:19:45,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 56 transitions, 445 flow, removed 4 selfloop flow, removed 11 redundant places. [2025-04-30 10:19:45,597 INFO L231 Difference]: Finished difference. Result has 86 places, 43 transitions, 298 flow [2025-04-30 10:19:45,597 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=298, PETRI_PLACES=86, PETRI_TRANSITIONS=43} [2025-04-30 10:19:45,597 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 57 predicate places. [2025-04-30 10:19:45,597 INFO L485 AbstractCegarLoop]: Abstraction has has 86 places, 43 transitions, 298 flow [2025-04-30 10:19:45,597 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:45,598 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:19:45,598 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:19:45,598 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-30 10:19:45,598 INFO L403 AbstractCegarLoop]: === Iteration 26 === 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,598 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:45,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1508537161, now seen corresponding path program 2 times [2025-04-30 10:19:45,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:45,598 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870068069] [2025-04-30 10:19:45,598 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:19:45,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:45,604 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-04-30 10:19:45,627 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-30 10:19:45,627 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:19:45,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:46,725 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-04-30 10:19:46,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:46,725 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870068069] [2025-04-30 10:19:46,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870068069] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:19:46,725 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804305796] [2025-04-30 10:19:46,725 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:19:46,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:19:46,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:19:46,727 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:46,728 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:46,777 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-04-30 10:19:46,852 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-30 10:19:46,852 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:19:46,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:46,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 73 conjuncts are in the unsatisfiable core [2025-04-30 10:19:46,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:19:48,211 INFO L325 Elim1Store]: treesize reduction 257, result has 30.7 percent of original size [2025-04-30 10:19:48,212 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 65 case distinctions, treesize of input 107 treesize of output 155 [2025-04-30 10:19:49,829 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:19:49,829 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 485 treesize of output 303 Killed by 15