./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/05-lval_ls_12-fldsense_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/05-lval_ls_12-fldsense_nr.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 f07f53b70b113c395773370086657e2cda4799340cf7206361c323fc526218bf --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:19:53,269 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:19:53,318 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:19:53,327 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:19:53,327 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:19:53,348 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:19:53,349 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:19:53,349 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:19:53,350 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:19:53,350 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:19:53,350 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:19:53,350 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:19:53,350 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:19:53,353 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:19:53,353 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:19:53,354 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:19:53,354 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:19:53,354 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:19:53,354 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:19:53,354 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:19:53,354 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:19:53,354 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:19:53,354 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:19:53,354 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:19:53,354 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:19:53,355 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:19:53,355 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:19:53,355 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:19:53,355 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:19:53,355 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:19:53,355 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:19:53,355 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:19:53,355 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:19:53,355 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:19:53,355 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:19:53,356 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:19:53,356 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:19:53,356 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:19:53,356 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:19:53,356 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:19:53,356 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:19:53,356 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:19:53,356 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:19:53,356 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:19:53,356 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:19:53,356 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/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 -> f07f53b70b113c395773370086657e2cda4799340cf7206361c323fc526218bf [2025-03-04 15:19:53,606 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:19:53,612 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:19:53,614 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:19:53,615 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:19:53,615 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:19:53,617 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/05-lval_ls_12-fldsense_nr.i [2025-03-04 15:19:54,781 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01c142884/44beba64fad74a3e85b697857b253ce5/FLAGd53c75e94 [2025-03-04 15:19:55,047 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:19:55,047 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/05-lval_ls_12-fldsense_nr.i [2025-03-04 15:19:55,062 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01c142884/44beba64fad74a3e85b697857b253ce5/FLAGd53c75e94 [2025-03-04 15:19:55,077 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01c142884/44beba64fad74a3e85b697857b253ce5 [2025-03-04 15:19:55,079 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:19:55,080 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:19:55,082 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:19:55,082 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:19:55,085 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:19:55,087 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:19:55" (1/1) ... [2025-03-04 15:19:55,087 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@547dfb53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:19:55, skipping insertion in model container [2025-03-04 15:19:55,088 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:19:55" (1/1) ... [2025-03-04 15:19:55,115 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:19:55,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:19:55,302 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:19:55,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:19:55,355 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:19:55,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:19:55 WrapperNode [2025-03-04 15:19:55,356 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:19:55,357 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:19:55,357 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:19:55,357 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:19:55,361 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:19:55" (1/1) ... [2025-03-04 15:19:55,368 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:19:55" (1/1) ... [2025-03-04 15:19:55,379 INFO L138 Inliner]: procedures = 162, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 57 [2025-03-04 15:19:55,380 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:19:55,380 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:19:55,380 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:19:55,380 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:19:55,384 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:19:55" (1/1) ... [2025-03-04 15:19:55,385 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:19:55" (1/1) ... [2025-03-04 15:19:55,386 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:19:55" (1/1) ... [2025-03-04 15:19:55,395 INFO L175 MemorySlicer]: Split 18 memory accesses to 2 slices as follows [8, 10]. 56 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 10]. The 3 writes are split as follows [3, 0]. [2025-03-04 15:19:55,395 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:19:55" (1/1) ... [2025-03-04 15:19:55,395 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:19:55" (1/1) ... [2025-03-04 15:19:55,399 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:19:55" (1/1) ... [2025-03-04 15:19:55,399 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:19:55" (1/1) ... [2025-03-04 15:19:55,400 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:19:55" (1/1) ... [2025-03-04 15:19:55,400 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:19:55" (1/1) ... [2025-03-04 15:19:55,404 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:19:55,405 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:19:55,405 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:19:55,405 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:19:55,405 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:19:55" (1/1) ... [2025-03-04 15:19:55,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:19:55,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:19:55,426 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 15:19:55,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 15:19:55,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:19:55,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:19:55,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:19:55,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:19:55,441 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 15:19:55,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:19:55,441 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 15:19:55,441 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 15:19:55,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:19:55,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:19:55,441 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 15:19:55,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:19:55,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:19:55,442 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 15:19:55,519 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:19:55,520 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:19:55,631 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:19:55,631 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:19:55,717 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:19:55,717 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:19:55,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:19:55 BoogieIcfgContainer [2025-03-04 15:19:55,718 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:19:55,719 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:19:55,719 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:19:55,723 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:19:55,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:19:55" (1/3) ... [2025-03-04 15:19:55,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2193d430 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:19:55, skipping insertion in model container [2025-03-04 15:19:55,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:19:55" (2/3) ... [2025-03-04 15:19:55,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2193d430 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:19:55, skipping insertion in model container [2025-03-04 15:19:55,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:19:55" (3/3) ... [2025-03-04 15:19:55,726 INFO L128 eAbstractionObserver]: Analyzing ICFG 05-lval_ls_12-fldsense_nr.i [2025-03-04 15:19:55,736 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:19:55,737 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 05-lval_ls_12-fldsense_nr.i that has 2 procedures, 30 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-03-04 15:19:55,737 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:19:55,761 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 15:19:55,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 29 transitions, 62 flow [2025-03-04 15:19:55,811 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2025-03-04 15:19:55,813 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:19:55,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 28 events. 0/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 36 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-03-04 15:19:55,817 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 29 transitions, 62 flow [2025-03-04 15:19:55,819 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 28 transitions, 59 flow [2025-03-04 15:19:55,826 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:19:55,836 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;@11d7ce44, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:19:55,837 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-04 15:19:55,840 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:19:55,841 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-03-04 15:19:55,841 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:19:55,842 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:19:55,842 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:19:55,842 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:19:55,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:19:55,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1378069308, now seen corresponding path program 1 times [2025-03-04 15:19:55,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:19:55,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118757889] [2025-03-04 15:19:55,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:19:55,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:19:55,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:19:55,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:19:55,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:19:55,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:19:56,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:19:56,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:19:56,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118757889] [2025-03-04 15:19:56,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118757889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:19:56,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:19:56,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:19:56,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413038661] [2025-03-04 15:19:56,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:19:56,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:19:56,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:19:56,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:19:56,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:19:56,110 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 29 [2025-03-04 15:19:56,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 59 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-03-04 15:19:56,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:19:56,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 29 [2025-03-04 15:19:56,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:19:56,240 INFO L124 PetriNetUnfolderBase]: 68/203 cut-off events. [2025-03-04 15:19:56,240 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:19:56,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 364 conditions, 203 events. 68/203 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 865 event pairs, 35 based on Foata normal form. 11/195 useless extension candidates. Maximal degree in co-relation 355. Up to 131 conditions per place. [2025-03-04 15:19:56,244 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 28 selfloop transitions, 6 changer transitions 3/46 dead transitions. [2025-03-04 15:19:56,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 46 transitions, 169 flow [2025-03-04 15:19:56,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:19:56,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:19:56,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2025-03-04 15:19:56,257 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6275862068965518 [2025-03-04 15:19:56,258 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 59 flow. Second operand 5 states and 91 transitions. [2025-03-04 15:19:56,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 46 transitions, 169 flow [2025-03-04 15:19:56,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 46 transitions, 168 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:19:56,263 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 102 flow [2025-03-04 15:19:56,264 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=102, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2025-03-04 15:19:56,266 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 6 predicate places. [2025-03-04 15:19:56,267 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 102 flow [2025-03-04 15:19:56,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-03-04 15:19:56,267 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:19:56,267 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:19:56,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:19:56,267 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:19:56,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:19:56,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1377956985, now seen corresponding path program 1 times [2025-03-04 15:19:56,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:19:56,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720567791] [2025-03-04 15:19:56,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:19:56,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:19:56,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:19:56,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:19:56,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:19:56,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:19:56,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:19:56,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:19:56,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720567791] [2025-03-04 15:19:56,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720567791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:19:56,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:19:56,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:19:56,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624417001] [2025-03-04 15:19:56,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:19:56,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:19:56,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:19:56,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:19:56,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:19:56,334 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 29 [2025-03-04 15:19:56,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-03-04 15:19:56,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:19:56,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 29 [2025-03-04 15:19:56,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:19:56,435 INFO L124 PetriNetUnfolderBase]: 62/189 cut-off events. [2025-03-04 15:19:56,435 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-03-04 15:19:56,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 411 conditions, 189 events. 62/189 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 778 event pairs, 28 based on Foata normal form. 12/192 useless extension candidates. Maximal degree in co-relation 398. Up to 124 conditions per place. [2025-03-04 15:19:56,437 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 27 selfloop transitions, 7 changer transitions 0/43 dead transitions. [2025-03-04 15:19:56,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 43 transitions, 199 flow [2025-03-04 15:19:56,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:19:56,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:19:56,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2025-03-04 15:19:56,438 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.593103448275862 [2025-03-04 15:19:56,438 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 102 flow. Second operand 5 states and 86 transitions. [2025-03-04 15:19:56,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 43 transitions, 199 flow [2025-03-04 15:19:56,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 199 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:19:56,439 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 148 flow [2025-03-04 15:19:56,439 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=148, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2025-03-04 15:19:56,440 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 13 predicate places. [2025-03-04 15:19:56,440 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 148 flow [2025-03-04 15:19:56,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-03-04 15:19:56,440 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:19:56,440 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:19:56,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:19:56,440 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:19:56,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:19:56,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1836755579, now seen corresponding path program 1 times [2025-03-04 15:19:56,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:19:56,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885387647] [2025-03-04 15:19:56,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:19:56,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:19:56,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:19:56,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:19:56,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:19:56,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:19:56,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:19:56,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:19:56,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885387647] [2025-03-04 15:19:56,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885387647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:19:56,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:19:56,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:19:56,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533292775] [2025-03-04 15:19:56,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:19:56,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:19:56,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:19:56,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:19:56,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:19:56,542 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 29 [2025-03-04 15:19:56,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-03-04 15:19:56,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:19:56,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 29 [2025-03-04 15:19:56,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:19:56,605 INFO L124 PetriNetUnfolderBase]: 35/131 cut-off events. [2025-03-04 15:19:56,607 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-03-04 15:19:56,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306 conditions, 131 events. 35/131 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 474 event pairs, 12 based on Foata normal form. 6/133 useless extension candidates. Maximal degree in co-relation 288. Up to 54 conditions per place. [2025-03-04 15:19:56,609 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 24 selfloop transitions, 4 changer transitions 0/39 dead transitions. [2025-03-04 15:19:56,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 39 transitions, 188 flow [2025-03-04 15:19:56,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:19:56,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:19:56,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2025-03-04 15:19:56,610 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7126436781609196 [2025-03-04 15:19:56,610 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 148 flow. Second operand 3 states and 62 transitions. [2025-03-04 15:19:56,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 39 transitions, 188 flow [2025-03-04 15:19:56,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 39 transitions, 175 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-03-04 15:19:56,612 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 113 flow [2025-03-04 15:19:56,612 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2025-03-04 15:19:56,613 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 10 predicate places. [2025-03-04 15:19:56,613 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 113 flow [2025-03-04 15:19:56,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-03-04 15:19:56,613 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:19:56,613 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:19:56,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:19:56,613 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:19:56,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:19:56,616 INFO L85 PathProgramCache]: Analyzing trace with hash -988044353, now seen corresponding path program 1 times [2025-03-04 15:19:56,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:19:56,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191678851] [2025-03-04 15:19:56,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:19:56,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:19:56,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:19:56,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:19:56,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:19:56,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:19:56,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:19:56,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:19:56,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191678851] [2025-03-04 15:19:56,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191678851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:19:56,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:19:56,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:19:56,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556860975] [2025-03-04 15:19:56,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:19:56,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:19:56,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:19:56,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:19:56,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:19:56,790 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 15:19:56,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 113 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-03-04 15:19:56,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:19:56,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 15:19:56,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:19:56,903 INFO L124 PetriNetUnfolderBase]: 46/156 cut-off events. [2025-03-04 15:19:56,903 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-03-04 15:19:56,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 357 conditions, 156 events. 46/156 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 606 event pairs, 33 based on Foata normal form. 6/156 useless extension candidates. Maximal degree in co-relation 341. Up to 51 conditions per place. [2025-03-04 15:19:56,904 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 31 selfloop transitions, 6 changer transitions 3/47 dead transitions. [2025-03-04 15:19:56,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 47 transitions, 229 flow [2025-03-04 15:19:56,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:19:56,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:19:56,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2025-03-04 15:19:56,906 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5114942528735632 [2025-03-04 15:19:56,906 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 113 flow. Second operand 6 states and 89 transitions. [2025-03-04 15:19:56,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 47 transitions, 229 flow [2025-03-04 15:19:56,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 47 transitions, 221 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:19:56,907 INFO L231 Difference]: Finished difference. Result has 45 places, 31 transitions, 117 flow [2025-03-04 15:19:56,908 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=117, PETRI_PLACES=45, PETRI_TRANSITIONS=31} [2025-03-04 15:19:56,908 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 13 predicate places. [2025-03-04 15:19:56,908 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 31 transitions, 117 flow [2025-03-04 15:19:56,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-03-04 15:19:56,908 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:19:56,908 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:19:56,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:19:56,909 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:19:56,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:19:56,909 INFO L85 PathProgramCache]: Analyzing trace with hash -465223464, now seen corresponding path program 1 times [2025-03-04 15:19:56,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:19:56,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260727543] [2025-03-04 15:19:56,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:19:56,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:19:56,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:19:56,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:19:56,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:19:56,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:19:57,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:19:57,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:19:57,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260727543] [2025-03-04 15:19:57,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260727543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:19:57,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:19:57,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:19:57,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106065280] [2025-03-04 15:19:57,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:19:57,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:19:57,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:19:57,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:19:57,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:19:57,034 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 15:19:57,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 31 transitions, 117 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-03-04 15:19:57,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:19:57,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 15:19:57,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:19:57,134 INFO L124 PetriNetUnfolderBase]: 45/155 cut-off events. [2025-03-04 15:19:57,134 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2025-03-04 15:19:57,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 358 conditions, 155 events. 45/155 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 601 event pairs, 39 based on Foata normal form. 2/149 useless extension candidates. Maximal degree in co-relation 340. Up to 74 conditions per place. [2025-03-04 15:19:57,135 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 27 selfloop transitions, 6 changer transitions 3/43 dead transitions. [2025-03-04 15:19:57,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 43 transitions, 215 flow [2025-03-04 15:19:57,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:19:57,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:19:57,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2025-03-04 15:19:57,136 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4885057471264368 [2025-03-04 15:19:57,136 INFO L175 Difference]: Start difference. First operand has 45 places, 31 transitions, 117 flow. Second operand 6 states and 85 transitions. [2025-03-04 15:19:57,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 43 transitions, 215 flow [2025-03-04 15:19:57,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 43 transitions, 201 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-04 15:19:57,138 INFO L231 Difference]: Finished difference. Result has 45 places, 30 transitions, 111 flow [2025-03-04 15:19:57,138 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=111, PETRI_PLACES=45, PETRI_TRANSITIONS=30} [2025-03-04 15:19:57,138 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 13 predicate places. [2025-03-04 15:19:57,138 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 30 transitions, 111 flow [2025-03-04 15:19:57,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-03-04 15:19:57,138 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:19:57,138 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:19:57,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:19:57,139 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:19:57,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:19:57,139 INFO L85 PathProgramCache]: Analyzing trace with hash -988423317, now seen corresponding path program 1 times [2025-03-04 15:19:57,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:19:57,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086663751] [2025-03-04 15:19:57,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:19:57,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:19:57,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:19:57,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:19:57,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:19:57,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:19:57,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:19:57,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:19:57,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086663751] [2025-03-04 15:19:57,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086663751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:19:57,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:19:57,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:19:57,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722076408] [2025-03-04 15:19:57,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:19:57,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:19:57,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:19:57,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:19:57,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:19:57,223 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 29 [2025-03-04 15:19:57,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 30 transitions, 111 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-03-04 15:19:57,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:19:57,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 29 [2025-03-04 15:19:57,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:19:57,278 INFO L124 PetriNetUnfolderBase]: 39/132 cut-off events. [2025-03-04 15:19:57,278 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2025-03-04 15:19:57,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 307 conditions, 132 events. 39/132 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 438 event pairs, 15 based on Foata normal form. 8/139 useless extension candidates. Maximal degree in co-relation 290. Up to 53 conditions per place. [2025-03-04 15:19:57,279 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 20 selfloop transitions, 3 changer transitions 8/38 dead transitions. [2025-03-04 15:19:57,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 38 transitions, 201 flow [2025-03-04 15:19:57,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:19:57,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:19:57,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2025-03-04 15:19:57,280 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5948275862068966 [2025-03-04 15:19:57,280 INFO L175 Difference]: Start difference. First operand has 45 places, 30 transitions, 111 flow. Second operand 4 states and 69 transitions. [2025-03-04 15:19:57,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 38 transitions, 201 flow [2025-03-04 15:19:57,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 38 transitions, 184 flow, removed 2 selfloop flow, removed 5 redundant places. [2025-03-04 15:19:57,282 INFO L231 Difference]: Finished difference. Result has 41 places, 26 transitions, 88 flow [2025-03-04 15:19:57,282 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=88, PETRI_PLACES=41, PETRI_TRANSITIONS=26} [2025-03-04 15:19:57,283 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 9 predicate places. [2025-03-04 15:19:57,283 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 26 transitions, 88 flow [2025-03-04 15:19:57,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-03-04 15:19:57,283 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:19:57,283 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:19:57,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:19:57,283 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:19:57,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:19:57,283 INFO L85 PathProgramCache]: Analyzing trace with hash -564603722, now seen corresponding path program 1 times [2025-03-04 15:19:57,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:19:57,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49201162] [2025-03-04 15:19:57,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:19:57,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:19:57,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:19:57,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:19:57,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:19:57,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:19:57,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:19:57,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:19:57,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49201162] [2025-03-04 15:19:57,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49201162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:19:57,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:19:57,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:19:57,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57675169] [2025-03-04 15:19:57,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:19:57,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:19:57,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:19:57,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:19:57,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:19:57,390 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 15:19:57,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 26 transitions, 88 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-03-04 15:19:57,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:19:57,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 15:19:57,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:19:57,466 INFO L124 PetriNetUnfolderBase]: 18/73 cut-off events. [2025-03-04 15:19:57,466 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-04 15:19:57,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 73 events. 18/73 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 187 event pairs, 9 based on Foata normal form. 6/78 useless extension candidates. Maximal degree in co-relation 155. Up to 19 conditions per place. [2025-03-04 15:19:57,467 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 10 selfloop transitions, 3 changer transitions 18/34 dead transitions. [2025-03-04 15:19:57,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 34 transitions, 166 flow [2025-03-04 15:19:57,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:19:57,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:19:57,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 86 transitions. [2025-03-04 15:19:57,468 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4236453201970443 [2025-03-04 15:19:57,468 INFO L175 Difference]: Start difference. First operand has 41 places, 26 transitions, 88 flow. Second operand 7 states and 86 transitions. [2025-03-04 15:19:57,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 34 transitions, 166 flow [2025-03-04 15:19:57,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 34 transitions, 154 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 15:19:57,469 INFO L231 Difference]: Finished difference. Result has 42 places, 14 transitions, 50 flow [2025-03-04 15:19:57,469 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=50, PETRI_PLACES=42, PETRI_TRANSITIONS=14} [2025-03-04 15:19:57,470 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 10 predicate places. [2025-03-04 15:19:57,470 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 14 transitions, 50 flow [2025-03-04 15:19:57,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-03-04 15:19:57,470 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:19:57,470 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:19:57,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:19:57,470 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:19:57,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:19:57,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1537025372, now seen corresponding path program 1 times [2025-03-04 15:19:57,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:19:57,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772660985] [2025-03-04 15:19:57,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:19:57,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:19:57,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:19:57,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:19:57,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:19:57,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:19:57,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:19:57,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:19:57,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772660985] [2025-03-04 15:19:57,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772660985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:19:57,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:19:57,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:19:57,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139366789] [2025-03-04 15:19:57,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:19:57,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:19:57,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:19:57,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:19:57,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:19:57,584 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 15:19:57,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 14 transitions, 50 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-03-04 15:19:57,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:19:57,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 15:19:57,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:19:57,624 INFO L124 PetriNetUnfolderBase]: 7/30 cut-off events. [2025-03-04 15:19:57,624 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2025-03-04 15:19:57,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 30 events. 7/30 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 29 event pairs, 2 based on Foata normal form. 2/31 useless extension candidates. Maximal degree in co-relation 72. Up to 12 conditions per place. [2025-03-04 15:19:57,625 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 0 selfloop transitions, 0 changer transitions 17/17 dead transitions. [2025-03-04 15:19:57,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 17 transitions, 83 flow [2025-03-04 15:19:57,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:19:57,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:19:57,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2025-03-04 15:19:57,625 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3620689655172414 [2025-03-04 15:19:57,626 INFO L175 Difference]: Start difference. First operand has 42 places, 14 transitions, 50 flow. Second operand 6 states and 63 transitions. [2025-03-04 15:19:57,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 17 transitions, 83 flow [2025-03-04 15:19:57,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 17 transitions, 71 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 15:19:57,626 INFO L231 Difference]: Finished difference. Result has 25 places, 0 transitions, 0 flow [2025-03-04 15:19:57,626 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=13, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=25, PETRI_TRANSITIONS=0} [2025-03-04 15:19:57,626 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, -7 predicate places. [2025-03-04 15:19:57,626 INFO L471 AbstractCegarLoop]: Abstraction has has 25 places, 0 transitions, 0 flow [2025-03-04 15:19:57,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-03-04 15:19:57,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 9 remaining) [2025-03-04 15:19:57,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 9 remaining) [2025-03-04 15:19:57,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 9 remaining) [2025-03-04 15:19:57,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 9 remaining) [2025-03-04 15:19:57,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2025-03-04 15:19:57,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 9 remaining) [2025-03-04 15:19:57,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 9 remaining) [2025-03-04 15:19:57,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 9 remaining) [2025-03-04 15:19:57,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 9 remaining) [2025-03-04 15:19:57,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:19:57,632 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:19:57,636 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 15:19:57,636 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 15:19:57,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 03:19:57 BasicIcfg [2025-03-04 15:19:57,642 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 15:19:57,642 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:19:57,642 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:19:57,642 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:19:57,643 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:19:55" (3/4) ... [2025-03-04 15:19:57,644 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 15:19:57,647 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-03-04 15:19:57,649 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2025-03-04 15:19:57,649 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-03-04 15:19:57,649 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 15:19:57,649 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-04 15:19:57,649 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 15:19:57,705 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 15:19:57,705 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 15:19:57,705 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:19:57,706 INFO L158 Benchmark]: Toolchain (without parser) took 2625.39ms. Allocated memory is still 142.6MB. Free memory was 110.9MB in the beginning and 39.1MB in the end (delta: 71.8MB). Peak memory consumption was 69.0MB. Max. memory is 16.1GB. [2025-03-04 15:19:57,706 INFO L158 Benchmark]: CDTParser took 0.48ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:19:57,706 INFO L158 Benchmark]: CACSL2BoogieTranslator took 274.56ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 91.3MB in the end (delta: 19.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 15:19:57,707 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.48ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 90.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:19:57,707 INFO L158 Benchmark]: Boogie Preprocessor took 24.24ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 88.0MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:19:57,708 INFO L158 Benchmark]: IcfgBuilder took 313.25ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 64.2MB in the end (delta: 23.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 15:19:57,708 INFO L158 Benchmark]: TraceAbstraction took 1922.34ms. Allocated memory is still 142.6MB. Free memory was 63.7MB in the beginning and 44.4MB in the end (delta: 19.3MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. [2025-03-04 15:19:57,708 INFO L158 Benchmark]: Witness Printer took 63.17ms. Allocated memory is still 142.6MB. Free memory was 44.4MB in the beginning and 39.1MB in the end (delta: 5.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:19:57,709 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.48ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 274.56ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 91.3MB in the end (delta: 19.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.48ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 90.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.24ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 88.0MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 313.25ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 64.2MB in the end (delta: 23.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1922.34ms. Allocated memory is still 142.6MB. Free memory was 63.7MB in the beginning and 44.4MB in the end (delta: 19.3MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. * Witness Printer took 63.17ms. Allocated memory is still 142.6MB. Free memory was 44.4MB in the beginning and 39.1MB in the end (delta: 5.3MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 693]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 693]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 696]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 696]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 683]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 683]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 41 locations, 9 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.8s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 202 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 161 mSDsluCounter, 133 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 113 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 664 IncrementalHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 20 mSDtfsCounter, 664 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=148occurred in iteration=2, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 85 NumberOfCodeBlocks, 85 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 77 ConstructedInterpolants, 0 QuantifiedInterpolants, 443 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 15:19:57,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE