./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-examples/standard_password_ground.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/array-examples/standard_password_ground.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 3cb77685c99da394e56759788276300560cc521e5b9b98850714a1baff20c383 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:22:05,552 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:22:05,602 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 10:22:05,606 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:22:05,606 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:22:05,619 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:22:05,620 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:22:05,620 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:22:05,620 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:22:05,621 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:22:05,621 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:22:05,621 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:22:05,621 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:22:05,621 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:22:05,621 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:22:05,621 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:22:05,621 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:22:05,622 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:22:05,622 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:22:05,622 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:22:05,622 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:22:05,622 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:22:05,622 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:22:05,622 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:22:05,622 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:22:05,622 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:22:05,622 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:22:05,622 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:22:05,622 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:22:05,622 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:22:05,623 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:22:05,623 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:22:05,623 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:22:05,623 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:22:05,623 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:22:05,623 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:22:05,623 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:22:05,623 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:22:05,623 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:22:05,623 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:22:05,623 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:22:05,624 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:22:05,624 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:22:05,624 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:22:05,624 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:22:05,624 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 -> 3cb77685c99da394e56759788276300560cc521e5b9b98850714a1baff20c383 [2025-03-04 10:22:05,860 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:22:05,867 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:22:05,869 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:22:05,870 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:22:05,870 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:22:05,871 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/standard_password_ground.i [2025-03-04 10:22:07,066 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f996bfc9f/28276e5e3cb5456aab56f2964ee3e54e/FLAGbdaebb966 [2025-03-04 10:22:07,290 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:22:07,291 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/standard_password_ground.i [2025-03-04 10:22:07,296 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f996bfc9f/28276e5e3cb5456aab56f2964ee3e54e/FLAGbdaebb966 [2025-03-04 10:22:07,629 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f996bfc9f/28276e5e3cb5456aab56f2964ee3e54e [2025-03-04 10:22:07,631 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:22:07,633 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:22:07,633 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:22:07,633 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:22:07,636 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:22:07,637 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:22:07" (1/1) ... [2025-03-04 10:22:07,637 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cf01ed3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:22:07, skipping insertion in model container [2025-03-04 10:22:07,637 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:22:07" (1/1) ... [2025-03-04 10:22:07,646 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:22:07,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:22:07,752 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:22:07,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:22:07,776 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:22:07,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:22:07 WrapperNode [2025-03-04 10:22:07,777 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:22:07,778 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:22:07,778 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:22:07,778 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:22:07,784 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:22:07" (1/1) ... [2025-03-04 10:22:07,790 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:22:07" (1/1) ... [2025-03-04 10:22:07,802 INFO L138 Inliner]: procedures = 16, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 74 [2025-03-04 10:22:07,803 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:22:07,803 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:22:07,803 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:22:07,804 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:22:07,809 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:22:07" (1/1) ... [2025-03-04 10:22:07,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:22:07" (1/1) ... [2025-03-04 10:22:07,811 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:22:07" (1/1) ... [2025-03-04 10:22:07,826 INFO L175 MemorySlicer]: Split 8 memory accesses to 3 slices as follows [2, 3, 3]. 38 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2025-03-04 10:22:07,826 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:22:07" (1/1) ... [2025-03-04 10:22:07,826 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:22:07" (1/1) ... [2025-03-04 10:22:07,829 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:22:07" (1/1) ... [2025-03-04 10:22:07,833 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:22:07" (1/1) ... [2025-03-04 10:22:07,834 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:22:07" (1/1) ... [2025-03-04 10:22:07,836 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:22:07" (1/1) ... [2025-03-04 10:22:07,837 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:22:07,841 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:22:07,841 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:22:07,841 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:22:07,842 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:22:07" (1/1) ... [2025-03-04 10:22:07,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:22:07,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:22:07,870 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 10:22:07,872 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 10:22:07,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:22:07,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:22:07,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:22:07,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 10:22:07,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 10:22:07,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:22:07,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:22:07,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 10:22:07,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:22:07,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:22:07,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:22:07,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:22:07,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 10:22:07,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 10:22:07,951 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:22:07,952 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:22:08,108 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17: call ULTIMATE.dealloc(main_~#password~0#1.base, main_~#password~0#1.offset);havoc main_~#password~0#1.base, main_~#password~0#1.offset;call ULTIMATE.dealloc(main_~#guess~0#1.base, main_~#guess~0#1.offset);havoc main_~#guess~0#1.base, main_~#guess~0#1.offset; [2025-03-04 10:22:08,121 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-03-04 10:22:08,121 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:22:08,129 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:22:08,129 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:22:08,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:22:08 BoogieIcfgContainer [2025-03-04 10:22:08,129 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:22:08,131 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:22:08,131 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:22:08,134 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:22:08,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:22:07" (1/3) ... [2025-03-04 10:22:08,134 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12c6658a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:22:08, skipping insertion in model container [2025-03-04 10:22:08,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:22:07" (2/3) ... [2025-03-04 10:22:08,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12c6658a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:22:08, skipping insertion in model container [2025-03-04 10:22:08,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:22:08" (3/3) ... [2025-03-04 10:22:08,136 INFO L128 eAbstractionObserver]: Analyzing ICFG standard_password_ground.i [2025-03-04 10:22:08,145 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:22:08,146 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG standard_password_ground.i that has 1 procedures, 29 locations, 1 initial locations, 3 loop locations, and 6 error locations. [2025-03-04 10:22:08,177 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:22:08,184 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;@6d99d1ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:22:08,184 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 10:22:08,186 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 28 states have internal predecessors, (35), 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 10:22:08,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 10:22:08,189 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:22:08,190 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 10:22:08,190 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:22:08,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:22:08,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1999935, now seen corresponding path program 1 times [2025-03-04 10:22:08,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:22:08,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104341889] [2025-03-04 10:22:08,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:22:08,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:22:08,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 10:22:08,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 10:22:08,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:22:08,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:22:08,349 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 10:22:08,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:22:08,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104341889] [2025-03-04 10:22:08,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104341889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:22:08,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:22:08,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:22:08,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731484828] [2025-03-04 10:22:08,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:22:08,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:22:08,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:22:08,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:22:08,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:22:08,370 INFO L87 Difference]: Start difference. First operand has 29 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 28 states have internal predecessors, (35), 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) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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 10:22:08,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:22:08,429 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2025-03-04 10:22:08,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:22:08,431 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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) Word has length 4 [2025-03-04 10:22:08,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:22:08,437 INFO L225 Difference]: With dead ends: 58 [2025-03-04 10:22:08,437 INFO L226 Difference]: Without dead ends: 28 [2025-03-04 10:22:08,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:22:08,441 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 4 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:22:08,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 72 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:22:08,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-04 10:22:08,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2025-03-04 10:22:08,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.45) internal successors, (29), 25 states have internal predecessors, (29), 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 10:22:08,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2025-03-04 10:22:08,464 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 4 [2025-03-04 10:22:08,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:22:08,465 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2025-03-04 10:22:08,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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 10:22:08,465 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2025-03-04 10:22:08,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 10:22:08,465 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:22:08,465 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-04 10:22:08,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:22:08,466 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:22:08,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:22:08,467 INFO L85 PathProgramCache]: Analyzing trace with hash -549479426, now seen corresponding path program 1 times [2025-03-04 10:22:08,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:22:08,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199133396] [2025-03-04 10:22:08,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:22:08,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:22:08,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:22:08,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:22:08,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:22:08,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:22:08,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:22:08,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:22:08,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199133396] [2025-03-04 10:22:08,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199133396] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:22:08,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232201536] [2025-03-04 10:22:08,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:22:08,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:22:08,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:22:08,619 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:22:08,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:22:08,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:22:08,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:22:08,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:22:08,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:22:08,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:22:08,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:22:08,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:22:08,749 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:22:08,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232201536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:22:08,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:22:08,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 10:22:08,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867922845] [2025-03-04 10:22:08,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:22:08,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:22:08,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:22:08,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:22:08,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:22:08,753 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 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 10:22:08,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:22:08,794 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2025-03-04 10:22:08,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:22:08,795 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 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) Word has length 7 [2025-03-04 10:22:08,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:22:08,796 INFO L225 Difference]: With dead ends: 28 [2025-03-04 10:22:08,796 INFO L226 Difference]: Without dead ends: 27 [2025-03-04 10:22:08,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:22:08,797 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 4 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:22:08,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 65 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:22:08,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-04 10:22:08,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2025-03-04 10:22:08,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 24 states have internal predecessors, (28), 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 10:22:08,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2025-03-04 10:22:08,803 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 7 [2025-03-04 10:22:08,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:22:08,803 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2025-03-04 10:22:08,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 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 10:22:08,804 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2025-03-04 10:22:08,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 10:22:08,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:22:08,805 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-03-04 10:22:08,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 10:22:09,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:22:09,006 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:22:09,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:22:09,008 INFO L85 PathProgramCache]: Analyzing trace with hash 146006977, now seen corresponding path program 1 times [2025-03-04 10:22:09,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:22:09,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077573170] [2025-03-04 10:22:09,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:22:09,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:22:09,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:22:09,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:22:09,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:22:09,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:22:09,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:22:09,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:22:09,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077573170] [2025-03-04 10:22:09,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077573170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:22:09,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:22:09,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:22:09,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985741600] [2025-03-04 10:22:09,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:22:09,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:22:09,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:22:09,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:22:09,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:22:09,110 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 10:22:09,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:22:09,122 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2025-03-04 10:22:09,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:22:09,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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) Word has length 8 [2025-03-04 10:22:09,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:22:09,123 INFO L225 Difference]: With dead ends: 25 [2025-03-04 10:22:09,123 INFO L226 Difference]: Without dead ends: 24 [2025-03-04 10:22:09,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:22:09,124 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:22:09,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:22:09,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-04 10:22:09,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2025-03-04 10:22:09,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 21 states have internal predecessors, (25), 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 10:22:09,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2025-03-04 10:22:09,129 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 8 [2025-03-04 10:22:09,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:22:09,129 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2025-03-04 10:22:09,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 10:22:09,129 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2025-03-04 10:22:09,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 10:22:09,130 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:22:09,130 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:22:09,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:22:09,130 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:22:09,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:22:09,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1425987462, now seen corresponding path program 1 times [2025-03-04 10:22:09,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:22:09,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798901928] [2025-03-04 10:22:09,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:22:09,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:22:09,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:22:09,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:22:09,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:22:09,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:22:09,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:22:09,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:22:09,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798901928] [2025-03-04 10:22:09,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798901928] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:22:09,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45279992] [2025-03-04 10:22:09,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:22:09,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:22:09,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:22:09,219 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:22:09,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:22:09,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:22:09,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:22:09,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:22:09,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:22:09,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:22:09,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:22:09,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:22:09,308 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:22:09,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:22:09,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45279992] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:22:09,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:22:09,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 10:22:09,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404160495] [2025-03-04 10:22:09,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:22:09,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:22:09,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:22:09,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:22:09,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:22:09,337 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 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 10:22:09,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:22:09,371 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2025-03-04 10:22:09,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:22:09,372 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 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) Word has length 10 [2025-03-04 10:22:09,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:22:09,372 INFO L225 Difference]: With dead ends: 46 [2025-03-04 10:22:09,372 INFO L226 Difference]: Without dead ends: 30 [2025-03-04 10:22:09,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:22:09,373 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 11 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:22:09,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 51 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:22:09,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-04 10:22:09,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2025-03-04 10:22:09,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 27 states have internal predecessors, (31), 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 10:22:09,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2025-03-04 10:22:09,377 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 10 [2025-03-04 10:22:09,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:22:09,377 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2025-03-04 10:22:09,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 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 10:22:09,377 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2025-03-04 10:22:09,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 10:22:09,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:22:09,377 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:22:09,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 10:22:09,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-04 10:22:09,583 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:22:09,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:22:09,583 INFO L85 PathProgramCache]: Analyzing trace with hash -2039520230, now seen corresponding path program 2 times [2025-03-04 10:22:09,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:22:09,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166739113] [2025-03-04 10:22:09,583 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:22:09,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:22:09,593 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 10:22:09,596 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 16 statements. [2025-03-04 10:22:09,596 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:22:09,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:22:09,621 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:22:09,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:22:09,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166739113] [2025-03-04 10:22:09,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166739113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:22:09,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:22:09,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:22:09,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792843944] [2025-03-04 10:22:09,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:22:09,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:22:09,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:22:09,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:22:09,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:22:09,623 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 10:22:09,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:22:09,647 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2025-03-04 10:22:09,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:22:09,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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) Word has length 16 [2025-03-04 10:22:09,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:22:09,648 INFO L225 Difference]: With dead ends: 34 [2025-03-04 10:22:09,648 INFO L226 Difference]: Without dead ends: 32 [2025-03-04 10:22:09,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:22:09,649 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:22:09,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 47 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:22:09,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-04 10:22:09,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-04 10:22:09,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 31 states have internal predecessors, (36), 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 10:22:09,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2025-03-04 10:22:09,652 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 16 [2025-03-04 10:22:09,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:22:09,653 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2025-03-04 10:22:09,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 10:22:09,653 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2025-03-04 10:22:09,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-04 10:22:09,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:22:09,653 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 10:22:09,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:22:09,653 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:22:09,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:22:09,654 INFO L85 PathProgramCache]: Analyzing trace with hash -145739593, now seen corresponding path program 1 times [2025-03-04 10:22:09,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:22:09,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047819357] [2025-03-04 10:22:09,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:22:09,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:22:09,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:22:09,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:22:09,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:22:09,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:22:09,791 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:22:09,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:22:09,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047819357] [2025-03-04 10:22:09,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047819357] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:22:09,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063089693] [2025-03-04 10:22:09,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:22:09,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:22:09,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:22:09,795 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:22:09,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:22:09,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:22:09,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:22:09,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:22:09,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:22:09,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:22:09,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:22:09,872 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:22:09,872 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:22:09,946 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:22:09,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063089693] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:22:09,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:22:09,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-04 10:22:09,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644244764] [2025-03-04 10:22:09,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:22:09,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 10:22:09,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:22:09,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 10:22:09,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:22:09,948 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 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 10:22:10,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:22:10,014 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2025-03-04 10:22:10,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 10:22:10,014 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 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) Word has length 21 [2025-03-04 10:22:10,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:22:10,015 INFO L225 Difference]: With dead ends: 64 [2025-03-04 10:22:10,015 INFO L226 Difference]: Without dead ends: 44 [2025-03-04 10:22:10,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:22:10,016 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 14 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:22:10,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 70 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:22:10,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-04 10:22:10,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-04 10:22:10,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 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 10:22:10,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2025-03-04 10:22:10,037 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 21 [2025-03-04 10:22:10,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:22:10,037 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2025-03-04 10:22:10,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 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 10:22:10,037 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2025-03-04 10:22:10,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-04 10:22:10,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:22:10,038 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 10:22:10,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 10:22:10,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:22:10,238 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:22:10,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:22:10,239 INFO L85 PathProgramCache]: Analyzing trace with hash 870508919, now seen corresponding path program 2 times [2025-03-04 10:22:10,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:22:10,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679622094] [2025-03-04 10:22:10,239 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:22:10,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:22:10,249 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-04 10:22:10,265 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:22:10,265 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:22:10,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:22:10,388 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 10:22:10,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:22:10,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679622094] [2025-03-04 10:22:10,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679622094] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:22:10,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013103657] [2025-03-04 10:22:10,389 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:22:10,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:22:10,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:22:10,391 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:22:10,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:22:10,434 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-04 10:22:10,455 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:22:10,455 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:22:10,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:22:10,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:22:10,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:22:10,681 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:22:10,682 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:22:11,033 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:22:11,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013103657] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:22:11,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:22:11,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 17, 17] total 36 [2025-03-04 10:22:11,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218399653] [2025-03-04 10:22:11,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:22:11,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-04 10:22:11,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:22:11,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-04 10:22:11,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=964, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 10:22:11,036 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 36 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 36 states have internal predecessors, (67), 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 10:22:11,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:22:11,233 INFO L93 Difference]: Finished difference Result 90 states and 108 transitions. [2025-03-04 10:22:11,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-04 10:22:11,233 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 36 states have internal predecessors, (67), 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) Word has length 33 [2025-03-04 10:22:11,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:22:11,234 INFO L225 Difference]: With dead ends: 90 [2025-03-04 10:22:11,234 INFO L226 Difference]: Without dead ends: 70 [2025-03-04 10:22:11,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=319, Invalid=1087, Unknown=0, NotChecked=0, Total=1406 [2025-03-04 10:22:11,235 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 20 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:22:11,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 158 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:22:11,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-04 10:22:11,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2025-03-04 10:22:11,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 65 states have (on average 1.1076923076923078) internal successors, (72), 67 states have internal predecessors, (72), 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 10:22:11,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2025-03-04 10:22:11,245 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 33 [2025-03-04 10:22:11,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:22:11,246 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2025-03-04 10:22:11,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 36 states have internal predecessors, (67), 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 10:22:11,247 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2025-03-04 10:22:11,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-04 10:22:11,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:22:11,248 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 10:22:11,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 10:22:11,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:22:11,449 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:22:11,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:22:11,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1697356834, now seen corresponding path program 1 times [2025-03-04 10:22:11,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:22:11,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091114759] [2025-03-04 10:22:11,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:22:11,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:22:11,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 10:22:11,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 10:22:11,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:22:11,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:22:11,573 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2025-03-04 10:22:11,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:22:11,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091114759] [2025-03-04 10:22:11,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091114759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:22:11,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:22:11,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:22:11,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528323018] [2025-03-04 10:22:11,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:22:11,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:22:11,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:22:11,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:22:11,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:22:11,574 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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 10:22:11,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:22:11,592 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2025-03-04 10:22:11,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:22:11,593 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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) Word has length 58 [2025-03-04 10:22:11,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:22:11,595 INFO L225 Difference]: With dead ends: 68 [2025-03-04 10:22:11,595 INFO L226 Difference]: Without dead ends: 67 [2025-03-04 10:22:11,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:22:11,596 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:22:11,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 41 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:22:11,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-04 10:22:11,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-04 10:22:11,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 65 states have (on average 1.0923076923076922) internal successors, (71), 66 states have internal predecessors, (71), 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 10:22:11,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2025-03-04 10:22:11,602 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 58 [2025-03-04 10:22:11,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:22:11,603 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2025-03-04 10:22:11,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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 10:22:11,603 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2025-03-04 10:22:11,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-04 10:22:11,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:22:11,604 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:22:11,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:22:11,605 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:22:11,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:22:11,605 INFO L85 PathProgramCache]: Analyzing trace with hash 243872209, now seen corresponding path program 1 times [2025-03-04 10:22:11,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:22:11,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682467499] [2025-03-04 10:22:11,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:22:11,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:22:11,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 10:22:11,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 10:22:11,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:22:11,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:22:11,736 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2025-03-04 10:22:11,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:22:11,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682467499] [2025-03-04 10:22:11,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682467499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:22:11,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:22:11,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:22:11,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980954265] [2025-03-04 10:22:11,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:22:11,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:22:11,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:22:11,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:22:11,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:22:11,739 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 10:22:11,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:22:11,745 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2025-03-04 10:22:11,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:22:11,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) Word has length 64 [2025-03-04 10:22:11,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:22:11,746 INFO L225 Difference]: With dead ends: 84 [2025-03-04 10:22:11,746 INFO L226 Difference]: Without dead ends: 67 [2025-03-04 10:22:11,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:22:11,747 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 2 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:22:11,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 42 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:22:11,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-04 10:22:11,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-04 10:22:11,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 65 states have (on average 1.0615384615384615) internal successors, (69), 66 states have internal predecessors, (69), 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 10:22:11,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2025-03-04 10:22:11,752 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 64 [2025-03-04 10:22:11,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:22:11,752 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2025-03-04 10:22:11,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 10:22:11,753 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2025-03-04 10:22:11,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-04 10:22:11,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:22:11,753 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:22:11,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:22:11,754 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:22:11,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:22:11,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1554910513, now seen corresponding path program 1 times [2025-03-04 10:22:11,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:22:11,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568825251] [2025-03-04 10:22:11,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:22:11,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:22:11,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 10:22:11,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 10:22:11,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:22:11,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:22:11,905 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2025-03-04 10:22:11,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:22:11,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568825251] [2025-03-04 10:22:11,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568825251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:22:11,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:22:11,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:22:11,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539420866] [2025-03-04 10:22:11,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:22:11,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:22:11,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:22:11,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:22:11,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:22:11,908 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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 10:22:11,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:22:11,930 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2025-03-04 10:22:11,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:22:11,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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) Word has length 64 [2025-03-04 10:22:11,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:22:11,931 INFO L225 Difference]: With dead ends: 74 [2025-03-04 10:22:11,931 INFO L226 Difference]: Without dead ends: 72 [2025-03-04 10:22:11,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:22:11,932 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:22:11,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 43 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:22:11,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-04 10:22:11,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-04 10:22:11,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 70 states have (on average 1.0571428571428572) internal successors, (74), 71 states have internal predecessors, (74), 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 10:22:11,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2025-03-04 10:22:11,941 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 64 [2025-03-04 10:22:11,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:22:11,941 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2025-03-04 10:22:11,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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 10:22:11,941 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2025-03-04 10:22:11,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-04 10:22:11,942 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:22:11,942 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:22:11,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 10:22:11,943 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:22:11,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:22:11,944 INFO L85 PathProgramCache]: Analyzing trace with hash -515332685, now seen corresponding path program 1 times [2025-03-04 10:22:11,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:22:11,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464774161] [2025-03-04 10:22:11,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:22:11,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:22:11,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 10:22:11,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 10:22:11,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:22:11,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:22:12,712 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 10:22:12,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:22:12,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464774161] [2025-03-04 10:22:12,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464774161] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:22:12,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029886887] [2025-03-04 10:22:12,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:22:12,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:22:12,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:22:12,715 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:22:12,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:22:12,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 10:22:12,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 10:22:12,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:22:12,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:22:12,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 10:22:12,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:22:12,928 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 10:22:12,928 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:22:13,807 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 10:22:13,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029886887] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:22:13,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:22:13,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 66 [2025-03-04 10:22:13,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439492989] [2025-03-04 10:22:13,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:22:13,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2025-03-04 10:22:13,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:22:13,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2025-03-04 10:22:13,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1122, Invalid=3168, Unknown=0, NotChecked=0, Total=4290 [2025-03-04 10:22:13,811 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand has 66 states, 66 states have (on average 1.696969696969697) internal successors, (112), 66 states have internal predecessors, (112), 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 10:22:13,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:22:13,982 INFO L93 Difference]: Finished difference Result 144 states and 163 transitions. [2025-03-04 10:22:13,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-03-04 10:22:13,982 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.696969696969697) internal successors, (112), 66 states have internal predecessors, (112), 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) Word has length 69 [2025-03-04 10:22:13,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:22:13,983 INFO L225 Difference]: With dead ends: 144 [2025-03-04 10:22:13,983 INFO L226 Difference]: Without dead ends: 120 [2025-03-04 10:22:13,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1318 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1122, Invalid=3168, Unknown=0, NotChecked=0, Total=4290 [2025-03-04 10:22:13,986 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 7 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:22:13,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 90 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:22:13,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-04 10:22:13,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-03-04 10:22:13,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 118 states have (on average 1.0338983050847457) internal successors, (122), 119 states have internal predecessors, (122), 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 10:22:13,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 122 transitions. [2025-03-04 10:22:13,994 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 122 transitions. Word has length 69 [2025-03-04 10:22:13,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:22:13,994 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 122 transitions. [2025-03-04 10:22:13,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 1.696969696969697) internal successors, (112), 66 states have internal predecessors, (112), 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 10:22:13,995 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 122 transitions. [2025-03-04 10:22:13,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-04 10:22:13,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:22:13,996 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:22:14,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 10:22:14,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 10:22:14,197 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:22:14,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:22:14,198 INFO L85 PathProgramCache]: Analyzing trace with hash 168216755, now seen corresponding path program 2 times [2025-03-04 10:22:14,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:22:14,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501298793] [2025-03-04 10:22:14,198 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:22:14,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:22:14,234 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 117 statements into 2 equivalence classes. [2025-03-04 10:22:14,263 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 10:22:14,264 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:22:14,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:22:14,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1437 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1433 trivial. 0 not checked. [2025-03-04 10:22:14,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:22:14,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501298793] [2025-03-04 10:22:14,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501298793] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:22:14,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496851221] [2025-03-04 10:22:14,504 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:22:14,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:22:14,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:22:14,509 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:22:14,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:22:14,639 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 117 statements into 2 equivalence classes. [2025-03-04 10:22:14,720 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 10:22:14,720 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:22:14,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:22:14,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-03-04 10:22:14,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:22:16,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1437 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 10:22:16,157 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:22:18,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1437 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 10:22:18,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496851221] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:22:18,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:22:18,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 65, 65] total 132 [2025-03-04 10:22:18,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303669917] [2025-03-04 10:22:18,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:22:18,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 132 states [2025-03-04 10:22:18,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:22:18,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2025-03-04 10:22:18,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4168, Invalid=13124, Unknown=0, NotChecked=0, Total=17292 [2025-03-04 10:22:18,635 INFO L87 Difference]: Start difference. First operand 120 states and 122 transitions. Second operand has 132 states, 132 states have (on average 1.7045454545454546) internal successors, (225), 132 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:22:19,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:22:19,108 INFO L93 Difference]: Finished difference Result 239 states and 275 transitions. [2025-03-04 10:22:19,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2025-03-04 10:22:19,109 INFO L78 Accepts]: Start accepts. Automaton has has 132 states, 132 states have (on average 1.7045454545454546) internal successors, (225), 132 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2025-03-04 10:22:19,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:22:19,111 INFO L225 Difference]: With dead ends: 239 [2025-03-04 10:22:19,111 INFO L226 Difference]: Without dead ends: 215 [2025-03-04 10:22:19,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4773 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4168, Invalid=13124, Unknown=0, NotChecked=0, Total=17292 [2025-03-04 10:22:19,116 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 8 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:22:19,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 125 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:22:19,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-03-04 10:22:19,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2025-03-04 10:22:19,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 1.014018691588785) internal successors, (217), 214 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:22:19,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 217 transitions. [2025-03-04 10:22:19,129 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 217 transitions. Word has length 117 [2025-03-04 10:22:19,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:22:19,129 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 217 transitions. [2025-03-04 10:22:19,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 132 states, 132 states have (on average 1.7045454545454546) internal successors, (225), 132 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:22:19,129 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 217 transitions. [2025-03-04 10:22:19,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-04 10:22:19,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:22:19,131 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:22:19,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 10:22:19,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:22:19,335 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:22:19,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:22:19,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1509214100, now seen corresponding path program 1 times [2025-03-04 10:22:19,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:22:19,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360584364] [2025-03-04 10:22:19,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:22:19,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:22:19,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-04 10:22:19,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-04 10:22:19,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:22:19,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:22:19,627 INFO L134 CoverageAnalysis]: Checked inductivity of 5934 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5930 trivial. 0 not checked. [2025-03-04 10:22:19,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:22:19,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360584364] [2025-03-04 10:22:19,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360584364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:22:19,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:22:19,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:22:19,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328285781] [2025-03-04 10:22:19,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:22:19,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:22:19,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:22:19,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:22:19,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:22:19,629 INFO L87 Difference]: Start difference. First operand 215 states and 217 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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 10:22:19,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:22:19,641 INFO L93 Difference]: Finished difference Result 215 states and 217 transitions. [2025-03-04 10:22:19,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:22:19,642 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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) Word has length 214 [2025-03-04 10:22:19,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:22:19,642 INFO L225 Difference]: With dead ends: 215 [2025-03-04 10:22:19,642 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 10:22:19,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:22:19,643 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:22:19,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:22:19,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 10:22:19,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 10:22:19,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 10:22:19,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 10:22:19,644 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 214 [2025-03-04 10:22:19,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:22:19,645 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 10:22:19,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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 10:22:19,646 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 10:22:19,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 10:22:19,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-03-04 10:22:19,651 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-03-04 10:22:19,651 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-03-04 10:22:19,651 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-03-04 10:22:19,651 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-03-04 10:22:19,651 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-03-04 10:22:19,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 10:22:19,654 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:22:19,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 10:22:19,725 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 10:22:19,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 10:22:19 BoogieIcfgContainer [2025-03-04 10:22:19,740 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 10:22:19,740 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 10:22:19,740 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 10:22:19,741 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 10:22:19,741 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:22:08" (3/4) ... [2025-03-04 10:22:19,743 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 10:22:19,751 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-04 10:22:19,751 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 10:22:19,751 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 10:22:19,751 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 10:22:19,817 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 10:22:19,817 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 10:22:19,817 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 10:22:19,818 INFO L158 Benchmark]: Toolchain (without parser) took 12186.21ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 113.1MB in the beginning and 158.8MB in the end (delta: -45.7MB). Peak memory consumption was 115.2MB. Max. memory is 16.1GB. [2025-03-04 10:22:19,818 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:22:19,818 INFO L158 Benchmark]: CACSL2BoogieTranslator took 143.92ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 102.1MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:22:19,819 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.07ms. Allocated memory is still 142.6MB. Free memory was 102.1MB in the beginning and 101.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:22:19,820 INFO L158 Benchmark]: Boogie Preprocessor took 37.00ms. Allocated memory is still 142.6MB. Free memory was 101.0MB in the beginning and 99.9MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:22:19,820 INFO L158 Benchmark]: IcfgBuilder took 288.36ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 86.4MB in the end (delta: 13.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:22:19,821 INFO L158 Benchmark]: TraceAbstraction took 11609.15ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 86.4MB in the beginning and 164.2MB in the end (delta: -77.8MB). Peak memory consumption was 81.7MB. Max. memory is 16.1GB. [2025-03-04 10:22:19,821 INFO L158 Benchmark]: Witness Printer took 77.20ms. Allocated memory is still 302.0MB. Free memory was 164.2MB in the beginning and 158.8MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:22:19,823 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.29ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 143.92ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 102.1MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.07ms. Allocated memory is still 142.6MB. Free memory was 102.1MB in the beginning and 101.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.00ms. Allocated memory is still 142.6MB. Free memory was 101.0MB in the beginning and 99.9MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 288.36ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 86.4MB in the end (delta: 13.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 11609.15ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 86.4MB in the beginning and 164.2MB in the end (delta: -77.8MB). Peak memory consumption was 81.7MB. Max. memory is 16.1GB. * Witness Printer took 77.20ms. Allocated memory is still 302.0MB. Free memory was 164.2MB in the beginning and 158.8MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 11.5s, OverallIterations: 13, TraceHistogramMax: 63, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 74 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 74 mSDsluCounter, 882 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 653 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 920 IncrementalHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 229 mSDtfsCounter, 920 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 580 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 272 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6458 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=215occurred in iteration=12, InterpolantAutomatonStates: 284, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 10 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 942 NumberOfCodeBlocks, 933 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1168 ConstructedInterpolants, 0 QuantifiedInterpolants, 2098 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1570 ConjunctsInSsa, 129 ConjunctsInUnsatCore, 24 InterpolantComputations, 8 PerfectInterpolantSequences, 8538/12569 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 - InvariantResult [Line: 22]: Location Invariant Derived location invariant: ((0 < i) || (i == 0)) - InvariantResult [Line: 28]: Location Invariant Derived location invariant: ((0 < i) || (i == 0)) - InvariantResult [Line: 35]: Location Invariant Derived location invariant: ((0 < x) || (x == 0)) RESULT: Ultimate proved your program to be correct! [2025-03-04 10:22:19,840 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