./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_24-sound_lock_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_24-sound_lock_racing.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1eea0d699fc30cae440905f5eeea19b8e9e5d0b5cc249e9ffded8d356549b279 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:46:24,450 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:46:24,505 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 06:46:24,509 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:46:24,509 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:46:24,523 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:46:24,523 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:46:24,523 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:46:24,524 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:46:24,524 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:46:24,524 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:46:24,524 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:46:24,524 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:46:24,524 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:46:24,524 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:46:24,524 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:46:24,525 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:46:24,525 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:46:24,525 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:46:24,525 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:46:24,525 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:46:24,525 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:46:24,525 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:46:24,525 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:46:24,525 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:46:24,525 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:46:24,525 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:46:24,525 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:46:24,526 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:46:24,526 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:46:24,526 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:46:24,526 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:46:24,526 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:46:24,526 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:46:24,526 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:46:24,526 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:46:24,526 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:46:24,526 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:46:24,526 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:46:24,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:46:24,527 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:46:24,527 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:46:24,527 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:46:24,527 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:46:24,527 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:46:24,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:46:24,527 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:46:24,527 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:46:24,527 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:46:24,527 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:46:24,528 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1eea0d699fc30cae440905f5eeea19b8e9e5d0b5cc249e9ffded8d356549b279 [2025-01-10 06:46:24,751 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:46:24,757 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:46:24,759 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:46:24,760 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:46:24,760 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:46:24,761 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_24-sound_lock_racing.i [2025-01-10 06:46:26,031 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2334d81e1/ccc3443c305a43a9bf16cbb199f08cee/FLAGebee34c50 [2025-01-10 06:46:26,368 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:46:26,368 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_24-sound_lock_racing.i [2025-01-10 06:46:26,378 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2334d81e1/ccc3443c305a43a9bf16cbb199f08cee/FLAGebee34c50 [2025-01-10 06:46:26,606 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2334d81e1/ccc3443c305a43a9bf16cbb199f08cee [2025-01-10 06:46:26,610 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:46:26,611 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:46:26,619 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:46:26,620 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:46:26,628 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:46:26,628 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:46:26" (1/1) ... [2025-01-10 06:46:26,629 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a92815f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:26, skipping insertion in model container [2025-01-10 06:46:26,629 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:46:26" (1/1) ... [2025-01-10 06:46:26,678 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:46:26,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:46:26,866 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:46:26,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:46:26,921 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:46:26,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:26 WrapperNode [2025-01-10 06:46:26,922 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:46:26,923 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:46:26,923 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:46:26,923 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:46:26,930 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:26" (1/1) ... [2025-01-10 06:46:26,944 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:26" (1/1) ... [2025-01-10 06:46:26,961 INFO L138 Inliner]: procedures = 171, calls = 42, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 89 [2025-01-10 06:46:26,963 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:46:26,964 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:46:26,964 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:46:26,964 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:46:26,970 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:26" (1/1) ... [2025-01-10 06:46:26,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:26" (1/1) ... [2025-01-10 06:46:26,973 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:26" (1/1) ... [2025-01-10 06:46:26,988 INFO L175 MemorySlicer]: Split 19 memory accesses to 4 slices as follows [2, 5, 10, 2]. 53 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 10, 0]. The 1 writes are split as follows [0, 0, 0, 1]. [2025-01-10 06:46:26,989 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:26" (1/1) ... [2025-01-10 06:46:26,989 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:26" (1/1) ... [2025-01-10 06:46:26,997 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:26" (1/1) ... [2025-01-10 06:46:27,001 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:26" (1/1) ... [2025-01-10 06:46:27,004 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:26" (1/1) ... [2025-01-10 06:46:27,005 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:26" (1/1) ... [2025-01-10 06:46:27,009 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:26" (1/1) ... [2025-01-10 06:46:27,010 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:46:27,011 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:46:27,014 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:46:27,014 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:46:27,015 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:26" (1/1) ... [2025-01-10 06:46:27,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:46:27,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:46:27,041 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 06:46:27,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 06:46:27,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:46:27,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:46:27,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 06:46:27,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 06:46:27,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:46:27,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:46:27,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 06:46:27,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 06:46:27,064 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 06:46:27,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:46:27,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 06:46:27,064 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-10 06:46:27,064 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-10 06:46:27,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 06:46:27,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:46:27,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:46:27,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 06:46:27,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 06:46:27,066 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 06:46:27,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:46:27,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:46:27,067 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 06:46:27,184 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:46:27,185 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:46:27,404 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:46:27,404 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:46:27,579 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:46:27,579 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-10 06:46:27,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:46:27 BoogieIcfgContainer [2025-01-10 06:46:27,580 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:46:27,582 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:46:27,583 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:46:27,586 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:46:27,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:46:26" (1/3) ... [2025-01-10 06:46:27,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3019b967 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:46:27, skipping insertion in model container [2025-01-10 06:46:27,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:26" (2/3) ... [2025-01-10 06:46:27,590 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3019b967 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:46:27, skipping insertion in model container [2025-01-10 06:46:27,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:46:27" (3/3) ... [2025-01-10 06:46:27,591 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_24-sound_lock_racing.i [2025-01-10 06:46:27,602 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:46:27,605 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_24-sound_lock_racing.i that has 2 procedures, 51 locations, 1 initial locations, 6 loop locations, and 8 error locations. [2025-01-10 06:46:27,605 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:46:27,661 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-10 06:46:27,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 60 transitions, 127 flow [2025-01-10 06:46:27,725 INFO L124 PetriNetUnfolderBase]: 11/75 cut-off events. [2025-01-10 06:46:27,727 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 06:46:27,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 75 events. 11/75 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 223 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 51. Up to 4 conditions per place. [2025-01-10 06:46:27,730 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 60 transitions, 127 flow [2025-01-10 06:46:27,733 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 59 transitions, 125 flow [2025-01-10 06:46:27,738 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:46:27,746 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;@39bd0047, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:46:27,747 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-01-10 06:46:27,751 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:46:27,751 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-01-10 06:46:27,751 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:46:27,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:46:27,752 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:46:27,752 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:46:27,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:46:27,757 INFO L85 PathProgramCache]: Analyzing trace with hash 349814835, now seen corresponding path program 1 times [2025-01-10 06:46:27,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:46:27,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451090978] [2025-01-10 06:46:27,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:46:27,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:46:27,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:46:27,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:46:27,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:27,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:46:28,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:46:28,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:46:28,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451090978] [2025-01-10 06:46:28,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451090978] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:46:28,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:46:28,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:46:28,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4138420] [2025-01-10 06:46:28,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:46:28,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:46:28,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:46:28,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:46:28,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:46:28,112 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 60 [2025-01-10 06:46:28,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 59 transitions, 125 flow. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:46:28,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:46:28,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 60 [2025-01-10 06:46:28,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:46:28,385 INFO L124 PetriNetUnfolderBase]: 132/361 cut-off events. [2025-01-10 06:46:28,385 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 06:46:28,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 658 conditions, 361 events. 132/361 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1730 event pairs, 20 based on Foata normal form. 76/410 useless extension candidates. Maximal degree in co-relation 630. Up to 255 conditions per place. [2025-01-10 06:46:28,391 INFO L140 encePairwiseOnDemand]: 46/60 looper letters, 46 selfloop transitions, 3 changer transitions 0/72 dead transitions. [2025-01-10 06:46:28,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 72 transitions, 249 flow [2025-01-10 06:46:28,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:46:28,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:46:28,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 164 transitions. [2025-01-10 06:46:28,414 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6833333333333333 [2025-01-10 06:46:28,415 INFO L175 Difference]: Start difference. First operand has 54 places, 59 transitions, 125 flow. Second operand 4 states and 164 transitions. [2025-01-10 06:46:28,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 72 transitions, 249 flow [2025-01-10 06:46:28,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 72 transitions, 249 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:46:28,429 INFO L231 Difference]: Finished difference. Result has 56 places, 49 transitions, 115 flow [2025-01-10 06:46:28,430 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=115, PETRI_PLACES=56, PETRI_TRANSITIONS=49} [2025-01-10 06:46:28,437 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 2 predicate places. [2025-01-10 06:46:28,437 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 115 flow [2025-01-10 06:46:28,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:46:28,441 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:46:28,441 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:46:28,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:46:28,441 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:46:28,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:46:28,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1743463959, now seen corresponding path program 1 times [2025-01-10 06:46:28,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:46:28,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549878198] [2025-01-10 06:46:28,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:46:28,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:46:28,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:46:28,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:46:28,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:28,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:46:28,484 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:46:28,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:46:28,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:46:28,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:28,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:46:28,532 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:46:28,532 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:46:28,534 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-01-10 06:46:28,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2025-01-10 06:46:28,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2025-01-10 06:46:28,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2025-01-10 06:46:28,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2025-01-10 06:46:28,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2025-01-10 06:46:28,538 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2025-01-10 06:46:28,538 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2025-01-10 06:46:28,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2025-01-10 06:46:28,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2025-01-10 06:46:28,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2025-01-10 06:46:28,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2025-01-10 06:46:28,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2025-01-10 06:46:28,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:46:28,539 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-10 06:46:28,542 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:46:28,545 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-10 06:46:28,581 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 06:46:28,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 93 transitions, 202 flow [2025-01-10 06:46:28,596 INFO L124 PetriNetUnfolderBase]: 21/142 cut-off events. [2025-01-10 06:46:28,596 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-10 06:46:28,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 142 events. 21/142 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 510 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 91. Up to 6 conditions per place. [2025-01-10 06:46:28,597 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 93 transitions, 202 flow [2025-01-10 06:46:28,598 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 93 transitions, 202 flow [2025-01-10 06:46:28,599 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:46:28,600 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;@39bd0047, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:46:28,600 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-01-10 06:46:28,602 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:46:28,602 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-01-10 06:46:28,602 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:46:28,602 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:46:28,602 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:46:28,602 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 06:46:28,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:46:28,603 INFO L85 PathProgramCache]: Analyzing trace with hash 438594991, now seen corresponding path program 1 times [2025-01-10 06:46:28,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:46:28,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552262584] [2025-01-10 06:46:28,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:46:28,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:46:28,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:46:28,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:46:28,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:28,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:46:28,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:46:28,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:46:28,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552262584] [2025-01-10 06:46:28,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552262584] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:46:28,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:46:28,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:46:28,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967066325] [2025-01-10 06:46:28,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:46:28,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:46:28,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:46:28,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:46:28,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:46:28,698 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 93 [2025-01-10 06:46:28,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 93 transitions, 202 flow. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:46:28,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:46:28,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 93 [2025-01-10 06:46:28,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:46:29,482 INFO L124 PetriNetUnfolderBase]: 4028/8613 cut-off events. [2025-01-10 06:46:29,483 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2025-01-10 06:46:29,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15091 conditions, 8613 events. 4028/8613 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 71956 event pairs, 1892 based on Foata normal form. 1643/9370 useless extension candidates. Maximal degree in co-relation 1207. Up to 6374 conditions per place. [2025-01-10 06:46:29,532 INFO L140 encePairwiseOnDemand]: 73/93 looper letters, 64 selfloop transitions, 3 changer transitions 0/104 dead transitions. [2025-01-10 06:46:29,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 104 transitions, 358 flow [2025-01-10 06:46:29,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:46:29,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:46:29,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 244 transitions. [2025-01-10 06:46:29,538 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6559139784946236 [2025-01-10 06:46:29,538 INFO L175 Difference]: Start difference. First operand has 82 places, 93 transitions, 202 flow. Second operand 4 states and 244 transitions. [2025-01-10 06:46:29,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 104 transitions, 358 flow [2025-01-10 06:46:29,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 104 transitions, 358 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:46:29,540 INFO L231 Difference]: Finished difference. Result has 87 places, 81 transitions, 198 flow [2025-01-10 06:46:29,540 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=198, PETRI_PLACES=87, PETRI_TRANSITIONS=81} [2025-01-10 06:46:29,541 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 5 predicate places. [2025-01-10 06:46:29,541 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 81 transitions, 198 flow [2025-01-10 06:46:29,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:46:29,541 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:46:29,542 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:46:29,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:46:29,542 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 06:46:29,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:46:29,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1605205786, now seen corresponding path program 1 times [2025-01-10 06:46:29,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:46:29,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114387105] [2025-01-10 06:46:29,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:46:29,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:46:29,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:46:29,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:46:29,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:29,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:46:29,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:46:29,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:46:29,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114387105] [2025-01-10 06:46:29,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114387105] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:46:29,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:46:29,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:46:29,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975391013] [2025-01-10 06:46:29,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:46:29,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:46:29,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:46:29,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:46:29,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:46:29,596 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 93 [2025-01-10 06:46:29,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 81 transitions, 198 flow. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:46:29,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:46:29,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 93 [2025-01-10 06:46:29,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:46:30,622 INFO L124 PetriNetUnfolderBase]: 5385/11254 cut-off events. [2025-01-10 06:46:30,623 INFO L125 PetriNetUnfolderBase]: For 456/792 co-relation queries the response was YES. [2025-01-10 06:46:30,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20412 conditions, 11254 events. 5385/11254 cut-off events. For 456/792 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 96873 event pairs, 1446 based on Foata normal form. 220/10518 useless extension candidates. Maximal degree in co-relation 20311. Up to 5441 conditions per place. [2025-01-10 06:46:30,682 INFO L140 encePairwiseOnDemand]: 84/93 looper letters, 118 selfloop transitions, 12 changer transitions 0/169 dead transitions. [2025-01-10 06:46:30,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 169 transitions, 674 flow [2025-01-10 06:46:30,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:46:30,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:46:30,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 321 transitions. [2025-01-10 06:46:30,685 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6903225806451613 [2025-01-10 06:46:30,686 INFO L175 Difference]: Start difference. First operand has 87 places, 81 transitions, 198 flow. Second operand 5 states and 321 transitions. [2025-01-10 06:46:30,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 169 transitions, 674 flow [2025-01-10 06:46:30,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 169 transitions, 670 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:46:30,692 INFO L231 Difference]: Finished difference. Result has 94 places, 92 transitions, 290 flow [2025-01-10 06:46:30,692 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=290, PETRI_PLACES=94, PETRI_TRANSITIONS=92} [2025-01-10 06:46:30,693 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 12 predicate places. [2025-01-10 06:46:30,693 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 92 transitions, 290 flow [2025-01-10 06:46:30,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:46:30,694 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:46:30,694 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:46:30,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:46:30,694 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 06:46:30,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:46:30,694 INFO L85 PathProgramCache]: Analyzing trace with hash -503891028, now seen corresponding path program 1 times [2025-01-10 06:46:30,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:46:30,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415955733] [2025-01-10 06:46:30,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:46:30,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:46:30,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:46:30,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:46:30,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:30,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:46:30,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:46:30,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:46:30,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415955733] [2025-01-10 06:46:30,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415955733] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:46:30,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:46:30,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:46:30,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137549743] [2025-01-10 06:46:30,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:46:30,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:46:30,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:46:30,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:46:30,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:46:30,785 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 93 [2025-01-10 06:46:30,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 92 transitions, 290 flow. Second operand has 6 states, 6 states have (on average 38.5) internal successors, (231), 6 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:46:30,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:46:30,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 93 [2025-01-10 06:46:30,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:46:31,744 INFO L124 PetriNetUnfolderBase]: 5504/11419 cut-off events. [2025-01-10 06:46:31,744 INFO L125 PetriNetUnfolderBase]: For 3944/3951 co-relation queries the response was YES. [2025-01-10 06:46:31,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23932 conditions, 11419 events. 5504/11419 cut-off events. For 3944/3951 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 98681 event pairs, 1518 based on Foata normal form. 152/10721 useless extension candidates. Maximal degree in co-relation 14940. Up to 6775 conditions per place. [2025-01-10 06:46:31,796 INFO L140 encePairwiseOnDemand]: 88/93 looper letters, 125 selfloop transitions, 6 changer transitions 0/168 dead transitions. [2025-01-10 06:46:31,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 168 transitions, 786 flow [2025-01-10 06:46:31,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:46:31,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:46:31,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 333 transitions. [2025-01-10 06:46:31,798 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5967741935483871 [2025-01-10 06:46:31,798 INFO L175 Difference]: Start difference. First operand has 94 places, 92 transitions, 290 flow. Second operand 6 states and 333 transitions. [2025-01-10 06:46:31,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 168 transitions, 786 flow [2025-01-10 06:46:31,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 168 transitions, 786 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:46:31,810 INFO L231 Difference]: Finished difference. Result has 98 places, 91 transitions, 298 flow [2025-01-10 06:46:31,810 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=298, PETRI_PLACES=98, PETRI_TRANSITIONS=91} [2025-01-10 06:46:31,810 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 16 predicate places. [2025-01-10 06:46:31,811 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 91 transitions, 298 flow [2025-01-10 06:46:31,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.5) internal successors, (231), 6 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:46:31,811 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:46:31,811 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 06:46:31,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:46:31,811 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 06:46:31,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:46:31,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1559247787, now seen corresponding path program 1 times [2025-01-10 06:46:31,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:46:31,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308874958] [2025-01-10 06:46:31,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:46:31,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:46:31,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:46:31,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:46:31,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:31,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:46:31,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:46:31,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:46:31,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308874958] [2025-01-10 06:46:31,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308874958] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:46:31,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:46:31,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:46:31,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256157166] [2025-01-10 06:46:31,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:46:31,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:46:31,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:46:31,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:46:31,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:46:31,903 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 93 [2025-01-10 06:46:31,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 91 transitions, 298 flow. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:46:31,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:46:31,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 93 [2025-01-10 06:46:31,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:46:33,175 INFO L124 PetriNetUnfolderBase]: 5241/10543 cut-off events. [2025-01-10 06:46:33,175 INFO L125 PetriNetUnfolderBase]: For 4610/4615 co-relation queries the response was YES. [2025-01-10 06:46:33,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22871 conditions, 10543 events. 5241/10543 cut-off events. For 4610/4615 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 87605 event pairs, 1919 based on Foata normal form. 160/10081 useless extension candidates. Maximal degree in co-relation 17313. Up to 7253 conditions per place. [2025-01-10 06:46:33,214 INFO L140 encePairwiseOnDemand]: 88/93 looper letters, 102 selfloop transitions, 6 changer transitions 0/145 dead transitions. [2025-01-10 06:46:33,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 145 transitions, 684 flow [2025-01-10 06:46:33,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:46:33,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:46:33,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 234 transitions. [2025-01-10 06:46:33,218 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6290322580645161 [2025-01-10 06:46:33,219 INFO L175 Difference]: Start difference. First operand has 98 places, 91 transitions, 298 flow. Second operand 4 states and 234 transitions. [2025-01-10 06:46:33,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 145 transitions, 684 flow [2025-01-10 06:46:33,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 145 transitions, 668 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-01-10 06:46:33,227 INFO L231 Difference]: Finished difference. Result has 96 places, 91 transitions, 298 flow [2025-01-10 06:46:33,227 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=298, PETRI_PLACES=96, PETRI_TRANSITIONS=91} [2025-01-10 06:46:33,227 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 14 predicate places. [2025-01-10 06:46:33,227 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 91 transitions, 298 flow [2025-01-10 06:46:33,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:46:33,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:46:33,228 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2025-01-10 06:46:33,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:46:33,228 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 06:46:33,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:46:33,228 INFO L85 PathProgramCache]: Analyzing trace with hash -506448678, now seen corresponding path program 1 times [2025-01-10 06:46:33,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:46:33,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033421506] [2025-01-10 06:46:33,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:46:33,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:46:33,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:46:33,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:46:33,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:33,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:46:33,242 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:46:33,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:46:33,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:46:33,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:33,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:46:33,252 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:46:33,252 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:46:33,252 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2025-01-10 06:46:33,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 17 remaining) [2025-01-10 06:46:33,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 17 remaining) [2025-01-10 06:46:33,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 17 remaining) [2025-01-10 06:46:33,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 17 remaining) [2025-01-10 06:46:33,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 17 remaining) [2025-01-10 06:46:33,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 17 remaining) [2025-01-10 06:46:33,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 17 remaining) [2025-01-10 06:46:33,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 17 remaining) [2025-01-10 06:46:33,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 17 remaining) [2025-01-10 06:46:33,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 17 remaining) [2025-01-10 06:46:33,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 17 remaining) [2025-01-10 06:46:33,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 17 remaining) [2025-01-10 06:46:33,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 17 remaining) [2025-01-10 06:46:33,253 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 17 remaining) [2025-01-10 06:46:33,253 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 17 remaining) [2025-01-10 06:46:33,253 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 17 remaining) [2025-01-10 06:46:33,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:46:33,253 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-10 06:46:33,253 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:46:33,253 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-10 06:46:33,270 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-10 06:46:33,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 126 transitions, 279 flow [2025-01-10 06:46:33,283 INFO L124 PetriNetUnfolderBase]: 34/228 cut-off events. [2025-01-10 06:46:33,284 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-01-10 06:46:33,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 228 events. 34/228 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 949 event pairs, 1 based on Foata normal form. 0/158 useless extension candidates. Maximal degree in co-relation 157. Up to 12 conditions per place. [2025-01-10 06:46:33,285 INFO L82 GeneralOperation]: Start removeDead. Operand has 110 places, 126 transitions, 279 flow [2025-01-10 06:46:33,286 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 126 transitions, 279 flow [2025-01-10 06:46:33,286 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:46:33,287 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;@39bd0047, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:46:33,287 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-01-10 06:46:33,288 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:46:33,288 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-01-10 06:46:33,288 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:46:33,288 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:46:33,288 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:46:33,288 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 06:46:33,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:46:33,289 INFO L85 PathProgramCache]: Analyzing trace with hash 558867212, now seen corresponding path program 1 times [2025-01-10 06:46:33,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:46:33,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094052428] [2025-01-10 06:46:33,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:46:33,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:46:33,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:46:33,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:46:33,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:33,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:46:33,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:46:33,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:46:33,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094052428] [2025-01-10 06:46:33,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094052428] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:46:33,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:46:33,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:46:33,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440334683] [2025-01-10 06:46:33,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:46:33,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:46:33,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:46:33,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:46:33,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:46:33,328 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 126 [2025-01-10 06:46:33,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 126 transitions, 279 flow. Second operand has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:46:33,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:46:33,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 126 [2025-01-10 06:46:33,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:46:41,223 INFO L124 PetriNetUnfolderBase]: 76325/138173 cut-off events. [2025-01-10 06:46:41,223 INFO L125 PetriNetUnfolderBase]: For 1879/1879 co-relation queries the response was YES. [2025-01-10 06:46:41,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245270 conditions, 138173 events. 76325/138173 cut-off events. For 1879/1879 co-relation queries the response was YES. Maximal size of possible extension queue 3139. Compared 1452125 event pairs, 49600 based on Foata normal form. 29480/155051 useless extension candidates. Maximal degree in co-relation 15960. Up to 105935 conditions per place. [2025-01-10 06:46:42,163 INFO L140 encePairwiseOnDemand]: 100/126 looper letters, 77 selfloop transitions, 3 changer transitions 0/131 dead transitions. [2025-01-10 06:46:42,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 131 transitions, 449 flow [2025-01-10 06:46:42,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:46:42,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:46:42,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 319 transitions. [2025-01-10 06:46:42,166 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6329365079365079 [2025-01-10 06:46:42,166 INFO L175 Difference]: Start difference. First operand has 110 places, 126 transitions, 279 flow. Second operand 4 states and 319 transitions. [2025-01-10 06:46:42,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 131 transitions, 449 flow [2025-01-10 06:46:42,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 131 transitions, 449 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:46:42,169 INFO L231 Difference]: Finished difference. Result has 115 places, 108 transitions, 263 flow [2025-01-10 06:46:42,169 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=263, PETRI_PLACES=115, PETRI_TRANSITIONS=108} [2025-01-10 06:46:42,171 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 5 predicate places. [2025-01-10 06:46:42,171 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 108 transitions, 263 flow [2025-01-10 06:46:42,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:46:42,172 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:46:42,172 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:46:42,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:46:42,172 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 06:46:42,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:46:42,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1268576820, now seen corresponding path program 1 times [2025-01-10 06:46:42,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:46:42,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401643905] [2025-01-10 06:46:42,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:46:42,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:46:42,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:46:42,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:46:42,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:42,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:46:42,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:46:42,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:46:42,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401643905] [2025-01-10 06:46:42,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401643905] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:46:42,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:46:42,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:46:42,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15921242] [2025-01-10 06:46:42,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:46:42,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:46:42,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:46:42,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:46:42,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:46:42,277 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 126 [2025-01-10 06:46:42,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 108 transitions, 263 flow. Second operand has 6 states, 6 states have (on average 52.5) internal successors, (315), 6 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:46:42,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:46:42,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 126 [2025-01-10 06:46:42,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:46:49,095 INFO L124 PetriNetUnfolderBase]: 71309/117126 cut-off events. [2025-01-10 06:46:49,096 INFO L125 PetriNetUnfolderBase]: For 8797/8797 co-relation queries the response was YES. [2025-01-10 06:46:49,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224887 conditions, 117126 events. 71309/117126 cut-off events. For 8797/8797 co-relation queries the response was YES. Maximal size of possible extension queue 2647. Compared 1106724 event pairs, 7896 based on Foata normal form. 1872/112151 useless extension candidates. Maximal degree in co-relation 18772. Up to 66277 conditions per place. [2025-01-10 06:46:49,959 INFO L140 encePairwiseOnDemand]: 121/126 looper letters, 139 selfloop transitions, 6 changer transitions 0/196 dead transitions. [2025-01-10 06:46:49,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 196 transitions, 727 flow [2025-01-10 06:46:49,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:46:49,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:46:49,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 452 transitions. [2025-01-10 06:46:49,961 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5978835978835979 [2025-01-10 06:46:49,961 INFO L175 Difference]: Start difference. First operand has 115 places, 108 transitions, 263 flow. Second operand 6 states and 452 transitions. [2025-01-10 06:46:49,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 196 transitions, 727 flow [2025-01-10 06:46:49,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 196 transitions, 725 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:46:49,965 INFO L231 Difference]: Finished difference. Result has 118 places, 107 transitions, 269 flow [2025-01-10 06:46:49,965 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=269, PETRI_PLACES=118, PETRI_TRANSITIONS=107} [2025-01-10 06:46:49,966 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 8 predicate places. [2025-01-10 06:46:49,966 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 107 transitions, 269 flow [2025-01-10 06:46:49,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 52.5) internal successors, (315), 6 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:46:49,966 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:46:49,966 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:46:49,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:46:49,966 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 06:46:49,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:46:49,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1865317849, now seen corresponding path program 1 times [2025-01-10 06:46:49,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:46:49,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520355270] [2025-01-10 06:46:49,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:46:49,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:46:49,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:46:49,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:46:49,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:49,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:46:50,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:46:50,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:46:50,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520355270] [2025-01-10 06:46:50,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520355270] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:46:50,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:46:50,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:46:50,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640959207] [2025-01-10 06:46:50,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:46:50,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:46:50,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:46:50,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:46:50,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:46:50,007 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 126 [2025-01-10 06:46:50,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 107 transitions, 269 flow. Second operand has 4 states, 4 states have (on average 53.75) internal successors, (215), 4 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:46:50,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:46:50,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 126 [2025-01-10 06:46:50,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:47:01,138 INFO L124 PetriNetUnfolderBase]: 111387/192531 cut-off events. [2025-01-10 06:47:01,139 INFO L125 PetriNetUnfolderBase]: For 16294/18542 co-relation queries the response was YES. [2025-01-10 06:47:01,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359101 conditions, 192531 events. 111387/192531 cut-off events. For 16294/18542 co-relation queries the response was YES. Maximal size of possible extension queue 4534. Compared 2001986 event pairs, 38008 based on Foata normal form. 2837/180494 useless extension candidates. Maximal degree in co-relation 243509. Up to 101431 conditions per place. [2025-01-10 06:47:02,363 INFO L140 encePairwiseOnDemand]: 115/126 looper letters, 170 selfloop transitions, 16 changer transitions 0/238 dead transitions. [2025-01-10 06:47:02,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 238 transitions, 987 flow [2025-01-10 06:47:02,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:47:02,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:47:02,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 447 transitions. [2025-01-10 06:47:02,532 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7095238095238096 [2025-01-10 06:47:02,532 INFO L175 Difference]: Start difference. First operand has 118 places, 107 transitions, 269 flow. Second operand 5 states and 447 transitions. [2025-01-10 06:47:02,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 238 transitions, 987 flow [2025-01-10 06:47:02,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 238 transitions, 964 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-01-10 06:47:02,541 INFO L231 Difference]: Finished difference. Result has 122 places, 122 transitions, 385 flow [2025-01-10 06:47:02,541 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=385, PETRI_PLACES=122, PETRI_TRANSITIONS=122} [2025-01-10 06:47:02,542 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 12 predicate places. [2025-01-10 06:47:02,542 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 122 transitions, 385 flow [2025-01-10 06:47:02,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.75) internal successors, (215), 4 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:47:02,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:47:02,542 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 06:47:02,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:47:02,543 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 06:47:02,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:47:02,543 INFO L85 PathProgramCache]: Analyzing trace with hash -671175159, now seen corresponding path program 1 times [2025-01-10 06:47:02,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:47:02,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799140711] [2025-01-10 06:47:02,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:47:02,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:47:02,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:47:02,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:47:02,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:02,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:47:02,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:47:02,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:47:02,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799140711] [2025-01-10 06:47:02,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799140711] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:47:02,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:47:02,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:47:02,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113866299] [2025-01-10 06:47:02,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:47:02,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:47:02,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:47:02,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:47:02,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:47:02,580 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 126 [2025-01-10 06:47:02,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 122 transitions, 385 flow. Second operand has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:47:02,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:47:02,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 126 [2025-01-10 06:47:02,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand