./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_06-cond_racing1.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_06-cond_racing1.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 830cb16a3cbc120e059f0ed7638e33ed20360a11f425952cf536aa3d659b86fc --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:45:36,919 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:45:36,969 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:36,976 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:45:36,976 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:45:37,000 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:45:37,002 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:45:37,002 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:45:37,002 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:45:37,002 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:45:37,003 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:45:37,003 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:45:37,003 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:45:37,004 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:45:37,004 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:45:37,004 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:45:37,004 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:45:37,004 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:45:37,004 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:45:37,004 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:45:37,005 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:45:37,005 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:45:37,005 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:45:37,005 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:45:37,005 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:45:37,005 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:45:37,005 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:45:37,005 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:45:37,005 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:45:37,005 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:45:37,005 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:45:37,005 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:45:37,005 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:45:37,005 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:45:37,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:45:37,006 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:45:37,006 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:45:37,006 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:45:37,006 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:45:37,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:45:37,006 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:45:37,006 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:45:37,006 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:45:37,006 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:45:37,006 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:45:37,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:45:37,006 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:45:37,006 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:45:37,006 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:45:37,006 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:45:37,006 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 -> 830cb16a3cbc120e059f0ed7638e33ed20360a11f425952cf536aa3d659b86fc [2025-01-10 06:45:37,264 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:45:37,273 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:45:37,277 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:45:37,278 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:45:37,278 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:45:37,279 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_06-cond_racing1.i [2025-01-10 06:45:37,755 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/09bf4bb57/9978ac0c0dbf459da9d827aab5a3c7ad/FLAG35baf64da [2025-01-10 06:45:39,422 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:45:39,423 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_06-cond_racing1.i [2025-01-10 06:45:39,435 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/09bf4bb57/9978ac0c0dbf459da9d827aab5a3c7ad/FLAG35baf64da [2025-01-10 06:45:39,449 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/09bf4bb57/9978ac0c0dbf459da9d827aab5a3c7ad [2025-01-10 06:45:39,451 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:45:39,452 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:45:39,453 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:45:39,453 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:45:39,456 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:45:39,457 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,457 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@368dfe1d 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,457 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,485 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:45:39,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:45:39,867 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:45:39,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:45:39,938 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:45:39,939 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,939 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:45:39,940 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:45:39,940 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:45:39,940 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:45:39,946 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,964 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,980 INFO L138 Inliner]: procedures = 271, calls = 42, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 93 [2025-01-10 06:45:39,981 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:45:39,981 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:45:39,981 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:45:39,981 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:45:39,993 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,993 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,995 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,017 INFO L175 MemorySlicer]: Split 19 memory accesses to 5 slices as follows [2, 5, 2, 5, 5]. 26 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 0, 5, 5]. The 1 writes are split as follows [0, 0, 1, 0, 0]. [2025-01-10 06:45:40,018 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,018 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,027 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,027 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,030 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,032 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,033 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,038 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:45:40,039 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:45:40,039 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:45:40,039 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:45:40,039 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,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:45:40,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:45:40,069 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,072 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,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 06:45:40,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 06:45:40,092 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 06:45:40,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:45:40,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:45:40,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 06:45:40,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 06:45:40,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-10 06:45:40,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:45:40,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:45:40,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 06:45:40,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 06:45:40,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-10 06:45:40,093 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 06:45:40,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:45:40,093 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-10 06:45:40,093 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-10 06:45:40,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:45:40,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:45:40,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 06:45:40,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 06:45:40,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-10 06:45:40,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:45:40,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:45:40,096 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,210 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:45:40,212 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:45:40,404 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:45:40,405 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:45:40,532 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:45:40,532 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-10 06:45:40,532 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,532 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:45:40,535 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:45:40,535 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:45:40,538 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:45:40,538 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,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@621c1553 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,539 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,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@621c1553 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,541 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,541 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_06-cond_racing1.i [2025-01-10 06:45:40,552 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:45:40,553 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_06-cond_racing1.i that has 2 procedures, 55 locations, 1 initial locations, 6 loop locations, and 8 error locations. [2025-01-10 06:45:40,553 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:45:40,596 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-10 06:45:40,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 67 transitions, 141 flow [2025-01-10 06:45:40,662 INFO L124 PetriNetUnfolderBase]: 17/89 cut-off events. [2025-01-10 06:45:40,664 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 06:45:40,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 89 events. 17/89 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 270 event pairs, 0 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 58. Up to 6 conditions per place. [2025-01-10 06:45:40,668 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 67 transitions, 141 flow [2025-01-10 06:45:40,671 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 66 transitions, 139 flow [2025-01-10 06:45:40,679 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:45:40,689 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;@234a4c29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:45:40,689 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-01-10 06:45:40,693 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:45:40,693 INFO L124 PetriNetUnfolderBase]: 1/11 cut-off events. [2025-01-10 06:45:40,693 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:45:40,693 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:40,694 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:45:40,694 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:45:40,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:40,700 INFO L85 PathProgramCache]: Analyzing trace with hash 364850079, now seen corresponding path program 1 times [2025-01-10 06:45:40,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:40,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795888461] [2025-01-10 06:45:40,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:45:40,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:40,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:45:40,797 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,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:40,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:45:40,996 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:40,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:45:40,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795888461] [2025-01-10 06:45:40,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795888461] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:45:41,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:45:41,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:45:41,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791759784] [2025-01-10 06:45:41,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:45:41,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:45:41,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:45:41,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:45:41,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:45:41,043 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 67 [2025-01-10 06:45:41,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 66 transitions, 139 flow. Second operand has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 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,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:45:41,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 67 [2025-01-10 06:45:41,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:45:41,263 INFO L124 PetriNetUnfolderBase]: 159/431 cut-off events. [2025-01-10 06:45:41,263 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 06:45:41,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 737 conditions, 431 events. 159/431 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2159 event pairs, 20 based on Foata normal form. 72/444 useless extension candidates. Maximal degree in co-relation 709. Up to 264 conditions per place. [2025-01-10 06:45:41,267 INFO L140 encePairwiseOnDemand]: 53/67 looper letters, 47 selfloop transitions, 3 changer transitions 0/79 dead transitions. [2025-01-10 06:45:41,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 79 transitions, 265 flow [2025-01-10 06:45:41,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:45:41,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:45:41,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 189 transitions. [2025-01-10 06:45:41,280 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7052238805970149 [2025-01-10 06:45:41,282 INFO L175 Difference]: Start difference. First operand has 58 places, 66 transitions, 139 flow. Second operand 4 states and 189 transitions. [2025-01-10 06:45:41,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 79 transitions, 265 flow [2025-01-10 06:45:41,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 79 transitions, 265 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:45:41,287 INFO L231 Difference]: Finished difference. Result has 60 places, 56 transitions, 129 flow [2025-01-10 06:45:41,289 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=129, PETRI_PLACES=60, PETRI_TRANSITIONS=56} [2025-01-10 06:45:41,292 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 2 predicate places. [2025-01-10 06:45:41,292 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 56 transitions, 129 flow [2025-01-10 06:45:41,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 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,292 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:41,292 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:45:41,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:45:41,293 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:45:41,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:41,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1313158420, now seen corresponding path program 1 times [2025-01-10 06:45:41,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:41,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759576860] [2025-01-10 06:45:41,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:45:41,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:41,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:45:41,326 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,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:41,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:45:41,327 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:45:41,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:45:41,339 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,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:41,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:45:41,357 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:45:41,357 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:45:41,358 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-01-10 06:45:41,359 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2025-01-10 06:45:41,359 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2025-01-10 06:45:41,359 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2025-01-10 06:45:41,359 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2025-01-10 06:45:41,360 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2025-01-10 06:45:41,360 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2025-01-10 06:45:41,360 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2025-01-10 06:45:41,360 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2025-01-10 06:45:41,360 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2025-01-10 06:45:41,360 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2025-01-10 06:45:41,360 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2025-01-10 06:45:41,360 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2025-01-10 06:45:41,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:45:41,360 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-10 06:45:41,362 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:45:41,362 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-10 06:45:41,385 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 06:45:41,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 100 transitions, 216 flow [2025-01-10 06:45:41,405 INFO L124 PetriNetUnfolderBase]: 30/163 cut-off events. [2025-01-10 06:45:41,406 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-10 06:45:41,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 163 events. 30/163 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 601 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 98. Up to 9 conditions per place. [2025-01-10 06:45:41,407 INFO L82 GeneralOperation]: Start removeDead. Operand has 86 places, 100 transitions, 216 flow [2025-01-10 06:45:41,408 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 100 transitions, 216 flow [2025-01-10 06:45:41,409 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:45:41,410 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;@234a4c29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:45:41,410 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-01-10 06:45:41,412 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:45:41,412 INFO L124 PetriNetUnfolderBase]: 1/11 cut-off events. [2025-01-10 06:45:41,412 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:45:41,412 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:41,412 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:45:41,412 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 06:45:41,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:41,413 INFO L85 PathProgramCache]: Analyzing trace with hash 460310370, now seen corresponding path program 1 times [2025-01-10 06:45:41,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:41,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349002268] [2025-01-10 06:45:41,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:45:41,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:41,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:45:41,428 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,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:41,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:45:41,468 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,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:45:41,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349002268] [2025-01-10 06:45:41,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349002268] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:45:41,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:45:41,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:45:41,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144698099] [2025-01-10 06:45:41,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:45:41,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:45:41,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:45:41,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:45:41,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:45:41,476 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 100 [2025-01-10 06:45:41,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 100 transitions, 216 flow. Second operand has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 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,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:45:41,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 100 [2025-01-10 06:45:41,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:45:42,370 INFO L124 PetriNetUnfolderBase]: 4611/9735 cut-off events. [2025-01-10 06:45:42,370 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2025-01-10 06:45:42,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16808 conditions, 9735 events. 4611/9735 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 83177 event pairs, 1952 based on Foata normal form. 1699/10276 useless extension candidates. Maximal degree in co-relation 1345. Up to 6969 conditions per place. [2025-01-10 06:45:42,441 INFO L140 encePairwiseOnDemand]: 80/100 looper letters, 65 selfloop transitions, 3 changer transitions 0/111 dead transitions. [2025-01-10 06:45:42,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 111 transitions, 374 flow [2025-01-10 06:45:42,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:45:42,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:45:42,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 269 transitions. [2025-01-10 06:45:42,444 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6725 [2025-01-10 06:45:42,444 INFO L175 Difference]: Start difference. First operand has 86 places, 100 transitions, 216 flow. Second operand 4 states and 269 transitions. [2025-01-10 06:45:42,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 111 transitions, 374 flow [2025-01-10 06:45:42,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 111 transitions, 374 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:45:42,449 INFO L231 Difference]: Finished difference. Result has 91 places, 88 transitions, 212 flow [2025-01-10 06:45:42,449 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=212, PETRI_PLACES=91, PETRI_TRANSITIONS=88} [2025-01-10 06:45:42,450 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 5 predicate places. [2025-01-10 06:45:42,450 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 88 transitions, 212 flow [2025-01-10 06:45:42,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 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,450 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:42,450 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:45:42,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:45:42,451 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 06:45:42,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:42,451 INFO L85 PathProgramCache]: Analyzing trace with hash 136173809, now seen corresponding path program 1 times [2025-01-10 06:45:42,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:42,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9121803] [2025-01-10 06:45:42,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:45:42,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:42,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:45:42,474 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,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:42,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:45:42,572 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,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:45:42,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9121803] [2025-01-10 06:45:42,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9121803] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:45:42,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:45:42,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:45:42,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247544059] [2025-01-10 06:45:42,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:45:42,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:45:42,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:45:42,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:45:42,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:45:42,590 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 100 [2025-01-10 06:45:42,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 88 transitions, 212 flow. Second operand has 6 states, 6 states have (on average 44.5) internal successors, (267), 6 states have internal predecessors, (267), 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,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:45:42,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 100 [2025-01-10 06:45:42,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:45:43,382 INFO L124 PetriNetUnfolderBase]: 3957/8136 cut-off events. [2025-01-10 06:45:43,382 INFO L125 PetriNetUnfolderBase]: For 654/654 co-relation queries the response was YES. [2025-01-10 06:45:43,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14727 conditions, 8136 events. 3957/8136 cut-off events. For 654/654 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 66204 event pairs, 326 based on Foata normal form. 144/7349 useless extension candidates. Maximal degree in co-relation 3532. Up to 3893 conditions per place. [2025-01-10 06:45:43,428 INFO L140 encePairwiseOnDemand]: 95/100 looper letters, 105 selfloop transitions, 6 changer transitions 0/154 dead transitions. [2025-01-10 06:45:43,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 154 transitions, 564 flow [2025-01-10 06:45:43,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:45:43,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:45:43,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 370 transitions. [2025-01-10 06:45:43,432 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6166666666666667 [2025-01-10 06:45:43,432 INFO L175 Difference]: Start difference. First operand has 91 places, 88 transitions, 212 flow. Second operand 6 states and 370 transitions. [2025-01-10 06:45:43,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 154 transitions, 564 flow [2025-01-10 06:45:43,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 154 transitions, 562 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:45:43,435 INFO L231 Difference]: Finished difference. Result has 94 places, 87 transitions, 218 flow [2025-01-10 06:45:43,436 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=218, PETRI_PLACES=94, PETRI_TRANSITIONS=87} [2025-01-10 06:45:43,437 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 8 predicate places. [2025-01-10 06:45:43,437 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 87 transitions, 218 flow [2025-01-10 06:45:43,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 44.5) internal successors, (267), 6 states have internal predecessors, (267), 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,437 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:43,437 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:45:43,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:45:43,438 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 06:45:43,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:43,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1158862990, now seen corresponding path program 1 times [2025-01-10 06:45:43,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:43,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291841750] [2025-01-10 06:45:43,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:45:43,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:43,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:45:43,457 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,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:43,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:45:43,508 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,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:45:43,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291841750] [2025-01-10 06:45:43,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291841750] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:45:43,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:45:43,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:45:43,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769839760] [2025-01-10 06:45:43,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:45:43,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:45:43,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:45:43,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:45:43,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:45:43,520 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 100 [2025-01-10 06:45:43,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 87 transitions, 218 flow. Second operand has 4 states, 4 states have (on average 45.75) internal successors, (183), 4 states have internal predecessors, (183), 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,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:45:43,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 100 [2025-01-10 06:45:43,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:45:44,478 INFO L124 PetriNetUnfolderBase]: 6320/12941 cut-off events. [2025-01-10 06:45:44,479 INFO L125 PetriNetUnfolderBase]: For 1175/1336 co-relation queries the response was YES. [2025-01-10 06:45:44,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23410 conditions, 12941 events. 6320/12941 cut-off events. For 1175/1336 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 112407 event pairs, 1495 based on Foata normal form. 222/11783 useless extension candidates. Maximal degree in co-relation 18886. Up to 6459 conditions per place. [2025-01-10 06:45:44,545 INFO L140 encePairwiseOnDemand]: 91/100 looper letters, 122 selfloop transitions, 12 changer transitions 0/178 dead transitions. [2025-01-10 06:45:44,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 178 transitions, 722 flow [2025-01-10 06:45:44,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:45:44,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:45:44,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 355 transitions. [2025-01-10 06:45:44,547 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.71 [2025-01-10 06:45:44,547 INFO L175 Difference]: Start difference. First operand has 94 places, 87 transitions, 218 flow. Second operand 5 states and 355 transitions. [2025-01-10 06:45:44,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 178 transitions, 722 flow [2025-01-10 06:45:44,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 178 transitions, 699 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-01-10 06:45:44,555 INFO L231 Difference]: Finished difference. Result has 98 places, 98 transitions, 300 flow [2025-01-10 06:45:44,555 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=300, PETRI_PLACES=98, PETRI_TRANSITIONS=98} [2025-01-10 06:45:44,557 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 12 predicate places. [2025-01-10 06:45:44,557 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 98 transitions, 300 flow [2025-01-10 06:45:44,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.75) internal successors, (183), 4 states have internal predecessors, (183), 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,557 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:44,557 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 06:45:44,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:45:44,558 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 06:45:44,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:44,559 INFO L85 PathProgramCache]: Analyzing trace with hash -73578751, now seen corresponding path program 1 times [2025-01-10 06:45:44,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:44,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53423697] [2025-01-10 06:45:44,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:45:44,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:44,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:45:44,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:45:44,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:44,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:45:44,624 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,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:45:44,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53423697] [2025-01-10 06:45:44,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53423697] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:45:44,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:45:44,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:45:44,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818319535] [2025-01-10 06:45:44,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:45:44,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:45:44,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:45:44,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:45:44,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:45:44,631 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 100 [2025-01-10 06:45:44,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 98 transitions, 300 flow. Second operand has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 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,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:45:44,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 100 [2025-01-10 06:45:44,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:45:45,394 INFO L124 PetriNetUnfolderBase]: 5333/11397 cut-off events. [2025-01-10 06:45:45,395 INFO L125 PetriNetUnfolderBase]: For 3629/3633 co-relation queries the response was YES. [2025-01-10 06:45:45,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22696 conditions, 11397 events. 5333/11397 cut-off events. For 3629/3633 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 99486 event pairs, 513 based on Foata normal form. 152/10318 useless extension candidates. Maximal degree in co-relation 19383. Up to 7054 conditions per place. [2025-01-10 06:45:45,456 INFO L140 encePairwiseOnDemand]: 95/100 looper letters, 103 selfloop transitions, 6 changer transitions 0/152 dead transitions. [2025-01-10 06:45:45,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 152 transitions, 688 flow [2025-01-10 06:45:45,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:45:45,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:45:45,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 259 transitions. [2025-01-10 06:45:45,457 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6475 [2025-01-10 06:45:45,457 INFO L175 Difference]: Start difference. First operand has 98 places, 98 transitions, 300 flow. Second operand 4 states and 259 transitions. [2025-01-10 06:45:45,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 152 transitions, 688 flow [2025-01-10 06:45:45,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 152 transitions, 684 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-10 06:45:45,464 INFO L231 Difference]: Finished difference. Result has 100 places, 98 transitions, 312 flow [2025-01-10 06:45:45,464 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=312, PETRI_PLACES=100, PETRI_TRANSITIONS=98} [2025-01-10 06:45:45,465 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 14 predicate places. [2025-01-10 06:45:45,465 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 98 transitions, 312 flow [2025-01-10 06:45:45,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 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,465 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:45,465 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2025-01-10 06:45:45,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:45:45,465 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 06:45:45,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:45,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1989687203, now seen corresponding path program 1 times [2025-01-10 06:45:45,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:45,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17329703] [2025-01-10 06:45:45,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:45:45,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:45,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:45:45,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:45:45,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:45,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:45:45,480 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:45:45,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:45:45,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:45:45,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:45,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:45:45,499 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:45:45,501 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:45:45,502 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2025-01-10 06:45:45,502 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 17 remaining) [2025-01-10 06:45:45,502 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 17 remaining) [2025-01-10 06:45:45,502 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 17 remaining) [2025-01-10 06:45:45,502 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 17 remaining) [2025-01-10 06:45:45,502 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 17 remaining) [2025-01-10 06:45:45,502 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 17 remaining) [2025-01-10 06:45:45,502 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 17 remaining) [2025-01-10 06:45:45,502 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 17 remaining) [2025-01-10 06:45:45,502 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 17 remaining) [2025-01-10 06:45:45,502 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 17 remaining) [2025-01-10 06:45:45,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 17 remaining) [2025-01-10 06:45:45,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 17 remaining) [2025-01-10 06:45:45,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 17 remaining) [2025-01-10 06:45:45,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 17 remaining) [2025-01-10 06:45:45,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 17 remaining) [2025-01-10 06:45:45,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 17 remaining) [2025-01-10 06:45:45,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:45:45,503 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-10 06:45:45,504 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:45:45,504 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-10 06:45:45,530 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-10 06:45:45,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 133 transitions, 293 flow [2025-01-10 06:45:45,555 INFO L124 PetriNetUnfolderBase]: 46/256 cut-off events. [2025-01-10 06:45:45,555 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-01-10 06:45:45,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 256 events. 46/256 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1042 event pairs, 1 based on Foata normal form. 0/174 useless extension candidates. Maximal degree in co-relation 178. Up to 12 conditions per place. [2025-01-10 06:45:45,556 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 133 transitions, 293 flow [2025-01-10 06:45:45,559 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 133 transitions, 293 flow [2025-01-10 06:45:45,560 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:45:45,560 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;@234a4c29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:45:45,562 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-01-10 06:45:45,564 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:45:45,564 INFO L124 PetriNetUnfolderBase]: 1/10 cut-off events. [2025-01-10 06:45:45,564 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:45:45,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:45,565 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:45:45,565 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 06:45:45,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:45,566 INFO L85 PathProgramCache]: Analyzing trace with hash 587262726, now seen corresponding path program 1 times [2025-01-10 06:45:45,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:45,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620322395] [2025-01-10 06:45:45,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:45:45,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:45,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:45:45,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:45:45,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:45,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:45:45,607 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,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:45:45,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620322395] [2025-01-10 06:45:45,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620322395] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:45:45,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:45:45,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:45:45,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538684912] [2025-01-10 06:45:45,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:45:45,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:45:45,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:45:45,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:45:45,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:45:45,613 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 133 [2025-01-10 06:45:45,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 133 transitions, 293 flow. Second operand has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 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,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:45:45,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 133 [2025-01-10 06:45:45,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:45:54,252 INFO L124 PetriNetUnfolderBase]: 86447/153025 cut-off events. [2025-01-10 06:45:54,252 INFO L125 PetriNetUnfolderBase]: For 1911/1911 co-relation queries the response was YES. [2025-01-10 06:45:54,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 271744 conditions, 153025 events. 86447/153025 cut-off events. For 1911/1911 co-relation queries the response was YES. Maximal size of possible extension queue 3550. Compared 1598383 event pairs, 52468 based on Foata normal form. 31112/168963 useless extension candidates. Maximal degree in co-relation 17771. Up to 117557 conditions per place. [2025-01-10 06:45:55,241 INFO L140 encePairwiseOnDemand]: 107/133 looper letters, 78 selfloop transitions, 3 changer transitions 0/138 dead transitions. [2025-01-10 06:45:55,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 138 transitions, 465 flow [2025-01-10 06:45:55,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:45:55,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:45:55,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 344 transitions. [2025-01-10 06:45:55,242 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6466165413533834 [2025-01-10 06:45:55,242 INFO L175 Difference]: Start difference. First operand has 114 places, 133 transitions, 293 flow. Second operand 4 states and 344 transitions. [2025-01-10 06:45:55,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 138 transitions, 465 flow [2025-01-10 06:45:55,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 138 transitions, 465 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:45:55,246 INFO L231 Difference]: Finished difference. Result has 119 places, 115 transitions, 277 flow [2025-01-10 06:45:55,246 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=277, PETRI_PLACES=119, PETRI_TRANSITIONS=115} [2025-01-10 06:45:55,247 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 5 predicate places. [2025-01-10 06:45:55,247 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 115 transitions, 277 flow [2025-01-10 06:45:55,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 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:55,247 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:55,247 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:45:55,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:45:55,248 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 06:45:55,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:55,248 INFO L85 PathProgramCache]: Analyzing trace with hash -331972751, now seen corresponding path program 1 times [2025-01-10 06:45:55,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:55,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632326887] [2025-01-10 06:45:55,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:45:55,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:55,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:45:55,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:45:55,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:55,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:45:55,305 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:55,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:45:55,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632326887] [2025-01-10 06:45:55,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632326887] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:45:55,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:45:55,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:45:55,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244040098] [2025-01-10 06:45:55,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:45:55,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:45:55,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:45:55,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:45:55,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:45:55,315 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 133 [2025-01-10 06:45:55,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 115 transitions, 277 flow. Second operand has 6 states, 6 states have (on average 58.5) internal successors, (351), 6 states have internal predecessors, (351), 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:55,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:45:55,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 133 [2025-01-10 06:45:55,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:46:02,501 INFO L124 PetriNetUnfolderBase]: 71934/125227 cut-off events. [2025-01-10 06:46:02,502 INFO L125 PetriNetUnfolderBase]: For 8821/8821 co-relation queries the response was YES. [2025-01-10 06:46:02,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229845 conditions, 125227 events. 71934/125227 cut-off events. For 8821/8821 co-relation queries the response was YES. Maximal size of possible extension queue 2835. Compared 1262625 event pairs, 7896 based on Foata normal form. 1872/114780 useless extension candidates. Maximal degree in co-relation 19473. Up to 63134 conditions per place. [2025-01-10 06:46:03,269 INFO L140 encePairwiseOnDemand]: 128/133 looper letters, 140 selfloop transitions, 6 changer transitions 0/203 dead transitions. [2025-01-10 06:46:03,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 203 transitions, 743 flow [2025-01-10 06:46:03,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:46:03,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:46:03,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 489 transitions. [2025-01-10 06:46:03,271 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6127819548872181 [2025-01-10 06:46:03,271 INFO L175 Difference]: Start difference. First operand has 119 places, 115 transitions, 277 flow. Second operand 6 states and 489 transitions. [2025-01-10 06:46:03,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 203 transitions, 743 flow [2025-01-10 06:46:03,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 203 transitions, 741 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:46:03,279 INFO L231 Difference]: Finished difference. Result has 122 places, 114 transitions, 283 flow [2025-01-10 06:46:03,279 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=283, PETRI_PLACES=122, PETRI_TRANSITIONS=114} [2025-01-10 06:46:03,279 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 8 predicate places. [2025-01-10 06:46:03,280 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 114 transitions, 283 flow [2025-01-10 06:46:03,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 58.5) internal successors, (351), 6 states have internal predecessors, (351), 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:03,280 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:46:03,280 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:46:03,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:46:03,280 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 06:46:03,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:46:03,281 INFO L85 PathProgramCache]: Analyzing trace with hash -602211695, now seen corresponding path program 1 times [2025-01-10 06:46:03,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:46:03,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951164030] [2025-01-10 06:46:03,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:46:03,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:46:03,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:46:03,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:46:03,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:03,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:46:03,340 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:03,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:46:03,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951164030] [2025-01-10 06:46:03,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951164030] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:46:03,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:46:03,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:46:03,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909363042] [2025-01-10 06:46:03,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:46:03,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:46:03,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:46:03,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:46:03,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:46:03,347 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 133 [2025-01-10 06:46:03,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 114 transitions, 283 flow. Second operand has 4 states, 4 states have (on average 59.75) internal successors, (239), 4 states have internal predecessors, (239), 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:03,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:46:03,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 133 [2025-01-10 06:46:03,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:46:15,616 INFO L124 PetriNetUnfolderBase]: 123460/213529 cut-off events. [2025-01-10 06:46:15,616 INFO L125 PetriNetUnfolderBase]: For 18650/20898 co-relation queries the response was YES. [2025-01-10 06:46:16,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 392961 conditions, 213529 events. 123460/213529 cut-off events. For 18650/20898 co-relation queries the response was YES. Maximal size of possible extension queue 4971. Compared 2243889 event pairs, 39792 based on Foata normal form. 3005/196353 useless extension candidates. Maximal degree in co-relation 265555. Up to 115524 conditions per place. [2025-01-10 06:46:17,015 INFO L140 encePairwiseOnDemand]: 122/133 looper letters, 174 selfloop transitions, 16 changer transitions 0/248 dead transitions. [2025-01-10 06:46:17,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 248 transitions, 1015 flow [2025-01-10 06:46:17,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:46:17,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:46:17,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 481 transitions. [2025-01-10 06:46:17,016 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7233082706766917 [2025-01-10 06:46:17,016 INFO L175 Difference]: Start difference. First operand has 122 places, 114 transitions, 283 flow. Second operand 5 states and 481 transitions. [2025-01-10 06:46:17,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 248 transitions, 1015 flow [2025-01-10 06:46:17,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 248 transitions, 992 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-01-10 06:46:17,028 INFO L231 Difference]: Finished difference. Result has 126 places, 129 transitions, 399 flow [2025-01-10 06:46:17,029 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=399, PETRI_PLACES=126, PETRI_TRANSITIONS=129} [2025-01-10 06:46:17,029 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 12 predicate places. [2025-01-10 06:46:17,029 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 129 transitions, 399 flow [2025-01-10 06:46:17,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.75) internal successors, (239), 4 states have internal predecessors, (239), 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:17,029 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:46:17,029 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 06:46:17,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:46:17,029 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 06:46:17,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:46:17,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1701220090, now seen corresponding path program 1 times [2025-01-10 06:46:17,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:46:17,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730291331] [2025-01-10 06:46:17,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:46:17,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:46:17,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:46:17,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:46:17,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:17,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:46:17,061 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:17,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:46:17,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730291331] [2025-01-10 06:46:17,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730291331] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:46:17,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:46:17,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:46:17,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33761411] [2025-01-10 06:46:17,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:46:17,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:46:17,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:46:17,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:46:17,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:46:17,067 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 133 [2025-01-10 06:46:17,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 129 transitions, 399 flow. Second operand has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 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:17,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:46:17,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 133 [2025-01-10 06:46:17,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand