./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_12-ptr_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d 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_12-ptr_racefree.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7cd6aaa75855c8ee03a174376352b142cf57dd56532b968b1b6c916585172927 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 14:05:26,422 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:05:26,471 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 14:05:26,474 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:05:26,475 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:05:26,493 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:05:26,495 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:05:26,495 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:05:26,496 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:05:26,496 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:05:26,497 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 14:05:26,497 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 14:05:26,497 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:05:26,497 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:05:26,497 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:05:26,498 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:05:26,498 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 14:05:26,498 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 14:05:26,498 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:05:26,498 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 14:05:26,498 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:05:26,498 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 14:05:26,498 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 14:05:26,498 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 14:05:26,498 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 14:05:26,498 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:05:26,499 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 14:05:26,499 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:05:26,499 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:05:26,499 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:05:26,499 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:05:26,499 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:05:26,499 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 14:05:26,499 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 14:05:26,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:05:26,500 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:05:26,500 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 14:05:26,500 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 14:05:26,500 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 14:05:26,500 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:05:26,500 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 14:05:26,500 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 14:05:26,500 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 14:05:26,500 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 14:05:26,500 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 14:05:26,500 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 -> 7cd6aaa75855c8ee03a174376352b142cf57dd56532b968b1b6c916585172927 [2025-02-08 14:05:26,702 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:05:26,710 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:05:26,712 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:05:26,713 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:05:26,713 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:05:26,714 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_12-ptr_racefree.i [2025-02-08 14:05:27,820 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d372818f5/67e8ddd5ebeb418086922897308c79a7/FLAGd76c6b1ca [2025-02-08 14:05:28,084 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:05:28,086 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_12-ptr_racefree.i [2025-02-08 14:05:28,099 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d372818f5/67e8ddd5ebeb418086922897308c79a7/FLAGd76c6b1ca [2025-02-08 14:05:28,112 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d372818f5/67e8ddd5ebeb418086922897308c79a7 [2025-02-08 14:05:28,114 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:05:28,115 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:05:28,116 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:05:28,116 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:05:28,119 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:05:28,120 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:05:28" (1/1) ... [2025-02-08 14:05:28,122 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e7c1208 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:28, skipping insertion in model container [2025-02-08 14:05:28,122 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:05:28" (1/1) ... [2025-02-08 14:05:28,149 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:05:28,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:05:28,412 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:05:28,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:05:28,483 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:05:28,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:28 WrapperNode [2025-02-08 14:05:28,484 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:05:28,485 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:05:28,485 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:05:28,485 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:05:28,489 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:28" (1/1) ... [2025-02-08 14:05:28,496 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:28" (1/1) ... [2025-02-08 14:05:28,509 INFO L138 Inliner]: procedures = 171, calls = 43, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 134 [2025-02-08 14:05:28,510 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:05:28,510 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:05:28,510 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:05:28,510 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:05:28,516 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:28" (1/1) ... [2025-02-08 14:05:28,516 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:28" (1/1) ... [2025-02-08 14:05:28,519 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:28" (1/1) ... [2025-02-08 14:05:28,534 INFO L175 MemorySlicer]: Split 20 memory accesses to 5 slices as follows [2, 2, 5, 5, 6]. 30 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 0, 5, 5, 1]. The 3 writes are split as follows [0, 1, 0, 0, 2]. [2025-02-08 14:05:28,534 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:28" (1/1) ... [2025-02-08 14:05:28,534 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:28" (1/1) ... [2025-02-08 14:05:28,540 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:28" (1/1) ... [2025-02-08 14:05:28,540 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:28" (1/1) ... [2025-02-08 14:05:28,541 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:28" (1/1) ... [2025-02-08 14:05:28,542 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:28" (1/1) ... [2025-02-08 14:05:28,543 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:05:28,544 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:05:28,544 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:05:28,544 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:05:28,545 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:28" (1/1) ... [2025-02-08 14:05:28,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:05:28,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:05:28,570 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-02-08 14:05:28,572 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-02-08 14:05:28,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 14:05:28,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 14:05:28,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 14:05:28,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 14:05:28,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-08 14:05:28,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 14:05:28,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 14:05:28,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 14:05:28,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 14:05:28,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-08 14:05:28,587 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 14:05:28,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 14:05:28,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 14:05:28,588 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-08 14:05:28,588 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-08 14:05:28,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 14:05:28,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 14:05:28,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 14:05:28,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 14:05:28,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 14:05:28,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-08 14:05:28,588 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 14:05:28,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:05:28,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:05:28,589 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 14:05:28,678 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:05:28,679 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:05:28,824 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L708: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-02-08 14:05:28,824 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L708-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-02-08 14:05:28,861 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 14:05:28,861 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:05:29,035 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:05:29,035 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:05:29,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:05:29 BoogieIcfgContainer [2025-02-08 14:05:29,035 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:05:29,037 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 14:05:29,037 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 14:05:29,040 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 14:05:29,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 02:05:28" (1/3) ... [2025-02-08 14:05:29,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f0aa33d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:05:29, skipping insertion in model container [2025-02-08 14:05:29,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:28" (2/3) ... [2025-02-08 14:05:29,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f0aa33d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:05:29, skipping insertion in model container [2025-02-08 14:05:29,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:05:29" (3/3) ... [2025-02-08 14:05:29,043 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_12-ptr_racefree.i [2025-02-08 14:05:29,051 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 14:05:29,054 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_12-ptr_racefree.i that has 2 procedures, 54 locations, 1 initial locations, 6 loop locations, and 8 error locations. [2025-02-08 14:05:29,054 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 14:05:29,090 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-08 14:05:29,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 63 transitions, 133 flow [2025-02-08 14:05:29,166 INFO L124 PetriNetUnfolderBase]: 11/79 cut-off events. [2025-02-08 14:05:29,169 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 14:05:29,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 79 events. 11/79 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 245 event pairs, 0 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 54. Up to 4 conditions per place. [2025-02-08 14:05:29,172 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 63 transitions, 133 flow [2025-02-08 14:05:29,175 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 62 transitions, 131 flow [2025-02-08 14:05:29,181 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:05:29,187 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;@708cf704, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:05:29,187 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-02-08 14:05:29,191 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:05:29,191 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-02-08 14:05:29,191 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:05:29,191 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:29,191 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 14:05:29,192 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-08 14:05:29,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:29,196 INFO L85 PathProgramCache]: Analyzing trace with hash 420415270, now seen corresponding path program 1 times [2025-02-08 14:05:29,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:29,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775311712] [2025-02-08 14:05:29,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:29,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:29,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:05:29,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:05:29,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:29,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:29,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:05:29,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:29,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775311712] [2025-02-08 14:05:29,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775311712] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:29,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:29,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:05:29,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056378949] [2025-02-08 14:05:29,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:29,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:05:29,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:29,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:05:29,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:05:29,529 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 63 [2025-02-08 14:05:29,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 62 transitions, 131 flow. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 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-02-08 14:05:29,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:29,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 63 [2025-02-08 14:05:29,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:29,713 INFO L124 PetriNetUnfolderBase]: 144/479 cut-off events. [2025-02-08 14:05:29,713 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 14:05:29,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 801 conditions, 479 events. 144/479 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2296 event pairs, 100 based on Foata normal form. 116/543 useless extension candidates. Maximal degree in co-relation 780. Up to 277 conditions per place. [2025-02-08 14:05:29,720 INFO L140 encePairwiseOnDemand]: 49/63 looper letters, 49 selfloop transitions, 3 changer transitions 0/77 dead transitions. [2025-02-08 14:05:29,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 77 transitions, 265 flow [2025-02-08 14:05:29,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:05:29,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:05:29,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2025-02-08 14:05:29,732 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6944444444444444 [2025-02-08 14:05:29,733 INFO L175 Difference]: Start difference. First operand has 57 places, 62 transitions, 131 flow. Second operand 4 states and 175 transitions. [2025-02-08 14:05:29,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 77 transitions, 265 flow [2025-02-08 14:05:29,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 77 transitions, 265 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:05:29,740 INFO L231 Difference]: Finished difference. Result has 59 places, 52 transitions, 121 flow [2025-02-08 14:05:29,741 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=121, PETRI_PLACES=59, PETRI_TRANSITIONS=52} [2025-02-08 14:05:29,745 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 2 predicate places. [2025-02-08 14:05:29,746 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 121 flow [2025-02-08 14:05:29,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 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-02-08 14:05:29,746 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:29,746 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-08 14:05:29,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 14:05:29,746 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-08 14:05:29,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:29,747 INFO L85 PathProgramCache]: Analyzing trace with hash 467019602, now seen corresponding path program 1 times [2025-02-08 14:05:29,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:29,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493929530] [2025-02-08 14:05:29,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:29,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:29,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:05:29,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:05:29,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:29,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:05:29,796 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:05:29,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:05:29,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:05:29,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:29,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:05:29,830 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:05:29,833 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 14:05:29,835 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-02-08 14:05:29,836 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2025-02-08 14:05:29,836 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2025-02-08 14:05:29,836 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2025-02-08 14:05:29,836 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2025-02-08 14:05:29,836 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2025-02-08 14:05:29,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2025-02-08 14:05:29,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2025-02-08 14:05:29,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2025-02-08 14:05:29,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2025-02-08 14:05:29,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2025-02-08 14:05:29,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2025-02-08 14:05:29,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2025-02-08 14:05:29,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 14:05:29,837 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-08 14:05:29,839 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 14:05:29,839 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 14:05:29,883 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 14:05:29,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 98 transitions, 212 flow [2025-02-08 14:05:29,906 INFO L124 PetriNetUnfolderBase]: 21/149 cut-off events. [2025-02-08 14:05:29,907 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 14:05:29,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 149 events. 21/149 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 557 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 96. Up to 6 conditions per place. [2025-02-08 14:05:29,908 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 98 transitions, 212 flow [2025-02-08 14:05:29,909 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 98 transitions, 212 flow [2025-02-08 14:05:29,909 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:05:29,910 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@708cf704, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:05:29,910 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-02-08 14:05:29,912 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:05:29,912 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-02-08 14:05:29,912 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:05:29,912 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:29,912 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 14:05:29,913 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 14:05:29,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:29,913 INFO L85 PathProgramCache]: Analyzing trace with hash 513968873, now seen corresponding path program 1 times [2025-02-08 14:05:29,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:29,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688718027] [2025-02-08 14:05:29,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:29,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:29,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:05:29,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:05:29,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:29,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:29,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:05:29,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:29,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688718027] [2025-02-08 14:05:29,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688718027] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:29,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:29,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:05:29,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951962966] [2025-02-08 14:05:29,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:29,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:05:29,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:29,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:05:29,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:05:29,995 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 98 [2025-02-08 14:05:29,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 98 transitions, 212 flow. Second operand has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 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-02-08 14:05:29,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:29,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 98 [2025-02-08 14:05:29,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:30,870 INFO L124 PetriNetUnfolderBase]: 4742/10613 cut-off events. [2025-02-08 14:05:30,870 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2025-02-08 14:05:30,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18203 conditions, 10613 events. 4742/10613 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 90615 event pairs, 4292 based on Foata normal form. 2713/12191 useless extension candidates. Maximal degree in co-relation 14555. Up to 7478 conditions per place. [2025-02-08 14:05:30,909 INFO L140 encePairwiseOnDemand]: 78/98 looper letters, 68 selfloop transitions, 3 changer transitions 0/111 dead transitions. [2025-02-08 14:05:30,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 111 transitions, 380 flow [2025-02-08 14:05:30,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:05:30,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:05:30,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 260 transitions. [2025-02-08 14:05:30,911 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6632653061224489 [2025-02-08 14:05:30,911 INFO L175 Difference]: Start difference. First operand has 87 places, 98 transitions, 212 flow. Second operand 4 states and 260 transitions. [2025-02-08 14:05:30,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 111 transitions, 380 flow [2025-02-08 14:05:30,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 111 transitions, 380 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:05:30,913 INFO L231 Difference]: Finished difference. Result has 92 places, 86 transitions, 208 flow [2025-02-08 14:05:30,913 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=208, PETRI_PLACES=92, PETRI_TRANSITIONS=86} [2025-02-08 14:05:30,914 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, 5 predicate places. [2025-02-08 14:05:30,914 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 86 transitions, 208 flow [2025-02-08 14:05:30,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 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-02-08 14:05:30,914 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:30,915 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 14:05:30,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 14:05:30,915 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 14:05:30,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:30,915 INFO L85 PathProgramCache]: Analyzing trace with hash -630934398, now seen corresponding path program 1 times [2025-02-08 14:05:30,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:30,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158059226] [2025-02-08 14:05:30,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:30,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:30,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:05:30,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:05:30,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:30,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:31,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:05:31,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:31,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158059226] [2025-02-08 14:05:31,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158059226] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:31,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:31,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:05:31,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453442223] [2025-02-08 14:05:31,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:31,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 14:05:31,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:31,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:05:31,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:05:31,034 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 98 [2025-02-08 14:05:31,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 86 transitions, 208 flow. Second operand has 6 states, 6 states have (on average 41.5) internal successors, (249), 6 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:05:31,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:31,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 98 [2025-02-08 14:05:31,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:31,848 INFO L124 PetriNetUnfolderBase]: 4430/8899 cut-off events. [2025-02-08 14:05:31,848 INFO L125 PetriNetUnfolderBase]: For 755/755 co-relation queries the response was YES. [2025-02-08 14:05:31,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16753 conditions, 8899 events. 4430/8899 cut-off events. For 755/755 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 71350 event pairs, 699 based on Foata normal form. 169/8444 useless extension candidates. Maximal degree in co-relation 14000. Up to 4698 conditions per place. [2025-02-08 14:05:31,890 INFO L140 encePairwiseOnDemand]: 93/98 looper letters, 112 selfloop transitions, 6 changer transitions 0/158 dead transitions. [2025-02-08 14:05:31,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 158 transitions, 586 flow [2025-02-08 14:05:31,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:05:31,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:05:31,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 359 transitions. [2025-02-08 14:05:31,892 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6105442176870748 [2025-02-08 14:05:31,893 INFO L175 Difference]: Start difference. First operand has 92 places, 86 transitions, 208 flow. Second operand 6 states and 359 transitions. [2025-02-08 14:05:31,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 158 transitions, 586 flow [2025-02-08 14:05:31,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 158 transitions, 584 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:05:31,898 INFO L231 Difference]: Finished difference. Result has 95 places, 85 transitions, 214 flow [2025-02-08 14:05:31,898 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=214, PETRI_PLACES=95, PETRI_TRANSITIONS=85} [2025-02-08 14:05:31,898 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, 8 predicate places. [2025-02-08 14:05:31,898 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 85 transitions, 214 flow [2025-02-08 14:05:31,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 41.5) internal successors, (249), 6 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:05:31,899 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:31,899 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:05:31,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 14:05:31,899 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 14:05:31,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:31,899 INFO L85 PathProgramCache]: Analyzing trace with hash -234501371, now seen corresponding path program 1 times [2025-02-08 14:05:31,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:31,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396655613] [2025-02-08 14:05:31,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:31,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:31,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:05:31,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:05:31,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:31,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:32,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:05:32,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:32,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396655613] [2025-02-08 14:05:32,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396655613] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:32,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:32,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:05:32,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948593999] [2025-02-08 14:05:32,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:32,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:05:32,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:32,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:05:32,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:05:32,032 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 98 [2025-02-08 14:05:32,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 85 transitions, 214 flow. Second operand has 5 states, 5 states have (on average 42.6) internal successors, (213), 5 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-02-08 14:05:32,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:32,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 98 [2025-02-08 14:05:32,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:32,988 INFO L124 PetriNetUnfolderBase]: 6470/13751 cut-off events. [2025-02-08 14:05:32,988 INFO L125 PetriNetUnfolderBase]: For 1500/1685 co-relation queries the response was YES. [2025-02-08 14:05:33,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25082 conditions, 13751 events. 6470/13751 cut-off events. For 1500/1685 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 122154 event pairs, 1247 based on Foata normal form. 273/12850 useless extension candidates. Maximal degree in co-relation 23481. Up to 6083 conditions per place. [2025-02-08 14:05:33,032 INFO L140 encePairwiseOnDemand]: 88/98 looper letters, 163 selfloop transitions, 17 changer transitions 0/221 dead transitions. [2025-02-08 14:05:33,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 221 transitions, 923 flow [2025-02-08 14:05:33,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 14:05:33,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 14:05:33,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 469 transitions. [2025-02-08 14:05:33,034 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6836734693877551 [2025-02-08 14:05:33,034 INFO L175 Difference]: Start difference. First operand has 95 places, 85 transitions, 214 flow. Second operand 7 states and 469 transitions. [2025-02-08 14:05:33,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 221 transitions, 923 flow [2025-02-08 14:05:33,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 221 transitions, 896 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-02-08 14:05:33,040 INFO L231 Difference]: Finished difference. Result has 103 places, 102 transitions, 334 flow [2025-02-08 14:05:33,040 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=334, PETRI_PLACES=103, PETRI_TRANSITIONS=102} [2025-02-08 14:05:33,041 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, 16 predicate places. [2025-02-08 14:05:33,041 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 102 transitions, 334 flow [2025-02-08 14:05:33,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.6) internal successors, (213), 5 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-02-08 14:05:33,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:33,041 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-02-08 14:05:33,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 14:05:33,041 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 14:05:33,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:33,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1915870586, now seen corresponding path program 1 times [2025-02-08 14:05:33,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:33,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301445119] [2025-02-08 14:05:33,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:33,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:33,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:05:33,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:05:33,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:33,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:33,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:05:33,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:33,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301445119] [2025-02-08 14:05:33,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301445119] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:33,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:33,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:05:33,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326592241] [2025-02-08 14:05:33,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:33,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:05:33,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:33,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:05:33,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:05:33,108 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 98 [2025-02-08 14:05:33,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 102 transitions, 334 flow. Second operand has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:05:33,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:33,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 98 [2025-02-08 14:05:33,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:33,951 INFO L124 PetriNetUnfolderBase]: 6285/12966 cut-off events. [2025-02-08 14:05:33,951 INFO L125 PetriNetUnfolderBase]: For 4799/4799 co-relation queries the response was YES. [2025-02-08 14:05:33,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27056 conditions, 12966 events. 6285/12966 cut-off events. For 4799/4799 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 111286 event pairs, 1342 based on Foata normal form. 177/12377 useless extension candidates. Maximal degree in co-relation 26240. Up to 8674 conditions per place. [2025-02-08 14:05:34,005 INFO L140 encePairwiseOnDemand]: 93/98 looper letters, 120 selfloop transitions, 6 changer transitions 0/166 dead transitions. [2025-02-08 14:05:34,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 166 transitions, 796 flow [2025-02-08 14:05:34,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:05:34,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:05:34,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 252 transitions. [2025-02-08 14:05:34,007 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2025-02-08 14:05:34,007 INFO L175 Difference]: Start difference. First operand has 103 places, 102 transitions, 334 flow. Second operand 4 states and 252 transitions. [2025-02-08 14:05:34,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 166 transitions, 796 flow [2025-02-08 14:05:34,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 166 transitions, 792 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-08 14:05:34,016 INFO L231 Difference]: Finished difference. Result has 105 places, 102 transitions, 346 flow [2025-02-08 14:05:34,016 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=346, PETRI_PLACES=105, PETRI_TRANSITIONS=102} [2025-02-08 14:05:34,016 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, 18 predicate places. [2025-02-08 14:05:34,017 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 102 transitions, 346 flow [2025-02-08 14:05:34,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:05:34,017 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:34,017 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2025-02-08 14:05:34,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 14:05:34,017 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 14:05:34,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:34,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1389320007, now seen corresponding path program 1 times [2025-02-08 14:05:34,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:34,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748492622] [2025-02-08 14:05:34,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:34,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:34,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:05:34,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:05:34,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:34,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:05:34,056 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:05:34,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:05:34,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:05:34,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:34,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:05:34,080 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:05:34,082 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 14:05:34,082 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2025-02-08 14:05:34,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 17 remaining) [2025-02-08 14:05:34,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 17 remaining) [2025-02-08 14:05:34,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 17 remaining) [2025-02-08 14:05:34,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 17 remaining) [2025-02-08 14:05:34,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 17 remaining) [2025-02-08 14:05:34,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 17 remaining) [2025-02-08 14:05:34,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 17 remaining) [2025-02-08 14:05:34,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 17 remaining) [2025-02-08 14:05:34,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 17 remaining) [2025-02-08 14:05:34,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 17 remaining) [2025-02-08 14:05:34,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 17 remaining) [2025-02-08 14:05:34,084 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 17 remaining) [2025-02-08 14:05:34,084 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 17 remaining) [2025-02-08 14:05:34,084 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 17 remaining) [2025-02-08 14:05:34,084 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 17 remaining) [2025-02-08 14:05:34,084 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 17 remaining) [2025-02-08 14:05:34,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 14:05:34,084 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-08 14:05:34,085 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 14:05:34,085 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 14:05:34,114 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 14:05:34,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 133 transitions, 293 flow [2025-02-08 14:05:34,143 INFO L124 PetriNetUnfolderBase]: 34/238 cut-off events. [2025-02-08 14:05:34,144 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-08 14:05:34,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 238 events. 34/238 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1010 event pairs, 1 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 164. Up to 12 conditions per place. [2025-02-08 14:05:34,146 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 133 transitions, 293 flow [2025-02-08 14:05:34,147 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 133 transitions, 293 flow [2025-02-08 14:05:34,148 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:05:34,148 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;@708cf704, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:05:34,148 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-02-08 14:05:34,151 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:05:34,151 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-02-08 14:05:34,151 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:05:34,152 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:34,152 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 14:05:34,152 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-08 14:05:34,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:34,152 INFO L85 PathProgramCache]: Analyzing trace with hash 640923151, now seen corresponding path program 1 times [2025-02-08 14:05:34,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:34,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715356183] [2025-02-08 14:05:34,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:34,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:34,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:05:34,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:05:34,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:34,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:34,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:05:34,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:34,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715356183] [2025-02-08 14:05:34,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715356183] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:34,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:34,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:05:34,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254482493] [2025-02-08 14:05:34,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:34,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:05:34,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:34,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:05:34,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:05:34,220 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 133 [2025-02-08 14:05:34,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 133 transitions, 293 flow. Second operand has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 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-02-08 14:05:34,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:34,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 133 [2025-02-08 14:05:34,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:44,123 INFO L124 PetriNetUnfolderBase]: 97039/177160 cut-off events. [2025-02-08 14:05:44,123 INFO L125 PetriNetUnfolderBase]: For 1809/1809 co-relation queries the response was YES. [2025-02-08 14:05:44,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 312812 conditions, 177160 events. 97039/177160 cut-off events. For 1809/1809 co-relation queries the response was YES. Maximal size of possible extension queue 3703. Compared 1888832 event pairs, 91193 based on Foata normal form. 51849/212373 useless extension candidates. Maximal degree in co-relation 137188. Up to 134303 conditions per place. [2025-02-08 14:05:44,959 INFO L140 encePairwiseOnDemand]: 107/133 looper letters, 82 selfloop transitions, 3 changer transitions 0/140 dead transitions. [2025-02-08 14:05:44,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 140 transitions, 477 flow [2025-02-08 14:05:44,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:05:44,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:05:44,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 340 transitions. [2025-02-08 14:05:44,961 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6390977443609023 [2025-02-08 14:05:44,961 INFO L175 Difference]: Start difference. First operand has 117 places, 133 transitions, 293 flow. Second operand 4 states and 340 transitions. [2025-02-08 14:05:44,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 140 transitions, 477 flow [2025-02-08 14:05:44,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 140 transitions, 477 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:05:44,965 INFO L231 Difference]: Finished difference. Result has 122 places, 115 transitions, 277 flow [2025-02-08 14:05:44,965 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=277, PETRI_PLACES=122, PETRI_TRANSITIONS=115} [2025-02-08 14:05:44,966 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 5 predicate places. [2025-02-08 14:05:44,966 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 115 transitions, 277 flow [2025-02-08 14:05:44,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 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-02-08 14:05:44,966 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:44,966 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 14:05:44,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 14:05:44,966 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-08 14:05:44,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:44,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1908425662, now seen corresponding path program 1 times [2025-02-08 14:05:44,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:44,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390951577] [2025-02-08 14:05:44,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:44,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:44,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:05:44,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:05:44,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:44,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:45,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:05:45,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:45,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390951577] [2025-02-08 14:05:45,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390951577] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:45,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:45,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:05:45,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953452560] [2025-02-08 14:05:45,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:45,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 14:05:45,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:45,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:05:45,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:05:45,049 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 133 [2025-02-08 14:05:45,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 115 transitions, 277 flow. Second operand has 6 states, 6 states have (on average 56.5) internal successors, (339), 6 states have internal predecessors, (339), 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-02-08 14:05:45,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:45,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 133 [2025-02-08 14:05:45,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:53,544 INFO L124 PetriNetUnfolderBase]: 90643/148271 cut-off events. [2025-02-08 14:05:53,544 INFO L125 PetriNetUnfolderBase]: For 8698/8698 co-relation queries the response was YES. [2025-02-08 14:05:53,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 284694 conditions, 148271 events. 90643/148271 cut-off events. For 8698/8698 co-relation queries the response was YES. Maximal size of possible extension queue 3089. Compared 1411301 event pairs, 10465 based on Foata normal form. 2366/142131 useless extension candidates. Maximal degree in co-relation 21949. Up to 83865 conditions per place. [2025-02-08 14:05:54,419 INFO L140 encePairwiseOnDemand]: 128/133 looper letters, 150 selfloop transitions, 6 changer transitions 0/211 dead transitions. [2025-02-08 14:05:54,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 211 transitions, 779 flow [2025-02-08 14:05:54,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:05:54,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:05:54,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 487 transitions. [2025-02-08 14:05:54,422 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6102756892230576 [2025-02-08 14:05:54,422 INFO L175 Difference]: Start difference. First operand has 122 places, 115 transitions, 277 flow. Second operand 6 states and 487 transitions. [2025-02-08 14:05:54,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 211 transitions, 779 flow [2025-02-08 14:05:54,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 211 transitions, 777 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:05:54,425 INFO L231 Difference]: Finished difference. Result has 125 places, 114 transitions, 283 flow [2025-02-08 14:05:54,426 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=283, PETRI_PLACES=125, PETRI_TRANSITIONS=114} [2025-02-08 14:05:54,426 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 8 predicate places. [2025-02-08 14:05:54,426 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 114 transitions, 283 flow [2025-02-08 14:05:54,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 56.5) internal successors, (339), 6 states have internal predecessors, (339), 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-02-08 14:05:54,427 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:54,427 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:05:54,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 14:05:54,427 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-08 14:05:54,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:54,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1723433845, now seen corresponding path program 1 times [2025-02-08 14:05:54,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:54,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298260512] [2025-02-08 14:05:54,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:54,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:54,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:05:54,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:05:54,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:54,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:54,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:05:54,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:54,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298260512] [2025-02-08 14:05:54,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298260512] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:54,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:54,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:05:54,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073264738] [2025-02-08 14:05:54,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:54,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:05:54,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:54,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:05:54,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:05:54,532 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 133 [2025-02-08 14:05:54,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 114 transitions, 283 flow. Second operand has 5 states, 5 states have (on average 57.6) internal successors, (288), 5 states have internal predecessors, (288), 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-02-08 14:05:54,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:54,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 133 [2025-02-08 14:05:54,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand