./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/popl20-prod-cons3.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-prod-cons3.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 41874b69ed787f1d4b0fd199a95bb437bfc8aab0f734c194621d2ef33cc65cc9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:29:50,240 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:29:50,296 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:29:50,299 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:29:50,300 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:29:50,317 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:29:50,318 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:29:50,318 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:29:50,318 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:29:50,318 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:29:50,318 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:29:50,318 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:29:50,318 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:29:50,318 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:29:50,318 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:29:50,319 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:29:50,319 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:29:50,319 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:29:50,319 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:29:50,319 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:29:50,319 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:29:50,319 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:29:50,319 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:29:50,319 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:29:50,319 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:29:50,319 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:29:50,319 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:29:50,319 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:29:50,319 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:29:50,319 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:29:50,319 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:29:50,319 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:29:50,319 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:29:50,319 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:29:50,320 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:29:50,320 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:29:50,320 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:29:50,320 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:29:50,320 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:29:50,320 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:29:50,320 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:29:50,320 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:29:50,320 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:29:50,320 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:29:50,320 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:29:50,320 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 -> 41874b69ed787f1d4b0fd199a95bb437bfc8aab0f734c194621d2ef33cc65cc9 [2025-03-04 15:29:50,551 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:29:50,557 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:29:50,562 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:29:50,563 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:29:50,563 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:29:50,564 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-prod-cons3.wvr.c [2025-03-04 15:29:51,781 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f157869cf/6185c4767940495baa1730ea2a689a3c/FLAG22af0aac0 [2025-03-04 15:29:51,984 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:29:51,985 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-prod-cons3.wvr.c [2025-03-04 15:29:51,994 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f157869cf/6185c4767940495baa1730ea2a689a3c/FLAG22af0aac0 [2025-03-04 15:29:52,005 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f157869cf/6185c4767940495baa1730ea2a689a3c [2025-03-04 15:29:52,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:29:52,008 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:29:52,009 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:29:52,009 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:29:52,012 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:29:52,014 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:29:52" (1/1) ... [2025-03-04 15:29:52,014 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@96a702a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:52, skipping insertion in model container [2025-03-04 15:29:52,014 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:29:52" (1/1) ... [2025-03-04 15:29:52,030 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:29:52,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:29:52,159 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:29:52,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:29:52,189 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:29:52,190 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:52 WrapperNode [2025-03-04 15:29:52,190 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:29:52,190 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:29:52,191 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:29:52,191 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:29:52,195 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:52" (1/1) ... [2025-03-04 15:29:52,200 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:52" (1/1) ... [2025-03-04 15:29:52,228 INFO L138 Inliner]: procedures = 25, calls = 54, calls flagged for inlining = 16, calls inlined = 18, statements flattened = 263 [2025-03-04 15:29:52,229 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:29:52,229 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:29:52,229 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:29:52,229 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:29:52,236 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:52" (1/1) ... [2025-03-04 15:29:52,236 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:52" (1/1) ... [2025-03-04 15:29:52,239 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:52" (1/1) ... [2025-03-04 15:29:52,260 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 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:52,260 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:52" (1/1) ... [2025-03-04 15:29:52,261 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:52" (1/1) ... [2025-03-04 15:29:52,268 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:52" (1/1) ... [2025-03-04 15:29:52,270 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:52" (1/1) ... [2025-03-04 15:29:52,271 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:52" (1/1) ... [2025-03-04 15:29:52,274 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:52" (1/1) ... [2025-03-04 15:29:52,276 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:29:52,276 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:29:52,276 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:29:52,276 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:29:52,277 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:52" (1/1) ... [2025-03-04 15:29:52,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:29:52,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:52,303 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:52,306 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:52,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:29:52,324 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 15:29:52,324 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 15:29:52,325 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 15:29:52,325 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 15:29:52,325 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 15:29:52,325 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 15:29:52,326 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-04 15:29:52,326 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-04 15:29:52,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:29:52,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:29:52,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:29:52,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:29:52,327 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 15:29:52,327 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 15:29:52,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 15:29:52,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:29:52,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:29:52,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:29:52,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:29:52,328 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:52,425 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:29:52,427 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:29:52,744 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:29:52,744 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:29:52,971 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:29:52,971 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:29:52,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:29:52 BoogieIcfgContainer [2025-03-04 15:29:52,972 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:29:52,973 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:29:52,973 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:29:52,976 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:29:52,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:29:52" (1/3) ... [2025-03-04 15:29:52,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@905a549 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:29:52, skipping insertion in model container [2025-03-04 15:29:52,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:52" (2/3) ... [2025-03-04 15:29:52,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@905a549 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:29:52, skipping insertion in model container [2025-03-04 15:29:52,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:29:52" (3/3) ... [2025-03-04 15:29:52,978 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-prod-cons3.wvr.c [2025-03-04 15:29:52,991 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:29:52,993 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-prod-cons3.wvr.c that has 5 procedures, 72 locations, 1 initial locations, 5 loop locations, and 22 error locations. [2025-03-04 15:29:52,993 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:29:53,076 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-04 15:29:53,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 77 transitions, 182 flow [2025-03-04 15:29:53,146 INFO L124 PetriNetUnfolderBase]: 6/73 cut-off events. [2025-03-04 15:29:53,148 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 15:29:53,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 73 events. 6/73 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 245 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2025-03-04 15:29:53,154 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 77 transitions, 182 flow [2025-03-04 15:29:53,157 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 71 transitions, 163 flow [2025-03-04 15:29:53,166 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:29:53,175 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;@523848b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:29:53,177 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2025-03-04 15:29:53,181 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:29:53,182 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-04 15:29:53,182 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:29:53,182 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:53,183 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:29:53,183 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 15:29:53,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:53,187 INFO L85 PathProgramCache]: Analyzing trace with hash 738438, now seen corresponding path program 1 times [2025-03-04 15:29:53,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:53,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982419115] [2025-03-04 15:29:53,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:53,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:53,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:29:53,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:29:53,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:53,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:53,387 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:53,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:53,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982419115] [2025-03-04 15:29:53,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982419115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:53,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:53,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:29:53,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011350651] [2025-03-04 15:29:53,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:53,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:29:53,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:53,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:29:53,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:29:53,426 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 77 [2025-03-04 15:29:53,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 71 transitions, 163 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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:53,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:53,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 77 [2025-03-04 15:29:53,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:56,228 INFO L124 PetriNetUnfolderBase]: 34047/45567 cut-off events. [2025-03-04 15:29:56,229 INFO L125 PetriNetUnfolderBase]: For 2157/2157 co-relation queries the response was YES. [2025-03-04 15:29:56,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92755 conditions, 45567 events. 34047/45567 cut-off events. For 2157/2157 co-relation queries the response was YES. Maximal size of possible extension queue 2313. Compared 285910 event pairs, 30634 based on Foata normal form. 2/31274 useless extension candidates. Maximal degree in co-relation 87374. Up to 44704 conditions per place. [2025-03-04 15:29:56,497 INFO L140 encePairwiseOnDemand]: 65/77 looper letters, 47 selfloop transitions, 6 changer transitions 0/65 dead transitions. [2025-03-04 15:29:56,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 65 transitions, 257 flow [2025-03-04 15:29:56,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:29:56,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:29:56,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2025-03-04 15:29:56,508 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39935064935064934 [2025-03-04 15:29:56,509 INFO L175 Difference]: Start difference. First operand has 78 places, 71 transitions, 163 flow. Second operand 4 states and 123 transitions. [2025-03-04 15:29:56,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 65 transitions, 257 flow [2025-03-04 15:29:56,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 65 transitions, 244 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-04 15:29:56,547 INFO L231 Difference]: Finished difference. Result has 68 places, 65 transitions, 150 flow [2025-03-04 15:29:56,549 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=68, PETRI_TRANSITIONS=65} [2025-03-04 15:29:56,552 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -10 predicate places. [2025-03-04 15:29:56,553 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 65 transitions, 150 flow [2025-03-04 15:29:56,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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:56,555 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:56,555 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 15:29:56,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:29:56,555 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 15:29:56,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:56,556 INFO L85 PathProgramCache]: Analyzing trace with hash 22892267, now seen corresponding path program 1 times [2025-03-04 15:29:56,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:56,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601647517] [2025-03-04 15:29:56,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:56,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:56,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:29:56,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:29:56,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:56,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:56,655 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:56,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:56,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601647517] [2025-03-04 15:29:56,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601647517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:56,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:56,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:29:56,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520830732] [2025-03-04 15:29:56,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:56,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:29:56,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:56,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:29:56,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:29:56,665 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 77 [2025-03-04 15:29:56,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 65 transitions, 150 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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:56,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:56,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 77 [2025-03-04 15:29:56,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:58,639 INFO L124 PetriNetUnfolderBase]: 34049/45575 cut-off events. [2025-03-04 15:29:58,639 INFO L125 PetriNetUnfolderBase]: For 349/349 co-relation queries the response was YES. [2025-03-04 15:29:58,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92043 conditions, 45575 events. 34049/45575 cut-off events. For 349/349 co-relation queries the response was YES. Maximal size of possible extension queue 2285. Compared 285420 event pairs, 30634 based on Foata normal form. 2/31284 useless extension candidates. Maximal degree in co-relation 91995. Up to 44713 conditions per place. [2025-03-04 15:29:58,888 INFO L140 encePairwiseOnDemand]: 68/77 looper letters, 52 selfloop transitions, 7 changer transitions 0/71 dead transitions. [2025-03-04 15:29:58,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 71 transitions, 290 flow [2025-03-04 15:29:58,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:29:58,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:29:58,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 125 transitions. [2025-03-04 15:29:58,890 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40584415584415584 [2025-03-04 15:29:58,890 INFO L175 Difference]: Start difference. First operand has 68 places, 65 transitions, 150 flow. Second operand 4 states and 125 transitions. [2025-03-04 15:29:58,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 71 transitions, 290 flow [2025-03-04 15:29:58,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 71 transitions, 268 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:29:58,892 INFO L231 Difference]: Finished difference. Result has 71 places, 71 transitions, 194 flow [2025-03-04 15:29:58,892 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=194, PETRI_PLACES=71, PETRI_TRANSITIONS=71} [2025-03-04 15:29:58,892 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -7 predicate places. [2025-03-04 15:29:58,893 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 71 transitions, 194 flow [2025-03-04 15:29:58,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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:58,893 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:58,893 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-04 15:29:58,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:29:58,893 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 15:29:58,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:58,894 INFO L85 PathProgramCache]: Analyzing trace with hash -915546104, now seen corresponding path program 1 times [2025-03-04 15:29:58,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:58,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111920634] [2025-03-04 15:29:58,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:58,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:58,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:29:58,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:29:58,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:58,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:59,010 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:59,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:59,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111920634] [2025-03-04 15:29:59,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111920634] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:59,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844659475] [2025-03-04 15:29:59,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:59,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:59,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:59,013 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:59,014 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:59,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:29:59,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:29:59,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:59,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:59,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:29:59,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:59,115 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:59,115 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:59,157 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:59,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844659475] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:59,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:59,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-04 15:29:59,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603276118] [2025-03-04 15:29:59,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:59,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:29:59,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:59,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:29:59,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:29:59,184 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 77 [2025-03-04 15:29:59,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 71 transitions, 194 flow. Second operand has 10 states, 10 states have (on average 17.0) internal successors, (170), 10 states have internal predecessors, (170), 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:59,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:59,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 77 [2025-03-04 15:29:59,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:01,127 INFO L124 PetriNetUnfolderBase]: 34055/45599 cut-off events. [2025-03-04 15:30:01,127 INFO L125 PetriNetUnfolderBase]: For 363/363 co-relation queries the response was YES. [2025-03-04 15:30:01,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92119 conditions, 45599 events. 34055/45599 cut-off events. For 363/363 co-relation queries the response was YES. Maximal size of possible extension queue 2285. Compared 285714 event pairs, 30634 based on Foata normal form. 0/31302 useless extension candidates. Maximal degree in co-relation 92006. Up to 44716 conditions per place. [2025-03-04 15:30:01,343 INFO L140 encePairwiseOnDemand]: 68/77 looper letters, 52 selfloop transitions, 25 changer transitions 0/89 dead transitions. [2025-03-04 15:30:01,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 89 transitions, 426 flow [2025-03-04 15:30:01,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:30:01,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:30:01,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 243 transitions. [2025-03-04 15:30:01,346 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3155844155844156 [2025-03-04 15:30:01,346 INFO L175 Difference]: Start difference. First operand has 71 places, 71 transitions, 194 flow. Second operand 10 states and 243 transitions. [2025-03-04 15:30:01,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 89 transitions, 426 flow [2025-03-04 15:30:01,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 89 transitions, 426 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:30:01,348 INFO L231 Difference]: Finished difference. Result has 83 places, 89 transitions, 356 flow [2025-03-04 15:30:01,348 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=356, PETRI_PLACES=83, PETRI_TRANSITIONS=89} [2025-03-04 15:30:01,348 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 5 predicate places. [2025-03-04 15:30:01,349 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 89 transitions, 356 flow [2025-03-04 15:30:01,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.0) internal successors, (170), 10 states have internal predecessors, (170), 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:30:01,349 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:01,349 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:30:01,357 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:30:01,555 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:30:01,555 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 15:30:01,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:01,555 INFO L85 PathProgramCache]: Analyzing trace with hash -673839415, now seen corresponding path program 1 times [2025-03-04 15:30:01,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:01,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33780627] [2025-03-04 15:30:01,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:01,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:01,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:30:01,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:30:01,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:01,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:01,661 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:30:01,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:01,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33780627] [2025-03-04 15:30:01,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33780627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:30:01,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:30:01,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:30:01,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42422740] [2025-03-04 15:30:01,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:30:01,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:30:01,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:01,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:30:01,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:30:01,663 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 77 [2025-03-04 15:30:01,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 89 transitions, 356 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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:30:01,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:01,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 77 [2025-03-04 15:30:01,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:04,253 INFO L124 PetriNetUnfolderBase]: 39412/52671 cut-off events. [2025-03-04 15:30:04,253 INFO L125 PetriNetUnfolderBase]: For 517/517 co-relation queries the response was YES. [2025-03-04 15:30:04,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106948 conditions, 52671 events. 39412/52671 cut-off events. For 517/517 co-relation queries the response was YES. Maximal size of possible extension queue 2226. Compared 327593 event pairs, 35768 based on Foata normal form. 922/38750 useless extension candidates. Maximal degree in co-relation 106854. Up to 44731 conditions per place. [2025-03-04 15:30:04,531 INFO L140 encePairwiseOnDemand]: 67/77 looper letters, 107 selfloop transitions, 13 changer transitions 0/134 dead transitions. [2025-03-04 15:30:04,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 134 transitions, 766 flow [2025-03-04 15:30:04,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:30:04,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:30:04,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 193 transitions. [2025-03-04 15:30:04,533 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5012987012987012 [2025-03-04 15:30:04,533 INFO L175 Difference]: Start difference. First operand has 83 places, 89 transitions, 356 flow. Second operand 5 states and 193 transitions. [2025-03-04 15:30:04,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 134 transitions, 766 flow [2025-03-04 15:30:04,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 134 transitions, 672 flow, removed 29 selfloop flow, removed 4 redundant places. [2025-03-04 15:30:04,536 INFO L231 Difference]: Finished difference. Result has 85 places, 99 transitions, 418 flow [2025-03-04 15:30:04,536 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=418, PETRI_PLACES=85, PETRI_TRANSITIONS=99} [2025-03-04 15:30:04,536 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 7 predicate places. [2025-03-04 15:30:04,536 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 99 transitions, 418 flow [2025-03-04 15:30:04,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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:30:04,538 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:04,538 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:30:04,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:30:04,538 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 15:30:04,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:04,539 INFO L85 PathProgramCache]: Analyzing trace with hash 972333004, now seen corresponding path program 1 times [2025-03-04 15:30:04,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:04,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254638250] [2025-03-04 15:30:04,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:04,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:04,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:30:04,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:30:04,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:04,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:04,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:30:04,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:04,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254638250] [2025-03-04 15:30:04,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254638250] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:30:04,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586561612] [2025-03-04 15:30:04,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:04,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:04,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:30:04,689 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:30:04,691 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:30:04,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:30:04,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:30:04,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:04,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:04,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:30:04,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:30:04,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:30:04,775 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:30:04,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586561612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:30:04,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:30:04,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2025-03-04 15:30:04,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611404620] [2025-03-04 15:30:04,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:30:04,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:30:04,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:04,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:30:04,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:30:04,776 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 77 [2025-03-04 15:30:04,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 99 transitions, 418 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:30:04,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:04,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 77 [2025-03-04 15:30:04,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:07,005 INFO L124 PetriNetUnfolderBase]: 32539/44362 cut-off events. [2025-03-04 15:30:07,005 INFO L125 PetriNetUnfolderBase]: For 2623/2623 co-relation queries the response was YES. [2025-03-04 15:30:07,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91281 conditions, 44362 events. 32539/44362 cut-off events. For 2623/2623 co-relation queries the response was YES. Maximal size of possible extension queue 1876. Compared 281926 event pairs, 29348 based on Foata normal form. 0/32827 useless extension candidates. Maximal degree in co-relation 91186. Up to 43087 conditions per place. [2025-03-04 15:30:07,222 INFO L140 encePairwiseOnDemand]: 74/77 looper letters, 82 selfloop transitions, 1 changer transitions 0/97 dead transitions. [2025-03-04 15:30:07,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 97 transitions, 576 flow [2025-03-04 15:30:07,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:30:07,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:30:07,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2025-03-04 15:30:07,224 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4805194805194805 [2025-03-04 15:30:07,224 INFO L175 Difference]: Start difference. First operand has 85 places, 99 transitions, 418 flow. Second operand 3 states and 111 transitions. [2025-03-04 15:30:07,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 97 transitions, 576 flow [2025-03-04 15:30:07,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 97 transitions, 572 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 15:30:07,230 INFO L231 Difference]: Finished difference. Result has 84 places, 97 transitions, 408 flow [2025-03-04 15:30:07,230 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=408, PETRI_PLACES=84, PETRI_TRANSITIONS=97} [2025-03-04 15:30:07,233 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 6 predicate places. [2025-03-04 15:30:07,233 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 97 transitions, 408 flow [2025-03-04 15:30:07,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:30:07,233 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:07,233 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:30:07,240 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:30:07,434 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:30:07,434 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 15:30:07,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:07,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1857213116, now seen corresponding path program 1 times [2025-03-04 15:30:07,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:07,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515851465] [2025-03-04 15:30:07,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:07,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:07,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:30:07,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:30:07,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:07,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:07,485 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:30:07,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:07,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515851465] [2025-03-04 15:30:07,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515851465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:30:07,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:30:07,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:30:07,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192044593] [2025-03-04 15:30:07,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:30:07,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:30:07,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:07,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:30:07,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:30:07,487 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 77 [2025-03-04 15:30:07,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 97 transitions, 408 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:30:07,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:07,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 77 [2025-03-04 15:30:07,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:09,323 INFO L124 PetriNetUnfolderBase]: 32417/44268 cut-off events. [2025-03-04 15:30:09,323 INFO L125 PetriNetUnfolderBase]: For 3142/3142 co-relation queries the response was YES. [2025-03-04 15:30:09,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91698 conditions, 44268 events. 32417/44268 cut-off events. For 3142/3142 co-relation queries the response was YES. Maximal size of possible extension queue 1612. Compared 275075 event pairs, 12522 based on Foata normal form. 797/34194 useless extension candidates. Maximal degree in co-relation 91682. Up to 30066 conditions per place. [2025-03-04 15:30:09,543 INFO L140 encePairwiseOnDemand]: 73/77 looper letters, 108 selfloop transitions, 2 changer transitions 0/124 dead transitions. [2025-03-04 15:30:09,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 124 transitions, 692 flow [2025-03-04 15:30:09,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:30:09,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:30:09,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2025-03-04 15:30:09,545 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5974025974025974 [2025-03-04 15:30:09,545 INFO L175 Difference]: Start difference. First operand has 84 places, 97 transitions, 408 flow. Second operand 3 states and 138 transitions. [2025-03-04 15:30:09,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 124 transitions, 692 flow [2025-03-04 15:30:09,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 124 transitions, 681 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:30:09,548 INFO L231 Difference]: Finished difference. Result has 85 places, 98 transitions, 411 flow [2025-03-04 15:30:09,551 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=411, PETRI_PLACES=85, PETRI_TRANSITIONS=98} [2025-03-04 15:30:09,553 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 7 predicate places. [2025-03-04 15:30:09,553 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 98 transitions, 411 flow [2025-03-04 15:30:09,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:30:09,553 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:09,553 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:30:09,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:30:09,554 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread4Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 15:30:09,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:09,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1854458215, now seen corresponding path program 1 times [2025-03-04 15:30:09,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:09,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134466417] [2025-03-04 15:30:09,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:09,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:09,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:30:09,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:30:09,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:09,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:09,602 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:30:09,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:09,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134466417] [2025-03-04 15:30:09,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134466417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:30:09,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:30:09,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:30:09,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837612205] [2025-03-04 15:30:09,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:30:09,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:30:09,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:09,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:30:09,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:30:09,603 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 77 [2025-03-04 15:30:09,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 98 transitions, 411 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:30:09,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:09,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 77 [2025-03-04 15:30:09,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:11,579 INFO L124 PetriNetUnfolderBase]: 26604/36533 cut-off events. [2025-03-04 15:30:11,579 INFO L125 PetriNetUnfolderBase]: For 3652/3652 co-relation queries the response was YES. [2025-03-04 15:30:11,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78396 conditions, 36533 events. 26604/36533 cut-off events. For 3652/3652 co-relation queries the response was YES. Maximal size of possible extension queue 1294. Compared 221511 event pairs, 24096 based on Foata normal form. 0/29432 useless extension candidates. Maximal degree in co-relation 78379. Up to 35456 conditions per place. [2025-03-04 15:30:11,749 INFO L140 encePairwiseOnDemand]: 75/77 looper letters, 77 selfloop transitions, 6 changer transitions 0/97 dead transitions. [2025-03-04 15:30:11,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 97 transitions, 575 flow [2025-03-04 15:30:11,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:30:11,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:30:11,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2025-03-04 15:30:11,750 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47186147186147187 [2025-03-04 15:30:11,750 INFO L175 Difference]: Start difference. First operand has 85 places, 98 transitions, 411 flow. Second operand 3 states and 109 transitions. [2025-03-04 15:30:11,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 97 transitions, 575 flow [2025-03-04 15:30:11,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 97 transitions, 573 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:30:11,754 INFO L231 Difference]: Finished difference. Result has 85 places, 97 transitions, 419 flow [2025-03-04 15:30:11,754 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=419, PETRI_PLACES=85, PETRI_TRANSITIONS=97} [2025-03-04 15:30:11,755 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 7 predicate places. [2025-03-04 15:30:11,755 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 97 transitions, 419 flow [2025-03-04 15:30:11,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:30:11,755 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:11,755 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:30:11,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:30:11,755 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread4Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 15:30:11,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:11,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1854458216, now seen corresponding path program 1 times [2025-03-04 15:30:11,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:11,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759096479] [2025-03-04 15:30:11,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:11,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:11,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:30:11,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:30:11,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:11,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:11,792 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:30:11,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:11,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759096479] [2025-03-04 15:30:11,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759096479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:30:11,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:30:11,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:30:11,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835211121] [2025-03-04 15:30:11,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:30:11,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:30:11,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:11,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:30:11,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:30:11,793 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 77 [2025-03-04 15:30:11,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 97 transitions, 419 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:30:11,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:11,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 77 [2025-03-04 15:30:11,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:13,125 INFO L124 PetriNetUnfolderBase]: 20791/28798 cut-off events. [2025-03-04 15:30:13,126 INFO L125 PetriNetUnfolderBase]: For 2933/2933 co-relation queries the response was YES. [2025-03-04 15:30:13,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61996 conditions, 28798 events. 20791/28798 cut-off events. For 2933/2933 co-relation queries the response was YES. Maximal size of possible extension queue 976. Compared 169806 event pairs, 18775 based on Foata normal form. 0/24484 useless extension candidates. Maximal degree in co-relation 61979. Up to 27929 conditions per place. [2025-03-04 15:30:13,226 INFO L140 encePairwiseOnDemand]: 75/77 looper letters, 79 selfloop transitions, 1 changer transitions 2/96 dead transitions. [2025-03-04 15:30:13,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 96 transitions, 581 flow [2025-03-04 15:30:13,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:30:13,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:30:13,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2025-03-04 15:30:13,227 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4675324675324675 [2025-03-04 15:30:13,227 INFO L175 Difference]: Start difference. First operand has 85 places, 97 transitions, 419 flow. Second operand 3 states and 108 transitions. [2025-03-04 15:30:13,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 96 transitions, 581 flow [2025-03-04 15:30:13,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 96 transitions, 575 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:30:13,230 INFO L231 Difference]: Finished difference. Result has 85 places, 94 transitions, 401 flow [2025-03-04 15:30:13,230 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=411, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=401, PETRI_PLACES=85, PETRI_TRANSITIONS=94} [2025-03-04 15:30:13,230 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 7 predicate places. [2025-03-04 15:30:13,230 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 94 transitions, 401 flow [2025-03-04 15:30:13,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:30:13,231 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:13,231 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:30:13,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:30:13,231 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 15:30:13,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:13,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1677253005, now seen corresponding path program 1 times [2025-03-04 15:30:13,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:13,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204955810] [2025-03-04 15:30:13,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:13,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:13,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:30:13,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:30:13,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:13,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:13,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:30:13,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:13,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204955810] [2025-03-04 15:30:13,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204955810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:30:13,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:30:13,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:30:13,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598944092] [2025-03-04 15:30:13,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:30:13,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:30:13,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:13,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:30:13,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:30:13,270 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 77 [2025-03-04 15:30:13,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 94 transitions, 401 flow. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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:30:13,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:13,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 77 [2025-03-04 15:30:13,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:14,688 INFO L124 PetriNetUnfolderBase]: 19391/27326 cut-off events. [2025-03-04 15:30:14,689 INFO L125 PetriNetUnfolderBase]: For 2771/2771 co-relation queries the response was YES. [2025-03-04 15:30:14,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58219 conditions, 27326 events. 19391/27326 cut-off events. For 2771/2771 co-relation queries the response was YES. Maximal size of possible extension queue 805. Compared 162055 event pairs, 8556 based on Foata normal form. 144/23663 useless extension candidates. Maximal degree in co-relation 58201. Up to 21928 conditions per place. [2025-03-04 15:30:14,841 INFO L140 encePairwiseOnDemand]: 74/77 looper letters, 95 selfloop transitions, 2 changer transitions 3/114 dead transitions. [2025-03-04 15:30:14,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 114 transitions, 649 flow [2025-03-04 15:30:14,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:30:14,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:30:14,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2025-03-04 15:30:14,843 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5497835497835498 [2025-03-04 15:30:14,843 INFO L175 Difference]: Start difference. First operand has 85 places, 94 transitions, 401 flow. Second operand 3 states and 127 transitions. [2025-03-04 15:30:14,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 114 transitions, 649 flow [2025-03-04 15:30:14,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 114 transitions, 648 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:30:14,845 INFO L231 Difference]: Finished difference. Result has 86 places, 95 transitions, 414 flow [2025-03-04 15:30:14,845 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=414, PETRI_PLACES=86, PETRI_TRANSITIONS=95} [2025-03-04 15:30:14,846 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 8 predicate places. [2025-03-04 15:30:14,846 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 95 transitions, 414 flow [2025-03-04 15:30:14,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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:30:14,846 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:14,846 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:30:14,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:30:14,846 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 15:30:14,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:14,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1890829201, now seen corresponding path program 1 times [2025-03-04 15:30:14,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:14,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954502785] [2025-03-04 15:30:14,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:14,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:14,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:30:14,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:30:14,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:14,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:14,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:30:14,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:14,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954502785] [2025-03-04 15:30:14,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954502785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:30:14,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:30:14,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:30:14,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774135791] [2025-03-04 15:30:14,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:30:14,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:30:14,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:14,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:30:14,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:30:14,893 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 77 [2025-03-04 15:30:14,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 95 transitions, 414 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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:30:14,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:14,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 77 [2025-03-04 15:30:14,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:16,978 INFO L124 PetriNetUnfolderBase]: 31127/44084 cut-off events. [2025-03-04 15:30:16,979 INFO L125 PetriNetUnfolderBase]: For 7396/7396 co-relation queries the response was YES. [2025-03-04 15:30:17,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94709 conditions, 44084 events. 31127/44084 cut-off events. For 7396/7396 co-relation queries the response was YES. Maximal size of possible extension queue 1205. Compared 279506 event pairs, 11139 based on Foata normal form. 1014/36755 useless extension candidates. Maximal degree in co-relation 94689. Up to 18985 conditions per place. [2025-03-04 15:30:17,311 INFO L140 encePairwiseOnDemand]: 72/77 looper letters, 143 selfloop transitions, 4 changer transitions 0/157 dead transitions. [2025-03-04 15:30:17,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 157 transitions, 864 flow [2025-03-04 15:30:17,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:30:17,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:30:17,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2025-03-04 15:30:17,312 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2025-03-04 15:30:17,312 INFO L175 Difference]: Start difference. First operand has 86 places, 95 transitions, 414 flow. Second operand 4 states and 175 transitions. [2025-03-04 15:30:17,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 157 transitions, 864 flow [2025-03-04 15:30:17,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 157 transitions, 854 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-03-04 15:30:17,319 INFO L231 Difference]: Finished difference. Result has 88 places, 95 transitions, 421 flow [2025-03-04 15:30:17,319 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=421, PETRI_PLACES=88, PETRI_TRANSITIONS=95} [2025-03-04 15:30:17,319 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 10 predicate places. [2025-03-04 15:30:17,319 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 95 transitions, 421 flow [2025-03-04 15:30:17,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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:30:17,320 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:17,320 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:30:17,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 15:30:17,320 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 15:30:17,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:17,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1513837620, now seen corresponding path program 1 times [2025-03-04 15:30:17,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:17,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619711968] [2025-03-04 15:30:17,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:17,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:17,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:30:17,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:30:17,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:17,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:17,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:30:17,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:17,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619711968] [2025-03-04 15:30:17,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619711968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:30:17,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:30:17,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:30:17,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194963956] [2025-03-04 15:30:17,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:30:17,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:30:17,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:17,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:30:17,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:30:17,385 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 77 [2025-03-04 15:30:17,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 95 transitions, 421 flow. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 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:30:17,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:17,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 77 [2025-03-04 15:30:17,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:19,053 INFO L124 PetriNetUnfolderBase]: 24303/34388 cut-off events. [2025-03-04 15:30:19,053 INFO L125 PetriNetUnfolderBase]: For 7598/7598 co-relation queries the response was YES. [2025-03-04 15:30:19,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79613 conditions, 34388 events. 24303/34388 cut-off events. For 7598/7598 co-relation queries the response was YES. Maximal size of possible extension queue 925. Compared 208354 event pairs, 9062 based on Foata normal form. 1014/31127 useless extension candidates. Maximal degree in co-relation 79592. Up to 19374 conditions per place. [2025-03-04 15:30:19,293 INFO L140 encePairwiseOnDemand]: 71/77 looper letters, 139 selfloop transitions, 6 changer transitions 0/156 dead transitions. [2025-03-04 15:30:19,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 156 transitions, 861 flow [2025-03-04 15:30:19,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:30:19,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:30:19,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 193 transitions. [2025-03-04 15:30:19,295 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5012987012987012 [2025-03-04 15:30:19,295 INFO L175 Difference]: Start difference. First operand has 88 places, 95 transitions, 421 flow. Second operand 5 states and 193 transitions. [2025-03-04 15:30:19,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 156 transitions, 861 flow [2025-03-04 15:30:19,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 156 transitions, 856 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:30:19,323 INFO L231 Difference]: Finished difference. Result has 89 places, 94 transitions, 426 flow [2025-03-04 15:30:19,323 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=426, PETRI_PLACES=89, PETRI_TRANSITIONS=94} [2025-03-04 15:30:19,324 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 11 predicate places. [2025-03-04 15:30:19,324 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 94 transitions, 426 flow [2025-03-04 15:30:19,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 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:30:19,324 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:19,324 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1] [2025-03-04 15:30:19,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 15:30:19,324 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 15:30:19,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:19,325 INFO L85 PathProgramCache]: Analyzing trace with hash -94518101, now seen corresponding path program 2 times [2025-03-04 15:30:19,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:19,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104428914] [2025-03-04 15:30:19,325 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:30:19,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:19,332 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:30:19,337 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-03-04 15:30:19,337 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:30:19,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:19,363 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:30:19,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:19,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104428914] [2025-03-04 15:30:19,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104428914] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:30:19,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932773907] [2025-03-04 15:30:19,364 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:30:19,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:19,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:30:19,366 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:30:19,368 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:30:19,412 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:30:19,420 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-03-04 15:30:19,420 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:30:19,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:19,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:30:19,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:30:19,443 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:30:19,444 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:30:19,466 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:30:19,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932773907] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:30:19,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:30:19,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2025-03-04 15:30:19,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128653824] [2025-03-04 15:30:19,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:30:19,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:30:19,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:19,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:30:19,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:30:19,474 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 77 [2025-03-04 15:30:19,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 94 transitions, 426 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:30:19,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:19,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 77 [2025-03-04 15:30:19,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:20,865 INFO L124 PetriNetUnfolderBase]: 20539/28048 cut-off events. [2025-03-04 15:30:20,865 INFO L125 PetriNetUnfolderBase]: For 15206/16418 co-relation queries the response was YES. [2025-03-04 15:30:20,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68925 conditions, 28048 events. 20539/28048 cut-off events. For 15206/16418 co-relation queries the response was YES. Maximal size of possible extension queue 798. Compared 157412 event pairs, 17392 based on Foata normal form. 1213/25712 useless extension candidates. Maximal degree in co-relation 68903. Up to 27262 conditions per place. [2025-03-04 15:30:21,034 INFO L140 encePairwiseOnDemand]: 72/77 looper letters, 67 selfloop transitions, 16 changer transitions 0/93 dead transitions. [2025-03-04 15:30:21,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 93 transitions, 582 flow [2025-03-04 15:30:21,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:30:21,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:30:21,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2025-03-04 15:30:21,035 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2025-03-04 15:30:21,035 INFO L175 Difference]: Start difference. First operand has 89 places, 94 transitions, 426 flow. Second operand 4 states and 112 transitions. [2025-03-04 15:30:21,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 93 transitions, 582 flow [2025-03-04 15:30:21,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 93 transitions, 570 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 15:30:21,047 INFO L231 Difference]: Finished difference. Result has 87 places, 93 transitions, 436 flow [2025-03-04 15:30:21,047 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=436, PETRI_PLACES=87, PETRI_TRANSITIONS=93} [2025-03-04 15:30:21,047 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 9 predicate places. [2025-03-04 15:30:21,047 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 93 transitions, 436 flow [2025-03-04 15:30:21,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:30:21,047 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:21,047 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1] [2025-03-04 15:30:21,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 15:30:21,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:21,248 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-04 15:30:21,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:21,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1722911179, now seen corresponding path program 1 times [2025-03-04 15:30:21,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:21,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7216980] [2025-03-04 15:30:21,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:21,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:21,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:30:21,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:30:21,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:21,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:21,376 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:30:21,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:21,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7216980] [2025-03-04 15:30:21,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7216980] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:30:21,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944719620] [2025-03-04 15:30:21,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:21,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:21,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:30:21,379 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:30:21,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:30:21,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:30:21,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:30:21,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:21,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:21,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:30:21,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:30:21,460 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:30:21,460 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:30:21,559 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:30:21,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944719620] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:30:21,560 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:30:21,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-03-04 15:30:21,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628514894] [2025-03-04 15:30:21,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:30:21,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 15:30:21,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:21,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 15:30:21,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-03-04 15:30:21,588 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 77 [2025-03-04 15:30:21,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 93 transitions, 436 flow. Second operand has 24 states, 24 states have (on average 17.083333333333332) internal successors, (410), 24 states have internal predecessors, (410), 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:30:21,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:21,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 77 [2025-03-04 15:30:21,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand