./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/popl20-more-array-sum2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-array-sum2.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6d47c8696b49948f6f8f53dd9eda6f4e0281717fd9a29e264a19ded5493fa577 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:28:59,600 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:28:59,645 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:28:59,650 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:28:59,650 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:28:59,670 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:28:59,673 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:28:59,673 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:28:59,674 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:28:59,674 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:28:59,674 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:28:59,674 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:28:59,674 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:28:59,674 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:28:59,674 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:28:59,674 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:28:59,674 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:28:59,674 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:28:59,674 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:28:59,674 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:28:59,674 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:28:59,674 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:28:59,674 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:28:59,675 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:28:59,675 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:28:59,675 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:28:59,675 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:28:59,675 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:28:59,675 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:28:59,675 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:28:59,675 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:28:59,675 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:28:59,675 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:28:59,675 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:28:59,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:28:59,675 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:28:59,675 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:28:59,675 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:28:59,675 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:28:59,675 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:28:59,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:28:59,676 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:28:59,676 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:28:59,676 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:28:59,676 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:28:59,676 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6d47c8696b49948f6f8f53dd9eda6f4e0281717fd9a29e264a19ded5493fa577 [2025-03-04 15:28:59,878 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:28:59,884 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:28:59,886 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:28:59,886 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:28:59,887 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:28:59,887 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-array-sum2.wvr.c [2025-03-04 15:29:01,034 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3b5e49fd/20052f460c7142d3ab2d19c07a6adc69/FLAGff453f1c3 [2025-03-04 15:29:01,265 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:29:01,269 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum2.wvr.c [2025-03-04 15:29:01,279 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3b5e49fd/20052f460c7142d3ab2d19c07a6adc69/FLAGff453f1c3 [2025-03-04 15:29:01,296 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3b5e49fd/20052f460c7142d3ab2d19c07a6adc69 [2025-03-04 15:29:01,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:29:01,300 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:29:01,301 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:29:01,302 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:29:01,305 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:29:01,305 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:29:01" (1/1) ... [2025-03-04 15:29:01,306 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10db9462 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:01, skipping insertion in model container [2025-03-04 15:29:01,306 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:29:01" (1/1) ... [2025-03-04 15:29:01,323 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:29:01,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:29:01,447 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:29:01,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:29:01,471 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:29:01,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:01 WrapperNode [2025-03-04 15:29:01,472 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:29:01,472 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:29:01,472 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:29:01,472 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:29:01,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:01" (1/1) ... [2025-03-04 15:29:01,485 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:01" (1/1) ... [2025-03-04 15:29:01,504 INFO L138 Inliner]: procedures = 24, calls = 38, calls flagged for inlining = 17, calls inlined = 29, statements flattened = 345 [2025-03-04 15:29:01,504 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:29:01,505 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:29:01,505 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:29:01,505 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:29:01,510 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:01" (1/1) ... [2025-03-04 15:29:01,510 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:01" (1/1) ... [2025-03-04 15:29:01,513 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:01" (1/1) ... [2025-03-04 15:29:01,522 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-04 15:29:01,522 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:01" (1/1) ... [2025-03-04 15:29:01,522 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:01" (1/1) ... [2025-03-04 15:29:01,528 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:01" (1/1) ... [2025-03-04 15:29:01,529 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:01" (1/1) ... [2025-03-04 15:29:01,530 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:01" (1/1) ... [2025-03-04 15:29:01,530 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:01" (1/1) ... [2025-03-04 15:29:01,532 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:29:01,533 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:29:01,533 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:29:01,533 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:29:01,533 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:01" (1/1) ... [2025-03-04 15:29:01,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:29:01,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:01,561 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 15:29:01,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 15:29:01,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:29:01,579 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 15:29:01,580 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 15:29:01,580 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 15:29:01,580 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 15:29:01,580 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 15:29:01,580 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 15:29:01,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:29:01,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:29:01,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:29:01,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:29:01,580 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 15:29:01,580 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 15:29:01,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 15:29:01,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:29:01,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:29:01,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:29:01,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:29:01,581 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 15:29:01,661 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:29:01,662 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:29:02,130 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:29:02,130 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:29:02,514 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:29:02,515 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:29:02,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:29:02 BoogieIcfgContainer [2025-03-04 15:29:02,515 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:29:02,517 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:29:02,518 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:29:02,521 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:29:02,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:29:01" (1/3) ... [2025-03-04 15:29:02,522 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32235acf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:29:02, skipping insertion in model container [2025-03-04 15:29:02,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:01" (2/3) ... [2025-03-04 15:29:02,523 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32235acf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:29:02, skipping insertion in model container [2025-03-04 15:29:02,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:29:02" (3/3) ... [2025-03-04 15:29:02,524 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum2.wvr.c [2025-03-04 15:29:02,539 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:29:02,540 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-array-sum2.wvr.c that has 4 procedures, 85 locations, 1 initial locations, 5 loop locations, and 46 error locations. [2025-03-04 15:29:02,541 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:29:02,718 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 15:29:02,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 89 transitions, 199 flow [2025-03-04 15:29:02,796 INFO L124 PetriNetUnfolderBase]: 5/86 cut-off events. [2025-03-04 15:29:02,799 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 15:29:02,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 86 events. 5/86 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 368 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2025-03-04 15:29:02,803 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 89 transitions, 199 flow [2025-03-04 15:29:02,806 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 84 transitions, 183 flow [2025-03-04 15:29:02,814 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:29:02,821 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;@39430e52, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:29:02,821 INFO L334 AbstractCegarLoop]: Starting to check reachability of 91 error locations. [2025-03-04 15:29:02,823 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:29:02,823 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-04 15:29:02,823 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:29:02,823 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:02,824 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:29:02,824 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 88 more)] === [2025-03-04 15:29:02,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:02,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1133455, now seen corresponding path program 1 times [2025-03-04 15:29:02,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:02,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657381704] [2025-03-04 15:29:02,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:02,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:02,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:29:02,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:29:02,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:02,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:03,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:03,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:03,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657381704] [2025-03-04 15:29:03,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657381704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:03,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:03,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:29:03,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170614548] [2025-03-04 15:29:03,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:03,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:29:03,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:03,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:29:03,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:29:03,055 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 89 [2025-03-04 15:29:03,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 84 transitions, 183 flow. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:03,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:03,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 89 [2025-03-04 15:29:03,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:04,486 INFO L124 PetriNetUnfolderBase]: 5633/9032 cut-off events. [2025-03-04 15:29:04,486 INFO L125 PetriNetUnfolderBase]: For 309/309 co-relation queries the response was YES. [2025-03-04 15:29:04,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17339 conditions, 9032 events. 5633/9032 cut-off events. For 309/309 co-relation queries the response was YES. Maximal size of possible extension queue 1130. Compared 68464 event pairs, 4968 based on Foata normal form. 2/4795 useless extension candidates. Maximal degree in co-relation 16560. Up to 7963 conditions per place. [2025-03-04 15:29:04,531 INFO L140 encePairwiseOnDemand]: 63/89 looper letters, 41 selfloop transitions, 6 changer transitions 0/64 dead transitions. [2025-03-04 15:29:04,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 64 transitions, 237 flow [2025-03-04 15:29:04,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:29:04,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:29:04,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2025-03-04 15:29:04,539 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41292134831460675 [2025-03-04 15:29:04,540 INFO L175 Difference]: Start difference. First operand has 89 places, 84 transitions, 183 flow. Second operand 4 states and 147 transitions. [2025-03-04 15:29:04,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 64 transitions, 237 flow [2025-03-04 15:29:04,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 64 transitions, 228 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 15:29:04,548 INFO L231 Difference]: Finished difference. Result has 67 places, 64 transitions, 146 flow [2025-03-04 15:29:04,550 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=67, PETRI_TRANSITIONS=64} [2025-03-04 15:29:04,552 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, -22 predicate places. [2025-03-04 15:29:04,552 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 64 transitions, 146 flow [2025-03-04 15:29:04,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:04,552 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:04,552 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 15:29:04,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:29:04,552 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 88 more)] === [2025-03-04 15:29:04,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:04,553 INFO L85 PathProgramCache]: Analyzing trace with hash 35138133, now seen corresponding path program 1 times [2025-03-04 15:29:04,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:04,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70956125] [2025-03-04 15:29:04,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:04,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:04,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:29:04,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:29:04,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:04,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:04,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:04,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:04,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70956125] [2025-03-04 15:29:04,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70956125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:04,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:04,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:29:04,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357846328] [2025-03-04 15:29:04,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:04,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:29:04,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:04,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:29:04,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:29:04,642 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 89 [2025-03-04 15:29:04,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 64 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:04,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:04,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 89 [2025-03-04 15:29:04,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:05,777 INFO L124 PetriNetUnfolderBase]: 5635/9040 cut-off events. [2025-03-04 15:29:05,778 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2025-03-04 15:29:05,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17241 conditions, 9040 events. 5635/9040 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 1130. Compared 68570 event pairs, 4968 based on Foata normal form. 2/4805 useless extension candidates. Maximal degree in co-relation 17193. Up to 7972 conditions per place. [2025-03-04 15:29:05,816 INFO L140 encePairwiseOnDemand]: 80/89 looper letters, 46 selfloop transitions, 7 changer transitions 0/70 dead transitions. [2025-03-04 15:29:05,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 70 transitions, 274 flow [2025-03-04 15:29:05,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:29:05,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:29:05,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2025-03-04 15:29:05,845 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3792134831460674 [2025-03-04 15:29:05,845 INFO L175 Difference]: Start difference. First operand has 67 places, 64 transitions, 146 flow. Second operand 4 states and 135 transitions. [2025-03-04 15:29:05,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 70 transitions, 274 flow [2025-03-04 15:29:05,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 70 transitions, 252 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:29:05,853 INFO L231 Difference]: Finished difference. Result has 70 places, 70 transitions, 190 flow [2025-03-04 15:29:05,853 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=190, PETRI_PLACES=70, PETRI_TRANSITIONS=70} [2025-03-04 15:29:05,854 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, -19 predicate places. [2025-03-04 15:29:05,854 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 70 transitions, 190 flow [2025-03-04 15:29:05,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:05,854 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:05,854 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-04 15:29:05,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:29:05,854 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 88 more)] === [2025-03-04 15:29:05,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:05,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1170783210, now seen corresponding path program 1 times [2025-03-04 15:29:05,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:05,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438326296] [2025-03-04 15:29:05,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:05,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:05,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:29:05,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:29:05,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:05,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:05,954 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:05,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:05,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438326296] [2025-03-04 15:29:05,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438326296] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:05,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314176663] [2025-03-04 15:29:05,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:05,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:05,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:05,958 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:29:05,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 15:29:06,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:29:06,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:29:06,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:06,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:06,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:29:06,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:06,096 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:06,096 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:06,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:06,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314176663] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:06,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:06,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-04 15:29:06,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100734680] [2025-03-04 15:29:06,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:06,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:29:06,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:06,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:29:06,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:29:06,148 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 89 [2025-03-04 15:29:06,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 70 transitions, 190 flow. Second operand has 10 states, 10 states have (on average 21.0) internal successors, (210), 10 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:06,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:06,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 89 [2025-03-04 15:29:06,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:07,106 INFO L124 PetriNetUnfolderBase]: 5641/9064 cut-off events. [2025-03-04 15:29:07,107 INFO L125 PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES. [2025-03-04 15:29:07,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17317 conditions, 9064 events. 5641/9064 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 1131. Compared 68917 event pairs, 4968 based on Foata normal form. 0/4823 useless extension candidates. Maximal degree in co-relation 17204. Up to 7975 conditions per place. [2025-03-04 15:29:07,138 INFO L140 encePairwiseOnDemand]: 80/89 looper letters, 46 selfloop transitions, 25 changer transitions 0/88 dead transitions. [2025-03-04 15:29:07,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 88 transitions, 410 flow [2025-03-04 15:29:07,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:29:07,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:29:07,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 277 transitions. [2025-03-04 15:29:07,141 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3112359550561798 [2025-03-04 15:29:07,141 INFO L175 Difference]: Start difference. First operand has 70 places, 70 transitions, 190 flow. Second operand 10 states and 277 transitions. [2025-03-04 15:29:07,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 88 transitions, 410 flow [2025-03-04 15:29:07,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 88 transitions, 410 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:29:07,144 INFO L231 Difference]: Finished difference. Result has 82 places, 88 transitions, 352 flow [2025-03-04 15:29:07,144 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=352, PETRI_PLACES=82, PETRI_TRANSITIONS=88} [2025-03-04 15:29:07,145 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, -7 predicate places. [2025-03-04 15:29:07,145 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 88 transitions, 352 flow [2025-03-04 15:29:07,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 21.0) internal successors, (210), 10 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:07,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:07,145 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:07,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 15:29:07,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:07,346 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 88 more)] === [2025-03-04 15:29:07,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:07,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1081519095, now seen corresponding path program 1 times [2025-03-04 15:29:07,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:07,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297165328] [2025-03-04 15:29:07,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:07,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:07,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:29:07,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:29:07,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:07,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:07,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:07,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:07,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297165328] [2025-03-04 15:29:07,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297165328] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:07,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:07,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:29:07,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694086741] [2025-03-04 15:29:07,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:07,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:29:07,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:07,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:29:07,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:29:07,453 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 89 [2025-03-04 15:29:07,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 88 transitions, 352 flow. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:07,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:07,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 89 [2025-03-04 15:29:07,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:08,593 INFO L124 PetriNetUnfolderBase]: 5640/9079 cut-off events. [2025-03-04 15:29:08,593 INFO L125 PetriNetUnfolderBase]: For 178/178 co-relation queries the response was YES. [2025-03-04 15:29:08,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17411 conditions, 9079 events. 5640/9079 cut-off events. For 178/178 co-relation queries the response was YES. Maximal size of possible extension queue 1130. Compared 68849 event pairs, 4968 based on Foata normal form. 5/4848 useless extension candidates. Maximal degree in co-relation 17321. Up to 7984 conditions per place. [2025-03-04 15:29:08,641 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 61 selfloop transitions, 17 changer transitions 0/97 dead transitions. [2025-03-04 15:29:08,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 97 transitions, 570 flow [2025-03-04 15:29:08,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:29:08,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:29:08,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 176 transitions. [2025-03-04 15:29:08,643 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3955056179775281 [2025-03-04 15:29:08,643 INFO L175 Difference]: Start difference. First operand has 82 places, 88 transitions, 352 flow. Second operand 5 states and 176 transitions. [2025-03-04 15:29:08,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 97 transitions, 570 flow [2025-03-04 15:29:08,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 97 transitions, 490 flow, removed 25 selfloop flow, removed 4 redundant places. [2025-03-04 15:29:08,649 INFO L231 Difference]: Finished difference. Result has 84 places, 96 transitions, 406 flow [2025-03-04 15:29:08,649 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=406, PETRI_PLACES=84, PETRI_TRANSITIONS=96} [2025-03-04 15:29:08,650 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, -5 predicate places. [2025-03-04 15:29:08,650 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 96 transitions, 406 flow [2025-03-04 15:29:08,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:08,650 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:08,651 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:08,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:29:08,651 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 88 more)] === [2025-03-04 15:29:08,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:08,651 INFO L85 PathProgramCache]: Analyzing trace with hash -2010493601, now seen corresponding path program 1 times [2025-03-04 15:29:08,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:08,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618780573] [2025-03-04 15:29:08,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:08,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:08,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:29:08,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:29:08,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:08,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:09,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:29:09,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:09,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618780573] [2025-03-04 15:29:09,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618780573] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:09,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862001234] [2025-03-04 15:29:09,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:09,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:09,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:09,069 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:29:09,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 15:29:09,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:29:09,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:29:09,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:09,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:09,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 15:29:09,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:09,211 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 1 [2025-03-04 15:29:09,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:29:09,253 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:09,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2025-03-04 15:29:09,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-03-04 15:29:09,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:29:09,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862001234] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:09,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:09,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-04 15:29:09,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736712994] [2025-03-04 15:29:09,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:09,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 15:29:09,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:09,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 15:29:09,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-04 15:29:09,334 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 89 [2025-03-04 15:29:09,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 96 transitions, 406 flow. Second operand has 13 states, 13 states have (on average 25.76923076923077) internal successors, (335), 13 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:09,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:09,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 89 [2025-03-04 15:29:09,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:10,751 INFO L124 PetriNetUnfolderBase]: 9656/15708 cut-off events. [2025-03-04 15:29:10,751 INFO L125 PetriNetUnfolderBase]: For 113/113 co-relation queries the response was YES. [2025-03-04 15:29:10,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29757 conditions, 15708 events. 9656/15708 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 1263. Compared 122453 event pairs, 2801 based on Foata normal form. 0/8316 useless extension candidates. Maximal degree in co-relation 29663. Up to 5348 conditions per place. [2025-03-04 15:29:10,808 INFO L140 encePairwiseOnDemand]: 72/89 looper letters, 111 selfloop transitions, 24 changer transitions 0/154 dead transitions. [2025-03-04 15:29:10,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 154 transitions, 798 flow [2025-03-04 15:29:10,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 15:29:10,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 15:29:10,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 301 transitions. [2025-03-04 15:29:10,810 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42275280898876405 [2025-03-04 15:29:10,810 INFO L175 Difference]: Start difference. First operand has 84 places, 96 transitions, 406 flow. Second operand 8 states and 301 transitions. [2025-03-04 15:29:10,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 154 transitions, 798 flow [2025-03-04 15:29:10,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 154 transitions, 788 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 15:29:10,813 INFO L231 Difference]: Finished difference. Result has 92 places, 104 transitions, 493 flow [2025-03-04 15:29:10,813 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=493, PETRI_PLACES=92, PETRI_TRANSITIONS=104} [2025-03-04 15:29:10,814 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 3 predicate places. [2025-03-04 15:29:10,814 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 104 transitions, 493 flow [2025-03-04 15:29:10,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 25.76923076923077) internal successors, (335), 13 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:10,814 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:10,814 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:10,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 15:29:11,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:11,015 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 88 more)] === [2025-03-04 15:29:11,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:11,015 INFO L85 PathProgramCache]: Analyzing trace with hash -2010493600, now seen corresponding path program 1 times [2025-03-04 15:29:11,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:11,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373430123] [2025-03-04 15:29:11,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:11,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:11,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:29:11,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:29:11,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:11,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:11,201 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:29:11,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:11,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373430123] [2025-03-04 15:29:11,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373430123] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:11,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863517147] [2025-03-04 15:29:11,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:11,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:11,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:11,204 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:29:11,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 15:29:11,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:29:11,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:29:11,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:11,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:11,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 15:29:11,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:11,321 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 1 [2025-03-04 15:29:11,350 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:29:11,350 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:11,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-03-04 15:29:11,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-03-04 15:29:11,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:29:11,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863517147] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:11,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:11,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-04 15:29:11,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441381658] [2025-03-04 15:29:11,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:11,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 15:29:11,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:11,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 15:29:11,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-04 15:29:11,419 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 89 [2025-03-04 15:29:11,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 104 transitions, 493 flow. Second operand has 13 states, 13 states have (on average 25.76923076923077) internal successors, (335), 13 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:11,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:11,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 89 [2025-03-04 15:29:11,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:12,806 INFO L124 PetriNetUnfolderBase]: 9114/14832 cut-off events. [2025-03-04 15:29:12,806 INFO L125 PetriNetUnfolderBase]: For 3451/3451 co-relation queries the response was YES. [2025-03-04 15:29:12,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33880 conditions, 14832 events. 9114/14832 cut-off events. For 3451/3451 co-relation queries the response was YES. Maximal size of possible extension queue 1108. Compared 115362 event pairs, 2507 based on Foata normal form. 0/8164 useless extension candidates. Maximal degree in co-relation 33782. Up to 4584 conditions per place. [2025-03-04 15:29:12,864 INFO L140 encePairwiseOnDemand]: 72/89 looper letters, 110 selfloop transitions, 24 changer transitions 0/153 dead transitions. [2025-03-04 15:29:12,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 153 transitions, 863 flow [2025-03-04 15:29:12,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 15:29:12,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 15:29:12,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 300 transitions. [2025-03-04 15:29:12,865 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42134831460674155 [2025-03-04 15:29:12,865 INFO L175 Difference]: Start difference. First operand has 92 places, 104 transitions, 493 flow. Second operand 8 states and 300 transitions. [2025-03-04 15:29:12,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 153 transitions, 863 flow [2025-03-04 15:29:12,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 153 transitions, 850 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:29:12,869 INFO L231 Difference]: Finished difference. Result has 96 places, 103 transitions, 524 flow [2025-03-04 15:29:12,870 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=524, PETRI_PLACES=96, PETRI_TRANSITIONS=103} [2025-03-04 15:29:12,870 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 7 predicate places. [2025-03-04 15:29:12,870 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 103 transitions, 524 flow [2025-03-04 15:29:12,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 25.76923076923077) internal successors, (335), 13 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:12,870 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:12,871 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:12,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 15:29:13,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:13,071 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 88 more)] === [2025-03-04 15:29:13,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:13,072 INFO L85 PathProgramCache]: Analyzing trace with hash -2010493598, now seen corresponding path program 1 times [2025-03-04 15:29:13,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:13,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359585116] [2025-03-04 15:29:13,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:13,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:13,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:29:13,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:29:13,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:13,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:13,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:13,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:13,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359585116] [2025-03-04 15:29:13,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359585116] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:13,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186092127] [2025-03-04 15:29:13,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:13,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:13,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:13,377 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:29:13,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 15:29:13,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:29:13,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:29:13,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:13,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:13,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 15:29:13,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:13,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-03-04 15:29:13,494 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 1 [2025-03-04 15:29:13,526 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 15:29:13,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 15:29:13,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-04 15:29:13,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:13,578 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:13,617 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_78 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_78) c_~A~0.base) c_~A~0.offset)))) is different from false [2025-03-04 15:29:13,666 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:29:13,666 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-03-04 15:29:13,672 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:29:13,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2025-03-04 15:29:13,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2025-03-04 15:29:13,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-03-04 15:29:13,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186092127] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:13,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:13,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-03-04 15:29:13,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389686913] [2025-03-04 15:29:13,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:13,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 15:29:13,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:13,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 15:29:13,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=167, Unknown=1, NotChecked=26, Total=240 [2025-03-04 15:29:13,717 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 89 [2025-03-04 15:29:13,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 103 transitions, 524 flow. Second operand has 16 states, 16 states have (on average 23.875) internal successors, (382), 16 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:13,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:13,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 89 [2025-03-04 15:29:13,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:15,344 INFO L124 PetriNetUnfolderBase]: 10740/16792 cut-off events. [2025-03-04 15:29:15,345 INFO L125 PetriNetUnfolderBase]: For 6026/6026 co-relation queries the response was YES. [2025-03-04 15:29:15,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40200 conditions, 16792 events. 10740/16792 cut-off events. For 6026/6026 co-relation queries the response was YES. Maximal size of possible extension queue 1188. Compared 125167 event pairs, 4243 based on Foata normal form. 0/9843 useless extension candidates. Maximal degree in co-relation 40101. Up to 8951 conditions per place. [2025-03-04 15:29:15,406 INFO L140 encePairwiseOnDemand]: 77/89 looper letters, 119 selfloop transitions, 19 changer transitions 0/155 dead transitions. [2025-03-04 15:29:15,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 155 transitions, 913 flow [2025-03-04 15:29:15,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 15:29:15,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 15:29:15,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 357 transitions. [2025-03-04 15:29:15,408 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36465781409601633 [2025-03-04 15:29:15,408 INFO L175 Difference]: Start difference. First operand has 96 places, 103 transitions, 524 flow. Second operand 11 states and 357 transitions. [2025-03-04 15:29:15,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 155 transitions, 913 flow [2025-03-04 15:29:15,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 155 transitions, 884 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 15:29:15,412 INFO L231 Difference]: Finished difference. Result has 101 places, 103 transitions, 536 flow [2025-03-04 15:29:15,412 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=536, PETRI_PLACES=101, PETRI_TRANSITIONS=103} [2025-03-04 15:29:15,413 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 12 predicate places. [2025-03-04 15:29:15,413 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 103 transitions, 536 flow [2025-03-04 15:29:15,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 23.875) internal successors, (382), 16 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:15,413 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:15,413 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:15,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 15:29:15,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:15,617 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 88 more)] === [2025-03-04 15:29:15,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:15,617 INFO L85 PathProgramCache]: Analyzing trace with hash -2010493597, now seen corresponding path program 1 times [2025-03-04 15:29:15,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:15,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957530090] [2025-03-04 15:29:15,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:15,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:15,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:29:15,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:29:15,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:15,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:15,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:15,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:15,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957530090] [2025-03-04 15:29:15,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957530090] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:15,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841127202] [2025-03-04 15:29:15,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:15,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:15,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:15,883 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:29:15,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 15:29:15,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:29:15,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:29:15,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:15,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:15,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 15:29:15,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:15,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-03-04 15:29:15,999 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 1 [2025-03-04 15:29:16,020 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 15:29:16,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 15:29:16,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 15:29:16,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:16,060 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:16,089 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_97 (Array Int Int))) (< (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_97) c_~A~0.base) c_~A~0.offset) 2147483648)) is different from false [2025-03-04 15:29:16,134 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:29:16,134 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-03-04 15:29:16,140 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:29:16,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 29 [2025-03-04 15:29:16,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2025-03-04 15:29:16,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-03-04 15:29:16,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841127202] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:16,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:16,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-03-04 15:29:16,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349038803] [2025-03-04 15:29:16,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:16,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 15:29:16,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:16,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 15:29:16,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=167, Unknown=1, NotChecked=26, Total=240 [2025-03-04 15:29:16,172 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 89 [2025-03-04 15:29:16,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 103 transitions, 536 flow. Second operand has 16 states, 16 states have (on average 23.875) internal successors, (382), 16 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:16,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:16,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 89 [2025-03-04 15:29:16,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:18,234 INFO L124 PetriNetUnfolderBase]: 10198/15900 cut-off events. [2025-03-04 15:29:18,234 INFO L125 PetriNetUnfolderBase]: For 7193/7193 co-relation queries the response was YES. [2025-03-04 15:29:18,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38971 conditions, 15900 events. 10198/15900 cut-off events. For 7193/7193 co-relation queries the response was YES. Maximal size of possible extension queue 1147. Compared 120799 event pairs, 4691 based on Foata normal form. 0/9658 useless extension candidates. Maximal degree in co-relation 38871. Up to 8951 conditions per place. [2025-03-04 15:29:18,307 INFO L140 encePairwiseOnDemand]: 77/89 looper letters, 118 selfloop transitions, 19 changer transitions 0/154 dead transitions. [2025-03-04 15:29:18,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 154 transitions, 916 flow [2025-03-04 15:29:18,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 15:29:18,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 15:29:18,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 356 transitions. [2025-03-04 15:29:18,309 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2025-03-04 15:29:18,309 INFO L175 Difference]: Start difference. First operand has 101 places, 103 transitions, 536 flow. Second operand 11 states and 356 transitions. [2025-03-04 15:29:18,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 154 transitions, 916 flow [2025-03-04 15:29:18,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 154 transitions, 879 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 15:29:18,315 INFO L231 Difference]: Finished difference. Result has 105 places, 102 transitions, 533 flow [2025-03-04 15:29:18,315 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=533, PETRI_PLACES=105, PETRI_TRANSITIONS=102} [2025-03-04 15:29:18,316 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 16 predicate places. [2025-03-04 15:29:18,316 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 102 transitions, 533 flow [2025-03-04 15:29:18,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 23.875) internal successors, (382), 16 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:18,316 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:18,316 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:18,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 15:29:18,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:18,518 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 88 more)] === [2025-03-04 15:29:18,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:18,518 INFO L85 PathProgramCache]: Analyzing trace with hash -2010493592, now seen corresponding path program 1 times [2025-03-04 15:29:18,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:18,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489891519] [2025-03-04 15:29:18,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:18,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:18,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:29:18,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:29:18,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:18,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:18,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:29:18,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:18,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489891519] [2025-03-04 15:29:18,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489891519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:18,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:18,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:29:18,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027736081] [2025-03-04 15:29:18,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:18,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:29:18,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:18,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:29:18,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:29:18,617 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 89 [2025-03-04 15:29:18,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 102 transitions, 533 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:18,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:18,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 89 [2025-03-04 15:29:18,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:19,754 INFO L124 PetriNetUnfolderBase]: 8018/13920 cut-off events. [2025-03-04 15:29:19,754 INFO L125 PetriNetUnfolderBase]: For 9521/9521 co-relation queries the response was YES. [2025-03-04 15:29:19,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33949 conditions, 13920 events. 8018/13920 cut-off events. For 9521/9521 co-relation queries the response was YES. Maximal size of possible extension queue 1215. Compared 118153 event pairs, 2468 based on Foata normal form. 0/8676 useless extension candidates. Maximal degree in co-relation 33849. Up to 7419 conditions per place. [2025-03-04 15:29:19,817 INFO L140 encePairwiseOnDemand]: 85/89 looper letters, 106 selfloop transitions, 3 changer transitions 0/128 dead transitions. [2025-03-04 15:29:19,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 128 transitions, 806 flow [2025-03-04 15:29:19,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:29:19,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:29:19,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2025-03-04 15:29:19,818 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5543071161048689 [2025-03-04 15:29:19,818 INFO L175 Difference]: Start difference. First operand has 105 places, 102 transitions, 533 flow. Second operand 3 states and 148 transitions. [2025-03-04 15:29:19,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 128 transitions, 806 flow [2025-03-04 15:29:19,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 128 transitions, 769 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-03-04 15:29:19,824 INFO L231 Difference]: Finished difference. Result has 98 places, 101 transitions, 498 flow [2025-03-04 15:29:19,824 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=498, PETRI_PLACES=98, PETRI_TRANSITIONS=101} [2025-03-04 15:29:19,825 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 9 predicate places. [2025-03-04 15:29:19,825 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 101 transitions, 498 flow [2025-03-04 15:29:19,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:19,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:19,825 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:19,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:29:19,826 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 88 more)] === [2025-03-04 15:29:19,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:19,826 INFO L85 PathProgramCache]: Analyzing trace with hash -2010493591, now seen corresponding path program 1 times [2025-03-04 15:29:19,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:19,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929717705] [2025-03-04 15:29:19,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:19,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:19,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:29:19,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:29:19,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:19,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:19,906 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:29:19,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:19,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929717705] [2025-03-04 15:29:19,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929717705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:19,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:19,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:29:19,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818060378] [2025-03-04 15:29:19,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:19,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:29:19,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:19,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:29:19,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:29:19,908 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 89 [2025-03-04 15:29:19,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 101 transitions, 498 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:19,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:19,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 89 [2025-03-04 15:29:19,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:20,988 INFO L124 PetriNetUnfolderBase]: 7476/13050 cut-off events. [2025-03-04 15:29:20,988 INFO L125 PetriNetUnfolderBase]: For 7950/7950 co-relation queries the response was YES. [2025-03-04 15:29:21,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31836 conditions, 13050 events. 7476/13050 cut-off events. For 7950/7950 co-relation queries the response was YES. Maximal size of possible extension queue 1204. Compared 110372 event pairs, 1968 based on Foata normal form. 221/8525 useless extension candidates. Maximal degree in co-relation 31738. Up to 7419 conditions per place. [2025-03-04 15:29:21,050 INFO L140 encePairwiseOnDemand]: 85/89 looper letters, 105 selfloop transitions, 3 changer transitions 0/127 dead transitions. [2025-03-04 15:29:21,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 127 transitions, 769 flow [2025-03-04 15:29:21,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:29:21,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:29:21,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2025-03-04 15:29:21,052 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.550561797752809 [2025-03-04 15:29:21,052 INFO L175 Difference]: Start difference. First operand has 98 places, 101 transitions, 498 flow. Second operand 3 states and 147 transitions. [2025-03-04 15:29:21,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 127 transitions, 769 flow [2025-03-04 15:29:21,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 127 transitions, 769 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:29:21,058 INFO L231 Difference]: Finished difference. Result has 100 places, 100 transitions, 500 flow [2025-03-04 15:29:21,058 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=500, PETRI_PLACES=100, PETRI_TRANSITIONS=100} [2025-03-04 15:29:21,059 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 11 predicate places. [2025-03-04 15:29:21,059 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 100 transitions, 500 flow [2025-03-04 15:29:21,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:21,060 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:21,060 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:21,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 15:29:21,060 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 88 more)] === [2025-03-04 15:29:21,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:21,060 INFO L85 PathProgramCache]: Analyzing trace with hash 650980044, now seen corresponding path program 1 times [2025-03-04 15:29:21,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:21,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339934339] [2025-03-04 15:29:21,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:21,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:21,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:29:21,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:29:21,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:21,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:21,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:29:21,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:21,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339934339] [2025-03-04 15:29:21,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339934339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:21,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:21,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:29:21,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89616715] [2025-03-04 15:29:21,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:21,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:29:21,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:21,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:29:21,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:29:21,114 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 89 [2025-03-04 15:29:21,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 100 transitions, 500 flow. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:21,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:21,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 89 [2025-03-04 15:29:21,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:22,441 INFO L124 PetriNetUnfolderBase]: 9644/15404 cut-off events. [2025-03-04 15:29:22,441 INFO L125 PetriNetUnfolderBase]: For 9284/9284 co-relation queries the response was YES. [2025-03-04 15:29:22,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37776 conditions, 15404 events. 9644/15404 cut-off events. For 9284/9284 co-relation queries the response was YES. Maximal size of possible extension queue 1332. Compared 120047 event pairs, 7157 based on Foata normal form. 444/10557 useless extension candidates. Maximal degree in co-relation 37677. Up to 11378 conditions per place. [2025-03-04 15:29:22,524 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 131 selfloop transitions, 4 changer transitions 0/151 dead transitions. [2025-03-04 15:29:22,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 151 transitions, 878 flow [2025-03-04 15:29:22,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:29:22,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:29:22,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 188 transitions. [2025-03-04 15:29:22,525 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5280898876404494 [2025-03-04 15:29:22,525 INFO L175 Difference]: Start difference. First operand has 100 places, 100 transitions, 500 flow. Second operand 4 states and 188 transitions. [2025-03-04 15:29:22,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 151 transitions, 878 flow [2025-03-04 15:29:22,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 151 transitions, 878 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:29:22,544 INFO L231 Difference]: Finished difference. Result has 105 places, 101 transitions, 521 flow [2025-03-04 15:29:22,544 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=521, PETRI_PLACES=105, PETRI_TRANSITIONS=101} [2025-03-04 15:29:22,545 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 16 predicate places. [2025-03-04 15:29:22,545 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 101 transitions, 521 flow [2025-03-04 15:29:22,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:22,545 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:22,545 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:22,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 15:29:22,545 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 88 more)] === [2025-03-04 15:29:22,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:22,545 INFO L85 PathProgramCache]: Analyzing trace with hash 629834393, now seen corresponding path program 1 times [2025-03-04 15:29:22,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:22,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164951983] [2025-03-04 15:29:22,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:22,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:22,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:29:22,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:29:22,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:22,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:22,611 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:29:22,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:22,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164951983] [2025-03-04 15:29:22,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164951983] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:22,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074575132] [2025-03-04 15:29:22,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:22,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:22,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:22,614 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:29:22,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 15:29:22,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:29:22,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:29:22,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:22,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:22,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 15:29:22,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:22,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:29:22,772 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:22,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:29:22,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074575132] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:22,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:22,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-03-04 15:29:22,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906064390] [2025-03-04 15:29:22,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:22,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 15:29:22,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:22,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 15:29:22,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2025-03-04 15:29:22,957 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 89 [2025-03-04 15:29:22,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 101 transitions, 521 flow. Second operand has 17 states, 17 states have (on average 20.705882352941178) internal successors, (352), 17 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:22,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:22,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 89 [2025-03-04 15:29:22,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:24,850 INFO L124 PetriNetUnfolderBase]: 10188/16382 cut-off events. [2025-03-04 15:29:24,850 INFO L125 PetriNetUnfolderBase]: For 18660/18660 co-relation queries the response was YES. [2025-03-04 15:29:24,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44687 conditions, 16382 events. 10188/16382 cut-off events. For 18660/18660 co-relation queries the response was YES. Maximal size of possible extension queue 1114. Compared 123217 event pairs, 8260 based on Foata normal form. 0/10782 useless extension candidates. Maximal degree in co-relation 44550. Up to 11633 conditions per place. [2025-03-04 15:29:24,955 INFO L140 encePairwiseOnDemand]: 79/89 looper letters, 108 selfloop transitions, 51 changer transitions 0/176 dead transitions. [2025-03-04 15:29:24,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 176 transitions, 1237 flow [2025-03-04 15:29:24,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 15:29:24,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 15:29:24,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 389 transitions. [2025-03-04 15:29:24,957 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31219903691813805 [2025-03-04 15:29:24,957 INFO L175 Difference]: Start difference. First operand has 105 places, 101 transitions, 521 flow. Second operand 14 states and 389 transitions. [2025-03-04 15:29:24,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 176 transitions, 1237 flow [2025-03-04 15:29:24,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 176 transitions, 1219 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:29:24,964 INFO L231 Difference]: Finished difference. Result has 120 places, 117 transitions, 775 flow [2025-03-04 15:29:24,964 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=775, PETRI_PLACES=120, PETRI_TRANSITIONS=117} [2025-03-04 15:29:24,964 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 31 predicate places. [2025-03-04 15:29:24,964 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 117 transitions, 775 flow [2025-03-04 15:29:24,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 20.705882352941178) internal successors, (352), 17 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:24,965 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:24,965 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1] [2025-03-04 15:29:24,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 15:29:25,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:25,169 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 88 more)] === [2025-03-04 15:29:25,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:25,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1177314539, now seen corresponding path program 2 times [2025-03-04 15:29:25,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:25,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472437039] [2025-03-04 15:29:25,170 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:29:25,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:25,178 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:29:25,183 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-03-04 15:29:25,183 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:29:25,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:25,203 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 15:29:25,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:25,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472437039] [2025-03-04 15:29:25,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472437039] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:25,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398573616] [2025-03-04 15:29:25,204 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:29:25,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:25,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:25,206 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:29:25,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 15:29:25,290 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:29:25,296 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-03-04 15:29:25,296 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:29:25,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:25,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:29:25,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:25,314 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 15:29:25,314 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:25,329 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 15:29:25,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398573616] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:25,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:25,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2025-03-04 15:29:25,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404970916] [2025-03-04 15:29:25,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:25,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:29:25,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:25,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:29:25,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:29:25,336 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 89 [2025-03-04 15:29:25,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 117 transitions, 775 flow. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:25,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:25,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 89 [2025-03-04 15:29:25,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:26,652 INFO L124 PetriNetUnfolderBase]: 9446/15623 cut-off events. [2025-03-04 15:29:26,652 INFO L125 PetriNetUnfolderBase]: For 16438/16438 co-relation queries the response was YES. [2025-03-04 15:29:26,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43266 conditions, 15623 events. 9446/15623 cut-off events. For 16438/16438 co-relation queries the response was YES. Maximal size of possible extension queue 1279. Compared 123090 event pairs, 8470 based on Foata normal form. 1/10530 useless extension candidates. Maximal degree in co-relation 43107. Up to 13551 conditions per place. [2025-03-04 15:29:26,771 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 82 selfloop transitions, 16 changer transitions 0/116 dead transitions. [2025-03-04 15:29:26,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 116 transitions, 961 flow [2025-03-04 15:29:26,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:29:26,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:29:26,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2025-03-04 15:29:26,772 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35674157303370785 [2025-03-04 15:29:26,772 INFO L175 Difference]: Start difference. First operand has 120 places, 117 transitions, 775 flow. Second operand 4 states and 127 transitions. [2025-03-04 15:29:26,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 116 transitions, 961 flow [2025-03-04 15:29:26,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 116 transitions, 936 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-03-04 15:29:26,782 INFO L231 Difference]: Finished difference. Result has 120 places, 116 transitions, 772 flow [2025-03-04 15:29:26,783 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=740, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=772, PETRI_PLACES=120, PETRI_TRANSITIONS=116} [2025-03-04 15:29:26,783 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 31 predicate places. [2025-03-04 15:29:26,783 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 116 transitions, 772 flow [2025-03-04 15:29:26,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:26,783 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:26,783 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1] [2025-03-04 15:29:26,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 15:29:26,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:26,984 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 88 more)] === [2025-03-04 15:29:26,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:26,984 INFO L85 PathProgramCache]: Analyzing trace with hash 928336124, now seen corresponding path program 1 times [2025-03-04 15:29:26,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:26,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455088052] [2025-03-04 15:29:26,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:26,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:26,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:29:26,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:29:26,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:26,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:27,027 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-04 15:29:27,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:27,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455088052] [2025-03-04 15:29:27,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455088052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:27,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:27,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:29:27,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178086955] [2025-03-04 15:29:27,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:27,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:29:27,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:27,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:29:27,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:29:27,032 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 89 [2025-03-04 15:29:27,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 116 transitions, 772 flow. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:27,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:27,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 89 [2025-03-04 15:29:27,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:28,409 INFO L124 PetriNetUnfolderBase]: 9445/15607 cut-off events. [2025-03-04 15:29:28,409 INFO L125 PetriNetUnfolderBase]: For 16319/16319 co-relation queries the response was YES. [2025-03-04 15:29:28,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43189 conditions, 15607 events. 9445/15607 cut-off events. For 16319/16319 co-relation queries the response was YES. Maximal size of possible extension queue 1279. Compared 122868 event pairs, 8470 based on Foata normal form. 1/10514 useless extension candidates. Maximal degree in co-relation 43089. Up to 13540 conditions per place. [2025-03-04 15:29:28,552 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 78 selfloop transitions, 8 changer transitions 1/106 dead transitions. [2025-03-04 15:29:28,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 106 transitions, 830 flow [2025-03-04 15:29:28,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:29:28,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:29:28,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2025-03-04 15:29:28,553 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41292134831460675 [2025-03-04 15:29:28,553 INFO L175 Difference]: Start difference. First operand has 120 places, 116 transitions, 772 flow. Second operand 4 states and 147 transitions. [2025-03-04 15:29:28,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 106 transitions, 830 flow [2025-03-04 15:29:28,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 106 transitions, 757 flow, removed 20 selfloop flow, removed 5 redundant places. [2025-03-04 15:29:28,564 INFO L231 Difference]: Finished difference. Result has 117 places, 105 transitions, 594 flow [2025-03-04 15:29:28,564 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=583, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=594, PETRI_PLACES=117, PETRI_TRANSITIONS=105} [2025-03-04 15:29:28,564 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 28 predicate places. [2025-03-04 15:29:28,565 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 105 transitions, 594 flow [2025-03-04 15:29:28,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:28,565 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:28,565 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:28,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 15:29:28,565 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 88 more)] === [2025-03-04 15:29:28,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:28,565 INFO L85 PathProgramCache]: Analyzing trace with hash -392113481, now seen corresponding path program 1 times [2025-03-04 15:29:28,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:28,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135732509] [2025-03-04 15:29:28,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:28,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:28,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:29:28,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:29:28,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:28,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:28,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:28,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:28,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135732509] [2025-03-04 15:29:28,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135732509] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:28,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018561409] [2025-03-04 15:29:28,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:28,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:28,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:28,836 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:29:28,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 15:29:28,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:29:28,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:29:28,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:28,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:28,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 15:29:28,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:28,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-03-04 15:29:28,973 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 23 treesize of output 1 [2025-03-04 15:29:29,049 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 15:29:29,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 15:29:29,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-04 15:29:29,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:29,227 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:29,489 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:29:29,489 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2025-03-04 15:29:29,495 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:29:29,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 33 [2025-03-04 15:29:29,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2025-03-04 15:29:29,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:29,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018561409] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:29,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:29,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2025-03-04 15:29:29,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295822019] [2025-03-04 15:29:29,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:29,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 15:29:29,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:29,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 15:29:29,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=437, Unknown=6, NotChecked=0, Total=506 [2025-03-04 15:29:29,712 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 89 [2025-03-04 15:29:29,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 105 transitions, 594 flow. Second operand has 23 states, 23 states have (on average 16.217391304347824) internal successors, (373), 23 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:29,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:29,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 89 [2025-03-04 15:29:29,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:37,438 INFO L124 PetriNetUnfolderBase]: 42109/67469 cut-off events. [2025-03-04 15:29:37,439 INFO L125 PetriNetUnfolderBase]: For 67479/67479 co-relation queries the response was YES. [2025-03-04 15:29:37,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183831 conditions, 67469 events. 42109/67469 cut-off events. For 67479/67479 co-relation queries the response was YES. Maximal size of possible extension queue 2418. Compared 553224 event pairs, 25398 based on Foata normal form. 0/45003 useless extension candidates. Maximal degree in co-relation 183680. Up to 18193 conditions per place. [2025-03-04 15:29:37,878 INFO L140 encePairwiseOnDemand]: 77/89 looper letters, 366 selfloop transitions, 64 changer transitions 8/450 dead transitions. [2025-03-04 15:29:37,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 450 transitions, 3145 flow [2025-03-04 15:29:37,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-04 15:29:37,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-04 15:29:37,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 805 transitions. [2025-03-04 15:29:37,880 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.301498127340824 [2025-03-04 15:29:37,880 INFO L175 Difference]: Start difference. First operand has 117 places, 105 transitions, 594 flow. Second operand 30 states and 805 transitions. [2025-03-04 15:29:37,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 450 transitions, 3145 flow [2025-03-04 15:29:37,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 450 transitions, 3127 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:29:37,907 INFO L231 Difference]: Finished difference. Result has 146 places, 133 transitions, 888 flow [2025-03-04 15:29:37,907 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=888, PETRI_PLACES=146, PETRI_TRANSITIONS=133} [2025-03-04 15:29:37,907 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 57 predicate places. [2025-03-04 15:29:37,907 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 133 transitions, 888 flow [2025-03-04 15:29:37,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 16.217391304347824) internal successors, (373), 23 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:37,908 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:37,908 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:37,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 15:29:38,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 15:29:38,114 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 88 more)] === [2025-03-04 15:29:38,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:38,114 INFO L85 PathProgramCache]: Analyzing trace with hash -392113476, now seen corresponding path program 1 times [2025-03-04 15:29:38,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:38,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064499783] [2025-03-04 15:29:38,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:38,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:38,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:29:38,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:29:38,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:38,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:38,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:29:38,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:38,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064499783] [2025-03-04 15:29:38,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064499783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:38,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:38,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:29:38,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770385802] [2025-03-04 15:29:38,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:38,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:29:38,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:38,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:29:38,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:29:38,176 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 89 [2025-03-04 15:29:38,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 133 transitions, 888 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:38,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:38,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 89 [2025-03-04 15:29:38,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:45,251 INFO L124 PetriNetUnfolderBase]: 38165/63545 cut-off events. [2025-03-04 15:29:45,251 INFO L125 PetriNetUnfolderBase]: For 87479/88375 co-relation queries the response was YES. [2025-03-04 15:29:45,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188306 conditions, 63545 events. 38165/63545 cut-off events. For 87479/88375 co-relation queries the response was YES. Maximal size of possible extension queue 3189. Compared 597100 event pairs, 14277 based on Foata normal form. 0/45611 useless extension candidates. Maximal degree in co-relation 188216. Up to 32305 conditions per place. [2025-03-04 15:29:45,673 INFO L140 encePairwiseOnDemand]: 82/89 looper letters, 152 selfloop transitions, 5 changer transitions 0/176 dead transitions. [2025-03-04 15:29:45,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 176 transitions, 1409 flow [2025-03-04 15:29:45,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:29:45,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:29:45,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2025-03-04 15:29:45,674 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5692883895131086 [2025-03-04 15:29:45,674 INFO L175 Difference]: Start difference. First operand has 146 places, 133 transitions, 888 flow. Second operand 3 states and 152 transitions. [2025-03-04 15:29:45,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 176 transitions, 1409 flow [2025-03-04 15:29:45,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 176 transitions, 1343 flow, removed 6 selfloop flow, removed 10 redundant places. [2025-03-04 15:29:45,965 INFO L231 Difference]: Finished difference. Result has 140 places, 137 transitions, 862 flow [2025-03-04 15:29:45,965 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=862, PETRI_PLACES=140, PETRI_TRANSITIONS=137} [2025-03-04 15:29:45,966 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 51 predicate places. [2025-03-04 15:29:45,966 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 137 transitions, 862 flow [2025-03-04 15:29:45,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:45,966 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:45,966 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:45,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 15:29:45,966 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (and 88 more)] === [2025-03-04 15:29:45,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:45,967 INFO L85 PathProgramCache]: Analyzing trace with hash -392113482, now seen corresponding path program 1 times [2025-03-04 15:29:45,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:45,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010766041] [2025-03-04 15:29:45,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:45,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:45,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:29:45,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:29:45,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:45,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:46,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:46,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:46,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010766041] [2025-03-04 15:29:46,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010766041] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:46,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593381583] [2025-03-04 15:29:46,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:46,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:46,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:46,197 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:29:46,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 15:29:46,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:29:46,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:29:46,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:46,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:46,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 15:29:46,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:46,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-03-04 15:29:46,332 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 23 treesize of output 1 [2025-03-04 15:29:46,408 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 15:29:46,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 15:29:46,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2025-03-04 15:29:46,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:46,541 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:46,760 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:29:46,760 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2025-03-04 15:29:46,766 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:29:46,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 39 [2025-03-04 15:29:46,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2025-03-04 15:29:46,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:46,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593381583] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:46,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:46,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2025-03-04 15:29:46,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54119918] [2025-03-04 15:29:46,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:46,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 15:29:46,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:46,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 15:29:46,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=441, Unknown=2, NotChecked=0, Total=506 [2025-03-04 15:29:47,126 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 89 [2025-03-04 15:29:47,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 137 transitions, 862 flow. Second operand has 23 states, 23 states have (on average 16.217391304347824) internal successors, (373), 23 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:47,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:47,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 89 [2025-03-04 15:29:47,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:58,702 INFO L124 PetriNetUnfolderBase]: 54868/85648 cut-off events. [2025-03-04 15:29:58,703 INFO L125 PetriNetUnfolderBase]: For 117169/117169 co-relation queries the response was YES. [2025-03-04 15:29:59,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267898 conditions, 85648 events. 54868/85648 cut-off events. For 117169/117169 co-relation queries the response was YES. Maximal size of possible extension queue 2764. Compared 697527 event pairs, 32968 based on Foata normal form. 776/69971 useless extension candidates. Maximal degree in co-relation 267806. Up to 28820 conditions per place.