./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_07-cond_racing2.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_07-cond_racing2.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 45d1947e02656e790dafd6ca03f6eadb14d0b370e2217b75740af9998d975bef --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:45:37,418 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:45:37,479 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:45:37,482 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:45:37,482 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:45:37,511 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:45:37,511 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:45:37,511 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:45:37,512 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:45:37,512 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:45:37,512 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:45:37,512 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:45:37,512 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:45:37,512 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:45:37,512 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:45:37,512 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:45:37,512 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:45:37,512 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:45:37,512 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:45:37,512 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:45:37,513 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:45:37,513 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:45:37,513 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:45:37,513 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:45:37,513 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:45:37,513 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:45:37,513 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:45:37,513 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:45:37,513 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:45:37,513 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:45:37,513 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:45:37,513 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:45:37,513 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:45:37,513 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:45:37,513 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:45:37,513 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:45:37,513 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:45:37,513 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:45:37,513 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:45:37,513 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:45:37,513 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:45:37,513 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:45:37,514 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:45:37,514 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:45:37,514 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:45:37,514 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:45:37,514 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:45:37,514 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:45:37,514 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:45:37,514 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:45:37,514 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 -> 45d1947e02656e790dafd6ca03f6eadb14d0b370e2217b75740af9998d975bef [2025-01-10 06:45:37,728 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:45:37,734 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:45:37,735 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:45:37,736 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:45:37,736 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:45:37,737 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_07-cond_racing2.i [2025-01-10 06:45:38,916 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e80282928/2ca1b7652d2b4c778e3199c55e80a889/FLAGa92d501c4 [2025-01-10 06:45:39,257 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:45:39,259 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_07-cond_racing2.i [2025-01-10 06:45:39,269 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e80282928/2ca1b7652d2b4c778e3199c55e80a889/FLAGa92d501c4 [2025-01-10 06:45:39,488 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e80282928/2ca1b7652d2b4c778e3199c55e80a889 [2025-01-10 06:45:39,490 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:45:39,491 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:45:39,492 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:45:39,492 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:45:39,495 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:45:39,495 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:45:39" (1/1) ... [2025-01-10 06:45:39,496 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e44cc30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:39, skipping insertion in model container [2025-01-10 06:45:39,496 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:45:39" (1/1) ... [2025-01-10 06:45:39,522 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:45:39,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:45:39,842 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:45:39,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:45:39,916 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:45:39,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:39 WrapperNode [2025-01-10 06:45:39,919 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:45:39,920 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:45:39,920 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:45:39,920 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:45:39,932 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:45:39" (1/1) ... [2025-01-10 06:45:39,949 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:45:39" (1/1) ... [2025-01-10 06:45:39,973 INFO L138 Inliner]: procedures = 271, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 143 [2025-01-10 06:45:39,974 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:45:39,974 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:45:39,975 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:45:39,975 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:45:39,982 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:39" (1/1) ... [2025-01-10 06:45:39,982 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:39" (1/1) ... [2025-01-10 06:45:39,985 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:39" (1/1) ... [2025-01-10 06:45:40,002 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 5, 5, 2]. 36 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5, 0]. The 1 writes are split as follows [0, 0, 0, 1]. [2025-01-10 06:45:40,003 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:39" (1/1) ... [2025-01-10 06:45:40,003 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:39" (1/1) ... [2025-01-10 06:45:40,009 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:39" (1/1) ... [2025-01-10 06:45:40,010 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:39" (1/1) ... [2025-01-10 06:45:40,012 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:39" (1/1) ... [2025-01-10 06:45:40,013 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:39" (1/1) ... [2025-01-10 06:45:40,014 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:39" (1/1) ... [2025-01-10 06:45:40,016 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:45:40,020 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:45:40,021 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:45:40,021 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:45:40,022 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:39" (1/1) ... [2025-01-10 06:45:40,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:45:40,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:45:40,056 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:45:40,058 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:45:40,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 06:45:40,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 06:45:40,075 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 06:45:40,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:45:40,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:45:40,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 06:45:40,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 06:45:40,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:45:40,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:45:40,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 06:45:40,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 06:45:40,075 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 06:45:40,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:45:40,076 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-10 06:45:40,076 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-10 06:45:40,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:45:40,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:45:40,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 06:45:40,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 06:45:40,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:45:40,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:45:40,077 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:45:40,201 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:45:40,202 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:45:40,377 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:45:40,378 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:45:40,650 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:45:40,651 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-10 06:45:40,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:45:40 BoogieIcfgContainer [2025-01-10 06:45:40,652 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:45:40,653 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:45:40,653 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:45:40,657 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:45:40,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:45:39" (1/3) ... [2025-01-10 06:45:40,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ad9fe6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:45:40, skipping insertion in model container [2025-01-10 06:45:40,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:39" (2/3) ... [2025-01-10 06:45:40,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ad9fe6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:45:40, skipping insertion in model container [2025-01-10 06:45:40,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:45:40" (3/3) ... [2025-01-10 06:45:40,659 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_07-cond_racing2.i [2025-01-10 06:45:40,686 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:45:40,687 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_07-cond_racing2.i that has 2 procedures, 59 locations, 1 initial locations, 6 loop locations, and 10 error locations. [2025-01-10 06:45:40,687 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:45:40,725 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-10 06:45:40,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 71 transitions, 149 flow [2025-01-10 06:45:40,790 INFO L124 PetriNetUnfolderBase]: 17/97 cut-off events. [2025-01-10 06:45:40,792 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 06:45:40,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 97 events. 17/97 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 299 event pairs, 0 based on Foata normal form. 0/65 useless extension candidates. Maximal degree in co-relation 62. Up to 6 conditions per place. [2025-01-10 06:45:40,796 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 71 transitions, 149 flow [2025-01-10 06:45:40,799 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 70 transitions, 147 flow [2025-01-10 06:45:40,807 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:45:40,817 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;@42b58403, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:45:40,818 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-01-10 06:45:40,823 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:45:40,823 INFO L124 PetriNetUnfolderBase]: 1/11 cut-off events. [2025-01-10 06:45:40,823 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:45:40,823 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:40,824 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:45:40,824 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-01-10 06:45:40,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:40,829 INFO L85 PathProgramCache]: Analyzing trace with hash 464131403, now seen corresponding path program 1 times [2025-01-10 06:45:40,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:40,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003230086] [2025-01-10 06:45:40,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:45:40,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:40,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:45:40,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:45:40,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:40,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:45:41,118 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:45:41,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:45:41,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003230086] [2025-01-10 06:45:41,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003230086] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:45:41,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:45:41,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:45:41,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607069911] [2025-01-10 06:45:41,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:45:41,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:45:41,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:45:41,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:45:41,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:45:41,161 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 71 [2025-01-10 06:45:41,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 70 transitions, 147 flow. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:45:41,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:45:41,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 71 [2025-01-10 06:45:41,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:45:41,312 INFO L124 PetriNetUnfolderBase]: 165/512 cut-off events. [2025-01-10 06:45:41,312 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 06:45:41,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 833 conditions, 512 events. 165/512 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2711 event pairs, 62 based on Foata normal form. 76/506 useless extension candidates. Maximal degree in co-relation 808. Up to 279 conditions per place. [2025-01-10 06:45:41,316 INFO L140 encePairwiseOnDemand]: 57/71 looper letters, 47 selfloop transitions, 3 changer transitions 0/83 dead transitions. [2025-01-10 06:45:41,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 83 transitions, 273 flow [2025-01-10 06:45:41,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:45:41,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:45:41,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 205 transitions. [2025-01-10 06:45:41,325 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.721830985915493 [2025-01-10 06:45:41,326 INFO L175 Difference]: Start difference. First operand has 62 places, 70 transitions, 147 flow. Second operand 4 states and 205 transitions. [2025-01-10 06:45:41,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 83 transitions, 273 flow [2025-01-10 06:45:41,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 83 transitions, 273 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:45:41,332 INFO L231 Difference]: Finished difference. Result has 64 places, 60 transitions, 137 flow [2025-01-10 06:45:41,333 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=137, PETRI_PLACES=64, PETRI_TRANSITIONS=60} [2025-01-10 06:45:41,335 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 2 predicate places. [2025-01-10 06:45:41,336 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 60 transitions, 137 flow [2025-01-10 06:45:41,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:45:41,336 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:41,336 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:45:41,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:45:41,336 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-01-10 06:45:41,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:41,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1439366601, now seen corresponding path program 1 times [2025-01-10 06:45:41,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:41,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752875029] [2025-01-10 06:45:41,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:45:41,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:41,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:45:41,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:45:41,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:41,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:45:41,406 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:45:41,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:45:41,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:45:41,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:41,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:45:41,432 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:45:41,432 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:45:41,433 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2025-01-10 06:45:41,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 15 remaining) [2025-01-10 06:45:41,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 15 remaining) [2025-01-10 06:45:41,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 15 remaining) [2025-01-10 06:45:41,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 15 remaining) [2025-01-10 06:45:41,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 15 remaining) [2025-01-10 06:45:41,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 15 remaining) [2025-01-10 06:45:41,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 15 remaining) [2025-01-10 06:45:41,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 15 remaining) [2025-01-10 06:45:41,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 15 remaining) [2025-01-10 06:45:41,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 15 remaining) [2025-01-10 06:45:41,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 15 remaining) [2025-01-10 06:45:41,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 15 remaining) [2025-01-10 06:45:41,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 15 remaining) [2025-01-10 06:45:41,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 15 remaining) [2025-01-10 06:45:41,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:45:41,437 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-10 06:45:41,438 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:45:41,438 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-10 06:45:41,457 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 06:45:41,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 104 transitions, 224 flow [2025-01-10 06:45:41,477 INFO L124 PetriNetUnfolderBase]: 30/175 cut-off events. [2025-01-10 06:45:41,477 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-10 06:45:41,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 175 events. 30/175 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 658 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 105. Up to 9 conditions per place. [2025-01-10 06:45:41,478 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 104 transitions, 224 flow [2025-01-10 06:45:41,480 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 104 transitions, 224 flow [2025-01-10 06:45:41,481 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:45:41,481 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;@42b58403, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:45:41,481 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-01-10 06:45:41,484 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:45:41,485 INFO L124 PetriNetUnfolderBase]: 1/11 cut-off events. [2025-01-10 06:45:41,485 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:45:41,485 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:41,485 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:45:41,485 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-01-10 06:45:41,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:41,485 INFO L85 PathProgramCache]: Analyzing trace with hash 563408914, now seen corresponding path program 1 times [2025-01-10 06:45:41,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:41,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883249037] [2025-01-10 06:45:41,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:45:41,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:41,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:45:41,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:45:41,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:41,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:45:41,577 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:45:41,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:45:41,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883249037] [2025-01-10 06:45:41,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883249037] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:45:41,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:45:41,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:45:41,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002502197] [2025-01-10 06:45:41,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:45:41,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:45:41,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:45:41,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:45:41,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:45:41,586 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 104 [2025-01-10 06:45:41,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 104 transitions, 224 flow. Second operand has 4 states, 4 states have (on average 48.25) internal successors, (193), 4 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:45:41,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:45:41,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 104 [2025-01-10 06:45:41,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:45:42,588 INFO L124 PetriNetUnfolderBase]: 4719/10013 cut-off events. [2025-01-10 06:45:42,588 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2025-01-10 06:45:42,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17194 conditions, 10013 events. 4719/10013 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 85988 event pairs, 1952 based on Foata normal form. 1711/10442 useless extension candidates. Maximal degree in co-relation 1373. Up to 7077 conditions per place. [2025-01-10 06:45:42,639 INFO L140 encePairwiseOnDemand]: 84/104 looper letters, 65 selfloop transitions, 3 changer transitions 0/115 dead transitions. [2025-01-10 06:45:42,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 115 transitions, 382 flow [2025-01-10 06:45:42,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:45:42,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:45:42,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 285 transitions. [2025-01-10 06:45:42,642 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6850961538461539 [2025-01-10 06:45:42,642 INFO L175 Difference]: Start difference. First operand has 90 places, 104 transitions, 224 flow. Second operand 4 states and 285 transitions. [2025-01-10 06:45:42,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 115 transitions, 382 flow [2025-01-10 06:45:42,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 115 transitions, 382 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:45:42,644 INFO L231 Difference]: Finished difference. Result has 95 places, 92 transitions, 220 flow [2025-01-10 06:45:42,645 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=220, PETRI_PLACES=95, PETRI_TRANSITIONS=92} [2025-01-10 06:45:42,645 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 5 predicate places. [2025-01-10 06:45:42,645 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 92 transitions, 220 flow [2025-01-10 06:45:42,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.25) internal successors, (193), 4 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:45:42,646 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:42,646 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:45:42,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:45:42,646 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-01-10 06:45:42,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:42,646 INFO L85 PathProgramCache]: Analyzing trace with hash -2058381329, now seen corresponding path program 1 times [2025-01-10 06:45:42,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:42,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222701102] [2025-01-10 06:45:42,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:45:42,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:42,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:45:42,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:45:42,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:42,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:45:42,772 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:45:42,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:45:42,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222701102] [2025-01-10 06:45:42,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222701102] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:45:42,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:45:42,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:45:42,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561865193] [2025-01-10 06:45:42,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:45:42,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:45:42,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:45:42,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:45:42,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:45:42,784 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 104 [2025-01-10 06:45:42,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 92 transitions, 220 flow. Second operand has 6 states, 6 states have (on average 48.5) internal successors, (291), 6 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:45:42,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:45:42,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 104 [2025-01-10 06:45:42,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:45:43,591 INFO L124 PetriNetUnfolderBase]: 3957/8793 cut-off events. [2025-01-10 06:45:43,592 INFO L125 PetriNetUnfolderBase]: For 624/624 co-relation queries the response was YES. [2025-01-10 06:45:43,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15384 conditions, 8793 events. 3957/8793 cut-off events. For 624/624 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 75974 event pairs, 252 based on Foata normal form. 144/7685 useless extension candidates. Maximal degree in co-relation 1276. Up to 3893 conditions per place. [2025-01-10 06:45:43,649 INFO L140 encePairwiseOnDemand]: 99/104 looper letters, 105 selfloop transitions, 6 changer transitions 0/158 dead transitions. [2025-01-10 06:45:43,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 158 transitions, 572 flow [2025-01-10 06:45:43,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:45:43,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:45:43,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 394 transitions. [2025-01-10 06:45:43,653 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6314102564102564 [2025-01-10 06:45:43,653 INFO L175 Difference]: Start difference. First operand has 95 places, 92 transitions, 220 flow. Second operand 6 states and 394 transitions. [2025-01-10 06:45:43,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 158 transitions, 572 flow [2025-01-10 06:45:43,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 158 transitions, 570 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:45:43,656 INFO L231 Difference]: Finished difference. Result has 98 places, 91 transitions, 226 flow [2025-01-10 06:45:43,657 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=214, 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=226, PETRI_PLACES=98, PETRI_TRANSITIONS=91} [2025-01-10 06:45:43,657 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 8 predicate places. [2025-01-10 06:45:43,657 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 91 transitions, 226 flow [2025-01-10 06:45:43,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 48.5) internal successors, (291), 6 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:45:43,657 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:43,658 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:45:43,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:45:43,658 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-01-10 06:45:43,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:43,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1204247539, now seen corresponding path program 1 times [2025-01-10 06:45:43,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:43,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131977436] [2025-01-10 06:45:43,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:45:43,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:43,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:45:43,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:45:43,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:43,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:45:43,727 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:45:43,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:45:43,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131977436] [2025-01-10 06:45:43,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131977436] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:45:43,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:45:43,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:45:43,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104498286] [2025-01-10 06:45:43,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:45:43,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:45:43,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:45:43,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:45:43,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:45:43,734 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 104 [2025-01-10 06:45:43,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 91 transitions, 226 flow. Second operand has 4 states, 4 states have (on average 49.75) internal successors, (199), 4 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:45:43,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:45:43,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 104 [2025-01-10 06:45:43,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:45:44,658 INFO L124 PetriNetUnfolderBase]: 6297/12852 cut-off events. [2025-01-10 06:45:44,659 INFO L125 PetriNetUnfolderBase]: For 1495/1656 co-relation queries the response was YES. [2025-01-10 06:45:44,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23290 conditions, 12852 events. 6297/12852 cut-off events. For 1495/1656 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 111597 event pairs, 1495 based on Foata normal form. 222/11733 useless extension candidates. Maximal degree in co-relation 18758. Up to 6450 conditions per place. [2025-01-10 06:45:44,714 INFO L140 encePairwiseOnDemand]: 95/104 looper letters, 122 selfloop transitions, 12 changer transitions 0/182 dead transitions. [2025-01-10 06:45:44,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 182 transitions, 730 flow [2025-01-10 06:45:44,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:45:44,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:45:44,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 375 transitions. [2025-01-10 06:45:44,716 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7211538461538461 [2025-01-10 06:45:44,716 INFO L175 Difference]: Start difference. First operand has 98 places, 91 transitions, 226 flow. Second operand 5 states and 375 transitions. [2025-01-10 06:45:44,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 182 transitions, 730 flow [2025-01-10 06:45:44,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 182 transitions, 707 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-01-10 06:45:44,723 INFO L231 Difference]: Finished difference. Result has 102 places, 102 transitions, 308 flow [2025-01-10 06:45:44,723 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=308, PETRI_PLACES=102, PETRI_TRANSITIONS=102} [2025-01-10 06:45:44,724 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 12 predicate places. [2025-01-10 06:45:44,725 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 102 transitions, 308 flow [2025-01-10 06:45:44,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.75) internal successors, (199), 4 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:45:44,725 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:44,725 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:45:44,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:45:44,725 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-01-10 06:45:44,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:44,726 INFO L85 PathProgramCache]: Analyzing trace with hash -2058432132, now seen corresponding path program 1 times [2025-01-10 06:45:44,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:44,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508494269] [2025-01-10 06:45:44,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:45:44,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:44,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:45:44,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:45:44,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:44,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:45:44,818 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:45:44,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:45:44,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508494269] [2025-01-10 06:45:44,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508494269] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:45:44,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:45:44,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:45:44,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148792619] [2025-01-10 06:45:44,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:45:44,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:45:44,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:45:44,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:45:44,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:45:44,828 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 104 [2025-01-10 06:45:44,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 102 transitions, 308 flow. Second operand has 5 states, 5 states have (on average 48.4) internal successors, (242), 5 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:45:44,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:45:44,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 104 [2025-01-10 06:45:44,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:45:45,576 INFO L124 PetriNetUnfolderBase]: 5529/12293 cut-off events. [2025-01-10 06:45:45,576 INFO L125 PetriNetUnfolderBase]: For 3856/3862 co-relation queries the response was YES. [2025-01-10 06:45:45,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24051 conditions, 12293 events. 5529/12293 cut-off events. For 3856/3862 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 111339 event pairs, 559 based on Foata normal form. 12/10787 useless extension candidates. Maximal degree in co-relation 20797. Up to 7305 conditions per place. [2025-01-10 06:45:45,631 INFO L140 encePairwiseOnDemand]: 100/104 looper letters, 102 selfloop transitions, 4 changer transitions 0/153 dead transitions. [2025-01-10 06:45:45,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 153 transitions, 674 flow [2025-01-10 06:45:45,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:45:45,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:45:45,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 326 transitions. [2025-01-10 06:45:45,633 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6269230769230769 [2025-01-10 06:45:45,633 INFO L175 Difference]: Start difference. First operand has 102 places, 102 transitions, 308 flow. Second operand 5 states and 326 transitions. [2025-01-10 06:45:45,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 153 transitions, 674 flow [2025-01-10 06:45:45,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 153 transitions, 674 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:45:45,640 INFO L231 Difference]: Finished difference. Result has 107 places, 102 transitions, 320 flow [2025-01-10 06:45:45,640 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=320, PETRI_PLACES=107, PETRI_TRANSITIONS=102} [2025-01-10 06:45:45,640 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 17 predicate places. [2025-01-10 06:45:45,640 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 102 transitions, 320 flow [2025-01-10 06:45:45,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.4) internal successors, (242), 5 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:45:45,641 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:45,641 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 06:45:45,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:45:45,641 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-01-10 06:45:45,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:45,642 INFO L85 PathProgramCache]: Analyzing trace with hash 614688813, now seen corresponding path program 1 times [2025-01-10 06:45:45,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:45,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176153270] [2025-01-10 06:45:45,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:45:45,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:45,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:45:45,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:45:45,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:45,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:45:45,705 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:45:45,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:45:45,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176153270] [2025-01-10 06:45:45,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176153270] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:45:45,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:45:45,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:45:45,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543782874] [2025-01-10 06:45:45,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:45:45,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:45:45,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:45:45,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:45:45,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:45:45,712 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 104 [2025-01-10 06:45:45,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 102 transitions, 320 flow. Second operand has 4 states, 4 states have (on average 49.25) internal successors, (197), 4 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:45:45,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:45:45,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 104 [2025-01-10 06:45:45,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:45:46,336 INFO L124 PetriNetUnfolderBase]: 5231/11685 cut-off events. [2025-01-10 06:45:46,336 INFO L125 PetriNetUnfolderBase]: For 4182/4187 co-relation queries the response was YES. [2025-01-10 06:45:46,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23220 conditions, 11685 events. 5231/11685 cut-off events. For 4182/4187 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 104812 event pairs, 553 based on Foata normal form. 160/10361 useless extension candidates. Maximal degree in co-relation 20073. Up to 6842 conditions per place. [2025-01-10 06:45:46,399 INFO L140 encePairwiseOnDemand]: 99/104 looper letters, 103 selfloop transitions, 6 changer transitions 0/156 dead transitions. [2025-01-10 06:45:46,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 156 transitions, 708 flow [2025-01-10 06:45:46,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:45:46,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:45:46,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 275 transitions. [2025-01-10 06:45:46,401 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6610576923076923 [2025-01-10 06:45:46,401 INFO L175 Difference]: Start difference. First operand has 107 places, 102 transitions, 320 flow. Second operand 4 states and 275 transitions. [2025-01-10 06:45:46,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 156 transitions, 708 flow [2025-01-10 06:45:46,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 156 transitions, 696 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-01-10 06:45:46,411 INFO L231 Difference]: Finished difference. Result has 105 places, 102 transitions, 324 flow [2025-01-10 06:45:46,412 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=324, PETRI_PLACES=105, PETRI_TRANSITIONS=102} [2025-01-10 06:45:46,412 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 15 predicate places. [2025-01-10 06:45:46,412 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 102 transitions, 324 flow [2025-01-10 06:45:46,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.25) internal successors, (197), 4 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:45:46,412 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:46,412 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2025-01-10 06:45:46,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:45:46,413 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-01-10 06:45:46,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:46,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1989518292, now seen corresponding path program 1 times [2025-01-10 06:45:46,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:46,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488296692] [2025-01-10 06:45:46,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:45:46,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:46,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:45:46,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:45:46,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:46,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:45:46,436 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:45:46,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:45:46,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:45:46,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:46,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:45:46,455 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:45:46,455 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:45:46,455 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 19 remaining) [2025-01-10 06:45:46,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 19 remaining) [2025-01-10 06:45:46,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 19 remaining) [2025-01-10 06:45:46,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 19 remaining) [2025-01-10 06:45:46,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 19 remaining) [2025-01-10 06:45:46,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 19 remaining) [2025-01-10 06:45:46,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 19 remaining) [2025-01-10 06:45:46,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 19 remaining) [2025-01-10 06:45:46,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 19 remaining) [2025-01-10 06:45:46,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 19 remaining) [2025-01-10 06:45:46,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 19 remaining) [2025-01-10 06:45:46,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 19 remaining) [2025-01-10 06:45:46,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 19 remaining) [2025-01-10 06:45:46,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 19 remaining) [2025-01-10 06:45:46,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 19 remaining) [2025-01-10 06:45:46,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 19 remaining) [2025-01-10 06:45:46,457 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 19 remaining) [2025-01-10 06:45:46,457 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 19 remaining) [2025-01-10 06:45:46,457 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 19 remaining) [2025-01-10 06:45:46,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:45:46,457 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-01-10 06:45:46,457 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:45:46,457 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-10 06:45:46,482 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-10 06:45:46,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 137 transitions, 301 flow [2025-01-10 06:45:46,504 INFO L124 PetriNetUnfolderBase]: 46/272 cut-off events. [2025-01-10 06:45:46,505 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-01-10 06:45:46,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 297 conditions, 272 events. 46/272 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1123 event pairs, 1 based on Foata normal form. 0/182 useless extension candidates. Maximal degree in co-relation 190. Up to 12 conditions per place. [2025-01-10 06:45:46,506 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 137 transitions, 301 flow [2025-01-10 06:45:46,507 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 137 transitions, 301 flow [2025-01-10 06:45:46,508 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:45:46,508 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;@42b58403, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:45:46,510 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-01-10 06:45:46,511 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:45:46,512 INFO L124 PetriNetUnfolderBase]: 1/10 cut-off events. [2025-01-10 06:45:46,512 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:45:46,512 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:46,512 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:45:46,512 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-01-10 06:45:46,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:46,512 INFO L85 PathProgramCache]: Analyzing trace with hash 694178490, now seen corresponding path program 1 times [2025-01-10 06:45:46,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:46,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924212804] [2025-01-10 06:45:46,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:45:46,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:46,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:45:46,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:45:46,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:46,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:45:46,589 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:45:46,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:45:46,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924212804] [2025-01-10 06:45:46,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924212804] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:45:46,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:45:46,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:45:46,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615353935] [2025-01-10 06:45:46,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:45:46,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:45:46,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:45:46,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:45:46,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:45:46,595 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 137 [2025-01-10 06:45:46,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 137 transitions, 301 flow. Second operand has 4 states, 4 states have (on average 62.25) internal successors, (249), 4 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:45:46,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:45:46,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 137 [2025-01-10 06:45:46,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:45:55,445 INFO L124 PetriNetUnfolderBase]: 87851/154955 cut-off events. [2025-01-10 06:45:55,446 INFO L125 PetriNetUnfolderBase]: For 1911/1911 co-relation queries the response was YES. [2025-01-10 06:45:55,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275078 conditions, 154955 events. 87851/154955 cut-off events. For 1911/1911 co-relation queries the response was YES. Maximal size of possible extension queue 3677. Compared 1615291 event pairs, 52468 based on Foata normal form. 31160/170357 useless extension candidates. Maximal degree in co-relation 17993. Up to 118961 conditions per place. [2025-01-10 06:45:56,386 INFO L140 encePairwiseOnDemand]: 111/137 looper letters, 78 selfloop transitions, 3 changer transitions 0/142 dead transitions. [2025-01-10 06:45:56,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 142 transitions, 473 flow [2025-01-10 06:45:56,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:45:56,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:45:56,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 360 transitions. [2025-01-10 06:45:56,388 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.656934306569343 [2025-01-10 06:45:56,388 INFO L175 Difference]: Start difference. First operand has 118 places, 137 transitions, 301 flow. Second operand 4 states and 360 transitions. [2025-01-10 06:45:56,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 142 transitions, 473 flow [2025-01-10 06:45:56,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 142 transitions, 473 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:45:56,392 INFO L231 Difference]: Finished difference. Result has 123 places, 119 transitions, 285 flow [2025-01-10 06:45:56,392 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=285, PETRI_PLACES=123, PETRI_TRANSITIONS=119} [2025-01-10 06:45:56,393 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 5 predicate places. [2025-01-10 06:45:56,393 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 119 transitions, 285 flow [2025-01-10 06:45:56,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.25) internal successors, (249), 4 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:45:56,393 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:56,393 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:45:56,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:45:56,394 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-01-10 06:45:56,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:56,394 INFO L85 PathProgramCache]: Analyzing trace with hash 89649554, now seen corresponding path program 1 times [2025-01-10 06:45:56,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:56,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74638613] [2025-01-10 06:45:56,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:45:56,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:56,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:45:56,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:45:56,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:56,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:45:56,452 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:45:56,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:45:56,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74638613] [2025-01-10 06:45:56,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74638613] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:45:56,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:45:56,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:45:56,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538136585] [2025-01-10 06:45:56,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:45:56,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:45:56,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:45:56,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:45:56,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:45:56,456 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 137 [2025-01-10 06:45:56,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 119 transitions, 285 flow. Second operand has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:45:56,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:45:56,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 137 [2025-01-10 06:45:56,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:46:09,270 INFO L124 PetriNetUnfolderBase]: 124373/213784 cut-off events. [2025-01-10 06:46:09,271 INFO L125 PetriNetUnfolderBase]: For 7138/11654 co-relation queries the response was YES. [2025-01-10 06:46:09,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 389248 conditions, 213784 events. 124373/213784 cut-off events. For 7138/11654 co-relation queries the response was YES. Maximal size of possible extension queue 5008. Compared 2237646 event pairs, 39414 based on Foata normal form. 3015/196620 useless extension candidates. Maximal degree in co-relation 389146. Up to 117315 conditions per place. [2025-01-10 06:46:10,871 INFO L140 encePairwiseOnDemand]: 126/137 looper letters, 174 selfloop transitions, 16 changer transitions 0/253 dead transitions. [2025-01-10 06:46:10,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 253 transitions, 1003 flow [2025-01-10 06:46:10,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:46:10,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:46:10,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 501 transitions. [2025-01-10 06:46:10,875 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7313868613138687 [2025-01-10 06:46:10,875 INFO L175 Difference]: Start difference. First operand has 123 places, 119 transitions, 285 flow. Second operand 5 states and 501 transitions. [2025-01-10 06:46:10,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 253 transitions, 1003 flow [2025-01-10 06:46:10,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 253 transitions, 999 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:46:10,884 INFO L231 Difference]: Finished difference. Result has 130 places, 134 transitions, 411 flow [2025-01-10 06:46:10,885 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=411, PETRI_PLACES=130, PETRI_TRANSITIONS=134} [2025-01-10 06:46:10,886 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 12 predicate places. [2025-01-10 06:46:10,886 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 134 transitions, 411 flow [2025-01-10 06:46:10,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 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:10,886 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:46:10,886 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:46:10,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:46:10,886 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-01-10 06:46:10,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:46:10,887 INFO L85 PathProgramCache]: Analyzing trace with hash 97190127, now seen corresponding path program 1 times [2025-01-10 06:46:10,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:46:10,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793649812] [2025-01-10 06:46:10,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:46:10,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:46:10,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:46:10,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:46:10,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:10,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:46:10,954 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:10,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:46:10,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793649812] [2025-01-10 06:46:10,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793649812] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:46:10,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:46:10,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:46:10,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913489297] [2025-01-10 06:46:10,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:46:10,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:46:10,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:46:10,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:46:10,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:46:10,966 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 137 [2025-01-10 06:46:10,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 134 transitions, 411 flow. Second operand has 6 states, 6 states have (on average 62.5) internal successors, (375), 6 states have internal predecessors, (375), 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:10,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:46:10,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 137 [2025-01-10 06:46:10,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand