./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_36-indirect_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc 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_36-indirect_racefree.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3eff698bae51c39e8a3a4c763800dbda831dabb73a169fa31c8e326faee47cd8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 18:45:24,589 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 18:45:24,634 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 18:45:24,638 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 18:45:24,638 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 18:45:24,651 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 18:45:24,652 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 18:45:24,652 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 18:45:24,652 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 18:45:24,652 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 18:45:24,652 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 18:45:24,652 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 18:45:24,653 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 18:45:24,653 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 18:45:24,653 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 18:45:24,653 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 18:45:24,653 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 18:45:24,653 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 18:45:24,653 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 18:45:24,653 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 18:45:24,653 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 18:45:24,653 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 18:45:24,653 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 18:45:24,653 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 18:45:24,653 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 18:45:24,653 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 18:45:24,653 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 18:45:24,653 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 18:45:24,653 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 18:45:24,653 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 18:45:24,654 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 18:45:24,654 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 18:45:24,654 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 18:45:24,654 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 18:45:24,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:45:24,654 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 18:45:24,654 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 18:45:24,654 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 18:45:24,654 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 18:45:24,654 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 18:45:24,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 18:45:24,654 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 18:45:24,654 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 18:45:24,654 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 18:45:24,654 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 18:45:24,654 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 -> 3eff698bae51c39e8a3a4c763800dbda831dabb73a169fa31c8e326faee47cd8 [2025-02-06 18:45:24,839 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 18:45:24,844 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 18:45:24,846 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 18:45:24,847 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 18:45:24,847 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 18:45:24,847 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_36-indirect_racefree.i [2025-02-06 18:45:26,031 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6f2b6e78f/3dd7ab43ebf247329b4dbc4308cb7921/FLAG75c96527e [2025-02-06 18:45:26,346 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 18:45:26,349 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_36-indirect_racefree.i [2025-02-06 18:45:26,364 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6f2b6e78f/3dd7ab43ebf247329b4dbc4308cb7921/FLAG75c96527e [2025-02-06 18:45:26,620 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6f2b6e78f/3dd7ab43ebf247329b4dbc4308cb7921 [2025-02-06 18:45:26,622 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 18:45:26,623 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 18:45:26,625 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 18:45:26,625 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 18:45:26,628 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 18:45:26,628 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:45:26" (1/1) ... [2025-02-06 18:45:26,630 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26371119 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:26, skipping insertion in model container [2025-02-06 18:45:26,630 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:45:26" (1/1) ... [2025-02-06 18:45:26,658 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 18:45:26,888 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:45:26,902 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 18:45:26,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:45:26,971 INFO L204 MainTranslator]: Completed translation [2025-02-06 18:45:26,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:26 WrapperNode [2025-02-06 18:45:26,972 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 18:45:26,973 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 18:45:26,974 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 18:45:26,974 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 18:45:26,978 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:26" (1/1) ... [2025-02-06 18:45:26,988 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:26" (1/1) ... [2025-02-06 18:45:27,001 INFO L138 Inliner]: procedures = 171, calls = 43, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 83 [2025-02-06 18:45:27,001 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 18:45:27,001 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 18:45:27,001 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 18:45:27,001 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 18:45:27,011 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:26" (1/1) ... [2025-02-06 18:45:27,012 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:26" (1/1) ... [2025-02-06 18:45:27,013 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:26" (1/1) ... [2025-02-06 18:45:27,032 INFO L175 MemorySlicer]: Split 20 memory accesses to 5 slices as follows [2, 5, 6, 5, 2]. 30 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 1, 5, 0]. The 3 writes are split as follows [0, 0, 2, 0, 1]. [2025-02-06 18:45:27,035 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:26" (1/1) ... [2025-02-06 18:45:27,036 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:26" (1/1) ... [2025-02-06 18:45:27,041 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:26" (1/1) ... [2025-02-06 18:45:27,041 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:26" (1/1) ... [2025-02-06 18:45:27,042 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:26" (1/1) ... [2025-02-06 18:45:27,043 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:26" (1/1) ... [2025-02-06 18:45:27,045 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 18:45:27,045 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 18:45:27,045 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 18:45:27,045 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 18:45:27,046 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:26" (1/1) ... [2025-02-06 18:45:27,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:45:27,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:45:27,081 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-06 18:45:27,083 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-06 18:45:27,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 18:45:27,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 18:45:27,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 18:45:27,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 18:45:27,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 18:45:27,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 18:45:27,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 18:45:27,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 18:45:27,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 18:45:27,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 18:45:27,099 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 18:45:27,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 18:45:27,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 18:45:27,099 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-06 18:45:27,099 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-06 18:45:27,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 18:45:27,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 18:45:27,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 18:45:27,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 18:45:27,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 18:45:27,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 18:45:27,100 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 18:45:27,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 18:45:27,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 18:45:27,101 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 18:45:27,193 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 18:45:27,195 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 18:45:27,317 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L709: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-02-06 18:45:27,317 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L709-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-02-06 18:45:27,353 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 18:45:27,353 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 18:45:27,449 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 18:45:27,449 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 18:45:27,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:45:27 BoogieIcfgContainer [2025-02-06 18:45:27,449 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 18:45:27,451 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 18:45:27,451 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 18:45:27,454 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 18:45:27,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:45:26" (1/3) ... [2025-02-06 18:45:27,455 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52a7798e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:45:27, skipping insertion in model container [2025-02-06 18:45:27,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:45:26" (2/3) ... [2025-02-06 18:45:27,455 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52a7798e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:45:27, skipping insertion in model container [2025-02-06 18:45:27,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:45:27" (3/3) ... [2025-02-06 18:45:27,456 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_36-indirect_racefree.i [2025-02-06 18:45:27,466 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 18:45:27,467 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_36-indirect_racefree.i that has 2 procedures, 54 locations, 1 initial locations, 6 loop locations, and 8 error locations. [2025-02-06 18:45:27,467 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 18:45:27,506 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-06 18:45:27,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 63 transitions, 133 flow [2025-02-06 18:45:27,561 INFO L124 PetriNetUnfolderBase]: 11/79 cut-off events. [2025-02-06 18:45:27,566 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 18:45:27,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 79 events. 11/79 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 244 event pairs, 0 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 54. Up to 4 conditions per place. [2025-02-06 18:45:27,569 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 63 transitions, 133 flow [2025-02-06 18:45:27,571 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 62 transitions, 131 flow [2025-02-06 18:45:27,592 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:45:27,603 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;@1acb4c68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:45:27,604 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-02-06 18:45:27,609 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 18:45:27,611 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-02-06 18:45:27,611 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 18:45:27,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:45:27,612 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 18:45:27,612 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-06 18:45:27,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:45:27,615 INFO L85 PathProgramCache]: Analyzing trace with hash 320598661, now seen corresponding path program 1 times [2025-02-06 18:45:27,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:45:27,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069040312] [2025-02-06 18:45:27,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:45:27,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:45:27,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 18:45:27,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 18:45:27,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:27,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:45:27,805 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-06 18:45:27,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:45:27,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069040312] [2025-02-06 18:45:27,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069040312] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:45:27,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:45:27,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:45:27,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460715754] [2025-02-06 18:45:27,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:45:27,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:45:27,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:45:27,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:45:27,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:45:27,846 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 63 [2025-02-06 18:45:27,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 62 transitions, 131 flow. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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-06 18:45:27,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:45:27,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 63 [2025-02-06 18:45:27,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:45:27,997 INFO L124 PetriNetUnfolderBase]: 132/449 cut-off events. [2025-02-06 18:45:27,997 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 18:45:27,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 746 conditions, 449 events. 132/449 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2188 event pairs, 100 based on Foata normal form. 113/512 useless extension candidates. Maximal degree in co-relation 726. Up to 255 conditions per place. [2025-02-06 18:45:28,004 INFO L140 encePairwiseOnDemand]: 49/63 looper letters, 46 selfloop transitions, 3 changer transitions 0/75 dead transitions. [2025-02-06 18:45:28,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 75 transitions, 255 flow [2025-02-06 18:45:28,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:45:28,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:45:28,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 176 transitions. [2025-02-06 18:45:28,016 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6984126984126984 [2025-02-06 18:45:28,017 INFO L175 Difference]: Start difference. First operand has 57 places, 62 transitions, 131 flow. Second operand 4 states and 176 transitions. [2025-02-06 18:45:28,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 75 transitions, 255 flow [2025-02-06 18:45:28,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 75 transitions, 255 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 18:45:28,026 INFO L231 Difference]: Finished difference. Result has 59 places, 52 transitions, 121 flow [2025-02-06 18:45:28,028 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=121, PETRI_PLACES=59, PETRI_TRANSITIONS=52} [2025-02-06 18:45:28,031 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 2 predicate places. [2025-02-06 18:45:28,032 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 121 flow [2025-02-06 18:45:28,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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-06 18:45:28,032 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:45:28,032 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-06 18:45:28,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 18:45:28,033 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-06 18:45:28,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:45:28,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1052293008, now seen corresponding path program 1 times [2025-02-06 18:45:28,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:45:28,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276006463] [2025-02-06 18:45:28,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:45:28,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:45:28,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 18:45:28,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 18:45:28,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:28,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:45:28,069 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:45:28,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 18:45:28,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 18:45:28,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:28,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:45:28,096 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:45:28,097 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 18:45:28,099 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-02-06 18:45:28,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2025-02-06 18:45:28,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2025-02-06 18:45:28,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2025-02-06 18:45:28,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2025-02-06 18:45:28,101 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2025-02-06 18:45:28,101 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2025-02-06 18:45:28,101 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2025-02-06 18:45:28,101 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2025-02-06 18:45:28,101 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2025-02-06 18:45:28,101 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2025-02-06 18:45:28,101 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2025-02-06 18:45:28,102 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2025-02-06 18:45:28,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 18:45:28,102 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-06 18:45:28,105 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 18:45:28,105 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 18:45:28,126 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 18:45:28,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 98 transitions, 212 flow [2025-02-06 18:45:28,150 INFO L124 PetriNetUnfolderBase]: 21/149 cut-off events. [2025-02-06 18:45:28,150 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 18:45:28,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 149 events. 21/149 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 562 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 96. Up to 6 conditions per place. [2025-02-06 18:45:28,153 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 98 transitions, 212 flow [2025-02-06 18:45:28,154 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 98 transitions, 212 flow [2025-02-06 18:45:28,157 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:45:28,157 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;@1acb4c68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:45:28,157 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-02-06 18:45:28,159 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 18:45:28,159 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-02-06 18:45:28,159 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 18:45:28,160 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:45:28,160 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 18:45:28,160 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-06 18:45:28,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:45:28,160 INFO L85 PathProgramCache]: Analyzing trace with hash 414152264, now seen corresponding path program 1 times [2025-02-06 18:45:28,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:45:28,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772201399] [2025-02-06 18:45:28,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:45:28,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:45:28,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 18:45:28,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 18:45:28,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:28,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:45:28,216 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-06 18:45:28,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:45:28,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772201399] [2025-02-06 18:45:28,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772201399] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:45:28,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:45:28,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:45:28,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901803437] [2025-02-06 18:45:28,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:45:28,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:45:28,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:45:28,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:45:28,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:45:28,224 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 98 [2025-02-06 18:45:28,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 98 transitions, 212 flow. Second operand has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 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-06 18:45:28,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:45:28,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 98 [2025-02-06 18:45:28,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:45:29,050 INFO L124 PetriNetUnfolderBase]: 4028/9079 cut-off events. [2025-02-06 18:45:29,052 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2025-02-06 18:45:29,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15557 conditions, 9079 events. 4028/9079 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 78014 event pairs, 3802 based on Foata normal form. 2495/10575 useless extension candidates. Maximal degree in co-relation 13397. Up to 6374 conditions per place. [2025-02-06 18:45:29,103 INFO L140 encePairwiseOnDemand]: 78/98 looper letters, 64 selfloop transitions, 3 changer transitions 0/109 dead transitions. [2025-02-06 18:45:29,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 109 transitions, 368 flow [2025-02-06 18:45:29,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:45:29,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:45:29,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 264 transitions. [2025-02-06 18:45:29,107 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.673469387755102 [2025-02-06 18:45:29,107 INFO L175 Difference]: Start difference. First operand has 87 places, 98 transitions, 212 flow. Second operand 4 states and 264 transitions. [2025-02-06 18:45:29,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 109 transitions, 368 flow [2025-02-06 18:45:29,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 109 transitions, 368 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 18:45:29,110 INFO L231 Difference]: Finished difference. Result has 92 places, 86 transitions, 208 flow [2025-02-06 18:45:29,111 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=208, PETRI_PLACES=92, PETRI_TRANSITIONS=86} [2025-02-06 18:45:29,112 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, 5 predicate places. [2025-02-06 18:45:29,112 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 86 transitions, 208 flow [2025-02-06 18:45:29,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 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-06 18:45:29,112 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:45:29,112 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 18:45:29,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 18:45:29,113 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-06 18:45:29,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:45:29,113 INFO L85 PathProgramCache]: Analyzing trace with hash -401474312, now seen corresponding path program 1 times [2025-02-06 18:45:29,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:45:29,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093679997] [2025-02-06 18:45:29,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:45:29,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:45:29,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 18:45:29,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 18:45:29,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:29,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:45:29,242 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-06 18:45:29,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:45:29,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093679997] [2025-02-06 18:45:29,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093679997] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:45:29,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:45:29,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:45:29,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631783403] [2025-02-06 18:45:29,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:45:29,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:45:29,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:45:29,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:45:29,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:45:29,256 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 98 [2025-02-06 18:45:29,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 86 transitions, 208 flow. Second operand has 6 states, 6 states have (on average 43.5) internal successors, (261), 6 states have internal predecessors, (261), 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-06 18:45:29,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:45:29,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 98 [2025-02-06 18:45:29,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:45:29,939 INFO L124 PetriNetUnfolderBase]: 3764/7611 cut-off events. [2025-02-06 18:45:29,939 INFO L125 PetriNetUnfolderBase]: For 664/664 co-relation queries the response was YES. [2025-02-06 18:45:29,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14321 conditions, 7611 events. 3764/7611 cut-off events. For 664/664 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 61363 event pairs, 622 based on Foata normal form. 144/7220 useless extension candidates. Maximal degree in co-relation 12956. Up to 4012 conditions per place. [2025-02-06 18:45:29,972 INFO L140 encePairwiseOnDemand]: 93/98 looper letters, 104 selfloop transitions, 6 changer transitions 0/152 dead transitions. [2025-02-06 18:45:29,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 152 transitions, 558 flow [2025-02-06 18:45:29,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:45:29,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 18:45:29,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 363 transitions. [2025-02-06 18:45:29,973 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6173469387755102 [2025-02-06 18:45:29,973 INFO L175 Difference]: Start difference. First operand has 92 places, 86 transitions, 208 flow. Second operand 6 states and 363 transitions. [2025-02-06 18:45:29,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 152 transitions, 558 flow [2025-02-06 18:45:29,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 152 transitions, 556 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:45:29,979 INFO L231 Difference]: Finished difference. Result has 95 places, 85 transitions, 214 flow [2025-02-06 18:45:29,980 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=214, PETRI_PLACES=95, PETRI_TRANSITIONS=85} [2025-02-06 18:45:29,980 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, 8 predicate places. [2025-02-06 18:45:29,980 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 85 transitions, 214 flow [2025-02-06 18:45:29,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 43.5) internal successors, (261), 6 states have internal predecessors, (261), 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-06 18:45:29,980 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:45:29,980 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:45:29,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 18:45:29,981 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-06 18:45:29,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:45:29,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1503328180, now seen corresponding path program 1 times [2025-02-06 18:45:29,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:45:29,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556538207] [2025-02-06 18:45:29,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:45:29,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:45:29,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 18:45:29,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 18:45:29,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:29,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:45:30,097 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-06 18:45:30,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:45:30,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556538207] [2025-02-06 18:45:30,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556538207] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:45:30,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:45:30,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:45:30,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704945594] [2025-02-06 18:45:30,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:45:30,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:45:30,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:45:30,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:45:30,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:45:30,101 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 98 [2025-02-06 18:45:30,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 85 transitions, 214 flow. Second operand has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 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-06 18:45:30,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:45:30,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 98 [2025-02-06 18:45:30,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:45:30,704 INFO L124 PetriNetUnfolderBase]: 3761/8277 cut-off events. [2025-02-06 18:45:30,704 INFO L125 PetriNetUnfolderBase]: For 1142/1303 co-relation queries the response was YES. [2025-02-06 18:45:30,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15096 conditions, 8277 events. 3761/8277 cut-off events. For 1142/1303 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 69034 event pairs, 1192 based on Foata normal form. 160/7761 useless extension candidates. Maximal degree in co-relation 11980. Up to 5273 conditions per place. [2025-02-06 18:45:30,737 INFO L140 encePairwiseOnDemand]: 92/98 looper letters, 95 selfloop transitions, 6 changer transitions 0/144 dead transitions. [2025-02-06 18:45:30,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 144 transitions, 579 flow [2025-02-06 18:45:30,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:45:30,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 18:45:30,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 317 transitions. [2025-02-06 18:45:30,738 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6469387755102041 [2025-02-06 18:45:30,738 INFO L175 Difference]: Start difference. First operand has 95 places, 85 transitions, 214 flow. Second operand 5 states and 317 transitions. [2025-02-06 18:45:30,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 144 transitions, 579 flow [2025-02-06 18:45:30,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 144 transitions, 556 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-02-06 18:45:30,744 INFO L231 Difference]: Finished difference. Result has 98 places, 90 transitions, 246 flow [2025-02-06 18:45:30,744 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=246, PETRI_PLACES=98, PETRI_TRANSITIONS=90} [2025-02-06 18:45:30,745 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, 11 predicate places. [2025-02-06 18:45:30,745 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 90 transitions, 246 flow [2025-02-06 18:45:30,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 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-06 18:45:30,745 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:45:30,745 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-02-06 18:45:30,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 18:45:30,745 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-06 18:45:30,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:45:30,746 INFO L85 PathProgramCache]: Analyzing trace with hash 439198577, now seen corresponding path program 1 times [2025-02-06 18:45:30,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:45:30,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109996314] [2025-02-06 18:45:30,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:45:30,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:45:30,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 18:45:30,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 18:45:30,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:30,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:45:30,790 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-06 18:45:30,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:45:30,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109996314] [2025-02-06 18:45:30,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109996314] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:45:30,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:45:30,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:45:30,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177639141] [2025-02-06 18:45:30,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:45:30,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:45:30,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:45:30,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:45:30,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:45:30,796 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 98 [2025-02-06 18:45:30,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 90 transitions, 246 flow. Second operand has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:45:30,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:45:30,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 98 [2025-02-06 18:45:30,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:45:31,367 INFO L124 PetriNetUnfolderBase]: 3699/7282 cut-off events. [2025-02-06 18:45:31,368 INFO L125 PetriNetUnfolderBase]: For 1659/1659 co-relation queries the response was YES. [2025-02-06 18:45:31,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14727 conditions, 7282 events. 3699/7282 cut-off events. For 1659/1659 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 57285 event pairs, 254 based on Foata normal form. 152/7109 useless extension candidates. Maximal degree in co-relation 13674. Up to 4701 conditions per place. [2025-02-06 18:45:31,388 INFO L140 encePairwiseOnDemand]: 93/98 looper letters, 96 selfloop transitions, 6 changer transitions 0/144 dead transitions. [2025-02-06 18:45:31,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 144 transitions, 602 flow [2025-02-06 18:45:31,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:45:31,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:45:31,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 254 transitions. [2025-02-06 18:45:31,390 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6479591836734694 [2025-02-06 18:45:31,390 INFO L175 Difference]: Start difference. First operand has 98 places, 90 transitions, 246 flow. Second operand 4 states and 254 transitions. [2025-02-06 18:45:31,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 144 transitions, 602 flow [2025-02-06 18:45:31,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 144 transitions, 598 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-06 18:45:31,393 INFO L231 Difference]: Finished difference. Result has 100 places, 90 transitions, 258 flow [2025-02-06 18:45:31,393 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=258, PETRI_PLACES=100, PETRI_TRANSITIONS=90} [2025-02-06 18:45:31,394 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, 13 predicate places. [2025-02-06 18:45:31,394 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 90 transitions, 258 flow [2025-02-06 18:45:31,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:45:31,394 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:45:31,394 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2025-02-06 18:45:31,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 18:45:31,394 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-06 18:45:31,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:45:31,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1163051360, now seen corresponding path program 1 times [2025-02-06 18:45:31,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:45:31,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136519218] [2025-02-06 18:45:31,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:45:31,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:45:31,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:45:31,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:45:31,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:31,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:45:31,406 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:45:31,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:45:31,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:45:31,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:31,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:45:31,415 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:45:31,415 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 18:45:31,415 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2025-02-06 18:45:31,415 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 17 remaining) [2025-02-06 18:45:31,415 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 17 remaining) [2025-02-06 18:45:31,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 17 remaining) [2025-02-06 18:45:31,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 17 remaining) [2025-02-06 18:45:31,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 17 remaining) [2025-02-06 18:45:31,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 17 remaining) [2025-02-06 18:45:31,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 17 remaining) [2025-02-06 18:45:31,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 17 remaining) [2025-02-06 18:45:31,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 17 remaining) [2025-02-06 18:45:31,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 17 remaining) [2025-02-06 18:45:31,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 17 remaining) [2025-02-06 18:45:31,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 17 remaining) [2025-02-06 18:45:31,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 17 remaining) [2025-02-06 18:45:31,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 17 remaining) [2025-02-06 18:45:31,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 17 remaining) [2025-02-06 18:45:31,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 17 remaining) [2025-02-06 18:45:31,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 18:45:31,417 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-06 18:45:31,417 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 18:45:31,417 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-06 18:45:31,437 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 18:45:31,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 133 transitions, 293 flow [2025-02-06 18:45:31,451 INFO L124 PetriNetUnfolderBase]: 34/238 cut-off events. [2025-02-06 18:45:31,451 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-06 18:45:31,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 238 events. 34/238 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1013 event pairs, 1 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 164. Up to 12 conditions per place. [2025-02-06 18:45:31,452 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 133 transitions, 293 flow [2025-02-06 18:45:31,453 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 133 transitions, 293 flow [2025-02-06 18:45:31,453 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:45:31,454 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;@1acb4c68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:45:31,454 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-02-06 18:45:31,455 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 18:45:31,455 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-02-06 18:45:31,455 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 18:45:31,455 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:45:31,455 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 18:45:31,455 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-06 18:45:31,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:45:31,456 INFO L85 PathProgramCache]: Analyzing trace with hash 541106542, now seen corresponding path program 1 times [2025-02-06 18:45:31,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:45:31,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870462845] [2025-02-06 18:45:31,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:45:31,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:45:31,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 18:45:31,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 18:45:31,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:31,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:45:31,483 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-06 18:45:31,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:45:31,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870462845] [2025-02-06 18:45:31,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870462845] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:45:31,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:45:31,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:45:31,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852452212] [2025-02-06 18:45:31,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:45:31,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:45:31,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:45:31,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:45:31,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:45:31,494 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 133 [2025-02-06 18:45:31,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 133 transitions, 293 flow. Second operand has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:45:31,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:45:31,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 133 [2025-02-06 18:45:31,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:45:39,362 INFO L124 PetriNetUnfolderBase]: 76325/139760 cut-off events. [2025-02-06 18:45:39,362 INFO L125 PetriNetUnfolderBase]: For 1636/1636 co-relation queries the response was YES. [2025-02-06 18:45:39,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246857 conditions, 139760 events. 76325/139760 cut-off events. For 1636/1636 co-relation queries the response was YES. Maximal size of possible extension queue 3161. Compared 1481862 event pairs, 73710 based on Foata normal form. 44347/170893 useless extension candidates. Maximal degree in co-relation 126395. Up to 105935 conditions per place. [2025-02-06 18:45:40,006 INFO L140 encePairwiseOnDemand]: 107/133 looper letters, 77 selfloop transitions, 3 changer transitions 0/138 dead transitions. [2025-02-06 18:45:40,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 138 transitions, 463 flow [2025-02-06 18:45:40,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:45:40,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:45:40,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 347 transitions. [2025-02-06 18:45:40,008 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6522556390977443 [2025-02-06 18:45:40,008 INFO L175 Difference]: Start difference. First operand has 117 places, 133 transitions, 293 flow. Second operand 4 states and 347 transitions. [2025-02-06 18:45:40,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 138 transitions, 463 flow [2025-02-06 18:45:40,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 138 transitions, 463 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 18:45:40,015 INFO L231 Difference]: Finished difference. Result has 122 places, 115 transitions, 277 flow [2025-02-06 18:45:40,015 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=277, PETRI_PLACES=122, PETRI_TRANSITIONS=115} [2025-02-06 18:45:40,016 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 5 predicate places. [2025-02-06 18:45:40,017 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 115 transitions, 277 flow [2025-02-06 18:45:40,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:45:40,017 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:45:40,018 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 18:45:40,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 18:45:40,018 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-06 18:45:40,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:45:40,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1678965576, now seen corresponding path program 1 times [2025-02-06 18:45:40,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:45:40,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125811973] [2025-02-06 18:45:40,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:45:40,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:45:40,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 18:45:40,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 18:45:40,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:40,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:45:40,086 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-06 18:45:40,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:45:40,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125811973] [2025-02-06 18:45:40,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125811973] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:45:40,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:45:40,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:45:40,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899252686] [2025-02-06 18:45:40,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:45:40,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:45:40,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:45:40,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:45:40,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:45:40,099 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 133 [2025-02-06 18:45:40,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 115 transitions, 277 flow. Second operand has 6 states, 6 states have (on average 59.5) internal successors, (357), 6 states have internal predecessors, (357), 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-06 18:45:40,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:45:40,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 133 [2025-02-06 18:45:40,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:45:47,036 INFO L124 PetriNetUnfolderBase]: 71309/117175 cut-off events. [2025-02-06 18:45:47,037 INFO L125 PetriNetUnfolderBase]: For 7069/7069 co-relation queries the response was YES. [2025-02-06 18:45:47,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224936 conditions, 117175 events. 71309/117175 cut-off events. For 7069/7069 co-relation queries the response was YES. Maximal size of possible extension queue 2662. Compared 1115389 event pairs, 8196 based on Foata normal form. 1872/112251 useless extension candidates. Maximal degree in co-relation 18776. Up to 66277 conditions per place. [2025-02-06 18:45:47,591 INFO L140 encePairwiseOnDemand]: 128/133 looper letters, 139 selfloop transitions, 6 changer transitions 0/203 dead transitions. [2025-02-06 18:45:47,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 203 transitions, 741 flow [2025-02-06 18:45:47,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:45:47,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 18:45:47,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 494 transitions. [2025-02-06 18:45:47,593 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2025-02-06 18:45:47,593 INFO L175 Difference]: Start difference. First operand has 122 places, 115 transitions, 277 flow. Second operand 6 states and 494 transitions. [2025-02-06 18:45:47,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 203 transitions, 741 flow [2025-02-06 18:45:47,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 203 transitions, 739 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:45:47,599 INFO L231 Difference]: Finished difference. Result has 125 places, 114 transitions, 283 flow [2025-02-06 18:45:47,599 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=283, PETRI_PLACES=125, PETRI_TRANSITIONS=114} [2025-02-06 18:45:47,599 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 8 predicate places. [2025-02-06 18:45:47,599 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 114 transitions, 283 flow [2025-02-06 18:45:47,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 59.5) internal successors, (357), 6 states have internal predecessors, (357), 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-06 18:45:47,600 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:45:47,600 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:45:47,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 18:45:47,600 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-06 18:45:47,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:45:47,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1302706642, now seen corresponding path program 1 times [2025-02-06 18:45:47,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:45:47,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705391080] [2025-02-06 18:45:47,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:45:47,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:45:47,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 18:45:47,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 18:45:47,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:47,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:45:47,672 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-06 18:45:47,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:45:47,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705391080] [2025-02-06 18:45:47,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705391080] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:45:47,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:45:47,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:45:47,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444214858] [2025-02-06 18:45:47,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:45:47,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:45:47,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:45:47,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:45:47,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:45:47,678 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 133 [2025-02-06 18:45:47,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 114 transitions, 283 flow. Second operand has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 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-06 18:45:47,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:45:47,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 133 [2025-02-06 18:45:47,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:45:55,662 INFO L124 PetriNetUnfolderBase]: 74926/134330 cut-off events. [2025-02-06 18:45:55,664 INFO L125 PetriNetUnfolderBase]: For 17853/20101 co-relation queries the response was YES. [2025-02-06 18:45:55,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 248970 conditions, 134330 events. 74926/134330 cut-off events. For 17853/20101 co-relation queries the response was YES. Maximal size of possible extension queue 3130. Compared 1388438 event pairs, 30365 based on Foata normal form. 1960/126353 useless extension candidates. Maximal degree in co-relation 166895. Up to 96498 conditions per place. [2025-02-06 18:45:56,322 INFO L140 encePairwiseOnDemand]: 126/133 looper letters, 133 selfloop transitions, 8 changer transitions 0/200 dead transitions. [2025-02-06 18:45:56,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 200 transitions, 806 flow [2025-02-06 18:45:56,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:45:56,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 18:45:56,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 437 transitions. [2025-02-06 18:45:56,329 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6571428571428571 [2025-02-06 18:45:56,329 INFO L175 Difference]: Start difference. First operand has 125 places, 114 transitions, 283 flow. Second operand 5 states and 437 transitions. [2025-02-06 18:45:56,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 200 transitions, 806 flow [2025-02-06 18:45:56,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 200 transitions, 783 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-02-06 18:45:56,345 INFO L231 Difference]: Finished difference. Result has 128 places, 121 transitions, 332 flow [2025-02-06 18:45:56,349 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=332, PETRI_PLACES=128, PETRI_TRANSITIONS=121} [2025-02-06 18:45:56,349 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 11 predicate places. [2025-02-06 18:45:56,349 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 121 transitions, 332 flow [2025-02-06 18:45:56,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 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-06 18:45:56,349 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:45:56,349 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-02-06 18:45:56,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 18:45:56,349 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-06 18:45:56,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:45:56,351 INFO L85 PathProgramCache]: Analyzing trace with hash -508324810, now seen corresponding path program 1 times [2025-02-06 18:45:56,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:45:56,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914058304] [2025-02-06 18:45:56,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:45:56,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:45:56,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 18:45:56,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 18:45:56,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:45:56,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:45:56,538 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-06 18:45:56,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:45:56,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914058304] [2025-02-06 18:45:56,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914058304] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:45:56,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:45:56,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:45:56,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378925855] [2025-02-06 18:45:56,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:45:56,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:45:56,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:45:56,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:45:56,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:45:56,547 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 133 [2025-02-06 18:45:56,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 121 transitions, 332 flow. Second operand has 4 states, 4 states have (on average 60.25) internal successors, (241), 4 states have internal predecessors, (241), 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-06 18:45:56,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:45:56,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 133 [2025-02-06 18:45:56,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand