./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_60-invariant_racefree.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_60-invariant_racefree.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 ca8ac8d2a0a0bfcebfb7f99229747142c166641dd0f1bf091ac2b4ae67e9ee75 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:46:59,229 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:46:59,300 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 06:46:59,307 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:46:59,307 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:46:59,339 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:46:59,340 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:46:59,341 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:46:59,341 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:46:59,341 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:46:59,342 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:46:59,342 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:46:59,343 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:46:59,343 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:46:59,343 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:46:59,343 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:46:59,343 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:46:59,344 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:46:59,344 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:46:59,344 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:46:59,344 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:46:59,344 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:46:59,344 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:46:59,344 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:46:59,344 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:46:59,344 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:46:59,344 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:46:59,345 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:46:59,345 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:46:59,345 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:46:59,345 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:46:59,345 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:46:59,345 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:46:59,346 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:46:59,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:46:59,346 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:46:59,346 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:46:59,346 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:46:59,346 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:46:59,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:46:59,346 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:46:59,346 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:46:59,347 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:46:59,347 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:46:59,347 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:46:59,347 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:46:59,347 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:46:59,347 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:46:59,347 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:46:59,347 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:46:59,348 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 -> ca8ac8d2a0a0bfcebfb7f99229747142c166641dd0f1bf091ac2b4ae67e9ee75 [2025-01-10 06:46:59,629 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:46:59,639 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:46:59,641 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:46:59,642 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:46:59,643 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:46:59,645 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_60-invariant_racefree.i [2025-01-10 06:47:00,925 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9466dcc43/a35f4f08d3a94145bccaebe2979fd8c9/FLAG223ac3986 [2025-01-10 06:47:01,299 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:47:01,300 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_60-invariant_racefree.i [2025-01-10 06:47:01,318 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9466dcc43/a35f4f08d3a94145bccaebe2979fd8c9/FLAG223ac3986 [2025-01-10 06:47:01,510 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9466dcc43/a35f4f08d3a94145bccaebe2979fd8c9 [2025-01-10 06:47:01,513 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:47:01,515 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:47:01,517 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:47:01,518 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:47:01,523 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:47:01,524 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:47:01" (1/1) ... [2025-01-10 06:47:01,525 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28828d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:01, skipping insertion in model container [2025-01-10 06:47:01,525 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:47:01" (1/1) ... [2025-01-10 06:47:01,558 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:47:01,888 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:47:01,910 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:47:01,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:47:02,000 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:47:02,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:02 WrapperNode [2025-01-10 06:47:02,003 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:47:02,004 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:47:02,004 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:47:02,004 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:47:02,013 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:47:02" (1/1) ... [2025-01-10 06:47:02,030 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:47:02" (1/1) ... [2025-01-10 06:47:02,057 INFO L138 Inliner]: procedures = 171, calls = 44, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 167 [2025-01-10 06:47:02,058 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:47:02,059 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:47:02,059 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:47:02,059 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:47:02,068 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:02" (1/1) ... [2025-01-10 06:47:02,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:02" (1/1) ... [2025-01-10 06:47:02,073 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:02" (1/1) ... [2025-01-10 06:47:02,093 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 5, 5, 2]. 36 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5, 0]. The 1 writes are split as follows [0, 0, 0, 1]. [2025-01-10 06:47:02,094 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:02" (1/1) ... [2025-01-10 06:47:02,094 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:02" (1/1) ... [2025-01-10 06:47:02,107 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:02" (1/1) ... [2025-01-10 06:47:02,111 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:02" (1/1) ... [2025-01-10 06:47:02,114 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:02" (1/1) ... [2025-01-10 06:47:02,116 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:02" (1/1) ... [2025-01-10 06:47:02,117 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:02" (1/1) ... [2025-01-10 06:47:02,119 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:47:02,119 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:47:02,120 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:47:02,120 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:47:02,120 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:02" (1/1) ... [2025-01-10 06:47:02,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:47:02,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:47:02,162 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:47:02,169 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:47:02,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:47:02,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:47:02,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 06:47:02,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 06:47:02,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:47:02,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:47:02,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 06:47:02,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 06:47:02,189 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 06:47:02,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:47:02,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 06:47:02,189 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-10 06:47:02,189 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-10 06:47:02,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 06:47:02,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:47:02,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:47:02,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 06:47:02,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 06:47:02,190 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 06:47:02,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:47:02,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:47:02,191 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:47:02,323 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:47:02,324 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:47:02,601 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:47:02,601 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:47:02,755 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:47:02,756 INFO L312 CfgBuilder]: Removed 8 assume(true) statements. [2025-01-10 06:47:02,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:47:02 BoogieIcfgContainer [2025-01-10 06:47:02,756 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:47:02,758 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:47:02,759 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:47:02,763 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:47:02,763 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:47:01" (1/3) ... [2025-01-10 06:47:02,765 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1210927f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:47:02, skipping insertion in model container [2025-01-10 06:47:02,765 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:02" (2/3) ... [2025-01-10 06:47:02,765 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1210927f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:47:02, skipping insertion in model container [2025-01-10 06:47:02,765 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:47:02" (3/3) ... [2025-01-10 06:47:02,766 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_60-invariant_racefree.i [2025-01-10 06:47:02,780 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:47:02,782 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_60-invariant_racefree.i that has 2 procedures, 80 locations, 1 initial locations, 10 loop locations, and 12 error locations. [2025-01-10 06:47:02,782 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:47:02,841 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-10 06:47:02,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 98 transitions, 203 flow [2025-01-10 06:47:02,940 INFO L124 PetriNetUnfolderBase]: 26/139 cut-off events. [2025-01-10 06:47:02,943 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 06:47:02,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 139 events. 26/139 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 556 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 89. Up to 6 conditions per place. [2025-01-10 06:47:02,947 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 98 transitions, 203 flow [2025-01-10 06:47:02,952 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 97 transitions, 201 flow [2025-01-10 06:47:02,962 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:47:02,977 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;@4b753dbc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:47:02,978 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-01-10 06:47:02,986 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:47:02,986 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-01-10 06:47:02,986 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:47:02,986 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:47:02,987 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:47:02,988 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:47:02,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:47:02,994 INFO L85 PathProgramCache]: Analyzing trace with hash 479595952, now seen corresponding path program 1 times [2025-01-10 06:47:03,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:47:03,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739040285] [2025-01-10 06:47:03,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:47:03,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:47:03,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:47:03,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:47:03,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:03,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:47:03,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:47:03,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:47:03,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739040285] [2025-01-10 06:47:03,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739040285] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:47:03,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:47:03,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:47:03,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302693687] [2025-01-10 06:47:03,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:47:03,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:47:03,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:47:03,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:47:03,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:47:03,356 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 98 [2025-01-10 06:47:03,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 97 transitions, 201 flow. Second operand has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:47:03,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:47:03,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 98 [2025-01-10 06:47:03,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:47:03,693 INFO L124 PetriNetUnfolderBase]: 301/935 cut-off events. [2025-01-10 06:47:03,694 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 06:47:03,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1580 conditions, 935 events. 301/935 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 5808 event pairs, 0 based on Foata normal form. 201/1068 useless extension candidates. Maximal degree in co-relation 1546. Up to 591 conditions per place. [2025-01-10 06:47:03,702 INFO L140 encePairwiseOnDemand]: 76/98 looper letters, 66 selfloop transitions, 3 changer transitions 0/110 dead transitions. [2025-01-10 06:47:03,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 110 transitions, 365 flow [2025-01-10 06:47:03,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:47:03,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:47:03,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 268 transitions. [2025-01-10 06:47:03,716 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6836734693877551 [2025-01-10 06:47:03,718 INFO L175 Difference]: Start difference. First operand has 83 places, 97 transitions, 201 flow. Second operand 4 states and 268 transitions. [2025-01-10 06:47:03,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 110 transitions, 365 flow [2025-01-10 06:47:03,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 110 transitions, 365 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:47:03,731 INFO L231 Difference]: Finished difference. Result has 85 places, 79 transitions, 175 flow [2025-01-10 06:47:03,734 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=175, PETRI_PLACES=85, PETRI_TRANSITIONS=79} [2025-01-10 06:47:03,737 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 2 predicate places. [2025-01-10 06:47:03,737 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 79 transitions, 175 flow [2025-01-10 06:47:03,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:47:03,737 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:47:03,737 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:47:03,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:47:03,739 INFO L396 AbstractCegarLoop]: === Iteration 2 === 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:47:03,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:47:03,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1712724274, now seen corresponding path program 1 times [2025-01-10 06:47:03,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:47:03,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987426012] [2025-01-10 06:47:03,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:47:03,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:47:03,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:47:03,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:47:03,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:03,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:47:03,777 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:47:03,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:47:03,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:47:03,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:03,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:47:03,818 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:47:03,818 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:47:03,820 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2025-01-10 06:47:03,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 17 remaining) [2025-01-10 06:47:03,824 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 17 remaining) [2025-01-10 06:47:03,824 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 17 remaining) [2025-01-10 06:47:03,824 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 17 remaining) [2025-01-10 06:47:03,824 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 17 remaining) [2025-01-10 06:47:03,824 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 17 remaining) [2025-01-10 06:47:03,825 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 17 remaining) [2025-01-10 06:47:03,825 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 17 remaining) [2025-01-10 06:47:03,825 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 17 remaining) [2025-01-10 06:47:03,825 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 17 remaining) [2025-01-10 06:47:03,825 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 17 remaining) [2025-01-10 06:47:03,825 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 17 remaining) [2025-01-10 06:47:03,825 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 17 remaining) [2025-01-10 06:47:03,825 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 17 remaining) [2025-01-10 06:47:03,826 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 17 remaining) [2025-01-10 06:47:03,826 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 17 remaining) [2025-01-10 06:47:03,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:47:03,826 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-10 06:47:03,829 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:47:03,830 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-10 06:47:03,869 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 06:47:03,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 143 transitions, 302 flow [2025-01-10 06:47:03,899 INFO L124 PetriNetUnfolderBase]: 45/244 cut-off events. [2025-01-10 06:47:03,900 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-10 06:47:03,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256 conditions, 244 events. 45/244 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1125 event pairs, 0 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 147. Up to 9 conditions per place. [2025-01-10 06:47:03,904 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 143 transitions, 302 flow [2025-01-10 06:47:03,909 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 143 transitions, 302 flow [2025-01-10 06:47:03,910 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:47:03,910 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;@4b753dbc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:47:03,910 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-01-10 06:47:03,914 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:47:03,914 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-01-10 06:47:03,915 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:47:03,915 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:47:03,915 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:47:03,915 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:47:03,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:47:03,917 INFO L85 PathProgramCache]: Analyzing trace with hash 616102890, now seen corresponding path program 1 times [2025-01-10 06:47:03,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:47:03,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050931396] [2025-01-10 06:47:03,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:47:03,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:47:03,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:47:03,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:47:03,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:03,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:47:04,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:47:04,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:47:04,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050931396] [2025-01-10 06:47:04,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050931396] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:47:04,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:47:04,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:47:04,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000587840] [2025-01-10 06:47:04,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:47:04,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:47:04,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:47:04,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:47:04,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:47:04,012 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 143 [2025-01-10 06:47:04,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 143 transitions, 302 flow. Second operand has 4 states, 4 states have (on average 62.25) internal successors, (249), 4 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:47:04,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:47:04,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 143 [2025-01-10 06:47:04,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:47:06,552 INFO L124 PetriNetUnfolderBase]: 11954/25295 cut-off events. [2025-01-10 06:47:06,552 INFO L125 PetriNetUnfolderBase]: For 109/109 co-relation queries the response was YES. [2025-01-10 06:47:06,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43523 conditions, 25295 events. 11954/25295 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 638. Compared 246832 event pairs, 9210 based on Foata normal form. 5056/28240 useless extension candidates. Maximal degree in co-relation 21179. Up to 18092 conditions per place. [2025-01-10 06:47:06,860 INFO L140 encePairwiseOnDemand]: 113/143 looper letters, 88 selfloop transitions, 3 changer transitions 0/152 dead transitions. [2025-01-10 06:47:06,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 152 transitions, 502 flow [2025-01-10 06:47:06,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:47:06,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:47:06,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 378 transitions. [2025-01-10 06:47:06,865 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6608391608391608 [2025-01-10 06:47:06,865 INFO L175 Difference]: Start difference. First operand has 120 places, 143 transitions, 302 flow. Second operand 4 states and 378 transitions. [2025-01-10 06:47:06,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 152 transitions, 502 flow [2025-01-10 06:47:06,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 152 transitions, 502 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:47:06,872 INFO L231 Difference]: Finished difference. Result has 125 places, 121 transitions, 278 flow [2025-01-10 06:47:06,873 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=278, PETRI_PLACES=125, PETRI_TRANSITIONS=121} [2025-01-10 06:47:06,874 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 5 predicate places. [2025-01-10 06:47:06,874 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 121 transitions, 278 flow [2025-01-10 06:47:06,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.25) internal successors, (249), 4 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:47:06,874 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:47:06,874 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:47:06,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:47:06,875 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:47:06,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:47:06,875 INFO L85 PathProgramCache]: Analyzing trace with hash 279543900, now seen corresponding path program 1 times [2025-01-10 06:47:06,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:47:06,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164639870] [2025-01-10 06:47:06,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:47:06,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:47:06,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:47:06,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:47:06,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:06,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:47:07,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:47:07,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:47:07,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164639870] [2025-01-10 06:47:07,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164639870] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:47:07,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:47:07,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:47:07,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982578270] [2025-01-10 06:47:07,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:47:07,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:47:07,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:47:07,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:47:07,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:47:07,030 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 143 [2025-01-10 06:47:07,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 121 transitions, 278 flow. Second operand has 6 states, 6 states have (on average 62.5) internal successors, (375), 6 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:47:07,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:47:07,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 143 [2025-01-10 06:47:07,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:47:09,321 INFO L124 PetriNetUnfolderBase]: 10794/22408 cut-off events. [2025-01-10 06:47:09,322 INFO L125 PetriNetUnfolderBase]: For 1104/1104 co-relation queries the response was YES. [2025-01-10 06:47:09,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40370 conditions, 22408 events. 10794/22408 cut-off events. For 1104/1104 co-relation queries the response was YES. Maximal size of possible extension queue 575. Compared 214586 event pairs, 448 based on Foata normal form. 256/21329 useless extension candidates. Maximal degree in co-relation 3280. Up to 13216 conditions per place. [2025-01-10 06:47:09,467 INFO L140 encePairwiseOnDemand]: 138/143 looper letters, 144 selfloop transitions, 6 changer transitions 0/211 dead transitions. [2025-01-10 06:47:09,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 211 transitions, 756 flow [2025-01-10 06:47:09,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:47:09,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:47:09,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 517 transitions. [2025-01-10 06:47:09,470 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6025641025641025 [2025-01-10 06:47:09,470 INFO L175 Difference]: Start difference. First operand has 125 places, 121 transitions, 278 flow. Second operand 6 states and 517 transitions. [2025-01-10 06:47:09,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 211 transitions, 756 flow [2025-01-10 06:47:09,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 211 transitions, 754 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:47:09,481 INFO L231 Difference]: Finished difference. Result has 128 places, 120 transitions, 284 flow [2025-01-10 06:47:09,482 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=284, PETRI_PLACES=128, PETRI_TRANSITIONS=120} [2025-01-10 06:47:09,483 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 8 predicate places. [2025-01-10 06:47:09,484 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 120 transitions, 284 flow [2025-01-10 06:47:09,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 62.5) internal successors, (375), 6 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:47:09,485 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:47:09,485 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 06:47:09,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:47:09,485 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 06:47:09,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:47:09,486 INFO L85 PathProgramCache]: Analyzing trace with hash 75926916, now seen corresponding path program 1 times [2025-01-10 06:47:09,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:47:09,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934046887] [2025-01-10 06:47:09,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:47:09,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:47:09,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:47:09,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:47:09,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:09,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:47:09,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:47:09,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:47:09,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934046887] [2025-01-10 06:47:09,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934046887] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:47:09,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:47:09,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:47:09,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214748007] [2025-01-10 06:47:09,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:47:09,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:47:09,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:47:09,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:47:09,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:47:09,577 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 143 [2025-01-10 06:47:09,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 120 transitions, 284 flow. Second operand has 4 states, 4 states have (on average 63.25) internal successors, (253), 4 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:47:09,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:47:09,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 143 [2025-01-10 06:47:09,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:47:10,886 INFO L124 PetriNetUnfolderBase]: 10315/21281 cut-off events. [2025-01-10 06:47:10,886 INFO L125 PetriNetUnfolderBase]: For 2015/2015 co-relation queries the response was YES. [2025-01-10 06:47:11,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39081 conditions, 21281 events. 10315/21281 cut-off events. For 2015/2015 co-relation queries the response was YES. Maximal size of possible extension queue 559. Compared 201089 event pairs, 465 based on Foata normal form. 256/20516 useless extension candidates. Maximal degree in co-relation 17685. Up to 13983 conditions per place. [2025-01-10 06:47:11,098 INFO L140 encePairwiseOnDemand]: 138/143 looper letters, 113 selfloop transitions, 6 changer transitions 0/180 dead transitions. [2025-01-10 06:47:11,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 180 transitions, 640 flow [2025-01-10 06:47:11,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:47:11,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:47:11,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 362 transitions. [2025-01-10 06:47:11,100 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6328671328671329 [2025-01-10 06:47:11,100 INFO L175 Difference]: Start difference. First operand has 128 places, 120 transitions, 284 flow. Second operand 4 states and 362 transitions. [2025-01-10 06:47:11,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 180 transitions, 640 flow [2025-01-10 06:47:11,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 180 transitions, 624 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-01-10 06:47:11,115 INFO L231 Difference]: Finished difference. Result has 126 places, 120 transitions, 284 flow [2025-01-10 06:47:11,116 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=284, PETRI_PLACES=126, PETRI_TRANSITIONS=120} [2025-01-10 06:47:11,116 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 6 predicate places. [2025-01-10 06:47:11,117 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 120 transitions, 284 flow [2025-01-10 06:47:11,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.25) internal successors, (253), 4 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:47:11,118 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:47:11,118 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:47:11,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:47:11,118 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 06:47:11,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:47:11,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1997950484, now seen corresponding path program 1 times [2025-01-10 06:47:11,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:47:11,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612759210] [2025-01-10 06:47:11,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:47:11,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:47:11,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:47:11,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:47:11,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:11,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:47:11,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:47:11,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:47:11,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612759210] [2025-01-10 06:47:11,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612759210] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:47:11,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:47:11,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:47:11,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119226082] [2025-01-10 06:47:11,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:47:11,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:47:11,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:47:11,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:47:11,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:47:11,166 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 143 [2025-01-10 06:47:11,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 120 transitions, 284 flow. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:47:11,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:47:11,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 143 [2025-01-10 06:47:11,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:47:12,774 INFO L124 PetriNetUnfolderBase]: 13607/28316 cut-off events. [2025-01-10 06:47:12,775 INFO L125 PetriNetUnfolderBase]: For 695/695 co-relation queries the response was YES. [2025-01-10 06:47:12,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50067 conditions, 28316 events. 13607/28316 cut-off events. For 695/695 co-relation queries the response was YES. Maximal size of possible extension queue 693. Compared 271366 event pairs, 5599 based on Foata normal form. 0/26235 useless extension candidates. Maximal degree in co-relation 28638. Up to 10799 conditions per place. [2025-01-10 06:47:12,944 INFO L140 encePairwiseOnDemand]: 129/143 looper letters, 96 selfloop transitions, 12 changer transitions 0/167 dead transitions. [2025-01-10 06:47:12,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 167 transitions, 600 flow [2025-01-10 06:47:12,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:47:12,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:47:12,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 288 transitions. [2025-01-10 06:47:12,946 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6713286713286714 [2025-01-10 06:47:12,946 INFO L175 Difference]: Start difference. First operand has 126 places, 120 transitions, 284 flow. Second operand 3 states and 288 transitions. [2025-01-10 06:47:12,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 167 transitions, 600 flow [2025-01-10 06:47:12,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 167 transitions, 592 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:47:12,951 INFO L231 Difference]: Finished difference. Result has 128 places, 130 transitions, 368 flow [2025-01-10 06:47:12,951 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=368, PETRI_PLACES=128, PETRI_TRANSITIONS=130} [2025-01-10 06:47:12,952 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 8 predicate places. [2025-01-10 06:47:12,952 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 130 transitions, 368 flow [2025-01-10 06:47:12,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:47:12,953 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:47:12,953 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2025-01-10 06:47:12,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:47:12,953 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 06:47:12,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:47:12,953 INFO L85 PathProgramCache]: Analyzing trace with hash -48656516, now seen corresponding path program 1 times [2025-01-10 06:47:12,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:47:12,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069031479] [2025-01-10 06:47:12,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:47:12,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:47:12,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:47:12,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:47:12,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:12,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:47:12,979 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:47:12,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:47:12,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:47:12,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:12,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:47:13,002 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:47:13,004 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:47:13,004 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 21 remaining) [2025-01-10 06:47:13,004 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 21 remaining) [2025-01-10 06:47:13,004 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 21 remaining) [2025-01-10 06:47:13,004 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 21 remaining) [2025-01-10 06:47:13,005 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 21 remaining) [2025-01-10 06:47:13,005 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 21 remaining) [2025-01-10 06:47:13,005 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 21 remaining) [2025-01-10 06:47:13,005 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 21 remaining) [2025-01-10 06:47:13,005 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 21 remaining) [2025-01-10 06:47:13,005 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 21 remaining) [2025-01-10 06:47:13,005 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 21 remaining) [2025-01-10 06:47:13,005 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 21 remaining) [2025-01-10 06:47:13,005 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 21 remaining) [2025-01-10 06:47:13,006 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 21 remaining) [2025-01-10 06:47:13,006 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 21 remaining) [2025-01-10 06:47:13,006 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 21 remaining) [2025-01-10 06:47:13,006 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 21 remaining) [2025-01-10 06:47:13,006 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 21 remaining) [2025-01-10 06:47:13,006 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 21 remaining) [2025-01-10 06:47:13,006 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 21 remaining) [2025-01-10 06:47:13,006 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 21 remaining) [2025-01-10 06:47:13,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:47:13,007 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-10 06:47:13,007 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:47:13,007 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-10 06:47:13,054 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-10 06:47:13,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 188 transitions, 403 flow [2025-01-10 06:47:13,094 INFO L124 PetriNetUnfolderBase]: 67/368 cut-off events. [2025-01-10 06:47:13,094 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-01-10 06:47:13,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 393 conditions, 368 events. 67/368 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1816 event pairs, 1 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 259. Up to 12 conditions per place. [2025-01-10 06:47:13,101 INFO L82 GeneralOperation]: Start removeDead. Operand has 157 places, 188 transitions, 403 flow [2025-01-10 06:47:13,109 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 157 places, 188 transitions, 403 flow [2025-01-10 06:47:13,110 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:47:13,110 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;@4b753dbc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:47:13,112 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-01-10 06:47:13,114 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:47:13,114 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-01-10 06:47:13,114 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:47:13,114 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:47:13,114 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:47:13,114 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-01-10 06:47:13,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:47:13,117 INFO L85 PathProgramCache]: Analyzing trace with hash 795553553, now seen corresponding path program 1 times [2025-01-10 06:47:13,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:47:13,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753767940] [2025-01-10 06:47:13,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:47:13,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:47:13,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:47:13,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:47:13,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:13,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:47:13,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:47:13,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:47:13,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753767940] [2025-01-10 06:47:13,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753767940] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:47:13,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:47:13,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:47:13,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632749331] [2025-01-10 06:47:13,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:47:13,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:47:13,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:47:13,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:47:13,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:47:13,187 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 188 [2025-01-10 06:47:13,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 188 transitions, 403 flow. Second operand has 4 states, 4 states have (on average 82.25) internal successors, (329), 4 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:47:13,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:47:13,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 188 [2025-01-10 06:47:13,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand