./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/popl20-difference-det.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-difference-det.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 74892b4fb04a6fe0e809c110df08d9da57c5c90ea65da5b04a32432686fc90f8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:53:19,143 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:53:19,196 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 06:53:19,201 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:53:19,202 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:53:19,216 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:53:19,218 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:53:19,218 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:53:19,218 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:53:19,218 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:53:19,218 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:53:19,219 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:53:19,219 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:53:19,219 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:53:19,220 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:53:19,220 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:53:19,220 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:53:19,220 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:53:19,220 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:53:19,220 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:53:19,220 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:53:19,220 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:53:19,220 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:53:19,220 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:53:19,220 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:53:19,221 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:53:19,221 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:53:19,221 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:53:19,221 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:53:19,221 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:53:19,221 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:53:19,221 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:53:19,222 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:53:19,222 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:53:19,222 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:53:19,222 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:53:19,222 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:53:19,222 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:53:19,222 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:53:19,222 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:53:19,222 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:53:19,223 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:53:19,223 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:53:19,223 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:53:19,223 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:53:19,223 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:53:19,223 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:53:19,223 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:53:19,223 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:53:19,223 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:53:19,223 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 74892b4fb04a6fe0e809c110df08d9da57c5c90ea65da5b04a32432686fc90f8 [2025-01-10 06:53:19,472 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:53:19,479 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:53:19,481 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:53:19,482 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:53:19,483 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:53:19,484 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-difference-det.wvr.c [2025-01-10 06:53:20,867 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9c557505c/152637985ff2478a878df1a67caa204a/FLAG5ece0ef7d [2025-01-10 06:53:21,191 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:53:21,192 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-difference-det.wvr.c [2025-01-10 06:53:21,224 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9c557505c/152637985ff2478a878df1a67caa204a/FLAG5ece0ef7d [2025-01-10 06:53:21,457 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9c557505c/152637985ff2478a878df1a67caa204a [2025-01-10 06:53:21,459 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:53:21,460 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:53:21,463 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:53:21,464 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:53:21,467 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:53:21,468 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:53:21" (1/1) ... [2025-01-10 06:53:21,468 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@320ca190 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:21, skipping insertion in model container [2025-01-10 06:53:21,468 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:53:21" (1/1) ... [2025-01-10 06:53:21,480 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:53:21,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:53:21,611 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:53:21,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:53:21,644 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:53:21,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:21 WrapperNode [2025-01-10 06:53:21,645 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:53:21,647 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:53:21,647 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:53:21,647 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:53:21,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:21" (1/1) ... [2025-01-10 06:53:21,658 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:21" (1/1) ... [2025-01-10 06:53:21,674 INFO L138 Inliner]: procedures = 20, calls = 14, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 103 [2025-01-10 06:53:21,674 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:53:21,675 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:53:21,675 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:53:21,676 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:53:21,682 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:21" (1/1) ... [2025-01-10 06:53:21,682 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:21" (1/1) ... [2025-01-10 06:53:21,684 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:21" (1/1) ... [2025-01-10 06:53:21,702 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 06:53:21,705 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:21" (1/1) ... [2025-01-10 06:53:21,705 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:21" (1/1) ... [2025-01-10 06:53:21,711 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:21" (1/1) ... [2025-01-10 06:53:21,712 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:21" (1/1) ... [2025-01-10 06:53:21,717 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:21" (1/1) ... [2025-01-10 06:53:21,718 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:21" (1/1) ... [2025-01-10 06:53:21,719 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:21" (1/1) ... [2025-01-10 06:53:21,720 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:53:21,721 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:53:21,721 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:53:21,721 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:53:21,721 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:21" (1/1) ... [2025-01-10 06:53:21,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:53:21,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:53:21,745 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 06:53:21,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 06:53:21,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:53:21,768 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 06:53:21,768 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 06:53:21,768 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 06:53:21,769 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 06:53:21,769 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-10 06:53:21,769 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-10 06:53:21,769 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-01-10 06:53:21,769 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-01-10 06:53:21,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:53:21,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:53:21,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:53:21,770 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 06:53:21,837 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:53:21,839 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:53:22,007 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:53:22,007 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:53:22,110 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:53:22,113 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 06:53:22,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:53:22 BoogieIcfgContainer [2025-01-10 06:53:22,113 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:53:22,115 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:53:22,115 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:53:22,118 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:53:22,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:53:21" (1/3) ... [2025-01-10 06:53:22,119 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e2321be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:53:22, skipping insertion in model container [2025-01-10 06:53:22,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:21" (2/3) ... [2025-01-10 06:53:22,119 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e2321be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:53:22, skipping insertion in model container [2025-01-10 06:53:22,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:53:22" (3/3) ... [2025-01-10 06:53:22,120 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-difference-det.wvr.c [2025-01-10 06:53:22,131 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:53:22,132 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-difference-det.wvr.c that has 5 procedures, 59 locations, 1 initial locations, 4 loop locations, and 16 error locations. [2025-01-10 06:53:22,132 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:53:22,184 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-10 06:53:22,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 62 transitions, 152 flow [2025-01-10 06:53:22,269 INFO L124 PetriNetUnfolderBase]: 4/58 cut-off events. [2025-01-10 06:53:22,271 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-10 06:53:22,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 58 events. 4/58 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 159 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2025-01-10 06:53:22,278 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 62 transitions, 152 flow [2025-01-10 06:53:22,281 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 56 transitions, 133 flow [2025-01-10 06:53:22,292 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:53:22,304 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;@46e2aa33, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:53:22,304 INFO L334 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2025-01-10 06:53:22,309 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:53:22,309 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2025-01-10 06:53:22,310 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:53:22,310 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:53:22,310 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:53:22,310 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-01-10 06:53:22,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:53:22,314 INFO L85 PathProgramCache]: Analyzing trace with hash 347322367, now seen corresponding path program 1 times [2025-01-10 06:53:22,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:53:22,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971865678] [2025-01-10 06:53:22,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:53:22,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:53:22,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:53:22,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:53:22,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:53:22,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:53:22,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:53:22,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:53:22,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971865678] [2025-01-10 06:53:22,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971865678] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:53:22,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:53:22,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:53:22,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548149274] [2025-01-10 06:53:22,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:53:22,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:53:22,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:53:22,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:53:22,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:53:22,502 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2025-01-10 06:53:22,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 56 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:53:22,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:53:22,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2025-01-10 06:53:22,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:53:24,709 INFO L124 PetriNetUnfolderBase]: 26633/39153 cut-off events. [2025-01-10 06:53:24,710 INFO L125 PetriNetUnfolderBase]: For 1921/1921 co-relation queries the response was YES. [2025-01-10 06:53:24,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75527 conditions, 39153 events. 26633/39153 cut-off events. For 1921/1921 co-relation queries the response was YES. Maximal size of possible extension queue 1871. Compared 285069 event pairs, 6878 based on Foata normal form. 0/28295 useless extension candidates. Maximal degree in co-relation 69156. Up to 29555 conditions per place. [2025-01-10 06:53:25,130 INFO L140 encePairwiseOnDemand]: 57/62 looper letters, 69 selfloop transitions, 2 changer transitions 0/85 dead transitions. [2025-01-10 06:53:25,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 85 transitions, 351 flow [2025-01-10 06:53:25,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:53:25,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:53:25,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2025-01-10 06:53:25,142 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6881720430107527 [2025-01-10 06:53:25,143 INFO L175 Difference]: Start difference. First operand has 65 places, 56 transitions, 133 flow. Second operand 3 states and 128 transitions. [2025-01-10 06:53:25,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 85 transitions, 351 flow [2025-01-10 06:53:25,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 85 transitions, 327 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-01-10 06:53:25,234 INFO L231 Difference]: Finished difference. Result has 61 places, 57 transitions, 136 flow [2025-01-10 06:53:25,236 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=61, PETRI_TRANSITIONS=57} [2025-01-10 06:53:25,240 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, -4 predicate places. [2025-01-10 06:53:25,240 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 57 transitions, 136 flow [2025-01-10 06:53:25,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:53:25,241 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:53:25,241 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:53:25,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:53:25,241 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-01-10 06:53:25,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:53:25,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1230640158, now seen corresponding path program 1 times [2025-01-10 06:53:25,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:53:25,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418283084] [2025-01-10 06:53:25,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:53:25,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:53:25,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:53:25,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:53:25,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:53:25,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:53:25,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:53:25,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:53:25,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418283084] [2025-01-10 06:53:25,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418283084] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:53:25,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:53:25,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:53:25,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814981570] [2025-01-10 06:53:25,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:53:25,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:53:25,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:53:25,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:53:25,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:53:25,347 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 62 [2025-01-10 06:53:25,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 57 transitions, 136 flow. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:53:25,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:53:25,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 62 [2025-01-10 06:53:25,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:53:28,002 INFO L124 PetriNetUnfolderBase]: 40657/59242 cut-off events. [2025-01-10 06:53:28,002 INFO L125 PetriNetUnfolderBase]: For 3176/3176 co-relation queries the response was YES. [2025-01-10 06:53:28,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118602 conditions, 59242 events. 40657/59242 cut-off events. For 3176/3176 co-relation queries the response was YES. Maximal size of possible extension queue 2684. Compared 435391 event pairs, 23154 based on Foata normal form. 1026/45357 useless extension candidates. Maximal degree in co-relation 52499. Up to 42823 conditions per place. [2025-01-10 06:53:28,681 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 104 selfloop transitions, 4 changer transitions 0/120 dead transitions. [2025-01-10 06:53:28,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 120 transitions, 490 flow [2025-01-10 06:53:28,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:53:28,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:53:28,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2025-01-10 06:53:28,682 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7016129032258065 [2025-01-10 06:53:28,682 INFO L175 Difference]: Start difference. First operand has 61 places, 57 transitions, 136 flow. Second operand 4 states and 174 transitions. [2025-01-10 06:53:28,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 120 transitions, 490 flow [2025-01-10 06:53:28,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 120 transitions, 488 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:53:28,685 INFO L231 Difference]: Finished difference. Result has 65 places, 60 transitions, 163 flow [2025-01-10 06:53:28,685 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=163, PETRI_PLACES=65, PETRI_TRANSITIONS=60} [2025-01-10 06:53:28,686 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 0 predicate places. [2025-01-10 06:53:28,686 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 60 transitions, 163 flow [2025-01-10 06:53:28,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:53:28,686 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:53:28,686 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:53:28,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:53:28,687 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-01-10 06:53:28,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:53:28,687 INFO L85 PathProgramCache]: Analyzing trace with hash 123969529, now seen corresponding path program 1 times [2025-01-10 06:53:28,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:53:28,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237543437] [2025-01-10 06:53:28,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:53:28,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:53:28,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:53:28,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:53:28,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:53:28,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:53:28,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:53:28,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:53:28,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237543437] [2025-01-10 06:53:28,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237543437] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:53:28,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:53:28,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:53:28,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567616254] [2025-01-10 06:53:28,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:53:28,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:53:28,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:53:28,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:53:28,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:53:28,767 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2025-01-10 06:53:28,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 60 transitions, 163 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:53:28,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:53:28,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2025-01-10 06:53:28,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:53:30,752 INFO L124 PetriNetUnfolderBase]: 34577/51715 cut-off events. [2025-01-10 06:53:30,752 INFO L125 PetriNetUnfolderBase]: For 12415/14143 co-relation queries the response was YES. [2025-01-10 06:53:30,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112171 conditions, 51715 events. 34577/51715 cut-off events. For 12415/14143 co-relation queries the response was YES. Maximal size of possible extension queue 1993. Compared 380939 event pairs, 8936 based on Foata normal form. 0/39788 useless extension candidates. Maximal degree in co-relation 64010. Up to 37724 conditions per place. [2025-01-10 06:53:31,017 INFO L140 encePairwiseOnDemand]: 57/62 looper letters, 72 selfloop transitions, 2 changer transitions 1/89 dead transitions. [2025-01-10 06:53:31,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 89 transitions, 405 flow [2025-01-10 06:53:31,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:53:31,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:53:31,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2025-01-10 06:53:31,019 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-01-10 06:53:31,019 INFO L175 Difference]: Start difference. First operand has 65 places, 60 transitions, 163 flow. Second operand 3 states and 124 transitions. [2025-01-10 06:53:31,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 89 transitions, 405 flow [2025-01-10 06:53:31,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 89 transitions, 399 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:53:31,029 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 176 flow [2025-01-10 06:53:31,029 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=67, PETRI_TRANSITIONS=61} [2025-01-10 06:53:31,029 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 2 predicate places. [2025-01-10 06:53:31,029 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 176 flow [2025-01-10 06:53:31,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:53:31,030 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:53:31,030 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:53:31,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:53:31,030 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-01-10 06:53:31,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:53:31,030 INFO L85 PathProgramCache]: Analyzing trace with hash -181557790, now seen corresponding path program 1 times [2025-01-10 06:53:31,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:53:31,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262020326] [2025-01-10 06:53:31,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:53:31,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:53:31,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:53:31,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:53:31,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:53:31,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:53:31,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:53:31,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:53:31,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262020326] [2025-01-10 06:53:31,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262020326] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:53:31,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:53:31,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:53:31,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24465719] [2025-01-10 06:53:31,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:53:31,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:53:31,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:53:31,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:53:31,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:53:31,062 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2025-01-10 06:53:31,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 61 transitions, 176 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:53:31,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:53:31,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2025-01-10 06:53:31,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:53:33,146 INFO L124 PetriNetUnfolderBase]: 31801/47218 cut-off events. [2025-01-10 06:53:33,147 INFO L125 PetriNetUnfolderBase]: For 12732/13660 co-relation queries the response was YES. [2025-01-10 06:53:33,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107829 conditions, 47218 events. 31801/47218 cut-off events. For 12732/13660 co-relation queries the response was YES. Maximal size of possible extension queue 1785. Compared 343930 event pairs, 19145 based on Foata normal form. 0/38424 useless extension candidates. Maximal degree in co-relation 50267. Up to 29306 conditions per place. [2025-01-10 06:53:33,464 INFO L140 encePairwiseOnDemand]: 57/62 looper letters, 79 selfloop transitions, 3 changer transitions 0/96 dead transitions. [2025-01-10 06:53:33,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 96 transitions, 444 flow [2025-01-10 06:53:33,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:53:33,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:53:33,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2025-01-10 06:53:33,466 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6989247311827957 [2025-01-10 06:53:33,467 INFO L175 Difference]: Start difference. First operand has 67 places, 61 transitions, 176 flow. Second operand 3 states and 130 transitions. [2025-01-10 06:53:33,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 96 transitions, 444 flow [2025-01-10 06:53:33,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 96 transitions, 441 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:53:33,483 INFO L231 Difference]: Finished difference. Result has 69 places, 62 transitions, 198 flow [2025-01-10 06:53:33,483 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=69, PETRI_TRANSITIONS=62} [2025-01-10 06:53:33,485 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 4 predicate places. [2025-01-10 06:53:33,485 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 62 transitions, 198 flow [2025-01-10 06:53:33,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:53:33,485 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:53:33,485 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:53:33,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:53:33,486 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-01-10 06:53:33,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:53:33,487 INFO L85 PathProgramCache]: Analyzing trace with hash 84928433, now seen corresponding path program 1 times [2025-01-10 06:53:33,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:53:33,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124956557] [2025-01-10 06:53:33,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:53:33,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:53:33,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:53:33,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:53:33,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:53:33,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:53:33,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:53:33,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:53:33,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124956557] [2025-01-10 06:53:33,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124956557] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:53:33,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:53:33,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:53:33,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769915076] [2025-01-10 06:53:33,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:53:33,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:53:33,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:53:33,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:53:33,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:53:33,562 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2025-01-10 06:53:33,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 62 transitions, 198 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:53:33,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:53:33,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2025-01-10 06:53:33,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:53:36,245 INFO L124 PetriNetUnfolderBase]: 37799/56461 cut-off events. [2025-01-10 06:53:36,245 INFO L125 PetriNetUnfolderBase]: For 31719/31853 co-relation queries the response was YES. [2025-01-10 06:53:36,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137155 conditions, 56461 events. 37799/56461 cut-off events. For 31719/31853 co-relation queries the response was YES. Maximal size of possible extension queue 1788. Compared 416207 event pairs, 5739 based on Foata normal form. 1533/51758 useless extension candidates. Maximal degree in co-relation 68027. Up to 24870 conditions per place. [2025-01-10 06:53:36,530 INFO L140 encePairwiseOnDemand]: 57/62 looper letters, 107 selfloop transitions, 4 changer transitions 0/125 dead transitions. [2025-01-10 06:53:36,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 125 transitions, 598 flow [2025-01-10 06:53:36,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:53:36,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:53:36,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 180 transitions. [2025-01-10 06:53:36,531 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7258064516129032 [2025-01-10 06:53:36,531 INFO L175 Difference]: Start difference. First operand has 69 places, 62 transitions, 198 flow. Second operand 4 states and 180 transitions. [2025-01-10 06:53:36,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 125 transitions, 598 flow [2025-01-10 06:53:36,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 125 transitions, 588 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:53:36,618 INFO L231 Difference]: Finished difference. Result has 72 places, 64 transitions, 226 flow [2025-01-10 06:53:36,618 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=226, PETRI_PLACES=72, PETRI_TRANSITIONS=64} [2025-01-10 06:53:36,619 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 7 predicate places. [2025-01-10 06:53:36,619 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 64 transitions, 226 flow [2025-01-10 06:53:36,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:53:36,619 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:53:36,619 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:53:36,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:53:36,620 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-01-10 06:53:36,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:53:36,620 INFO L85 PathProgramCache]: Analyzing trace with hash -159692540, now seen corresponding path program 1 times [2025-01-10 06:53:36,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:53:36,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371247626] [2025-01-10 06:53:36,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:53:36,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:53:36,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:53:36,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:53:36,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:53:36,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:53:36,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:53:36,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:53:36,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371247626] [2025-01-10 06:53:36,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371247626] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:53:36,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527293445] [2025-01-10 06:53:36,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:53:36,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:53:36,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:53:36,659 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:53:36,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 06:53:36,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:53:36,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:53:36,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:53:36,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:53:36,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:53:36,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:53:36,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:53:36,733 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:53:36,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527293445] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:53:36,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:53:36,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2025-01-10 06:53:36,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896445845] [2025-01-10 06:53:36,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:53:36,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:53:36,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:53:36,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:53:36,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:53:36,735 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2025-01-10 06:53:36,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 64 transitions, 226 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:53:36,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:53:36,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2025-01-10 06:53:36,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:53:40,094 INFO L124 PetriNetUnfolderBase]: 47163/70000 cut-off events. [2025-01-10 06:53:40,094 INFO L125 PetriNetUnfolderBase]: For 58112/59313 co-relation queries the response was YES. [2025-01-10 06:53:40,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171377 conditions, 70000 events. 47163/70000 cut-off events. For 58112/59313 co-relation queries the response was YES. Maximal size of possible extension queue 2157. Compared 522232 event pairs, 16808 based on Foata normal form. 2148/64115 useless extension candidates. Maximal degree in co-relation 67294. Up to 34736 conditions per place. [2025-01-10 06:53:40,489 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 80 selfloop transitions, 7 changer transitions 0/101 dead transitions. [2025-01-10 06:53:40,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 101 transitions, 509 flow [2025-01-10 06:53:40,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:53:40,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:53:40,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 149 transitions. [2025-01-10 06:53:40,491 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6008064516129032 [2025-01-10 06:53:40,491 INFO L175 Difference]: Start difference. First operand has 72 places, 64 transitions, 226 flow. Second operand 4 states and 149 transitions. [2025-01-10 06:53:40,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 101 transitions, 509 flow [2025-01-10 06:53:40,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 101 transitions, 501 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:53:40,557 INFO L231 Difference]: Finished difference. Result has 72 places, 66 transitions, 257 flow [2025-01-10 06:53:40,557 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=257, PETRI_PLACES=72, PETRI_TRANSITIONS=66} [2025-01-10 06:53:40,558 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 7 predicate places. [2025-01-10 06:53:40,558 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 66 transitions, 257 flow [2025-01-10 06:53:40,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:53:40,558 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:53:40,558 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:53:40,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 06:53:40,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:53:40,763 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-01-10 06:53:40,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:53:40,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1124352933, now seen corresponding path program 1 times [2025-01-10 06:53:40,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:53:40,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235976932] [2025-01-10 06:53:40,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:53:40,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:53:40,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:53:40,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:53:40,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:53:40,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:53:40,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:53:40,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:53:40,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235976932] [2025-01-10 06:53:40,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235976932] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:53:40,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:53:40,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:53:40,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103459576] [2025-01-10 06:53:40,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:53:40,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:53:40,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:53:40,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:53:40,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:53:40,826 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 62 [2025-01-10 06:53:40,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 66 transitions, 257 flow. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:53:40,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:53:40,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 62 [2025-01-10 06:53:40,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:53:46,252 INFO L124 PetriNetUnfolderBase]: 73155/106475 cut-off events. [2025-01-10 06:53:46,252 INFO L125 PetriNetUnfolderBase]: For 102935/105013 co-relation queries the response was YES. [2025-01-10 06:53:46,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274470 conditions, 106475 events. 73155/106475 cut-off events. For 102935/105013 co-relation queries the response was YES. Maximal size of possible extension queue 3164. Compared 803315 event pairs, 40798 based on Foata normal form. 1944/97323 useless extension candidates. Maximal degree in co-relation 109895. Up to 76203 conditions per place. [2025-01-10 06:53:46,963 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 127 selfloop transitions, 4 changer transitions 0/143 dead transitions. [2025-01-10 06:53:46,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 143 transitions, 877 flow [2025-01-10 06:53:46,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:53:46,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:53:46,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 164 transitions. [2025-01-10 06:53:46,964 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6612903225806451 [2025-01-10 06:53:46,964 INFO L175 Difference]: Start difference. First operand has 72 places, 66 transitions, 257 flow. Second operand 4 states and 164 transitions. [2025-01-10 06:53:46,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 143 transitions, 877 flow [2025-01-10 06:53:47,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 143 transitions, 858 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:53:47,057 INFO L231 Difference]: Finished difference. Result has 75 places, 69 transitions, 279 flow [2025-01-10 06:53:47,058 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=279, PETRI_PLACES=75, PETRI_TRANSITIONS=69} [2025-01-10 06:53:47,058 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 10 predicate places. [2025-01-10 06:53:47,058 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 69 transitions, 279 flow [2025-01-10 06:53:47,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:53:47,059 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:53:47,059 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:53:47,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:53:47,059 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-01-10 06:53:47,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:53:47,059 INFO L85 PathProgramCache]: Analyzing trace with hash 11859123, now seen corresponding path program 1 times [2025-01-10 06:53:47,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:53:47,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038727523] [2025-01-10 06:53:47,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:53:47,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:53:47,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:53:47,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:53:47,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:53:47,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:53:47,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:53:47,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:53:47,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038727523] [2025-01-10 06:53:47,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038727523] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:53:47,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:53:47,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:53:47,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134434704] [2025-01-10 06:53:47,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:53:47,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:53:47,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:53:47,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:53:47,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:53:47,113 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 62 [2025-01-10 06:53:47,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 69 transitions, 279 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:53:47,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:53:47,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 62 [2025-01-10 06:53:47,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand