./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/06-symbeq_08-tricky_address3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/06-symbeq_08-tricky_address3.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 a812aad62102b8bb20af57f89ce6dbf7fb9ee1fa63f6f8ecf164ccf61d0713cb --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:44:05,549 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:44:05,589 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 06:44:05,592 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:44:05,593 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:44:05,607 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:44:05,608 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:44:05,608 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:44:05,611 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:44:05,611 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:44:05,611 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:44:05,611 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:44:05,611 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:44:05,611 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:44:05,611 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:44:05,611 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:44:05,612 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:44:05,612 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:44:05,612 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:44:05,612 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:44:05,612 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:44:05,612 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:44:05,612 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:44:05,612 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:44:05,612 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:44:05,612 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:44:05,612 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:44:05,612 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:44:05,612 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:44:05,613 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:44:05,613 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:44:05,613 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:44:05,613 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:44:05,613 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:44:05,613 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:44:05,613 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:44:05,613 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:44:05,613 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:44:05,613 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:44:05,613 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:44:05,614 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:44:05,614 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:44:05,614 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:44:05,614 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:44:05,614 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:44:05,614 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:44:05,614 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:44:05,614 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:44:05,614 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:44:05,614 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:44:05,614 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-jdk21/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 -> a812aad62102b8bb20af57f89ce6dbf7fb9ee1fa63f6f8ecf164ccf61d0713cb [2025-01-10 06:44:05,794 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:44:05,809 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:44:05,816 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:44:05,817 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:44:05,818 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:44:05,818 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/06-symbeq_08-tricky_address3.i [2025-01-10 06:44:07,048 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4847585a8/18b1b07f7b5b4a86b0b453bde19bef2b/FLAG6810789fa [2025-01-10 06:44:07,385 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:44:07,388 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/06-symbeq_08-tricky_address3.i [2025-01-10 06:44:07,419 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4847585a8/18b1b07f7b5b4a86b0b453bde19bef2b/FLAG6810789fa [2025-01-10 06:44:07,612 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4847585a8/18b1b07f7b5b4a86b0b453bde19bef2b [2025-01-10 06:44:07,613 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:44:07,615 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:44:07,615 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:44:07,615 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:44:07,618 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:44:07,619 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:44:07" (1/1) ... [2025-01-10 06:44:07,619 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d57fddb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:44:07, skipping insertion in model container [2025-01-10 06:44:07,620 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:44:07" (1/1) ... [2025-01-10 06:44:07,639 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:44:07,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:44:07,950 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:44:07,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:44:08,028 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:44:08,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:44:08 WrapperNode [2025-01-10 06:44:08,031 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:44:08,032 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:44:08,033 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:44:08,033 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:44:08,039 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:44:08" (1/1) ... [2025-01-10 06:44:08,054 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:44:08" (1/1) ... [2025-01-10 06:44:08,077 INFO L138 Inliner]: procedures = 265, calls = 74, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 135 [2025-01-10 06:44:08,082 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:44:08,082 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:44:08,082 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:44:08,083 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:44:08,091 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:44:08" (1/1) ... [2025-01-10 06:44:08,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:44:08" (1/1) ... [2025-01-10 06:44:08,094 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:44:08" (1/1) ... [2025-01-10 06:44:08,113 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-01-10 06:44:08,114 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:44:08" (1/1) ... [2025-01-10 06:44:08,114 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:44:08" (1/1) ... [2025-01-10 06:44:08,121 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:44:08" (1/1) ... [2025-01-10 06:44:08,126 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:44:08" (1/1) ... [2025-01-10 06:44:08,128 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:44:08" (1/1) ... [2025-01-10 06:44:08,129 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:44:08" (1/1) ... [2025-01-10 06:44:08,134 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:44:08" (1/1) ... [2025-01-10 06:44:08,136 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:44:08,136 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:44:08,136 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:44:08,136 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:44:08,137 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:44:08" (1/1) ... [2025-01-10 06:44:08,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:44:08,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:44:08,178 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 06:44:08,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 06:44:08,202 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 06:44:08,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:44:08,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:44:08,202 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 06:44:08,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:44:08,203 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-10 06:44:08,203 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-10 06:44:08,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:44:08,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:44:08,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:44:08,204 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 06:44:08,298 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:44:08,303 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:44:08,505 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:44:08,506 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:44:08,843 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:44:08,844 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 06:44:08,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:44:08 BoogieIcfgContainer [2025-01-10 06:44:08,845 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:44:08,846 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:44:08,847 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:44:08,850 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:44:08,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:44:07" (1/3) ... [2025-01-10 06:44:08,851 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b64dfe4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:44:08, skipping insertion in model container [2025-01-10 06:44:08,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:44:08" (2/3) ... [2025-01-10 06:44:08,853 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b64dfe4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:44:08, skipping insertion in model container [2025-01-10 06:44:08,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:44:08" (3/3) ... [2025-01-10 06:44:08,854 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_08-tricky_address3.i [2025-01-10 06:44:08,866 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:44:08,867 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_08-tricky_address3.i that has 2 procedures, 31 locations, 1 initial locations, 1 loop locations, and 8 error locations. [2025-01-10 06:44:08,867 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:44:08,906 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 06:44:08,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 31 transitions, 66 flow [2025-01-10 06:44:08,959 INFO L124 PetriNetUnfolderBase]: 1/30 cut-off events. [2025-01-10 06:44:08,962 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:44:08,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 30 events. 1/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 7. Up to 2 conditions per place. [2025-01-10 06:44:08,965 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 31 transitions, 66 flow [2025-01-10 06:44:08,967 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 30 transitions, 63 flow [2025-01-10 06:44:08,977 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:44:08,987 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3eabdaa4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:44:08,987 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-01-10 06:44:08,993 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:44:08,995 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-01-10 06:44:08,995 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:44:08,995 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:44:08,995 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 06:44:08,996 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:44:09,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:44:09,001 INFO L85 PathProgramCache]: Analyzing trace with hash 348226, now seen corresponding path program 1 times [2025-01-10 06:44:09,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:44:09,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140189605] [2025-01-10 06:44:09,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:44:09,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:44:09,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 06:44:09,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 06:44:09,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:44:09,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:44:09,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:44:09,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:44:09,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140189605] [2025-01-10 06:44:09,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140189605] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:44:09,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:44:09,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:44:09,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292442683] [2025-01-10 06:44:09,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:44:09,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:44:09,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:44:09,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:44:09,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:44:09,321 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2025-01-10 06:44:09,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 30 transitions, 63 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-01-10 06:44:09,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:44:09,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2025-01-10 06:44:09,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:44:09,456 INFO L124 PetriNetUnfolderBase]: 43/147 cut-off events. [2025-01-10 06:44:09,456 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:44:09,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 147 events. 43/147 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 552 event pairs, 42 based on Foata normal form. 1/131 useless extension candidates. Maximal degree in co-relation 233. Up to 105 conditions per place. [2025-01-10 06:44:09,459 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 19 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2025-01-10 06:44:09,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 32 transitions, 111 flow [2025-01-10 06:44:09,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:44:09,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:44:09,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2025-01-10 06:44:09,471 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5564516129032258 [2025-01-10 06:44:09,472 INFO L175 Difference]: Start difference. First operand has 33 places, 30 transitions, 63 flow. Second operand 4 states and 69 transitions. [2025-01-10 06:44:09,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 32 transitions, 111 flow [2025-01-10 06:44:09,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 32 transitions, 110 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:44:09,480 INFO L231 Difference]: Finished difference. Result has 37 places, 32 transitions, 86 flow [2025-01-10 06:44:09,482 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=86, PETRI_PLACES=37, PETRI_TRANSITIONS=32} [2025-01-10 06:44:09,485 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 4 predicate places. [2025-01-10 06:44:09,485 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 86 flow [2025-01-10 06:44:09,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-01-10 06:44:09,485 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:44:09,486 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-01-10 06:44:09,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:44:09,486 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:44:09,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:44:09,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1784403829, now seen corresponding path program 1 times [2025-01-10 06:44:09,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:44:09,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131254063] [2025-01-10 06:44:09,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:44:09,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:44:09,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:44:09,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:44:09,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:44:09,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:44:09,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:44:09,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:44:09,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131254063] [2025-01-10 06:44:09,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131254063] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:44:09,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405865727] [2025-01-10 06:44:09,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:44:09,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:44:09,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:44:09,620 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:44:09,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 06:44:09,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:44:09,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:44:09,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:44:09,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:44:09,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:44:09,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:44:09,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:44:09,733 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:44:09,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405865727] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:44:09,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:44:09,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-10 06:44:09,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623110251] [2025-01-10 06:44:09,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:44:09,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:44:09,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:44:09,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:44:09,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:44:09,742 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2025-01-10 06:44:09,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 86 flow. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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-01-10 06:44:09,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:44:09,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2025-01-10 06:44:09,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:44:09,846 INFO L124 PetriNetUnfolderBase]: 43/146 cut-off events. [2025-01-10 06:44:09,846 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 06:44:09,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267 conditions, 146 events. 43/146 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 547 event pairs, 42 based on Foata normal form. 1/130 useless extension candidates. Maximal degree in co-relation 250. Up to 100 conditions per place. [2025-01-10 06:44:09,847 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 15 selfloop transitions, 6 changer transitions 0/31 dead transitions. [2025-01-10 06:44:09,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 31 transitions, 124 flow [2025-01-10 06:44:09,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:44:09,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:44:09,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2025-01-10 06:44:09,848 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4731182795698925 [2025-01-10 06:44:09,848 INFO L175 Difference]: Start difference. First operand has 37 places, 32 transitions, 86 flow. Second operand 6 states and 88 transitions. [2025-01-10 06:44:09,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 31 transitions, 124 flow [2025-01-10 06:44:09,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 31 transitions, 122 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:44:09,852 INFO L231 Difference]: Finished difference. Result has 40 places, 31 transitions, 92 flow [2025-01-10 06:44:09,852 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=92, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2025-01-10 06:44:09,853 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 7 predicate places. [2025-01-10 06:44:09,853 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 92 flow [2025-01-10 06:44:09,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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-01-10 06:44:09,853 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:44:09,853 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-01-10 06:44:09,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 06:44:10,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:44:10,059 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:44:10,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:44:10,059 INFO L85 PathProgramCache]: Analyzing trace with hash -518055809, now seen corresponding path program 1 times [2025-01-10 06:44:10,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:44:10,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739970582] [2025-01-10 06:44:10,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:44:10,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:44:10,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:44:10,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:44:10,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:44:10,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:44:10,147 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:44:10,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:44:10,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739970582] [2025-01-10 06:44:10,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739970582] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:44:10,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:44:10,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:44:10,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634463078] [2025-01-10 06:44:10,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:44:10,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:44:10,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:44:10,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:44:10,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:44:10,152 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2025-01-10 06:44:10,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-01-10 06:44:10,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:44:10,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2025-01-10 06:44:10,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:44:10,193 INFO L124 PetriNetUnfolderBase]: 43/145 cut-off events. [2025-01-10 06:44:10,194 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-10 06:44:10,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 145 events. 43/145 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 545 event pairs, 42 based on Foata normal form. 1/130 useless extension candidates. Maximal degree in co-relation 246. Up to 103 conditions per place. [2025-01-10 06:44:10,195 INFO L140 encePairwiseOnDemand]: 28/31 looper letters, 16 selfloop transitions, 4 changer transitions 0/30 dead transitions. [2025-01-10 06:44:10,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 30 transitions, 128 flow [2025-01-10 06:44:10,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:44:10,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:44:10,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2025-01-10 06:44:10,196 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5591397849462365 [2025-01-10 06:44:10,196 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 92 flow. Second operand 3 states and 52 transitions. [2025-01-10 06:44:10,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 30 transitions, 128 flow [2025-01-10 06:44:10,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 30 transitions, 106 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-01-10 06:44:10,197 INFO L231 Difference]: Finished difference. Result has 35 places, 30 transitions, 74 flow [2025-01-10 06:44:10,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=35, PETRI_TRANSITIONS=30} [2025-01-10 06:44:10,198 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 2 predicate places. [2025-01-10 06:44:10,198 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 30 transitions, 74 flow [2025-01-10 06:44:10,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-01-10 06:44:10,198 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:44:10,198 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:44:10,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:44:10,198 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:44:10,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:44:10,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1526150787, now seen corresponding path program 1 times [2025-01-10 06:44:10,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:44:10,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759553856] [2025-01-10 06:44:10,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:44:10,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:44:10,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:44:10,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:44:10,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:44:10,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:44:10,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:44:10,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:44:10,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759553856] [2025-01-10 06:44:10,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759553856] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:44:10,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932248210] [2025-01-10 06:44:10,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:44:10,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:44:10,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:44:10,272 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:44:10,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 06:44:10,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:44:10,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:44:10,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:44:10,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:44:10,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:44:10,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:44:10,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:44:10,347 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:44:10,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:44:10,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932248210] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:44:10,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:44:10,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-01-10 06:44:10,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780903069] [2025-01-10 06:44:10,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:44:10,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:44:10,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:44:10,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:44:10,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:44:10,406 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2025-01-10 06:44:10,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 30 transitions, 74 flow. Second operand has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 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-01-10 06:44:10,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:44:10,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2025-01-10 06:44:10,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:44:10,506 INFO L124 PetriNetUnfolderBase]: 43/149 cut-off events. [2025-01-10 06:44:10,507 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-01-10 06:44:10,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 149 events. 43/149 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 540 event pairs, 42 based on Foata normal form. 2/136 useless extension candidates. Maximal degree in co-relation 239. Up to 101 conditions per place. [2025-01-10 06:44:10,508 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 16 selfloop transitions, 7 changer transitions 0/33 dead transitions. [2025-01-10 06:44:10,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 33 transitions, 135 flow [2025-01-10 06:44:10,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:44:10,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 06:44:10,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2025-01-10 06:44:10,509 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4700460829493088 [2025-01-10 06:44:10,510 INFO L175 Difference]: Start difference. First operand has 35 places, 30 transitions, 74 flow. Second operand 7 states and 102 transitions. [2025-01-10 06:44:10,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 33 transitions, 135 flow [2025-01-10 06:44:10,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 33 transitions, 121 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:44:10,511 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 100 flow [2025-01-10 06:44:10,511 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=100, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2025-01-10 06:44:10,511 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 8 predicate places. [2025-01-10 06:44:10,511 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 100 flow [2025-01-10 06:44:10,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 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-01-10 06:44:10,512 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:44:10,512 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:44:10,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 06:44:10,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:44:10,713 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:44:10,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:44:10,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1188972963, now seen corresponding path program 2 times [2025-01-10 06:44:10,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:44:10,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005674254] [2025-01-10 06:44:10,714 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:44:10,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:44:10,722 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-01-10 06:44:10,746 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 16 statements. [2025-01-10 06:44:10,747 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:44:10,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:44:11,600 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 06:44:11,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:44:11,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005674254] [2025-01-10 06:44:11,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005674254] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:44:11,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:44:11,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:44:11,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546358921] [2025-01-10 06:44:11,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:44:11,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:44:11,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:44:11,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:44:11,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:44:11,617 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2025-01-10 06:44:11,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 100 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 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-01-10 06:44:11,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:44:11,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2025-01-10 06:44:11,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:44:11,818 INFO L124 PetriNetUnfolderBase]: 49/151 cut-off events. [2025-01-10 06:44:11,820 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-01-10 06:44:11,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 296 conditions, 151 events. 49/151 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 499 event pairs, 20 based on Foata normal form. 8/150 useless extension candidates. Maximal degree in co-relation 258. Up to 79 conditions per place. [2025-01-10 06:44:11,822 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 31 selfloop transitions, 5 changer transitions 6/50 dead transitions. [2025-01-10 06:44:11,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 50 transitions, 218 flow [2025-01-10 06:44:11,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:44:11,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:44:11,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2025-01-10 06:44:11,824 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5752688172043011 [2025-01-10 06:44:11,824 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 100 flow. Second operand 6 states and 107 transitions. [2025-01-10 06:44:11,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 50 transitions, 218 flow [2025-01-10 06:44:11,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 50 transitions, 214 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:44:11,827 INFO L231 Difference]: Finished difference. Result has 47 places, 34 transitions, 123 flow [2025-01-10 06:44:11,827 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=123, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2025-01-10 06:44:11,828 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 14 predicate places. [2025-01-10 06:44:11,829 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 123 flow [2025-01-10 06:44:11,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 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-01-10 06:44:11,829 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:44:11,829 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:44:11,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:44:11,829 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:44:11,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:44:11,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1188644459, now seen corresponding path program 1 times [2025-01-10 06:44:11,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:44:11,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233099958] [2025-01-10 06:44:11,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:44:11,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:44:11,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:44:11,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:44:11,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:44:11,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:44:11,889 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 06:44:11,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:44:11,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233099958] [2025-01-10 06:44:11,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233099958] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:44:11,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:44:11,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:44:11,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586654407] [2025-01-10 06:44:11,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:44:11,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:44:11,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:44:11,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:44:11,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:44:11,897 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2025-01-10 06:44:11,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 123 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 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-01-10 06:44:11,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:44:11,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2025-01-10 06:44:11,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:44:11,970 INFO L124 PetriNetUnfolderBase]: 39/142 cut-off events. [2025-01-10 06:44:11,971 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-01-10 06:44:11,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 315 conditions, 142 events. 39/142 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 531 event pairs, 2 based on Foata normal form. 7/135 useless extension candidates. Maximal degree in co-relation 288. Up to 59 conditions per place. [2025-01-10 06:44:11,972 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 34 selfloop transitions, 3 changer transitions 0/45 dead transitions. [2025-01-10 06:44:11,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 45 transitions, 233 flow [2025-01-10 06:44:11,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:44:11,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:44:11,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2025-01-10 06:44:11,974 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6129032258064516 [2025-01-10 06:44:11,974 INFO L175 Difference]: Start difference. First operand has 47 places, 34 transitions, 123 flow. Second operand 4 states and 76 transitions. [2025-01-10 06:44:11,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 45 transitions, 233 flow [2025-01-10 06:44:11,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 45 transitions, 222 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-01-10 06:44:11,976 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 118 flow [2025-01-10 06:44:11,976 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2025-01-10 06:44:11,976 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 12 predicate places. [2025-01-10 06:44:11,976 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 118 flow [2025-01-10 06:44:11,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 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-01-10 06:44:11,976 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:44:11,977 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:44:11,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:44:11,977 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:44:11,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:44:11,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1806727801, now seen corresponding path program 1 times [2025-01-10 06:44:11,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:44:11,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673292834] [2025-01-10 06:44:11,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:44:11,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:44:11,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:44:11,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:44:11,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:44:11,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:44:12,028 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 06:44:12,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:44:12,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673292834] [2025-01-10 06:44:12,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673292834] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:44:12,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:44:12,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:44:12,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298910501] [2025-01-10 06:44:12,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:44:12,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:44:12,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:44:12,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:44:12,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:44:12,032 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2025-01-10 06:44:12,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 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-01-10 06:44:12,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:44:12,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2025-01-10 06:44:12,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:44:12,167 INFO L124 PetriNetUnfolderBase]: 33/118 cut-off events. [2025-01-10 06:44:12,167 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-01-10 06:44:12,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 118 events. 33/118 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 357 event pairs, 14 based on Foata normal form. 7/121 useless extension candidates. Maximal degree in co-relation 240. Up to 50 conditions per place. [2025-01-10 06:44:12,168 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 33 selfloop transitions, 3 changer transitions 0/44 dead transitions. [2025-01-10 06:44:12,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 44 transitions, 224 flow [2025-01-10 06:44:12,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:44:12,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:44:12,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2025-01-10 06:44:12,173 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6048387096774194 [2025-01-10 06:44:12,174 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 118 flow. Second operand 4 states and 75 transitions. [2025-01-10 06:44:12,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 44 transitions, 224 flow [2025-01-10 06:44:12,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 44 transitions, 218 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:44:12,175 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 116 flow [2025-01-10 06:44:12,175 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=116, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2025-01-10 06:44:12,176 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 11 predicate places. [2025-01-10 06:44:12,176 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 116 flow [2025-01-10 06:44:12,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 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-01-10 06:44:12,176 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:44:12,176 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:44:12,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:44:12,176 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:44:12,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:44:12,179 INFO L85 PathProgramCache]: Analyzing trace with hash 173987351, now seen corresponding path program 1 times [2025-01-10 06:44:12,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:44:12,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194793677] [2025-01-10 06:44:12,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:44:12,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:44:12,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 06:44:12,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 06:44:12,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:44:12,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:44:12,297 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:44:12,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:44:12,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194793677] [2025-01-10 06:44:12,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194793677] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:44:12,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147116715] [2025-01-10 06:44:12,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:44:12,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:44:12,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:44:12,303 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:44:12,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 06:44:12,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 06:44:12,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 06:44:12,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:44:12,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:44:12,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 06:44:12,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:44:12,395 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:44:12,395 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:44:12,472 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:44:12,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147116715] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:44:12,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:44:12,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-01-10 06:44:12,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546906963] [2025-01-10 06:44:12,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:44:12,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 06:44:12,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:44:12,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 06:44:12,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-01-10 06:44:12,487 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2025-01-10 06:44:12,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 116 flow. Second operand has 18 states, 18 states have (on average 12.333333333333334) internal successors, (222), 18 states have internal predecessors, (222), 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-01-10 06:44:12,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:44:12,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2025-01-10 06:44:12,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:44:12,614 INFO L124 PetriNetUnfolderBase]: 33/135 cut-off events. [2025-01-10 06:44:12,614 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2025-01-10 06:44:12,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 135 events. 33/135 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 394 event pairs, 32 based on Foata normal form. 4/133 useless extension candidates. Maximal degree in co-relation 245. Up to 82 conditions per place. [2025-01-10 06:44:12,615 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 17 selfloop transitions, 15 changer transitions 0/40 dead transitions. [2025-01-10 06:44:12,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 40 transitions, 228 flow [2025-01-10 06:44:12,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 06:44:12,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-10 06:44:12,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 200 transitions. [2025-01-10 06:44:12,617 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43010752688172044 [2025-01-10 06:44:12,617 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 116 flow. Second operand 15 states and 200 transitions. [2025-01-10 06:44:12,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 40 transitions, 228 flow [2025-01-10 06:44:12,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 40 transitions, 222 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:44:12,618 INFO L231 Difference]: Finished difference. Result has 59 places, 40 transitions, 207 flow [2025-01-10 06:44:12,618 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=207, PETRI_PLACES=59, PETRI_TRANSITIONS=40} [2025-01-10 06:44:12,618 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 26 predicate places. [2025-01-10 06:44:12,619 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 40 transitions, 207 flow [2025-01-10 06:44:12,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 12.333333333333334) internal successors, (222), 18 states have internal predecessors, (222), 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-01-10 06:44:12,619 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:44:12,619 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:44:12,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 06:44:12,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:44:12,823 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:44:12,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:44:12,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1219872727, now seen corresponding path program 2 times [2025-01-10 06:44:12,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:44:12,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894177222] [2025-01-10 06:44:12,824 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:44:12,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:44:12,832 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-01-10 06:44:12,859 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 30 statements. [2025-01-10 06:44:12,859 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:44:12,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:44:13,183 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-01-10 06:44:13,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:44:13,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894177222] [2025-01-10 06:44:13,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894177222] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:44:13,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:44:13,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:44:13,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169264853] [2025-01-10 06:44:13,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:44:13,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:44:13,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:44:13,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:44:13,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:44:13,191 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2025-01-10 06:44:13,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 40 transitions, 207 flow. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 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-01-10 06:44:13,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:44:13,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2025-01-10 06:44:13,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:44:13,342 INFO L124 PetriNetUnfolderBase]: 36/136 cut-off events. [2025-01-10 06:44:13,342 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2025-01-10 06:44:13,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 340 conditions, 136 events. 36/136 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 383 event pairs, 8 based on Foata normal form. 14/150 useless extension candidates. Maximal degree in co-relation 241. Up to 57 conditions per place. [2025-01-10 06:44:13,343 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 40 selfloop transitions, 6 changer transitions 4/56 dead transitions. [2025-01-10 06:44:13,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 56 transitions, 351 flow [2025-01-10 06:44:13,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:44:13,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:44:13,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2025-01-10 06:44:13,344 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5752688172043011 [2025-01-10 06:44:13,344 INFO L175 Difference]: Start difference. First operand has 59 places, 40 transitions, 207 flow. Second operand 6 states and 107 transitions. [2025-01-10 06:44:13,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 56 transitions, 351 flow [2025-01-10 06:44:13,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 56 transitions, 341 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-01-10 06:44:13,346 INFO L231 Difference]: Finished difference. Result has 64 places, 43 transitions, 237 flow [2025-01-10 06:44:13,346 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=237, PETRI_PLACES=64, PETRI_TRANSITIONS=43} [2025-01-10 06:44:13,347 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 31 predicate places. [2025-01-10 06:44:13,347 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 43 transitions, 237 flow [2025-01-10 06:44:13,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 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-01-10 06:44:13,347 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:44:13,347 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:44:13,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:44:13,347 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:44:13,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:44:13,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1908998265, now seen corresponding path program 1 times [2025-01-10 06:44:13,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:44:13,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536914274] [2025-01-10 06:44:13,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:44:13,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:44:13,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-10 06:44:13,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 06:44:13,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:44:13,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:44:13,548 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:44:13,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:44:13,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536914274] [2025-01-10 06:44:13,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536914274] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:44:13,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100058376] [2025-01-10 06:44:13,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:44:13,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:44:13,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:44:13,551 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:44:13,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 06:44:13,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-10 06:44:13,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 06:44:13,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:44:13,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:44:13,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 06:44:13,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:44:13,685 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:44:13,685 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:44:13,929 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:44:13,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100058376] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:44:13,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:44:13,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 22 [2025-01-10 06:44:13,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037144844] [2025-01-10 06:44:13,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:44:13,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-10 06:44:13,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:44:13,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-10 06:44:13,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-01-10 06:44:13,961 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2025-01-10 06:44:13,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 43 transitions, 237 flow. Second operand has 23 states, 23 states have (on average 12.478260869565217) internal successors, (287), 23 states have internal predecessors, (287), 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-01-10 06:44:13,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:44:13,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2025-01-10 06:44:13,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:44:14,164 INFO L124 PetriNetUnfolderBase]: 32/135 cut-off events. [2025-01-10 06:44:14,165 INFO L125 PetriNetUnfolderBase]: For 176/176 co-relation queries the response was YES. [2025-01-10 06:44:14,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 393 conditions, 135 events. 32/135 cut-off events. For 176/176 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 331 event pairs, 28 based on Foata normal form. 3/137 useless extension candidates. Maximal degree in co-relation 370. Up to 81 conditions per place. [2025-01-10 06:44:14,166 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 20 selfloop transitions, 21 changer transitions 0/49 dead transitions. [2025-01-10 06:44:14,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 49 transitions, 373 flow [2025-01-10 06:44:14,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-10 06:44:14,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-01-10 06:44:14,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 271 transitions. [2025-01-10 06:44:14,167 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4162826420890937 [2025-01-10 06:44:14,167 INFO L175 Difference]: Start difference. First operand has 64 places, 43 transitions, 237 flow. Second operand 21 states and 271 transitions. [2025-01-10 06:44:14,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 49 transitions, 373 flow [2025-01-10 06:44:14,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 49 transitions, 365 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-01-10 06:44:14,170 INFO L231 Difference]: Finished difference. Result has 84 places, 49 transitions, 340 flow [2025-01-10 06:44:14,170 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=340, PETRI_PLACES=84, PETRI_TRANSITIONS=49} [2025-01-10 06:44:14,171 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 51 predicate places. [2025-01-10 06:44:14,171 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 49 transitions, 340 flow [2025-01-10 06:44:14,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 12.478260869565217) internal successors, (287), 23 states have internal predecessors, (287), 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-01-10 06:44:14,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:44:14,171 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:44:14,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 06:44:14,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-10 06:44:14,376 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:44:14,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:44:14,377 INFO L85 PathProgramCache]: Analyzing trace with hash -221561762, now seen corresponding path program 2 times [2025-01-10 06:44:14,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:44:14,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378972168] [2025-01-10 06:44:14,377 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:44:14,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:44:14,385 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-01-10 06:44:14,444 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 44 statements. [2025-01-10 06:44:14,444 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:44:14,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:44:19,730 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:44:19,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:44:19,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378972168] [2025-01-10 06:44:19,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378972168] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:44:19,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:44:19,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 06:44:19,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946985433] [2025-01-10 06:44:19,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:44:19,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:44:19,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:44:19,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:44:19,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:44:19,761 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2025-01-10 06:44:19,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 49 transitions, 340 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 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-01-10 06:44:19,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:44:19,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2025-01-10 06:44:19,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:44:21,541 INFO L124 PetriNetUnfolderBase]: 70/209 cut-off events. [2025-01-10 06:44:21,541 INFO L125 PetriNetUnfolderBase]: For 239/239 co-relation queries the response was YES. [2025-01-10 06:44:21,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 620 conditions, 209 events. 70/209 cut-off events. For 239/239 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 677 event pairs, 12 based on Foata normal form. 3/212 useless extension candidates. Maximal degree in co-relation 457. Up to 44 conditions per place. [2025-01-10 06:44:21,542 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 65 selfloop transitions, 17 changer transitions 3/87 dead transitions. [2025-01-10 06:44:21,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 87 transitions, 626 flow [2025-01-10 06:44:21,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 06:44:21,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 06:44:21,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 144 transitions. [2025-01-10 06:44:21,544 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4222873900293255 [2025-01-10 06:44:21,544 INFO L175 Difference]: Start difference. First operand has 84 places, 49 transitions, 340 flow. Second operand 11 states and 144 transitions. [2025-01-10 06:44:21,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 87 transitions, 626 flow [2025-01-10 06:44:21,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 87 transitions, 583 flow, removed 1 selfloop flow, removed 13 redundant places. [2025-01-10 06:44:21,547 INFO L231 Difference]: Finished difference. Result has 87 places, 60 transitions, 410 flow [2025-01-10 06:44:21,549 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=410, PETRI_PLACES=87, PETRI_TRANSITIONS=60} [2025-01-10 06:44:21,550 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 54 predicate places. [2025-01-10 06:44:21,551 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 60 transitions, 410 flow [2025-01-10 06:44:21,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 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-01-10 06:44:21,551 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:44:21,551 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:44:21,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 06:44:21,551 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:44:21,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:44:21,552 INFO L85 PathProgramCache]: Analyzing trace with hash 652531852, now seen corresponding path program 3 times [2025-01-10 06:44:21,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:44:21,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16466222] [2025-01-10 06:44:21,552 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:44:21,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:44:21,561 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 11 equivalence classes. [2025-01-10 06:44:21,598 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 14 of 44 statements. [2025-01-10 06:44:21,599 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 06:44:21,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:44:24,576 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:44:24,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:44:24,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16466222] [2025-01-10 06:44:24,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16466222] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:44:24,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:44:24,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 06:44:24,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709292254] [2025-01-10 06:44:24,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:44:24,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 06:44:24,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:44:24,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 06:44:24,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-10 06:44:24,608 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2025-01-10 06:44:24,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 60 transitions, 410 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:44:24,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:44:24,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2025-01-10 06:44:24,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:44:25,978 INFO L124 PetriNetUnfolderBase]: 80/247 cut-off events. [2025-01-10 06:44:25,979 INFO L125 PetriNetUnfolderBase]: For 411/413 co-relation queries the response was YES. [2025-01-10 06:44:25,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 828 conditions, 247 events. 80/247 cut-off events. For 411/413 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 901 event pairs, 22 based on Foata normal form. 5/252 useless extension candidates. Maximal degree in co-relation 743. Up to 65 conditions per place. [2025-01-10 06:44:25,980 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 66 selfloop transitions, 27 changer transitions 7/102 dead transitions. [2025-01-10 06:44:25,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 102 transitions, 816 flow [2025-01-10 06:44:25,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-10 06:44:25,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-01-10 06:44:25,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 190 transitions. [2025-01-10 06:44:25,982 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3605313092979127 [2025-01-10 06:44:25,982 INFO L175 Difference]: Start difference. First operand has 87 places, 60 transitions, 410 flow. Second operand 17 states and 190 transitions. [2025-01-10 06:44:25,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 102 transitions, 816 flow [2025-01-10 06:44:25,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 102 transitions, 786 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-01-10 06:44:25,988 INFO L231 Difference]: Finished difference. Result has 104 places, 73 transitions, 563 flow [2025-01-10 06:44:25,988 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=563, PETRI_PLACES=104, PETRI_TRANSITIONS=73} [2025-01-10 06:44:25,989 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 71 predicate places. [2025-01-10 06:44:25,989 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 73 transitions, 563 flow [2025-01-10 06:44:25,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:44:25,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:44:25,989 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:44:25,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 06:44:25,989 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:44:25,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:44:25,990 INFO L85 PathProgramCache]: Analyzing trace with hash 220982179, now seen corresponding path program 1 times [2025-01-10 06:44:25,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:44:25,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099499247] [2025-01-10 06:44:25,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:44:25,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:44:25,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-10 06:44:26,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 06:44:26,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:44:26,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:44:28,110 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:44:28,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:44:28,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099499247] [2025-01-10 06:44:28,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099499247] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:44:28,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:44:28,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 06:44:28,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812377717] [2025-01-10 06:44:28,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:44:28,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:44:28,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:44:28,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:44:28,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:44:28,125 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2025-01-10 06:44:28,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 73 transitions, 563 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 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-01-10 06:44:28,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:44:28,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2025-01-10 06:44:28,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:44:28,949 INFO L124 PetriNetUnfolderBase]: 83/261 cut-off events. [2025-01-10 06:44:28,949 INFO L125 PetriNetUnfolderBase]: For 522/526 co-relation queries the response was YES. [2025-01-10 06:44:28,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 942 conditions, 261 events. 83/261 cut-off events. For 522/526 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1006 event pairs, 30 based on Foata normal form. 7/268 useless extension candidates. Maximal degree in co-relation 847. Up to 125 conditions per place. [2025-01-10 06:44:28,951 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 66 selfloop transitions, 32 changer transitions 5/105 dead transitions. [2025-01-10 06:44:28,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 105 transitions, 918 flow [2025-01-10 06:44:28,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-10 06:44:28,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-01-10 06:44:28,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 184 transitions. [2025-01-10 06:44:28,952 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3709677419354839 [2025-01-10 06:44:28,952 INFO L175 Difference]: Start difference. First operand has 104 places, 73 transitions, 563 flow. Second operand 16 states and 184 transitions. [2025-01-10 06:44:28,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 105 transitions, 918 flow [2025-01-10 06:44:28,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 105 transitions, 844 flow, removed 12 selfloop flow, removed 6 redundant places. [2025-01-10 06:44:28,956 INFO L231 Difference]: Finished difference. Result has 116 places, 84 transitions, 669 flow [2025-01-10 06:44:28,956 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=505, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=669, PETRI_PLACES=116, PETRI_TRANSITIONS=84} [2025-01-10 06:44:28,957 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 83 predicate places. [2025-01-10 06:44:28,957 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 84 transitions, 669 flow [2025-01-10 06:44:28,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 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-01-10 06:44:28,957 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:44:28,957 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:44:28,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 06:44:28,957 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:44:28,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:44:28,958 INFO L85 PathProgramCache]: Analyzing trace with hash 389309547, now seen corresponding path program 2 times [2025-01-10 06:44:28,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:44:28,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459874921] [2025-01-10 06:44:28,958 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:44:28,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:44:28,966 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-01-10 06:44:28,978 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 44 statements. [2025-01-10 06:44:28,978 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:44:28,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:44:34,062 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:44:34,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:44:34,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459874921] [2025-01-10 06:44:34,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459874921] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:44:34,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:44:34,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 06:44:34,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777663361] [2025-01-10 06:44:34,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:44:34,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 06:44:34,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:44:34,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 06:44:34,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-10 06:44:34,125 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2025-01-10 06:44:34,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 84 transitions, 669 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:44:34,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:44:34,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2025-01-10 06:44:34,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:44:35,790 INFO L124 PetriNetUnfolderBase]: 87/279 cut-off events. [2025-01-10 06:44:35,791 INFO L125 PetriNetUnfolderBase]: For 612/616 co-relation queries the response was YES. [2025-01-10 06:44:35,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1033 conditions, 279 events. 87/279 cut-off events. For 612/616 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1153 event pairs, 35 based on Foata normal form. 4/283 useless extension candidates. Maximal degree in co-relation 939. Up to 133 conditions per place. [2025-01-10 06:44:35,795 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 66 selfloop transitions, 37 changer transitions 7/112 dead transitions. [2025-01-10 06:44:35,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 112 transitions, 1028 flow [2025-01-10 06:44:35,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-10 06:44:35,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-01-10 06:44:35,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 203 transitions. [2025-01-10 06:44:35,797 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34465195246179964 [2025-01-10 06:44:35,797 INFO L175 Difference]: Start difference. First operand has 116 places, 84 transitions, 669 flow. Second operand 19 states and 203 transitions. [2025-01-10 06:44:35,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 112 transitions, 1028 flow [2025-01-10 06:44:35,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 112 transitions, 994 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-01-10 06:44:35,809 INFO L231 Difference]: Finished difference. Result has 135 places, 90 transitions, 794 flow [2025-01-10 06:44:35,809 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=794, PETRI_PLACES=135, PETRI_TRANSITIONS=90} [2025-01-10 06:44:35,810 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 102 predicate places. [2025-01-10 06:44:35,810 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 90 transitions, 794 flow [2025-01-10 06:44:35,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:44:35,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:44:35,810 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:44:35,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 06:44:35,810 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:44:35,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:44:35,811 INFO L85 PathProgramCache]: Analyzing trace with hash 390462747, now seen corresponding path program 3 times [2025-01-10 06:44:35,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:44:35,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605501202] [2025-01-10 06:44:35,811 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:44:35,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:44:35,818 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 11 equivalence classes. [2025-01-10 06:44:35,827 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 14 of 44 statements. [2025-01-10 06:44:35,827 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 06:44:35,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:44:40,210 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:44:40,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:44:40,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605501202] [2025-01-10 06:44:40,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605501202] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:44:40,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:44:40,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 06:44:40,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512815192] [2025-01-10 06:44:40,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:44:40,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 06:44:40,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:44:40,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 06:44:40,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-01-10 06:44:40,235 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2025-01-10 06:44:40,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 90 transitions, 794 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:44:40,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:44:40,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2025-01-10 06:44:40,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:44:41,551 INFO L124 PetriNetUnfolderBase]: 89/289 cut-off events. [2025-01-10 06:44:41,551 INFO L125 PetriNetUnfolderBase]: For 846/851 co-relation queries the response was YES. [2025-01-10 06:44:41,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1142 conditions, 289 events. 89/289 cut-off events. For 846/851 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1232 event pairs, 30 based on Foata normal form. 5/294 useless extension candidates. Maximal degree in co-relation 1069. Up to 129 conditions per place. [2025-01-10 06:44:41,554 INFO L140 encePairwiseOnDemand]: 18/31 looper letters, 71 selfloop transitions, 44 changer transitions 0/117 dead transitions. [2025-01-10 06:44:41,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 117 transitions, 1148 flow [2025-01-10 06:44:41,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-10 06:44:41,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-01-10 06:44:41,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 189 transitions. [2025-01-10 06:44:41,556 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3586337760910816 [2025-01-10 06:44:41,556 INFO L175 Difference]: Start difference. First operand has 135 places, 90 transitions, 794 flow. Second operand 17 states and 189 transitions. [2025-01-10 06:44:41,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 117 transitions, 1148 flow [2025-01-10 06:44:41,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 117 transitions, 1104 flow, removed 7 selfloop flow, removed 7 redundant places. [2025-01-10 06:44:41,564 INFO L231 Difference]: Finished difference. Result has 145 places, 98 transitions, 925 flow [2025-01-10 06:44:41,564 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=925, PETRI_PLACES=145, PETRI_TRANSITIONS=98} [2025-01-10 06:44:41,565 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 112 predicate places. [2025-01-10 06:44:41,565 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 98 transitions, 925 flow [2025-01-10 06:44:41,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:44:41,565 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:44:41,565 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:44:41,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 06:44:41,566 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:44:41,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:44:41,566 INFO L85 PathProgramCache]: Analyzing trace with hash 221410881, now seen corresponding path program 4 times [2025-01-10 06:44:41,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:44:41,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139641333] [2025-01-10 06:44:41,567 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 06:44:41,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:44:41,577 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-01-10 06:44:41,612 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 06:44:41,612 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 06:44:41,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:44:45,651 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:44:45,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:44:45,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139641333] [2025-01-10 06:44:45,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139641333] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:44:45,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:44:45,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 06:44:45,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194293957] [2025-01-10 06:44:45,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:44:45,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:44:45,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:44:45,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:44:45,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:44:45,665 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2025-01-10 06:44:45,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 98 transitions, 925 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 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-01-10 06:44:45,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:44:45,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2025-01-10 06:44:45,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:44:46,843 INFO L124 PetriNetUnfolderBase]: 90/299 cut-off events. [2025-01-10 06:44:46,844 INFO L125 PetriNetUnfolderBase]: For 1015/1019 co-relation queries the response was YES. [2025-01-10 06:44:46,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1267 conditions, 299 events. 90/299 cut-off events. For 1015/1019 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1321 event pairs, 40 based on Foata normal form. 7/306 useless extension candidates. Maximal degree in co-relation 1153. Up to 142 conditions per place. [2025-01-10 06:44:46,850 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 79 selfloop transitions, 39 changer transitions 0/120 dead transitions. [2025-01-10 06:44:46,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 120 transitions, 1281 flow [2025-01-10 06:44:46,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 06:44:46,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-10 06:44:46,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 163 transitions. [2025-01-10 06:44:46,855 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37557603686635943 [2025-01-10 06:44:46,855 INFO L175 Difference]: Start difference. First operand has 145 places, 98 transitions, 925 flow. Second operand 14 states and 163 transitions. [2025-01-10 06:44:46,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 120 transitions, 1281 flow [2025-01-10 06:44:46,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 120 transitions, 1203 flow, removed 8 selfloop flow, removed 10 redundant places. [2025-01-10 06:44:46,871 INFO L231 Difference]: Finished difference. Result has 153 places, 104 transitions, 1028 flow [2025-01-10 06:44:46,872 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1028, PETRI_PLACES=153, PETRI_TRANSITIONS=104} [2025-01-10 06:44:46,873 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 120 predicate places. [2025-01-10 06:44:46,877 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 104 transitions, 1028 flow [2025-01-10 06:44:46,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 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-01-10 06:44:46,878 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:44:46,878 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:44:46,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 06:44:46,878 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:44:46,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:44:46,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1294311172, now seen corresponding path program 4 times [2025-01-10 06:44:46,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:44:46,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231227150] [2025-01-10 06:44:46,878 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 06:44:46,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:44:46,892 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-01-10 06:44:46,974 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 06:44:46,978 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 06:44:46,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:44:48,038 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:44:48,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:44:48,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231227150] [2025-01-10 06:44:48,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231227150] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:44:48,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:44:48,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 06:44:48,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198432091] [2025-01-10 06:44:48,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:44:48,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:44:48,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:44:48,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:44:48,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:44:48,048 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2025-01-10 06:44:48,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 104 transitions, 1028 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 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-01-10 06:44:48,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:44:48,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2025-01-10 06:44:48,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:44:48,585 INFO L124 PetriNetUnfolderBase]: 92/309 cut-off events. [2025-01-10 06:44:48,585 INFO L125 PetriNetUnfolderBase]: For 1158/1162 co-relation queries the response was YES. [2025-01-10 06:44:48,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1342 conditions, 309 events. 92/309 cut-off events. For 1158/1162 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1399 event pairs, 29 based on Foata normal form. 7/316 useless extension candidates. Maximal degree in co-relation 1239. Up to 119 conditions per place. [2025-01-10 06:44:48,587 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 90 selfloop transitions, 42 changer transitions 1/135 dead transitions. [2025-01-10 06:44:48,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 135 transitions, 1436 flow [2025-01-10 06:44:48,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-10 06:44:48,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-01-10 06:44:48,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 189 transitions. [2025-01-10 06:44:48,588 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3586337760910816 [2025-01-10 06:44:48,589 INFO L175 Difference]: Start difference. First operand has 153 places, 104 transitions, 1028 flow. Second operand 17 states and 189 transitions. [2025-01-10 06:44:48,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 135 transitions, 1436 flow [2025-01-10 06:44:48,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 135 transitions, 1408 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-01-10 06:44:48,595 INFO L231 Difference]: Finished difference. Result has 171 places, 114 transitions, 1166 flow [2025-01-10 06:44:48,596 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1001, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1166, PETRI_PLACES=171, PETRI_TRANSITIONS=114} [2025-01-10 06:44:48,596 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 138 predicate places. [2025-01-10 06:44:48,596 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 114 transitions, 1166 flow [2025-01-10 06:44:48,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 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-01-10 06:44:48,596 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:44:48,596 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:44:48,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 06:44:48,597 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:44:48,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:44:48,597 INFO L85 PathProgramCache]: Analyzing trace with hash -805159514, now seen corresponding path program 1 times [2025-01-10 06:44:48,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:44:48,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209534860] [2025-01-10 06:44:48,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:44:48,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:44:48,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-10 06:44:48,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-10 06:44:48,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:44:48,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:44:50,878 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:44:50,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:44:50,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209534860] [2025-01-10 06:44:50,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209534860] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:44:50,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:44:50,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 06:44:50,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292333566] [2025-01-10 06:44:50,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:44:50,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:44:50,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:44:50,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:44:50,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:44:50,923 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2025-01-10 06:44:50,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 114 transitions, 1166 flow. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:44:50,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:44:50,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2025-01-10 06:44:50,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:44:52,644 INFO L124 PetriNetUnfolderBase]: 80/315 cut-off events. [2025-01-10 06:44:52,645 INFO L125 PetriNetUnfolderBase]: For 1592/1596 co-relation queries the response was YES. [2025-01-10 06:44:52,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1448 conditions, 315 events. 80/315 cut-off events. For 1592/1596 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1583 event pairs, 28 based on Foata normal form. 7/322 useless extension candidates. Maximal degree in co-relation 1326. Up to 144 conditions per place. [2025-01-10 06:44:52,648 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 69 selfloop transitions, 19 changer transitions 25/132 dead transitions. [2025-01-10 06:44:52,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 132 transitions, 1503 flow [2025-01-10 06:44:52,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:44:52,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:44:52,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 138 transitions. [2025-01-10 06:44:52,649 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44516129032258067 [2025-01-10 06:44:52,649 INFO L175 Difference]: Start difference. First operand has 171 places, 114 transitions, 1166 flow. Second operand 10 states and 138 transitions. [2025-01-10 06:44:52,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 132 transitions, 1503 flow [2025-01-10 06:44:52,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 132 transitions, 1413 flow, removed 6 selfloop flow, removed 10 redundant places. [2025-01-10 06:44:52,658 INFO L231 Difference]: Finished difference. Result has 172 places, 102 transitions, 984 flow [2025-01-10 06:44:52,659 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1084, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=984, PETRI_PLACES=172, PETRI_TRANSITIONS=102} [2025-01-10 06:44:52,660 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 139 predicate places. [2025-01-10 06:44:52,660 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 102 transitions, 984 flow [2025-01-10 06:44:52,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:44:52,660 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:44:52,660 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:44:52,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 06:44:52,660 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:44:52,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:44:52,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1739486690, now seen corresponding path program 1 times [2025-01-10 06:44:52,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:44:52,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362217432] [2025-01-10 06:44:52,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:44:52,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:44:52,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-10 06:44:52,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-10 06:44:52,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:44:52,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:44:55,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-01-10 06:44:55,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:44:55,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362217432] [2025-01-10 06:44:55,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362217432] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:44:55,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:44:55,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 06:44:55,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123851134] [2025-01-10 06:44:55,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:44:55,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:44:55,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:44:55,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:44:55,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:44:55,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2025-01-10 06:44:55,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 102 transitions, 984 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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-01-10 06:44:55,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:44:55,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2025-01-10 06:44:55,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:44:56,200 INFO L124 PetriNetUnfolderBase]: 62/263 cut-off events. [2025-01-10 06:44:56,200 INFO L125 PetriNetUnfolderBase]: For 1228/1234 co-relation queries the response was YES. [2025-01-10 06:44:56,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1186 conditions, 263 events. 62/263 cut-off events. For 1228/1234 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1226 event pairs, 29 based on Foata normal form. 9/272 useless extension candidates. Maximal degree in co-relation 1135. Up to 146 conditions per place. [2025-01-10 06:44:56,206 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 61 selfloop transitions, 22 changer transitions 13/114 dead transitions. [2025-01-10 06:44:56,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 114 transitions, 1211 flow [2025-01-10 06:44:56,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 06:44:56,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 06:44:56,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 166 transitions. [2025-01-10 06:44:56,207 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4119106699751861 [2025-01-10 06:44:56,207 INFO L175 Difference]: Start difference. First operand has 172 places, 102 transitions, 984 flow. Second operand 13 states and 166 transitions. [2025-01-10 06:44:56,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 114 transitions, 1211 flow [2025-01-10 06:44:56,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 114 transitions, 1142 flow, removed 6 selfloop flow, removed 11 redundant places. [2025-01-10 06:44:56,222 INFO L231 Difference]: Finished difference. Result has 168 places, 96 transitions, 901 flow [2025-01-10 06:44:56,222 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=915, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=901, PETRI_PLACES=168, PETRI_TRANSITIONS=96} [2025-01-10 06:44:56,222 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 135 predicate places. [2025-01-10 06:44:56,223 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 96 transitions, 901 flow [2025-01-10 06:44:56,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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-01-10 06:44:56,223 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:44:56,223 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:44:56,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 06:44:56,223 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:44:56,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:44:56,227 INFO L85 PathProgramCache]: Analyzing trace with hash -779341660, now seen corresponding path program 1 times [2025-01-10 06:44:56,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:44:56,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551460912] [2025-01-10 06:44:56,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:44:56,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:44:56,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-10 06:44:56,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-10 06:44:56,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:44:56,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:44:58,546 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:44:58,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:44:58,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551460912] [2025-01-10 06:44:58,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551460912] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:44:58,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:44:58,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:44:58,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996332604] [2025-01-10 06:44:58,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:44:58,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:44:58,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:44:58,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:44:58,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:44:58,579 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2025-01-10 06:44:58,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 96 transitions, 901 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:44:58,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:44:58,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2025-01-10 06:44:58,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:44:59,022 INFO L124 PetriNetUnfolderBase]: 70/258 cut-off events. [2025-01-10 06:44:59,022 INFO L125 PetriNetUnfolderBase]: For 843/843 co-relation queries the response was YES. [2025-01-10 06:44:59,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1146 conditions, 258 events. 70/258 cut-off events. For 843/843 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1121 event pairs, 6 based on Foata normal form. 2/260 useless extension candidates. Maximal degree in co-relation 1097. Up to 69 conditions per place. [2025-01-10 06:44:59,024 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 87 selfloop transitions, 25 changer transitions 0/114 dead transitions. [2025-01-10 06:44:59,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 114 transitions, 1211 flow [2025-01-10 06:44:59,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 06:44:59,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 06:44:59,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 128 transitions. [2025-01-10 06:44:59,025 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.375366568914956 [2025-01-10 06:44:59,025 INFO L175 Difference]: Start difference. First operand has 168 places, 96 transitions, 901 flow. Second operand 11 states and 128 transitions. [2025-01-10 06:44:59,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 114 transitions, 1211 flow [2025-01-10 06:44:59,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 114 transitions, 1145 flow, removed 3 selfloop flow, removed 18 redundant places. [2025-01-10 06:44:59,032 INFO L231 Difference]: Finished difference. Result has 155 places, 95 transitions, 873 flow [2025-01-10 06:44:59,032 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=823, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=873, PETRI_PLACES=155, PETRI_TRANSITIONS=95} [2025-01-10 06:44:59,033 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 122 predicate places. [2025-01-10 06:44:59,033 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 95 transitions, 873 flow [2025-01-10 06:44:59,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:44:59,033 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:44:59,033 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:44:59,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 06:44:59,033 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:44:59,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:44:59,034 INFO L85 PathProgramCache]: Analyzing trace with hash -780556378, now seen corresponding path program 2 times [2025-01-10 06:44:59,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:44:59,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337375872] [2025-01-10 06:44:59,034 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:44:59,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:44:59,057 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-01-10 06:44:59,067 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 45 statements. [2025-01-10 06:44:59,068 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:44:59,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:45:02,419 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:45:02,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:45:02,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337375872] [2025-01-10 06:45:02,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337375872] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:45:02,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:45:02,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 06:45:02,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275625288] [2025-01-10 06:45:02,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:45:02,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 06:45:02,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:45:02,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 06:45:02,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-10 06:45:02,470 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2025-01-10 06:45:02,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 95 transitions, 873 flow. Second operand has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 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-01-10 06:45:02,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:45:02,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2025-01-10 06:45:02,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:45:03,702 INFO L124 PetriNetUnfolderBase]: 54/233 cut-off events. [2025-01-10 06:45:03,703 INFO L125 PetriNetUnfolderBase]: For 769/771 co-relation queries the response was YES. [2025-01-10 06:45:03,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1029 conditions, 233 events. 54/233 cut-off events. For 769/771 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1015 event pairs, 18 based on Foata normal form. 5/235 useless extension candidates. Maximal degree in co-relation 987. Up to 118 conditions per place. [2025-01-10 06:45:03,704 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 59 selfloop transitions, 26 changer transitions 7/109 dead transitions. [2025-01-10 06:45:03,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 109 transitions, 1104 flow [2025-01-10 06:45:03,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 06:45:03,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-10 06:45:03,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 174 transitions. [2025-01-10 06:45:03,705 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4009216589861751 [2025-01-10 06:45:03,705 INFO L175 Difference]: Start difference. First operand has 155 places, 95 transitions, 873 flow. Second operand 14 states and 174 transitions. [2025-01-10 06:45:03,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 109 transitions, 1104 flow [2025-01-10 06:45:03,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 109 transitions, 1060 flow, removed 1 selfloop flow, removed 9 redundant places. [2025-01-10 06:45:03,710 INFO L231 Difference]: Finished difference. Result has 160 places, 91 transitions, 851 flow [2025-01-10 06:45:03,711 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=829, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=851, PETRI_PLACES=160, PETRI_TRANSITIONS=91} [2025-01-10 06:45:03,711 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 127 predicate places. [2025-01-10 06:45:03,711 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 91 transitions, 851 flow [2025-01-10 06:45:03,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 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-01-10 06:45:03,711 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:03,711 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:45:03,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 06:45:03,712 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:45:03,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:03,712 INFO L85 PathProgramCache]: Analyzing trace with hash -816305578, now seen corresponding path program 3 times [2025-01-10 06:45:03,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:03,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806613208] [2025-01-10 06:45:03,713 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:45:03,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:03,719 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 11 equivalence classes. [2025-01-10 06:45:03,729 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 15 of 45 statements. [2025-01-10 06:45:03,729 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 06:45:03,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:45:07,075 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:45:07,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:45:07,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806613208] [2025-01-10 06:45:07,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806613208] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:45:07,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:45:07,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 06:45:07,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286015582] [2025-01-10 06:45:07,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:45:07,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 06:45:07,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:45:07,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 06:45:07,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-10 06:45:07,148 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2025-01-10 06:45:07,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 91 transitions, 851 flow. Second operand has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 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-01-10 06:45:07,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:45:07,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2025-01-10 06:45:07,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:45:08,377 INFO L124 PetriNetUnfolderBase]: 48/215 cut-off events. [2025-01-10 06:45:08,378 INFO L125 PetriNetUnfolderBase]: For 815/817 co-relation queries the response was YES. [2025-01-10 06:45:08,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 972 conditions, 215 events. 48/215 cut-off events. For 815/817 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 873 event pairs, 18 based on Foata normal form. 8/223 useless extension candidates. Maximal degree in co-relation 930. Up to 102 conditions per place. [2025-01-10 06:45:08,379 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 54 selfloop transitions, 20 changer transitions 16/102 dead transitions. [2025-01-10 06:45:08,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 102 transitions, 1058 flow [2025-01-10 06:45:08,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 06:45:08,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 06:45:08,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 161 transitions. [2025-01-10 06:45:08,381 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39950372208436724 [2025-01-10 06:45:08,381 INFO L175 Difference]: Start difference. First operand has 160 places, 91 transitions, 851 flow. Second operand 13 states and 161 transitions. [2025-01-10 06:45:08,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 102 transitions, 1058 flow [2025-01-10 06:45:08,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 102 transitions, 978 flow, removed 2 selfloop flow, removed 15 redundant places. [2025-01-10 06:45:08,390 INFO L231 Difference]: Finished difference. Result has 154 places, 80 transitions, 697 flow [2025-01-10 06:45:08,390 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=697, PETRI_PLACES=154, PETRI_TRANSITIONS=80} [2025-01-10 06:45:08,390 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 121 predicate places. [2025-01-10 06:45:08,390 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 80 transitions, 697 flow [2025-01-10 06:45:08,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 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-01-10 06:45:08,390 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:08,390 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:45:08,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-10 06:45:08,391 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:45:08,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:08,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1726196928, now seen corresponding path program 4 times [2025-01-10 06:45:08,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:08,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682339419] [2025-01-10 06:45:08,391 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 06:45:08,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:08,404 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-01-10 06:45:08,440 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-01-10 06:45:08,441 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 06:45:08,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:45:11,181 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:45:11,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:45:11,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682339419] [2025-01-10 06:45:11,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682339419] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:45:11,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:45:11,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:45:11,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039524171] [2025-01-10 06:45:11,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:45:11,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:45:11,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:45:11,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:45:11,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:45:11,193 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2025-01-10 06:45:11,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 80 transitions, 697 flow. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 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-01-10 06:45:11,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:45:11,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2025-01-10 06:45:11,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:45:11,818 INFO L124 PetriNetUnfolderBase]: 34/177 cut-off events. [2025-01-10 06:45:11,819 INFO L125 PetriNetUnfolderBase]: For 606/608 co-relation queries the response was YES. [2025-01-10 06:45:11,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 756 conditions, 177 events. 34/177 cut-off events. For 606/608 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 643 event pairs, 15 based on Foata normal form. 5/182 useless extension candidates. Maximal degree in co-relation 716. Up to 72 conditions per place. [2025-01-10 06:45:11,820 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 49 selfloop transitions, 14 changer transitions 14/88 dead transitions. [2025-01-10 06:45:11,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 88 transitions, 865 flow [2025-01-10 06:45:11,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 06:45:11,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 06:45:11,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 174 transitions. [2025-01-10 06:45:11,823 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46774193548387094 [2025-01-10 06:45:11,823 INFO L175 Difference]: Start difference. First operand has 154 places, 80 transitions, 697 flow. Second operand 12 states and 174 transitions. [2025-01-10 06:45:11,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 88 transitions, 865 flow [2025-01-10 06:45:11,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 88 transitions, 771 flow, removed 3 selfloop flow, removed 17 redundant places. [2025-01-10 06:45:11,827 INFO L231 Difference]: Finished difference. Result has 139 places, 71 transitions, 561 flow [2025-01-10 06:45:11,828 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=561, PETRI_PLACES=139, PETRI_TRANSITIONS=71} [2025-01-10 06:45:11,828 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 106 predicate places. [2025-01-10 06:45:11,828 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 71 transitions, 561 flow [2025-01-10 06:45:11,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 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-01-10 06:45:11,828 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:11,828 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:45:11,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-10 06:45:11,828 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:45:11,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:11,829 INFO L85 PathProgramCache]: Analyzing trace with hash -645528060, now seen corresponding path program 2 times [2025-01-10 06:45:11,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:11,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115492561] [2025-01-10 06:45:11,829 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:45:11,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:11,836 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-01-10 06:45:11,852 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 45 statements. [2025-01-10 06:45:11,852 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:45:11,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:45:15,232 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:45:15,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:45:15,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115492561] [2025-01-10 06:45:15,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115492561] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:45:15,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:45:15,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 06:45:15,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055509709] [2025-01-10 06:45:15,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:45:15,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 06:45:15,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:45:15,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 06:45:15,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-10 06:45:15,350 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2025-01-10 06:45:15,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 71 transitions, 561 flow. Second operand has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 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-01-10 06:45:15,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:45:15,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2025-01-10 06:45:15,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:45:16,250 INFO L124 PetriNetUnfolderBase]: 40/183 cut-off events. [2025-01-10 06:45:16,250 INFO L125 PetriNetUnfolderBase]: For 416/416 co-relation queries the response was YES. [2025-01-10 06:45:16,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 702 conditions, 183 events. 40/183 cut-off events. For 416/416 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 649 event pairs, 18 based on Foata normal form. 3/186 useless extension candidates. Maximal degree in co-relation 666. Up to 81 conditions per place. [2025-01-10 06:45:16,251 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 51 selfloop transitions, 12 changer transitions 12/84 dead transitions. [2025-01-10 06:45:16,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 84 transitions, 755 flow [2025-01-10 06:45:16,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 06:45:16,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 06:45:16,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 151 transitions. [2025-01-10 06:45:16,252 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40591397849462363 [2025-01-10 06:45:16,252 INFO L175 Difference]: Start difference. First operand has 139 places, 71 transitions, 561 flow. Second operand 12 states and 151 transitions. [2025-01-10 06:45:16,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 84 transitions, 755 flow [2025-01-10 06:45:16,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 84 transitions, 699 flow, removed 4 selfloop flow, removed 15 redundant places. [2025-01-10 06:45:16,255 INFO L231 Difference]: Finished difference. Result has 127 places, 67 transitions, 502 flow [2025-01-10 06:45:16,255 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=505, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=502, PETRI_PLACES=127, PETRI_TRANSITIONS=67} [2025-01-10 06:45:16,256 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 94 predicate places. [2025-01-10 06:45:16,256 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 67 transitions, 502 flow [2025-01-10 06:45:16,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 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-01-10 06:45:16,256 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:16,256 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:45:16,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-10 06:45:16,257 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:45:16,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:16,257 INFO L85 PathProgramCache]: Analyzing trace with hash 916229752, now seen corresponding path program 3 times [2025-01-10 06:45:16,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:16,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820229276] [2025-01-10 06:45:16,257 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:45:16,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:16,263 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 11 equivalence classes. [2025-01-10 06:45:16,274 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 15 of 45 statements. [2025-01-10 06:45:16,274 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 06:45:16,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:45:18,006 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:45:18,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:45:18,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820229276] [2025-01-10 06:45:18,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820229276] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:45:18,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:45:18,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 06:45:18,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112700737] [2025-01-10 06:45:18,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:45:18,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:45:18,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:45:18,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:45:18,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:45:18,100 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2025-01-10 06:45:18,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 67 transitions, 502 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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-01-10 06:45:18,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:45:18,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2025-01-10 06:45:18,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:45:18,787 INFO L124 PetriNetUnfolderBase]: 33/166 cut-off events. [2025-01-10 06:45:18,787 INFO L125 PetriNetUnfolderBase]: For 386/386 co-relation queries the response was YES. [2025-01-10 06:45:18,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 617 conditions, 166 events. 33/166 cut-off events. For 386/386 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 555 event pairs, 18 based on Foata normal form. 3/169 useless extension candidates. Maximal degree in co-relation 584. Up to 71 conditions per place. [2025-01-10 06:45:18,788 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 50 selfloop transitions, 13 changer transitions 8/80 dead transitions. [2025-01-10 06:45:18,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 80 transitions, 688 flow [2025-01-10 06:45:18,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 06:45:18,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 06:45:18,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 150 transitions. [2025-01-10 06:45:18,790 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4032258064516129 [2025-01-10 06:45:18,790 INFO L175 Difference]: Start difference. First operand has 127 places, 67 transitions, 502 flow. Second operand 12 states and 150 transitions. [2025-01-10 06:45:18,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 80 transitions, 688 flow [2025-01-10 06:45:18,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 80 transitions, 651 flow, removed 4 selfloop flow, removed 11 redundant places. [2025-01-10 06:45:18,793 INFO L231 Difference]: Finished difference. Result has 125 places, 67 transitions, 498 flow [2025-01-10 06:45:18,793 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=498, PETRI_PLACES=125, PETRI_TRANSITIONS=67} [2025-01-10 06:45:18,793 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 92 predicate places. [2025-01-10 06:45:18,793 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 67 transitions, 498 flow [2025-01-10 06:45:18,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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-01-10 06:45:18,793 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:18,793 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:45:18,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-10 06:45:18,793 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:45:18,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:18,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1766357968, now seen corresponding path program 1 times [2025-01-10 06:45:18,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:18,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159030198] [2025-01-10 06:45:18,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:45:18,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:18,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-10 06:45:18,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-10 06:45:18,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:18,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:45:19,432 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:45:19,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:45:19,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159030198] [2025-01-10 06:45:19,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159030198] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:45:19,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:45:19,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:45:19,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933648398] [2025-01-10 06:45:19,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:45:19,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:45:19,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:45:19,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:45:19,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:45:19,456 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-01-10 06:45:19,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 67 transitions, 498 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 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-01-10 06:45:19,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:45:19,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-01-10 06:45:19,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:45:19,848 INFO L124 PetriNetUnfolderBase]: 29/143 cut-off events. [2025-01-10 06:45:19,849 INFO L125 PetriNetUnfolderBase]: For 319/319 co-relation queries the response was YES. [2025-01-10 06:45:19,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 552 conditions, 143 events. 29/143 cut-off events. For 319/319 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 396 event pairs, 5 based on Foata normal form. 2/145 useless extension candidates. Maximal degree in co-relation 519. Up to 35 conditions per place. [2025-01-10 06:45:19,850 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 49 selfloop transitions, 24 changer transitions 0/79 dead transitions. [2025-01-10 06:45:19,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 79 transitions, 685 flow [2025-01-10 06:45:19,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 06:45:19,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 06:45:19,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 149 transitions. [2025-01-10 06:45:19,853 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.369727047146402 [2025-01-10 06:45:19,853 INFO L175 Difference]: Start difference. First operand has 125 places, 67 transitions, 498 flow. Second operand 13 states and 149 transitions. [2025-01-10 06:45:19,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 79 transitions, 685 flow [2025-01-10 06:45:19,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 79 transitions, 642 flow, removed 4 selfloop flow, removed 13 redundant places. [2025-01-10 06:45:19,855 INFO L231 Difference]: Finished difference. Result has 118 places, 72 transitions, 522 flow [2025-01-10 06:45:19,855 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=522, PETRI_PLACES=118, PETRI_TRANSITIONS=72} [2025-01-10 06:45:19,856 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 85 predicate places. [2025-01-10 06:45:19,856 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 72 transitions, 522 flow [2025-01-10 06:45:19,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 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-01-10 06:45:19,856 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:19,856 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:45:19,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-10 06:45:19,856 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:45:19,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:19,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1468940298, now seen corresponding path program 4 times [2025-01-10 06:45:19,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:19,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472019293] [2025-01-10 06:45:19,857 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 06:45:19,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:19,863 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-01-10 06:45:19,888 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-01-10 06:45:19,888 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 06:45:19,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:45:23,325 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 06:45:23,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:45:23,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472019293] [2025-01-10 06:45:23,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472019293] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:45:23,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209138532] [2025-01-10 06:45:23,326 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 06:45:23,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:45:23,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:45:23,328 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:45:23,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 06:45:23,383 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-01-10 06:45:23,458 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-01-10 06:45:23,459 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 06:45:23,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:45:23,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 76 conjuncts are in the unsatisfiable core [2025-01-10 06:45:23,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:45:24,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-01-10 06:45:24,393 INFO L349 Elim1Store]: treesize reduction 180, result has 38.1 percent of original size [2025-01-10 06:45:24,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 90 treesize of output 141 [2025-01-10 06:45:26,429 INFO L349 Elim1Store]: treesize reduction 10, result has 94.2 percent of original size [2025-01-10 06:45:26,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 45 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 505 treesize of output 611