./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_07-cond_racing2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 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_07-cond_racing2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 45d1947e02656e790dafd6ca03f6eadb14d0b370e2217b75740af9998d975bef --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 14:05:17,033 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:05:17,088 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:17,094 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:05:17,096 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:05:17,115 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:05:17,115 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:05:17,116 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:05:17,116 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:05:17,116 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:05:17,117 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 14:05:17,117 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 14:05:17,117 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:05:17,117 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:05:17,117 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:05:17,118 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:05:17,118 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 14:05:17,118 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 14:05:17,118 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:05:17,118 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 14:05:17,118 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:05:17,118 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 14:05:17,118 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 14:05:17,119 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 14:05:17,119 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 14:05:17,119 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:05:17,119 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 14:05:17,119 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:05:17,119 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:05:17,119 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:05:17,119 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:05:17,119 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:05:17,120 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 14:05:17,120 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 14:05:17,120 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:05:17,120 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:05:17,120 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 14:05:17,120 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 14:05:17,120 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 14:05:17,120 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:05:17,120 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 14:05:17,120 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 14:05:17,120 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 14:05:17,120 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 14:05:17,121 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 14:05:17,121 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 45d1947e02656e790dafd6ca03f6eadb14d0b370e2217b75740af9998d975bef [2025-02-08 14:05:17,339 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:05:17,346 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:05:17,348 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:05:17,349 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:05:17,349 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:05:17,350 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_07-cond_racing2.i [2025-02-08 14:05:18,507 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7c25c0636/3d1eef77d0944451b42a9f5d4a470fd9/FLAGc0a1549bd [2025-02-08 14:05:18,815 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:05:18,817 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_07-cond_racing2.i [2025-02-08 14:05:18,828 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7c25c0636/3d1eef77d0944451b42a9f5d4a470fd9/FLAGc0a1549bd [2025-02-08 14:05:19,070 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7c25c0636/3d1eef77d0944451b42a9f5d4a470fd9 [2025-02-08 14:05:19,071 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:05:19,074 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:05:19,075 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:05:19,076 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:05:19,078 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:05:19,079 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:05:19" (1/1) ... [2025-02-08 14:05:19,080 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d31ac5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:19, skipping insertion in model container [2025-02-08 14:05:19,081 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:05:19" (1/1) ... [2025-02-08 14:05:19,107 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:05:19,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:05:19,458 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:05:19,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:05:19,540 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:05:19,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:19 WrapperNode [2025-02-08 14:05:19,541 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:05:19,542 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:05:19,542 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:05:19,543 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:05:19,547 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:19" (1/1) ... [2025-02-08 14:05:19,555 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:19" (1/1) ... [2025-02-08 14:05:19,568 INFO L138 Inliner]: procedures = 271, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 143 [2025-02-08 14:05:19,568 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:05:19,569 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:05:19,569 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:05:19,569 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:05:19,575 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:19" (1/1) ... [2025-02-08 14:05:19,575 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:19" (1/1) ... [2025-02-08 14:05:19,577 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:19" (1/1) ... [2025-02-08 14:05:19,584 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 2, 5, 5]. 36 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 0, 5, 5]. The 1 writes are split as follows [0, 1, 0, 0]. [2025-02-08 14:05:19,584 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:19" (1/1) ... [2025-02-08 14:05:19,584 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:19" (1/1) ... [2025-02-08 14:05:19,589 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:19" (1/1) ... [2025-02-08 14:05:19,589 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:19" (1/1) ... [2025-02-08 14:05:19,590 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:19" (1/1) ... [2025-02-08 14:05:19,591 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:19" (1/1) ... [2025-02-08 14:05:19,592 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:05:19,593 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:05:19,593 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:05:19,593 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:05:19,593 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:19" (1/1) ... [2025-02-08 14:05:19,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:05:19,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:05:19,622 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:19,627 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:19,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 14:05:19,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 14:05:19,641 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 14:05:19,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 14:05:19,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 14:05:19,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 14:05:19,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 14:05:19,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 14:05:19,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 14:05:19,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 14:05:19,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 14:05:19,642 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 14:05:19,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 14:05:19,642 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-08 14:05:19,642 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-08 14:05:19,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 14:05:19,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 14:05:19,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 14:05:19,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 14:05:19,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:05:19,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:05:19,643 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:19,736 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:05:19,738 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:05:19,879 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L945: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-02-08 14:05:19,879 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L945-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:19,924 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 14:05:19,925 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:05:20,143 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:05:20,144 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:05:20,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:05:20 BoogieIcfgContainer [2025-02-08 14:05:20,145 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:05:20,147 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 14:05:20,147 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 14:05:20,150 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 14:05:20,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 02:05:19" (1/3) ... [2025-02-08 14:05:20,151 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7add4888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:05:20, skipping insertion in model container [2025-02-08 14:05:20,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:05:19" (2/3) ... [2025-02-08 14:05:20,151 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7add4888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:05:20, skipping insertion in model container [2025-02-08 14:05:20,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:05:20" (3/3) ... [2025-02-08 14:05:20,152 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_07-cond_racing2.i [2025-02-08 14:05:20,164 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 14:05:20,165 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_07-cond_racing2.i that has 2 procedures, 62 locations, 1 initial locations, 6 loop locations, and 10 error locations. [2025-02-08 14:05:20,165 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 14:05:20,200 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-08 14:05:20,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 74 transitions, 155 flow [2025-02-08 14:05:20,261 INFO L124 PetriNetUnfolderBase]: 17/101 cut-off events. [2025-02-08 14:05:20,262 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 14:05:20,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 101 events. 17/101 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 324 event pairs, 0 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 65. Up to 6 conditions per place. [2025-02-08 14:05:20,269 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 74 transitions, 155 flow [2025-02-08 14:05:20,271 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 73 transitions, 153 flow [2025-02-08 14:05:20,276 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:05:20,283 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;@6577e34f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:05:20,283 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-02-08 14:05:20,295 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:05:20,296 INFO L124 PetriNetUnfolderBase]: 1/11 cut-off events. [2025-02-08 14:05:20,296 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:05:20,296 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:20,296 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 14:05:20,296 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-02-08 14:05:20,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:20,305 INFO L85 PathProgramCache]: Analyzing trace with hash 427731332, now seen corresponding path program 1 times [2025-02-08 14:05:20,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:20,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954689060] [2025-02-08 14:05:20,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:20,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:20,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:05:20,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:05:20,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:20,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:20,653 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:20,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:20,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954689060] [2025-02-08 14:05:20,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954689060] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:20,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:20,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:05:20,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489161553] [2025-02-08 14:05:20,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:20,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:05:20,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:20,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:05:20,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:05:20,712 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 74 [2025-02-08 14:05:20,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 73 transitions, 153 flow. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 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:20,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:20,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 74 [2025-02-08 14:05:20,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:20,873 INFO L124 PetriNetUnfolderBase]: 171/580 cut-off events. [2025-02-08 14:05:20,874 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 14:05:20,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 911 conditions, 580 events. 171/580 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3261 event pairs, 21 based on Foata normal form. 116/578 useless extension candidates. Maximal degree in co-relation 856. Up to 220 conditions per place. [2025-02-08 14:05:20,878 INFO L140 encePairwiseOnDemand]: 61/74 looper letters, 46 selfloop transitions, 4 changer transitions 0/86 dead transitions. [2025-02-08 14:05:20,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 86 transitions, 279 flow [2025-02-08 14:05:20,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:05:20,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:05:20,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 215 transitions. [2025-02-08 14:05:20,887 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7263513513513513 [2025-02-08 14:05:20,889 INFO L175 Difference]: Start difference. First operand has 65 places, 73 transitions, 153 flow. Second operand 4 states and 215 transitions. [2025-02-08 14:05:20,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 86 transitions, 279 flow [2025-02-08 14:05:20,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 86 transitions, 279 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:05:20,894 INFO L231 Difference]: Finished difference. Result has 67 places, 64 transitions, 143 flow [2025-02-08 14:05:20,895 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=143, PETRI_PLACES=67, PETRI_TRANSITIONS=64} [2025-02-08 14:05:20,897 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 2 predicate places. [2025-02-08 14:05:20,898 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 64 transitions, 143 flow [2025-02-08 14:05:20,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 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:20,898 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:20,898 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 14:05:20,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 14:05:20,898 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-02-08 14:05:20,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:20,899 INFO L85 PathProgramCache]: Analyzing trace with hash 427680265, now seen corresponding path program 1 times [2025-02-08 14:05:20,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:20,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087298625] [2025-02-08 14:05:20,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:20,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:20,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:05:20,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:05:20,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:20,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:20,948 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:20,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:20,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087298625] [2025-02-08 14:05:20,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087298625] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:20,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:20,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:05:20,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434547571] [2025-02-08 14:05:20,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:20,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:05:20,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:20,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:05:20,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:05:20,952 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 74 [2025-02-08 14:05:20,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 64 transitions, 143 flow. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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:20,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:20,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 74 [2025-02-08 14:05:20,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:21,036 INFO L124 PetriNetUnfolderBase]: 171/528 cut-off events. [2025-02-08 14:05:21,036 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-02-08 14:05:21,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 882 conditions, 528 events. 171/528 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2907 event pairs, 106 based on Foata normal form. 1/462 useless extension candidates. Maximal degree in co-relation 859. Up to 308 conditions per place. [2025-02-08 14:05:21,040 INFO L140 encePairwiseOnDemand]: 71/74 looper letters, 36 selfloop transitions, 2 changer transitions 0/76 dead transitions. [2025-02-08 14:05:21,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 76 transitions, 243 flow [2025-02-08 14:05:21,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:05:21,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:05:21,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2025-02-08 14:05:21,041 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7027027027027027 [2025-02-08 14:05:21,041 INFO L175 Difference]: Start difference. First operand has 67 places, 64 transitions, 143 flow. Second operand 3 states and 156 transitions. [2025-02-08 14:05:21,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 76 transitions, 243 flow [2025-02-08 14:05:21,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 76 transitions, 235 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 14:05:21,043 INFO L231 Difference]: Finished difference. Result has 67 places, 64 transitions, 143 flow [2025-02-08 14:05:21,044 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=143, PETRI_PLACES=67, PETRI_TRANSITIONS=64} [2025-02-08 14:05:21,044 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 2 predicate places. [2025-02-08 14:05:21,044 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 64 transitions, 143 flow [2025-02-08 14:05:21,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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:21,045 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:21,045 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 14:05:21,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 14:05:21,045 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-02-08 14:05:21,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:21,045 INFO L85 PathProgramCache]: Analyzing trace with hash 374769759, now seen corresponding path program 1 times [2025-02-08 14:05:21,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:21,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319287996] [2025-02-08 14:05:21,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:21,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:21,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:05:21,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:05:21,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:21,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:21,157 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:21,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:21,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319287996] [2025-02-08 14:05:21,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319287996] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:21,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:21,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:05:21,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980181236] [2025-02-08 14:05:21,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:21,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:05:21,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:21,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:05:21,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:05:21,166 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 74 [2025-02-08 14:05:21,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 64 transitions, 143 flow. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 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:21,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:21,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 74 [2025-02-08 14:05:21,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:21,262 INFO L124 PetriNetUnfolderBase]: 157/506 cut-off events. [2025-02-08 14:05:21,262 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-02-08 14:05:21,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 843 conditions, 506 events. 157/506 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2729 event pairs, 0 based on Foata normal form. 12/437 useless extension candidates. Maximal degree in co-relation 810. Up to 256 conditions per place. [2025-02-08 14:05:21,265 INFO L140 encePairwiseOnDemand]: 70/74 looper letters, 47 selfloop transitions, 3 changer transitions 0/86 dead transitions. [2025-02-08 14:05:21,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 86 transitions, 287 flow [2025-02-08 14:05:21,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:05:21,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:05:21,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 195 transitions. [2025-02-08 14:05:21,267 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6587837837837838 [2025-02-08 14:05:21,267 INFO L175 Difference]: Start difference. First operand has 67 places, 64 transitions, 143 flow. Second operand 4 states and 195 transitions. [2025-02-08 14:05:21,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 86 transitions, 287 flow [2025-02-08 14:05:21,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 86 transitions, 283 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 14:05:21,268 INFO L231 Difference]: Finished difference. Result has 67 places, 63 transitions, 143 flow [2025-02-08 14:05:21,269 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=143, PETRI_PLACES=67, PETRI_TRANSITIONS=63} [2025-02-08 14:05:21,269 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 2 predicate places. [2025-02-08 14:05:21,269 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 63 transitions, 143 flow [2025-02-08 14:05:21,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 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:21,269 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:21,270 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-08 14:05:21,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 14:05:21,270 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-02-08 14:05:21,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:21,270 INFO L85 PathProgramCache]: Analyzing trace with hash -623499917, now seen corresponding path program 1 times [2025-02-08 14:05:21,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:21,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670656661] [2025-02-08 14:05:21,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:21,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:21,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:05:21,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:05:21,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:21,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:05:21,298 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:05:21,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:05:21,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:05:21,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:21,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:05:21,323 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:05:21,323 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 14:05:21,324 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2025-02-08 14:05:21,325 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 15 remaining) [2025-02-08 14:05:21,325 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 15 remaining) [2025-02-08 14:05:21,325 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 15 remaining) [2025-02-08 14:05:21,325 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 15 remaining) [2025-02-08 14:05:21,325 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 15 remaining) [2025-02-08 14:05:21,325 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 15 remaining) [2025-02-08 14:05:21,325 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 15 remaining) [2025-02-08 14:05:21,325 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 15 remaining) [2025-02-08 14:05:21,325 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 15 remaining) [2025-02-08 14:05:21,326 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 15 remaining) [2025-02-08 14:05:21,326 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 15 remaining) [2025-02-08 14:05:21,326 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 15 remaining) [2025-02-08 14:05:21,326 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 15 remaining) [2025-02-08 14:05:21,326 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 15 remaining) [2025-02-08 14:05:21,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 14:05:21,326 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-08 14:05:21,328 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 14:05:21,328 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 14:05:21,344 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 14:05:21,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 109 transitions, 234 flow [2025-02-08 14:05:21,358 INFO L124 PetriNetUnfolderBase]: 30/182 cut-off events. [2025-02-08 14:05:21,358 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 14:05:21,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 182 events. 30/182 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 720 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 109. Up to 9 conditions per place. [2025-02-08 14:05:21,359 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 109 transitions, 234 flow [2025-02-08 14:05:21,360 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 109 transitions, 234 flow [2025-02-08 14:05:21,361 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:05:21,362 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;@6577e34f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:05:21,362 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-02-08 14:05:21,364 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:05:21,364 INFO L124 PetriNetUnfolderBase]: 1/12 cut-off events. [2025-02-08 14:05:21,364 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:05:21,364 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:21,364 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 14:05:21,364 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-02-08 14:05:21,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:21,364 INFO L85 PathProgramCache]: Analyzing trace with hash 531782290, now seen corresponding path program 1 times [2025-02-08 14:05:21,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:21,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66706785] [2025-02-08 14:05:21,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:21,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:21,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:05:21,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:05:21,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:21,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:21,422 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:21,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:21,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66706785] [2025-02-08 14:05:21,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66706785] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:21,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:21,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:05:21,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462832735] [2025-02-08 14:05:21,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:21,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:05:21,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:21,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:05:21,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:05:21,429 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 109 [2025-02-08 14:05:21,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 109 transitions, 234 flow. Second operand has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:05:21,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:21,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 109 [2025-02-08 14:05:21,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:22,173 INFO L124 PetriNetUnfolderBase]: 3972/9175 cut-off events. [2025-02-08 14:05:22,173 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-02-08 14:05:22,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15157 conditions, 9175 events. 3972/9175 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 81330 event pairs, 657 based on Foata normal form. 2426/10106 useless extension candidates. Maximal degree in co-relation 11698. Up to 3901 conditions per place. [2025-02-08 14:05:22,217 INFO L140 encePairwiseOnDemand]: 90/109 looper letters, 82 selfloop transitions, 4 changer transitions 0/138 dead transitions. [2025-02-08 14:05:22,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 138 transitions, 464 flow [2025-02-08 14:05:22,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:05:22,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:05:22,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 333 transitions. [2025-02-08 14:05:22,219 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7637614678899083 [2025-02-08 14:05:22,219 INFO L175 Difference]: Start difference. First operand has 95 places, 109 transitions, 234 flow. Second operand 4 states and 333 transitions. [2025-02-08 14:05:22,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 138 transitions, 464 flow [2025-02-08 14:05:22,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 138 transitions, 464 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:05:22,221 INFO L231 Difference]: Finished difference. Result has 97 places, 94 transitions, 212 flow [2025-02-08 14:05:22,222 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=212, PETRI_PLACES=97, PETRI_TRANSITIONS=94} [2025-02-08 14:05:22,222 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, 2 predicate places. [2025-02-08 14:05:22,222 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 94 transitions, 212 flow [2025-02-08 14:05:22,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:05:22,223 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:22,223 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 14:05:22,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 14:05:22,223 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-02-08 14:05:22,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:22,223 INFO L85 PathProgramCache]: Analyzing trace with hash 531699510, now seen corresponding path program 1 times [2025-02-08 14:05:22,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:22,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062404088] [2025-02-08 14:05:22,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:22,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:22,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:05:22,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:05:22,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:22,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:22,275 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:22,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:22,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062404088] [2025-02-08 14:05:22,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062404088] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:22,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:22,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:05:22,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642935899] [2025-02-08 14:05:22,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:22,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:05:22,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:22,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:05:22,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:05:22,278 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 109 [2025-02-08 14:05:22,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 94 transitions, 212 flow. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 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:22,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:22,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 109 [2025-02-08 14:05:22,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:22,764 INFO L124 PetriNetUnfolderBase]: 4032/8849 cut-off events. [2025-02-08 14:05:22,765 INFO L125 PetriNetUnfolderBase]: For 360/360 co-relation queries the response was YES. [2025-02-08 14:05:22,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15298 conditions, 8849 events. 4032/8849 cut-off events. For 360/360 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 75821 event pairs, 1604 based on Foata normal form. 1/7990 useless extension candidates. Maximal degree in co-relation 1213. Up to 6041 conditions per place. [2025-02-08 14:05:22,799 INFO L140 encePairwiseOnDemand]: 106/109 looper letters, 51 selfloop transitions, 2 changer transitions 0/107 dead transitions. [2025-02-08 14:05:22,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 107 transitions, 346 flow [2025-02-08 14:05:22,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:05:22,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:05:22,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 219 transitions. [2025-02-08 14:05:22,801 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6697247706422018 [2025-02-08 14:05:22,801 INFO L175 Difference]: Start difference. First operand has 97 places, 94 transitions, 212 flow. Second operand 3 states and 219 transitions. [2025-02-08 14:05:22,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 107 transitions, 346 flow [2025-02-08 14:05:22,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 107 transitions, 336 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 14:05:22,803 INFO L231 Difference]: Finished difference. Result has 97 places, 95 transitions, 216 flow [2025-02-08 14:05:22,803 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=216, PETRI_PLACES=97, PETRI_TRANSITIONS=95} [2025-02-08 14:05:22,804 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, 2 predicate places. [2025-02-08 14:05:22,804 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 95 transitions, 216 flow [2025-02-08 14:05:22,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 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:22,804 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:22,804 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 14:05:22,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 14:05:22,804 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-02-08 14:05:22,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:22,805 INFO L85 PathProgramCache]: Analyzing trace with hash -694617730, now seen corresponding path program 1 times [2025-02-08 14:05:22,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:22,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206158487] [2025-02-08 14:05:22,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:22,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:22,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:05:22,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:05:22,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:22,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:22,871 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:22,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:22,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206158487] [2025-02-08 14:05:22,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206158487] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:22,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:22,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:05:22,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334385892] [2025-02-08 14:05:22,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:22,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:05:22,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:22,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:05:22,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:05:22,876 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 109 [2025-02-08 14:05:22,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 95 transitions, 216 flow. Second operand has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:05:22,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:22,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 109 [2025-02-08 14:05:22,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:23,505 INFO L124 PetriNetUnfolderBase]: 4455/9751 cut-off events. [2025-02-08 14:05:23,506 INFO L125 PetriNetUnfolderBase]: For 356/356 co-relation queries the response was YES. [2025-02-08 14:05:23,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16851 conditions, 9751 events. 4455/9751 cut-off events. For 356/356 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 85184 event pairs, 1820 based on Foata normal form. 12/8767 useless extension candidates. Maximal degree in co-relation 1403. Up to 6669 conditions per place. [2025-02-08 14:05:23,538 INFO L140 encePairwiseOnDemand]: 105/109 looper letters, 64 selfloop transitions, 3 changer transitions 0/119 dead transitions. [2025-02-08 14:05:23,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 119 transitions, 398 flow [2025-02-08 14:05:23,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:05:23,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:05:23,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 276 transitions. [2025-02-08 14:05:23,539 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6330275229357798 [2025-02-08 14:05:23,539 INFO L175 Difference]: Start difference. First operand has 97 places, 95 transitions, 216 flow. Second operand 4 states and 276 transitions. [2025-02-08 14:05:23,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 119 transitions, 398 flow [2025-02-08 14:05:23,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 119 transitions, 396 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:05:23,545 INFO L231 Difference]: Finished difference. Result has 101 places, 96 transitions, 230 flow [2025-02-08 14:05:23,545 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=230, PETRI_PLACES=101, PETRI_TRANSITIONS=96} [2025-02-08 14:05:23,546 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, 6 predicate places. [2025-02-08 14:05:23,546 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 96 transitions, 230 flow [2025-02-08 14:05:23,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:05:23,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:23,546 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:05:23,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 14:05:23,546 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-02-08 14:05:23,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:23,546 INFO L85 PathProgramCache]: Analyzing trace with hash -2022965753, now seen corresponding path program 1 times [2025-02-08 14:05:23,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:23,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430655419] [2025-02-08 14:05:23,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:23,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:23,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:05:23,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:05:23,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:23,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:23,584 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:23,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:23,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430655419] [2025-02-08 14:05:23,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430655419] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:23,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:23,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:05:23,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860293090] [2025-02-08 14:05:23,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:23,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:05:23,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:23,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:05:23,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:05:23,595 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 109 [2025-02-08 14:05:23,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 96 transitions, 230 flow. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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:23,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:23,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 109 [2025-02-08 14:05:23,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:24,067 INFO L124 PetriNetUnfolderBase]: 4413/9518 cut-off events. [2025-02-08 14:05:24,067 INFO L125 PetriNetUnfolderBase]: For 398/398 co-relation queries the response was YES. [2025-02-08 14:05:24,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16718 conditions, 9518 events. 4413/9518 cut-off events. For 398/398 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 81259 event pairs, 3755 based on Foata normal form. 156/8931 useless extension candidates. Maximal degree in co-relation 16599. Up to 6322 conditions per place. [2025-02-08 14:05:24,163 INFO L140 encePairwiseOnDemand]: 106/109 looper letters, 65 selfloop transitions, 2 changer transitions 0/117 dead transitions. [2025-02-08 14:05:24,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 117 transitions, 406 flow [2025-02-08 14:05:24,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:05:24,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:05:24,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 217 transitions. [2025-02-08 14:05:24,164 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6636085626911316 [2025-02-08 14:05:24,164 INFO L175 Difference]: Start difference. First operand has 101 places, 96 transitions, 230 flow. Second operand 3 states and 217 transitions. [2025-02-08 14:05:24,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 117 transitions, 406 flow [2025-02-08 14:05:24,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 117 transitions, 402 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 14:05:24,167 INFO L231 Difference]: Finished difference. Result has 100 places, 95 transitions, 228 flow [2025-02-08 14:05:24,167 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=228, PETRI_PLACES=100, PETRI_TRANSITIONS=95} [2025-02-08 14:05:24,167 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, 5 predicate places. [2025-02-08 14:05:24,167 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 95 transitions, 228 flow [2025-02-08 14:05:24,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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:24,168 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:24,168 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-02-08 14:05:24,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 14:05:24,168 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-02-08 14:05:24,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:24,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1715167532, now seen corresponding path program 1 times [2025-02-08 14:05:24,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:24,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78496396] [2025-02-08 14:05:24,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:24,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:24,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:05:24,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:05:24,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:24,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:24,213 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:24,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:24,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78496396] [2025-02-08 14:05:24,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78496396] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:24,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:24,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:05:24,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715165728] [2025-02-08 14:05:24,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:24,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:05:24,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:24,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:05:24,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:05:24,219 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 109 [2025-02-08 14:05:24,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 95 transitions, 228 flow. Second operand has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:05:24,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:24,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 109 [2025-02-08 14:05:24,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:24,684 INFO L124 PetriNetUnfolderBase]: 3693/8197 cut-off events. [2025-02-08 14:05:24,685 INFO L125 PetriNetUnfolderBase]: For 693/693 co-relation queries the response was YES. [2025-02-08 14:05:24,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14407 conditions, 8197 events. 3693/8197 cut-off events. For 693/693 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 69407 event pairs, 253 based on Foata normal form. 144/7560 useless extension candidates. Maximal degree in co-relation 13316. Up to 4324 conditions per place. [2025-02-08 14:05:24,721 INFO L140 encePairwiseOnDemand]: 104/109 looper letters, 82 selfloop transitions, 6 changer transitions 0/139 dead transitions. [2025-02-08 14:05:24,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 139 transitions, 490 flow [2025-02-08 14:05:24,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:05:24,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:05:24,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 295 transitions. [2025-02-08 14:05:24,722 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.676605504587156 [2025-02-08 14:05:24,722 INFO L175 Difference]: Start difference. First operand has 100 places, 95 transitions, 228 flow. Second operand 4 states and 295 transitions. [2025-02-08 14:05:24,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 139 transitions, 490 flow [2025-02-08 14:05:24,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 139 transitions, 484 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 14:05:24,731 INFO L231 Difference]: Finished difference. Result has 100 places, 95 transitions, 238 flow [2025-02-08 14:05:24,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=238, PETRI_PLACES=100, PETRI_TRANSITIONS=95} [2025-02-08 14:05:24,732 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, 5 predicate places. [2025-02-08 14:05:24,732 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 95 transitions, 238 flow [2025-02-08 14:05:24,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:05:24,732 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:24,732 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:05:24,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 14:05:24,732 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-02-08 14:05:24,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:24,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1657063917, now seen corresponding path program 1 times [2025-02-08 14:05:24,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:24,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345362099] [2025-02-08 14:05:24,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:24,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:24,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:05:24,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:05:24,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:24,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:24,792 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:24,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:24,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345362099] [2025-02-08 14:05:24,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345362099] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:24,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:24,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:05:24,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316012619] [2025-02-08 14:05:24,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:24,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:05:24,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:24,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:05:24,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:05:24,796 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 109 [2025-02-08 14:05:24,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 95 transitions, 238 flow. Second operand has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 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:24,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:24,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 109 [2025-02-08 14:05:24,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:25,670 INFO L124 PetriNetUnfolderBase]: 6297/13146 cut-off events. [2025-02-08 14:05:25,671 INFO L125 PetriNetUnfolderBase]: For 1535/1535 co-relation queries the response was YES. [2025-02-08 14:05:25,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23763 conditions, 13146 events. 6297/13146 cut-off events. For 1535/1535 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 116508 event pairs, 1495 based on Foata normal form. 222/11973 useless extension candidates. Maximal degree in co-relation 19539. Up to 6450 conditions per place. [2025-02-08 14:05:25,731 INFO L140 encePairwiseOnDemand]: 100/109 looper letters, 123 selfloop transitions, 12 changer transitions 0/186 dead transitions. [2025-02-08 14:05:25,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 186 transitions, 752 flow [2025-02-08 14:05:25,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:05:25,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:05:25,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 400 transitions. [2025-02-08 14:05:25,735 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7339449541284404 [2025-02-08 14:05:25,735 INFO L175 Difference]: Start difference. First operand has 100 places, 95 transitions, 238 flow. Second operand 5 states and 400 transitions. [2025-02-08 14:05:25,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 186 transitions, 752 flow [2025-02-08 14:05:25,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 186 transitions, 736 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 14:05:25,738 INFO L231 Difference]: Finished difference. Result has 106 places, 106 transitions, 324 flow [2025-02-08 14:05:25,738 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=324, PETRI_PLACES=106, PETRI_TRANSITIONS=106} [2025-02-08 14:05:25,738 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, 11 predicate places. [2025-02-08 14:05:25,738 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 106 transitions, 324 flow [2025-02-08 14:05:25,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 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:25,739 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:25,739 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:05:25,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 14:05:25,739 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-02-08 14:05:25,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:25,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1712571572, now seen corresponding path program 1 times [2025-02-08 14:05:25,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:25,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886465658] [2025-02-08 14:05:25,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:25,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:25,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:05:25,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:05:25,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:25,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:25,783 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:25,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:25,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886465658] [2025-02-08 14:05:25,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886465658] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:25,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:25,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:05:25,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663442766] [2025-02-08 14:05:25,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:25,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:05:25,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:25,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:05:25,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:05:25,795 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 109 [2025-02-08 14:05:25,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 106 transitions, 324 flow. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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:25,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:25,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 109 [2025-02-08 14:05:25,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:26,891 INFO L124 PetriNetUnfolderBase]: 10678/22422 cut-off events. [2025-02-08 14:05:26,891 INFO L125 PetriNetUnfolderBase]: For 6794/6854 co-relation queries the response was YES. [2025-02-08 14:05:26,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44583 conditions, 22422 events. 10678/22422 cut-off events. For 6794/6854 co-relation queries the response was YES. Maximal size of possible extension queue 665. Compared 214638 event pairs, 5129 based on Foata normal form. 182/21148 useless extension candidates. Maximal degree in co-relation 36665. Up to 9166 conditions per place. [2025-02-08 14:05:27,001 INFO L140 encePairwiseOnDemand]: 104/109 looper letters, 99 selfloop transitions, 4 changer transitions 0/152 dead transitions. [2025-02-08 14:05:27,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 152 transitions, 688 flow [2025-02-08 14:05:27,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:05:27,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:05:27,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 230 transitions. [2025-02-08 14:05:27,005 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7033639143730887 [2025-02-08 14:05:27,005 INFO L175 Difference]: Start difference. First operand has 106 places, 106 transitions, 324 flow. Second operand 3 states and 230 transitions. [2025-02-08 14:05:27,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 152 transitions, 688 flow [2025-02-08 14:05:27,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 152 transitions, 688 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:05:27,017 INFO L231 Difference]: Finished difference. Result has 110 places, 109 transitions, 354 flow [2025-02-08 14:05:27,017 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=354, PETRI_PLACES=110, PETRI_TRANSITIONS=109} [2025-02-08 14:05:27,019 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, 15 predicate places. [2025-02-08 14:05:27,019 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 109 transitions, 354 flow [2025-02-08 14:05:27,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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:27,020 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:27,020 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:05:27,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 14:05:27,020 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-02-08 14:05:27,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:27,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1549507930, now seen corresponding path program 1 times [2025-02-08 14:05:27,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:27,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496948658] [2025-02-08 14:05:27,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:27,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:27,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 14:05:27,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 14:05:27,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:27,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:27,089 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:27,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:27,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496948658] [2025-02-08 14:05:27,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496948658] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:27,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:27,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:05:27,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541330115] [2025-02-08 14:05:27,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:27,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:05:27,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:27,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:05:27,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:05:27,097 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 109 [2025-02-08 14:05:27,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 109 transitions, 354 flow. Second operand has 5 states, 5 states have (on average 53.6) internal successors, (268), 5 states have internal predecessors, (268), 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:27,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:27,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 109 [2025-02-08 14:05:27,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:28,335 INFO L124 PetriNetUnfolderBase]: 9344/20270 cut-off events. [2025-02-08 14:05:28,335 INFO L125 PetriNetUnfolderBase]: For 7503/7517 co-relation queries the response was YES. [2025-02-08 14:05:28,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42213 conditions, 20270 events. 9344/20270 cut-off events. For 7503/7517 co-relation queries the response was YES. Maximal size of possible extension queue 625. Compared 195508 event pairs, 1285 based on Foata normal form. 12/19852 useless extension candidates. Maximal degree in co-relation 37800. Up to 13218 conditions per place. [2025-02-08 14:05:28,468 INFO L140 encePairwiseOnDemand]: 105/109 looper letters, 102 selfloop transitions, 4 changer transitions 0/159 dead transitions. [2025-02-08 14:05:28,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 159 transitions, 720 flow [2025-02-08 14:05:28,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:05:28,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:05:28,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 350 transitions. [2025-02-08 14:05:28,470 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6422018348623854 [2025-02-08 14:05:28,470 INFO L175 Difference]: Start difference. First operand has 110 places, 109 transitions, 354 flow. Second operand 5 states and 350 transitions. [2025-02-08 14:05:28,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 159 transitions, 720 flow [2025-02-08 14:05:28,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 159 transitions, 712 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 14:05:28,536 INFO L231 Difference]: Finished difference. Result has 113 places, 109 transitions, 358 flow [2025-02-08 14:05:28,536 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=358, PETRI_PLACES=113, PETRI_TRANSITIONS=109} [2025-02-08 14:05:28,536 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, 18 predicate places. [2025-02-08 14:05:28,536 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 109 transitions, 358 flow [2025-02-08 14:05:28,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 53.6) internal successors, (268), 5 states have internal predecessors, (268), 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:28,537 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:28,537 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2025-02-08 14:05:28,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 14:05:28,537 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-02-08 14:05:28,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:28,537 INFO L85 PathProgramCache]: Analyzing trace with hash -991425343, now seen corresponding path program 1 times [2025-02-08 14:05:28,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:28,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365125089] [2025-02-08 14:05:28,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:28,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:28,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:05:28,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:05:28,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:28,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:05:28,567 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:05:28,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:05:28,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:05:28,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:28,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:05:28,583 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:05:28,587 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 14:05:28,587 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 19 remaining) [2025-02-08 14:05:28,587 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 19 remaining) [2025-02-08 14:05:28,587 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 19 remaining) [2025-02-08 14:05:28,587 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 19 remaining) [2025-02-08 14:05:28,587 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 19 remaining) [2025-02-08 14:05:28,587 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 19 remaining) [2025-02-08 14:05:28,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 19 remaining) [2025-02-08 14:05:28,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 19 remaining) [2025-02-08 14:05:28,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 19 remaining) [2025-02-08 14:05:28,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 19 remaining) [2025-02-08 14:05:28,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 19 remaining) [2025-02-08 14:05:28,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 19 remaining) [2025-02-08 14:05:28,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 19 remaining) [2025-02-08 14:05:28,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 19 remaining) [2025-02-08 14:05:28,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 19 remaining) [2025-02-08 14:05:28,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 19 remaining) [2025-02-08 14:05:28,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 19 remaining) [2025-02-08 14:05:28,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 19 remaining) [2025-02-08 14:05:28,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 19 remaining) [2025-02-08 14:05:28,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 14:05:28,589 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:05:28,589 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 14:05:28,589 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 14:05:28,621 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 14:05:28,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 144 transitions, 315 flow [2025-02-08 14:05:28,653 INFO L124 PetriNetUnfolderBase]: 46/282 cut-off events. [2025-02-08 14:05:28,653 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-08 14:05:28,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 307 conditions, 282 events. 46/282 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1216 event pairs, 1 based on Foata normal form. 0/192 useless extension candidates. Maximal degree in co-relation 197. Up to 12 conditions per place. [2025-02-08 14:05:28,655 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 144 transitions, 315 flow [2025-02-08 14:05:28,656 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 144 transitions, 315 flow [2025-02-08 14:05:28,657 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:05:28,660 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;@6577e34f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:05:28,660 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-02-08 14:05:28,662 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:05:28,662 INFO L124 PetriNetUnfolderBase]: 1/12 cut-off events. [2025-02-08 14:05:28,662 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:05:28,662 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:28,662 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 14:05:28,662 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-02-08 14:05:28,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:28,663 INFO L85 PathProgramCache]: Analyzing trace with hash 669233923, now seen corresponding path program 1 times [2025-02-08 14:05:28,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:28,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904604825] [2025-02-08 14:05:28,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:28,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:28,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:05:28,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:05:28,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:28,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:28,718 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:28,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:28,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904604825] [2025-02-08 14:05:28,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904604825] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:28,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:28,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:05:28,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788956700] [2025-02-08 14:05:28,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:28,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:05:28,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:28,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:05:28,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:05:28,722 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 144 [2025-02-08 14:05:28,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 144 transitions, 315 flow. Second operand has 4 states, 4 states have (on average 69.25) internal successors, (277), 4 states have internal predecessors, (277), 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:28,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:28,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 144 [2025-02-08 14:05:28,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:35,373 INFO L124 PetriNetUnfolderBase]: 71949/132767 cut-off events. [2025-02-08 14:05:35,373 INFO L125 PetriNetUnfolderBase]: For 1509/1509 co-relation queries the response was YES. [2025-02-08 14:05:35,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229864 conditions, 132767 events. 71949/132767 cut-off events. For 1509/1509 co-relation queries the response was YES. Maximal size of possible extension queue 3033. Compared 1432748 event pairs, 13366 based on Foata normal form. 42108/156684 useless extension candidates. Maximal degree in co-relation 117943. Up to 63142 conditions per place. [2025-02-08 14:05:36,008 INFO L140 encePairwiseOnDemand]: 119/144 looper letters, 117 selfloop transitions, 4 changer transitions 0/189 dead transitions. [2025-02-08 14:05:36,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 189 transitions, 647 flow [2025-02-08 14:05:36,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:05:36,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:05:36,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 450 transitions. [2025-02-08 14:05:36,010 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.78125 [2025-02-08 14:05:36,010 INFO L175 Difference]: Start difference. First operand has 125 places, 144 transitions, 315 flow. Second operand 4 states and 450 transitions. [2025-02-08 14:05:36,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 189 transitions, 647 flow [2025-02-08 14:05:36,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 189 transitions, 647 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:05:36,013 INFO L231 Difference]: Finished difference. Result has 127 places, 123 transitions, 281 flow [2025-02-08 14:05:36,013 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=281, PETRI_PLACES=127, PETRI_TRANSITIONS=123} [2025-02-08 14:05:36,014 INFO L279 CegarLoopForPetriNet]: 125 programPoint places, 2 predicate places. [2025-02-08 14:05:36,014 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 123 transitions, 281 flow [2025-02-08 14:05:36,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.25) internal successors, (277), 4 states have internal predecessors, (277), 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:36,014 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:36,014 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 14:05:36,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 14:05:36,014 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-02-08 14:05:36,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:36,015 INFO L85 PathProgramCache]: Analyzing trace with hash 669119430, now seen corresponding path program 1 times [2025-02-08 14:05:36,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:36,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521088755] [2025-02-08 14:05:36,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:36,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:36,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:05:36,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:05:36,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:36,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:36,044 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:36,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:36,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521088755] [2025-02-08 14:05:36,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521088755] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:36,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:36,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:05:36,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268890489] [2025-02-08 14:05:36,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:36,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:05:36,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:36,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:05:36,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:05:36,046 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 144 [2025-02-08 14:05:36,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 123 transitions, 281 flow. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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:36,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:36,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 144 [2025-02-08 14:05:36,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:43,726 INFO L124 PetriNetUnfolderBase]: 73794/132251 cut-off events. [2025-02-08 14:05:43,726 INFO L125 PetriNetUnfolderBase]: For 5491/5491 co-relation queries the response was YES. [2025-02-08 14:05:43,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236820 conditions, 132251 events. 73794/132251 cut-off events. For 5491/5491 co-relation queries the response was YES. Maximal size of possible extension queue 3206. Compared 1380629 event pairs, 42928 based on Foata normal form. 1/121073 useless extension candidates. Maximal degree in co-relation 15504. Up to 99611 conditions per place. [2025-02-08 14:05:44,353 INFO L140 encePairwiseOnDemand]: 141/144 looper letters, 64 selfloop transitions, 2 changer transitions 0/136 dead transitions. [2025-02-08 14:05:44,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 136 transitions, 441 flow [2025-02-08 14:05:44,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:05:44,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:05:44,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 280 transitions. [2025-02-08 14:05:44,355 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6481481481481481 [2025-02-08 14:05:44,355 INFO L175 Difference]: Start difference. First operand has 127 places, 123 transitions, 281 flow. Second operand 3 states and 280 transitions. [2025-02-08 14:05:44,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 136 transitions, 441 flow [2025-02-08 14:05:44,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 136 transitions, 431 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 14:05:44,360 INFO L231 Difference]: Finished difference. Result has 127 places, 124 transitions, 285 flow [2025-02-08 14:05:44,360 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=285, PETRI_PLACES=127, PETRI_TRANSITIONS=124} [2025-02-08 14:05:44,360 INFO L279 CegarLoopForPetriNet]: 125 programPoint places, 2 predicate places. [2025-02-08 14:05:44,360 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 124 transitions, 285 flow [2025-02-08 14:05:44,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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,361 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:44,361 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 14:05:44,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 14:05:44,361 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-02-08 14:05:44,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:44,361 INFO L85 PathProgramCache]: Analyzing trace with hash -728584259, now seen corresponding path program 1 times [2025-02-08 14:05:44,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:44,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670249202] [2025-02-08 14:05:44,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:44,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:44,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:05:44,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:05:44,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:44,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:44,407 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:44,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:44,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670249202] [2025-02-08 14:05:44,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670249202] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:44,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:44,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:05:44,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113028275] [2025-02-08 14:05:44,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:44,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:05:44,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:44,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:05:44,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:05:44,414 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 144 [2025-02-08 14:05:44,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 124 transitions, 285 flow. Second operand has 4 states, 4 states have (on average 69.25) internal successors, (277), 4 states have internal predecessors, (277), 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,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:44,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 144 [2025-02-08 14:05:44,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:52,954 INFO L124 PetriNetUnfolderBase]: 82835/148609 cut-off events. [2025-02-08 14:05:52,954 INFO L125 PetriNetUnfolderBase]: For 5523/5523 co-relation queries the response was YES. [2025-02-08 14:05:53,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 265627 conditions, 148609 events. 82835/148609 cut-off events. For 5523/5523 co-relation queries the response was YES. Maximal size of possible extension queue 3566. Compared 1576175 event pairs, 49168 based on Foata normal form. 12/136583 useless extension candidates. Maximal degree in co-relation 22144. Up to 112073 conditions per place. [2025-02-08 14:05:54,046 INFO L140 encePairwiseOnDemand]: 140/144 looper letters, 77 selfloop transitions, 3 changer transitions 0/148 dead transitions. [2025-02-08 14:05:54,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 148 transitions, 493 flow [2025-02-08 14:05:54,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:05:54,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:05:54,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 353 transitions. [2025-02-08 14:05:54,048 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6128472222222222 [2025-02-08 14:05:54,048 INFO L175 Difference]: Start difference. First operand has 127 places, 124 transitions, 285 flow. Second operand 4 states and 353 transitions. [2025-02-08 14:05:54,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 148 transitions, 493 flow [2025-02-08 14:05:54,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 148 transitions, 491 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:05:54,050 INFO L231 Difference]: Finished difference. Result has 131 places, 125 transitions, 299 flow [2025-02-08 14:05:54,051 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=299, PETRI_PLACES=131, PETRI_TRANSITIONS=125} [2025-02-08 14:05:54,051 INFO L279 CegarLoopForPetriNet]: 125 programPoint places, 6 predicate places. [2025-02-08 14:05:54,051 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 125 transitions, 299 flow [2025-02-08 14:05:54,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.25) internal successors, (277), 4 states have internal predecessors, (277), 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,051 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:54,052 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:05:54,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 14:05:54,052 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-02-08 14:05:54,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:54,052 INFO L85 PathProgramCache]: Analyzing trace with hash -380231482, now seen corresponding path program 1 times [2025-02-08 14:05:54,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:54,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967802386] [2025-02-08 14:05:54,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:54,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:54,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:05:54,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:05:54,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:54,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:54,089 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,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:54,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967802386] [2025-02-08 14:05:54,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967802386] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:54,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:54,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:05:54,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858507983] [2025-02-08 14:05:54,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:54,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:05:54,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:54,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:05:54,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:05:54,099 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 144 [2025-02-08 14:05:54,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 125 transitions, 299 flow. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:54,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 144 [2025-02-08 14:05:54,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand