./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_37-indirect_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_37-indirect_racing.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 78ae3f0dde82ce244d0cacebded5945a3f759d1f5aeba1d4553a1f59ef165385 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:46:32,315 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:46:32,358 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:32,362 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:46:32,362 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:46:32,377 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:46:32,378 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:46:32,378 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:46:32,378 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:46:32,378 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:46:32,378 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:46:32,379 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:46:32,379 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:46:32,379 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:46:32,379 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:46:32,379 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:46:32,379 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:46:32,379 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:46:32,379 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:46:32,379 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:46:32,380 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:46:32,380 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:46:32,380 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:46:32,380 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:46:32,380 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:46:32,380 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:46:32,380 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:46:32,380 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:46:32,380 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:46:32,380 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:46:32,380 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:46:32,381 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:46:32,381 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:46:32,381 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:46:32,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:46:32,381 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:46:32,381 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:46:32,381 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:46:32,381 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:46:32,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:46:32,381 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:46:32,382 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:46:32,382 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:46:32,382 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:46:32,382 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:46:32,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:46:32,382 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:46:32,382 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:46:32,382 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:46:32,382 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:46:32,382 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 -> 78ae3f0dde82ce244d0cacebded5945a3f759d1f5aeba1d4553a1f59ef165385 [2025-01-10 06:46:32,615 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:46:32,623 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:46:32,625 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:46:32,626 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:46:32,626 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:46:32,628 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_37-indirect_racing.i [2025-01-10 06:46:33,744 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2c3132434/f5dbf3dc6e6d4e388e55aa3f1ee332bf/FLAG4c32a2bbf [2025-01-10 06:46:34,036 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:46:34,036 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_37-indirect_racing.i [2025-01-10 06:46:34,046 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2c3132434/f5dbf3dc6e6d4e388e55aa3f1ee332bf/FLAG4c32a2bbf [2025-01-10 06:46:34,057 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2c3132434/f5dbf3dc6e6d4e388e55aa3f1ee332bf [2025-01-10 06:46:34,059 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:46:34,060 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:46:34,061 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:46:34,061 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:46:34,063 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:46:34,064 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:46:34" (1/1) ... [2025-01-10 06:46:34,065 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45cc5b2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:34, skipping insertion in model container [2025-01-10 06:46:34,065 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:46:34" (1/1) ... [2025-01-10 06:46:34,086 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:46:34,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:46:34,296 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:46:34,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:46:34,359 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:46:34,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:34 WrapperNode [2025-01-10 06:46:34,360 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:46:34,361 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:46:34,361 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:46:34,361 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:46:34,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:34" (1/1) ... [2025-01-10 06:46:34,375 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:34" (1/1) ... [2025-01-10 06:46:34,389 INFO L138 Inliner]: procedures = 171, calls = 41, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 77 [2025-01-10 06:46:34,390 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:46:34,390 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:46:34,391 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:46:34,391 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:46:34,397 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:34" (1/1) ... [2025-01-10 06:46:34,397 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:34" (1/1) ... [2025-01-10 06:46:34,399 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:34" (1/1) ... [2025-01-10 06:46:34,409 INFO L175 MemorySlicer]: Split 20 memory accesses to 5 slices as follows [2, 5, 6, 5, 2]. 30 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 1, 5, 0]. The 3 writes are split as follows [0, 0, 2, 0, 1]. [2025-01-10 06:46:34,409 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:34" (1/1) ... [2025-01-10 06:46:34,409 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:34" (1/1) ... [2025-01-10 06:46:34,414 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:34" (1/1) ... [2025-01-10 06:46:34,415 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:34" (1/1) ... [2025-01-10 06:46:34,418 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:34" (1/1) ... [2025-01-10 06:46:34,422 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:34" (1/1) ... [2025-01-10 06:46:34,423 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:34" (1/1) ... [2025-01-10 06:46:34,425 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:46:34,426 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:46:34,426 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:46:34,426 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:46:34,427 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:34" (1/1) ... [2025-01-10 06:46:34,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:46:34,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:46:34,455 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 06:46:34,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 06:46:34,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:46:34,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:46:34,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 06:46:34,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 06:46:34,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-10 06:46:34,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:46:34,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:46:34,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 06:46:34,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 06:46:34,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-10 06:46:34,477 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 06:46:34,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:46:34,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 06:46:34,478 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-10 06:46:34,478 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-10 06:46:34,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 06:46:34,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:46:34,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:46:34,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 06:46:34,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 06:46:34,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-10 06:46:34,478 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 06:46:34,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:46:34,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:46:34,479 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 06:46:34,578 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:46:34,579 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:46:34,745 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:46:34,745 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:46:34,876 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:46:34,876 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-10 06:46:34,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:46:34 BoogieIcfgContainer [2025-01-10 06:46:34,877 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:46:34,878 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:46:34,878 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:46:34,882 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:46:34,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:46:34" (1/3) ... [2025-01-10 06:46:34,884 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@390f9002 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:46:34, skipping insertion in model container [2025-01-10 06:46:34,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:34" (2/3) ... [2025-01-10 06:46:34,885 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@390f9002 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:46:34, skipping insertion in model container [2025-01-10 06:46:34,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:46:34" (3/3) ... [2025-01-10 06:46:34,886 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_37-indirect_racing.i [2025-01-10 06:46:34,900 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:46:34,901 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_37-indirect_racing.i that has 2 procedures, 48 locations, 1 initial locations, 6 loop locations, and 8 error locations. [2025-01-10 06:46:34,901 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:46:34,944 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-10 06:46:34,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 57 transitions, 121 flow [2025-01-10 06:46:35,006 INFO L124 PetriNetUnfolderBase]: 11/69 cut-off events. [2025-01-10 06:46:35,009 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 06:46:35,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 69 events. 11/69 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 194 event pairs, 0 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 48. Up to 4 conditions per place. [2025-01-10 06:46:35,013 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 57 transitions, 121 flow [2025-01-10 06:46:35,016 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 56 transitions, 119 flow [2025-01-10 06:46:35,024 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:46:35,036 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;@17cf5b49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:46:35,037 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-01-10 06:46:35,041 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:46:35,042 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-01-10 06:46:35,042 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:46:35,042 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:46:35,042 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:46:35,044 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:46:35,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:46:35,049 INFO L85 PathProgramCache]: Analyzing trace with hash 348478832, now seen corresponding path program 1 times [2025-01-10 06:46:35,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:46:35,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871815216] [2025-01-10 06:46:35,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:46:35,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:46:35,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:46:35,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:46:35,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:35,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:46:35,294 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:35,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:46:35,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871815216] [2025-01-10 06:46:35,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871815216] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:46:35,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:46:35,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:46:35,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087204754] [2025-01-10 06:46:35,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:46:35,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:46:35,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:46:35,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:46:35,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:46:35,336 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 57 [2025-01-10 06:46:35,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 56 transitions, 119 flow. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:46:35,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:46:35,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 57 [2025-01-10 06:46:35,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:46:35,538 INFO L124 PetriNetUnfolderBase]: 99/301 cut-off events. [2025-01-10 06:46:35,538 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 06:46:35,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 529 conditions, 301 events. 99/301 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1381 event pairs, 0 based on Foata normal form. 64/334 useless extension candidates. Maximal degree in co-relation 499. Up to 186 conditions per place. [2025-01-10 06:46:35,541 INFO L140 encePairwiseOnDemand]: 43/57 looper letters, 43 selfloop transitions, 3 changer transitions 0/69 dead transitions. [2025-01-10 06:46:35,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 69 transitions, 237 flow [2025-01-10 06:46:35,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:46:35,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:46:35,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 161 transitions. [2025-01-10 06:46:35,553 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.706140350877193 [2025-01-10 06:46:35,556 INFO L175 Difference]: Start difference. First operand has 51 places, 56 transitions, 119 flow. Second operand 4 states and 161 transitions. [2025-01-10 06:46:35,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 69 transitions, 237 flow [2025-01-10 06:46:35,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 69 transitions, 237 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:46:35,564 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 109 flow [2025-01-10 06:46:35,566 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=109, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2025-01-10 06:46:35,569 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 2 predicate places. [2025-01-10 06:46:35,570 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 109 flow [2025-01-10 06:46:35,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:46:35,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:46:35,571 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:46:35,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:46:35,571 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:46:35,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:46:35,571 INFO L85 PathProgramCache]: Analyzing trace with hash 597297094, now seen corresponding path program 1 times [2025-01-10 06:46:35,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:46:35,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732342621] [2025-01-10 06:46:35,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:46:35,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:46:35,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:46:35,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:46:35,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:35,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:46:35,600 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:46:35,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:46:35,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:46:35,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:35,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:46:35,630 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:46:35,630 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:46:35,631 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-01-10 06:46:35,633 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2025-01-10 06:46:35,633 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2025-01-10 06:46:35,633 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2025-01-10 06:46:35,634 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2025-01-10 06:46:35,634 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2025-01-10 06:46:35,634 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2025-01-10 06:46:35,634 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2025-01-10 06:46:35,634 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2025-01-10 06:46:35,634 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2025-01-10 06:46:35,634 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2025-01-10 06:46:35,634 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2025-01-10 06:46:35,634 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2025-01-10 06:46:35,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:46:35,634 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-10 06:46:35,638 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:46:35,638 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-10 06:46:35,659 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 06:46:35,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 90 transitions, 196 flow [2025-01-10 06:46:35,679 INFO L124 PetriNetUnfolderBase]: 21/133 cut-off events. [2025-01-10 06:46:35,679 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-10 06:46:35,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 133 events. 21/133 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 490 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 88. Up to 6 conditions per place. [2025-01-10 06:46:35,680 INFO L82 GeneralOperation]: Start removeDead. Operand has 79 places, 90 transitions, 196 flow [2025-01-10 06:46:35,681 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 90 transitions, 196 flow [2025-01-10 06:46:35,682 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:46:35,683 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;@17cf5b49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:46:35,683 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-01-10 06:46:35,685 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:46:35,685 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-01-10 06:46:35,685 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:46:35,685 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:46:35,685 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:46:35,686 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 06:46:35,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:46:35,686 INFO L85 PathProgramCache]: Analyzing trace with hash 434396073, now seen corresponding path program 1 times [2025-01-10 06:46:35,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:46:35,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658089174] [2025-01-10 06:46:35,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:46:35,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:46:35,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:46:35,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:46:35,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:35,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:46:35,757 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:35,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:46:35,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658089174] [2025-01-10 06:46:35,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658089174] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:46:35,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:46:35,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:46:35,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198175338] [2025-01-10 06:46:35,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:46:35,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:46:35,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:46:35,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:46:35,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:46:35,767 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 90 [2025-01-10 06:46:35,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 90 transitions, 196 flow. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:46:35,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:46:35,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 90 [2025-01-10 06:46:35,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:46:36,581 INFO L124 PetriNetUnfolderBase]: 3203/7079 cut-off events. [2025-01-10 06:46:36,581 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2025-01-10 06:46:36,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12264 conditions, 7079 events. 3203/7079 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 59605 event pairs, 1496 based on Foata normal form. 1367/7624 useless extension candidates. Maximal degree in co-relation 977. Up to 5081 conditions per place. [2025-01-10 06:46:36,629 INFO L140 encePairwiseOnDemand]: 70/90 looper letters, 61 selfloop transitions, 3 changer transitions 0/101 dead transitions. [2025-01-10 06:46:36,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 101 transitions, 346 flow [2025-01-10 06:46:36,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:46:36,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:46:36,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 241 transitions. [2025-01-10 06:46:36,632 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6694444444444444 [2025-01-10 06:46:36,632 INFO L175 Difference]: Start difference. First operand has 79 places, 90 transitions, 196 flow. Second operand 4 states and 241 transitions. [2025-01-10 06:46:36,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 101 transitions, 346 flow [2025-01-10 06:46:36,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 101 transitions, 346 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:46:36,635 INFO L231 Difference]: Finished difference. Result has 84 places, 78 transitions, 192 flow [2025-01-10 06:46:36,636 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=192, PETRI_PLACES=84, PETRI_TRANSITIONS=78} [2025-01-10 06:46:36,636 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 5 predicate places. [2025-01-10 06:46:36,636 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 78 transitions, 192 flow [2025-01-10 06:46:36,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:46:36,637 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:46:36,637 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:46:36,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:46:36,637 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:46:36,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:46:36,637 INFO L85 PathProgramCache]: Analyzing trace with hash -131441946, now seen corresponding path program 1 times [2025-01-10 06:46:36,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:46:36,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911149819] [2025-01-10 06:46:36,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:46:36,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:46:36,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:46:36,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:46:36,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:36,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:46:36,723 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:36,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:46:36,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911149819] [2025-01-10 06:46:36,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911149819] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:46:36,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:46:36,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:46:36,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317296581] [2025-01-10 06:46:36,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:46:36,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:46:36,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:46:36,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:46:36,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:46:36,769 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 90 [2025-01-10 06:46:36,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 78 transitions, 192 flow. Second operand has 6 states, 6 states have (on average 38.5) internal successors, (231), 6 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:46:36,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:46:36,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 90 [2025-01-10 06:46:36,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:46:37,466 INFO L124 PetriNetUnfolderBase]: 2940/5988 cut-off events. [2025-01-10 06:46:37,466 INFO L125 PetriNetUnfolderBase]: For 628/628 co-relation queries the response was YES. [2025-01-10 06:46:37,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11407 conditions, 5988 events. 2940/5988 cut-off events. For 628/628 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 46615 event pairs, 384 based on Foata normal form. 144/5637 useless extension candidates. Maximal degree in co-relation 1913. Up to 2721 conditions per place. [2025-01-10 06:46:37,512 INFO L140 encePairwiseOnDemand]: 85/90 looper letters, 101 selfloop transitions, 6 changer transitions 0/144 dead transitions. [2025-01-10 06:46:37,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 144 transitions, 536 flow [2025-01-10 06:46:37,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:46:37,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:46:37,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 330 transitions. [2025-01-10 06:46:37,516 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2025-01-10 06:46:37,516 INFO L175 Difference]: Start difference. First operand has 84 places, 78 transitions, 192 flow. Second operand 6 states and 330 transitions. [2025-01-10 06:46:37,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 144 transitions, 536 flow [2025-01-10 06:46:37,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 144 transitions, 534 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:46:37,522 INFO L231 Difference]: Finished difference. Result has 87 places, 77 transitions, 198 flow [2025-01-10 06:46:37,523 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=198, PETRI_PLACES=87, PETRI_TRANSITIONS=77} [2025-01-10 06:46:37,524 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 8 predicate places. [2025-01-10 06:46:37,524 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 77 transitions, 198 flow [2025-01-10 06:46:37,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.5) internal successors, (231), 6 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:46:37,525 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:46:37,525 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:46:37,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:46:37,525 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:46:37,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:46:37,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1418144782, now seen corresponding path program 1 times [2025-01-10 06:46:37,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:46:37,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157835297] [2025-01-10 06:46:37,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:46:37,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:46:37,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:46:37,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:46:37,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:37,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:46:37,707 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:37,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:46:37,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157835297] [2025-01-10 06:46:37,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157835297] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:46:37,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:46:37,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:46:37,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62321823] [2025-01-10 06:46:37,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:46:37,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:46:37,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:46:37,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:46:37,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:46:37,719 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 90 [2025-01-10 06:46:37,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 77 transitions, 198 flow. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:46:37,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:46:37,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 90 [2025-01-10 06:46:37,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:46:38,238 INFO L124 PetriNetUnfolderBase]: 2816/6146 cut-off events. [2025-01-10 06:46:38,238 INFO L125 PetriNetUnfolderBase]: For 1142/1303 co-relation queries the response was YES. [2025-01-10 06:46:38,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11488 conditions, 6146 events. 2816/6146 cut-off events. For 1142/1303 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 49734 event pairs, 911 based on Foata normal form. 121/5719 useless extension candidates. Maximal degree in co-relation 9011. Up to 3985 conditions per place. [2025-01-10 06:46:38,265 INFO L140 encePairwiseOnDemand]: 84/90 looper letters, 83 selfloop transitions, 6 changer transitions 0/127 dead transitions. [2025-01-10 06:46:38,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 127 transitions, 521 flow [2025-01-10 06:46:38,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:46:38,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:46:38,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 280 transitions. [2025-01-10 06:46:38,266 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6222222222222222 [2025-01-10 06:46:38,266 INFO L175 Difference]: Start difference. First operand has 87 places, 77 transitions, 198 flow. Second operand 5 states and 280 transitions. [2025-01-10 06:46:38,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 127 transitions, 521 flow [2025-01-10 06:46:38,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 127 transitions, 498 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-01-10 06:46:38,270 INFO L231 Difference]: Finished difference. Result has 90 places, 82 transitions, 230 flow [2025-01-10 06:46:38,270 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=230, PETRI_PLACES=90, PETRI_TRANSITIONS=82} [2025-01-10 06:46:38,270 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 11 predicate places. [2025-01-10 06:46:38,270 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 82 transitions, 230 flow [2025-01-10 06:46:38,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:46:38,271 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:46:38,271 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 06:46:38,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:46:38,271 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 06:46:38,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:46:38,271 INFO L85 PathProgramCache]: Analyzing trace with hash 220267431, now seen corresponding path program 1 times [2025-01-10 06:46:38,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:46:38,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870687032] [2025-01-10 06:46:38,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:46:38,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:46:38,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:46:38,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:46:38,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:38,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:46:38,312 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:38,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:46:38,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870687032] [2025-01-10 06:46:38,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870687032] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:46:38,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:46:38,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:46:38,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243541794] [2025-01-10 06:46:38,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:46:38,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:46:38,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:46:38,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:46:38,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:46:38,317 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 90 [2025-01-10 06:46:38,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 82 transitions, 230 flow. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:46:38,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:46:38,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 90 [2025-01-10 06:46:38,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:46:38,773 INFO L124 PetriNetUnfolderBase]: 2829/5695 cut-off events. [2025-01-10 06:46:38,773 INFO L125 PetriNetUnfolderBase]: For 1485/1485 co-relation queries the response was YES. [2025-01-10 06:46:38,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11554 conditions, 5695 events. 2829/5695 cut-off events. For 1485/1485 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 43876 event pairs, 397 based on Foata normal form. 152/5574 useless extension candidates. Maximal degree in co-relation 10740. Up to 3339 conditions per place. [2025-01-10 06:46:38,795 INFO L140 encePairwiseOnDemand]: 85/90 looper letters, 93 selfloop transitions, 6 changer transitions 0/136 dead transitions. [2025-01-10 06:46:38,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 136 transitions, 580 flow [2025-01-10 06:46:38,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:46:38,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:46:38,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 231 transitions. [2025-01-10 06:46:38,796 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6416666666666667 [2025-01-10 06:46:38,797 INFO L175 Difference]: Start difference. First operand has 90 places, 82 transitions, 230 flow. Second operand 4 states and 231 transitions. [2025-01-10 06:46:38,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 136 transitions, 580 flow [2025-01-10 06:46:38,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 136 transitions, 576 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-10 06:46:38,805 INFO L231 Difference]: Finished difference. Result has 92 places, 82 transitions, 242 flow [2025-01-10 06:46:38,805 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=242, PETRI_PLACES=92, PETRI_TRANSITIONS=82} [2025-01-10 06:46:38,806 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 13 predicate places. [2025-01-10 06:46:38,806 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 82 transitions, 242 flow [2025-01-10 06:46:38,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:46:38,807 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:46:38,807 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2025-01-10 06:46:38,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:46:38,807 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 06:46:38,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:46:38,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1223617481, now seen corresponding path program 1 times [2025-01-10 06:46:38,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:46:38,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439069119] [2025-01-10 06:46:38,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:46:38,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:46:38,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:46:38,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:46:38,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:38,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:46:38,828 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:46:38,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:46:38,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:46:38,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:38,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:46:38,844 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:46:38,848 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:46:38,848 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2025-01-10 06:46:38,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 17 remaining) [2025-01-10 06:46:38,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 17 remaining) [2025-01-10 06:46:38,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 17 remaining) [2025-01-10 06:46:38,849 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 17 remaining) [2025-01-10 06:46:38,849 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 17 remaining) [2025-01-10 06:46:38,849 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 17 remaining) [2025-01-10 06:46:38,849 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 17 remaining) [2025-01-10 06:46:38,849 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 17 remaining) [2025-01-10 06:46:38,849 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 17 remaining) [2025-01-10 06:46:38,849 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 17 remaining) [2025-01-10 06:46:38,849 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 17 remaining) [2025-01-10 06:46:38,849 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 17 remaining) [2025-01-10 06:46:38,849 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 17 remaining) [2025-01-10 06:46:38,849 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 17 remaining) [2025-01-10 06:46:38,849 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 17 remaining) [2025-01-10 06:46:38,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 17 remaining) [2025-01-10 06:46:38,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:46:38,850 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-10 06:46:38,851 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:46:38,851 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-10 06:46:38,876 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-10 06:46:38,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 123 transitions, 273 flow [2025-01-10 06:46:38,889 INFO L124 PetriNetUnfolderBase]: 34/216 cut-off events. [2025-01-10 06:46:38,890 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-01-10 06:46:38,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 216 events. 34/216 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 881 event pairs, 1 based on Foata normal form. 0/146 useless extension candidates. Maximal degree in co-relation 148. Up to 12 conditions per place. [2025-01-10 06:46:38,891 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 123 transitions, 273 flow [2025-01-10 06:46:38,892 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 123 transitions, 273 flow [2025-01-10 06:46:38,893 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:46:38,893 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;@17cf5b49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:46:38,893 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-01-10 06:46:38,894 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:46:38,894 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-01-10 06:46:38,894 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:46:38,895 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:46:38,895 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:46:38,895 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 06:46:38,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:46:38,895 INFO L85 PathProgramCache]: Analyzing trace with hash 551805379, now seen corresponding path program 1 times [2025-01-10 06:46:38,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:46:38,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362104668] [2025-01-10 06:46:38,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:46:38,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:46:38,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:46:38,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:46:38,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:38,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:46:38,927 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:38,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:46:38,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362104668] [2025-01-10 06:46:38,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362104668] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:46:38,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:46:38,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:46:38,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971320358] [2025-01-10 06:46:38,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:46:38,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:46:38,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:46:38,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:46:38,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:46:38,934 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 123 [2025-01-10 06:46:38,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 123 transitions, 273 flow. Second operand has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:46:38,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:46:38,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 123 [2025-01-10 06:46:38,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:46:45,427 INFO L124 PetriNetUnfolderBase]: 61547/112465 cut-off events. [2025-01-10 06:46:45,427 INFO L125 PetriNetUnfolderBase]: For 1911/1911 co-relation queries the response was YES. [2025-01-10 06:46:45,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199240 conditions, 112465 events. 61547/112465 cut-off events. For 1911/1911 co-relation queries the response was YES. Maximal size of possible extension queue 2793. Compared 1176720 event pairs, 39796 based on Foata normal form. 24272/125139 useless extension candidates. Maximal degree in co-relation 13323. Up to 85613 conditions per place. [2025-01-10 06:46:46,020 INFO L140 encePairwiseOnDemand]: 97/123 looper letters, 74 selfloop transitions, 3 changer transitions 0/128 dead transitions. [2025-01-10 06:46:46,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 128 transitions, 437 flow [2025-01-10 06:46:46,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:46:46,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:46:46,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 316 transitions. [2025-01-10 06:46:46,024 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6422764227642277 [2025-01-10 06:46:46,025 INFO L175 Difference]: Start difference. First operand has 107 places, 123 transitions, 273 flow. Second operand 4 states and 316 transitions. [2025-01-10 06:46:46,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 128 transitions, 437 flow [2025-01-10 06:46:46,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 128 transitions, 437 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:46:46,029 INFO L231 Difference]: Finished difference. Result has 112 places, 105 transitions, 257 flow [2025-01-10 06:46:46,030 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=257, PETRI_PLACES=112, PETRI_TRANSITIONS=105} [2025-01-10 06:46:46,030 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 5 predicate places. [2025-01-10 06:46:46,030 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 105 transitions, 257 flow [2025-01-10 06:46:46,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:46:46,030 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:46:46,030 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:46:46,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:46:46,031 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 06:46:46,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:46:46,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1431051046, now seen corresponding path program 1 times [2025-01-10 06:46:46,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:46:46,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138548020] [2025-01-10 06:46:46,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:46:46,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:46:46,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:46:46,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:46:46,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:46,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:46:46,098 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:46,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:46:46,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138548020] [2025-01-10 06:46:46,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138548020] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:46:46,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:46:46,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:46:46,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398374849] [2025-01-10 06:46:46,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:46:46,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:46:46,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:46:46,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:46:46,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:46:46,109 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 123 [2025-01-10 06:46:46,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 105 transitions, 257 flow. Second operand has 6 states, 6 states have (on average 52.5) internal successors, (315), 6 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:46:46,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:46:46,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 123 [2025-01-10 06:46:46,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:46:51,663 INFO L124 PetriNetUnfolderBase]: 56228/94040 cut-off events. [2025-01-10 06:46:51,663 INFO L125 PetriNetUnfolderBase]: For 7069/7069 co-relation queries the response was YES. [2025-01-10 06:46:51,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181068 conditions, 94040 events. 56228/94040 cut-off events. For 7069/7069 co-relation queries the response was YES. Maximal size of possible extension queue 2163. Compared 883962 event pairs, 8196 based on Foata normal form. 1872/89200 useless extension candidates. Maximal degree in co-relation 15984. Up to 45544 conditions per place. [2025-01-10 06:46:52,327 INFO L140 encePairwiseOnDemand]: 118/123 looper letters, 136 selfloop transitions, 6 changer transitions 0/193 dead transitions. [2025-01-10 06:46:52,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 193 transitions, 715 flow [2025-01-10 06:46:52,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:46:52,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:46:52,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 449 transitions. [2025-01-10 06:46:52,329 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6084010840108401 [2025-01-10 06:46:52,329 INFO L175 Difference]: Start difference. First operand has 112 places, 105 transitions, 257 flow. Second operand 6 states and 449 transitions. [2025-01-10 06:46:52,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 193 transitions, 715 flow [2025-01-10 06:46:52,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 193 transitions, 713 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:46:52,338 INFO L231 Difference]: Finished difference. Result has 115 places, 104 transitions, 263 flow [2025-01-10 06:46:52,338 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=263, PETRI_PLACES=115, PETRI_TRANSITIONS=104} [2025-01-10 06:46:52,338 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 8 predicate places. [2025-01-10 06:46:52,338 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 104 transitions, 263 flow [2025-01-10 06:46:52,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 52.5) internal successors, (315), 6 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:46:52,339 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:46:52,339 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:46:52,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:46:52,339 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:52,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:46:52,339 INFO L85 PathProgramCache]: Analyzing trace with hash -289531667, now seen corresponding path program 1 times [2025-01-10 06:46:52,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:46:52,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501184310] [2025-01-10 06:46:52,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:46:52,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:46:52,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:46:52,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:46:52,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:52,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:46:52,479 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:52,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:46:52,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501184310] [2025-01-10 06:46:52,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501184310] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:46:52,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:46:52,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:46:52,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61141754] [2025-01-10 06:46:52,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:46:52,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:46:52,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:46:52,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:46:52,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:46:52,486 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 123 [2025-01-10 06:46:52,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 104 transitions, 263 flow. Second operand has 4 states, 4 states have (on average 53.75) internal successors, (215), 4 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:46:52,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:46:52,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 123 [2025-01-10 06:46:52,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:46:58,321 INFO L124 PetriNetUnfolderBase]: 56914/100518 cut-off events. [2025-01-10 06:46:58,322 INFO L125 PetriNetUnfolderBase]: For 17853/20101 co-relation queries the response was YES. [2025-01-10 06:46:58,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190430 conditions, 100518 events. 56914/100518 cut-off events. For 17853/20101 co-relation queries the response was YES. Maximal size of possible extension queue 2634. Compared 1002655 event pairs, 23513 based on Foata normal form. 1497/93965 useless extension candidates. Maximal degree in co-relation 126509. Up to 73664 conditions per place. [2025-01-10 06:46:59,105 INFO L140 encePairwiseOnDemand]: 116/123 looper letters, 121 selfloop transitions, 8 changer transitions 0/181 dead transitions. [2025-01-10 06:46:59,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 181 transitions, 744 flow [2025-01-10 06:46:59,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:46:59,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:46:59,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 390 transitions. [2025-01-10 06:46:59,107 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6341463414634146 [2025-01-10 06:46:59,107 INFO L175 Difference]: Start difference. First operand has 115 places, 104 transitions, 263 flow. Second operand 5 states and 390 transitions. [2025-01-10 06:46:59,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 181 transitions, 744 flow [2025-01-10 06:46:59,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 181 transitions, 721 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-01-10 06:46:59,116 INFO L231 Difference]: Finished difference. Result has 118 places, 111 transitions, 312 flow [2025-01-10 06:46:59,116 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=312, PETRI_PLACES=118, PETRI_TRANSITIONS=111} [2025-01-10 06:46:59,117 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 11 predicate places. [2025-01-10 06:46:59,117 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 111 transitions, 312 flow [2025-01-10 06:46:59,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.75) internal successors, (215), 4 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:46:59,117 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:46:59,117 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 06:46:59,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:46:59,117 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:59,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:46:59,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1412910050, now seen corresponding path program 1 times [2025-01-10 06:46:59,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:46:59,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293731824] [2025-01-10 06:46:59,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:46:59,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:46:59,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:46:59,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:46:59,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:59,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:46:59,159 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:59,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:46:59,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293731824] [2025-01-10 06:46:59,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293731824] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:46:59,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:46:59,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:46:59,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154164204] [2025-01-10 06:46:59,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:46:59,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:46:59,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:46:59,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:46:59,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:46:59,164 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 123 [2025-01-10 06:46:59,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 111 transitions, 312 flow. Second operand has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:46:59,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:46:59,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 123 [2025-01-10 06:46:59,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:47:05,471 INFO L124 PetriNetUnfolderBase]: 57606/96241 cut-off events. [2025-01-10 06:47:05,471 INFO L125 PetriNetUnfolderBase]: For 28059/28059 co-relation queries the response was YES. [2025-01-10 06:47:05,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198866 conditions, 96241 events. 57606/96241 cut-off events. For 28059/28059 co-relation queries the response was YES. Maximal size of possible extension queue 2307. Compared 911735 event pairs, 8707 based on Foata normal form. 2136/93963 useless extension candidates. Maximal degree in co-relation 173294. Up to 59362 conditions per place. [2025-01-10 06:47:06,062 INFO L140 encePairwiseOnDemand]: 118/123 looper letters, 134 selfloop transitions, 6 changer transitions 0/191 dead transitions. [2025-01-10 06:47:06,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 191 transitions, 822 flow [2025-01-10 06:47:06,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:47:06,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:47:06,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 322 transitions. [2025-01-10 06:47:06,064 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6544715447154471 [2025-01-10 06:47:06,064 INFO L175 Difference]: Start difference. First operand has 118 places, 111 transitions, 312 flow. Second operand 4 states and 322 transitions. [2025-01-10 06:47:06,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 191 transitions, 822 flow [2025-01-10 06:47:06,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 191 transitions, 818 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-10 06:47:06,226 INFO L231 Difference]: Finished difference. Result has 120 places, 111 transitions, 324 flow [2025-01-10 06:47:06,227 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=324, PETRI_PLACES=120, PETRI_TRANSITIONS=111} [2025-01-10 06:47:06,227 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 13 predicate places. [2025-01-10 06:47:06,227 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 111 transitions, 324 flow [2025-01-10 06:47:06,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:47:06,227 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:47:06,227 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:47:06,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 06:47:06,228 INFO L396 AbstractCegarLoop]: === Iteration 5 === 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:06,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:47:06,228 INFO L85 PathProgramCache]: Analyzing trace with hash -345267092, now seen corresponding path program 1 times [2025-01-10 06:47:06,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:47:06,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069949195] [2025-01-10 06:47:06,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:47:06,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:47:06,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 06:47:06,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 06:47:06,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:06,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:47:06,352 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:06,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:47:06,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069949195] [2025-01-10 06:47:06,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069949195] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:47:06,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:47:06,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:47:06,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061484920] [2025-01-10 06:47:06,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:47:06,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:47:06,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:47:06,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:47:06,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:47:06,359 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 123 [2025-01-10 06:47:06,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 111 transitions, 324 flow. Second operand has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 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,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:47:06,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 123 [2025-01-10 06:47:06,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand