./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-memory-alloca/genady-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-memory-alloca/genady-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash 3cf25f06134410cf3fe2cb13bebb45512b92052388b257a9b0f3e089d05f1ab2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:41:31,747 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:41:31,794 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-04 10:41:31,797 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:41:31,797 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:41:31,816 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:41:31,816 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:41:31,817 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:41:31,817 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:41:31,817 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:41:31,817 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:41:31,817 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:41:31,817 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:41:31,818 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:41:31,818 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:41:31,818 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:41:31,818 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:41:31,818 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:41:31,818 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:41:31,818 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:41:31,818 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:41:31,818 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:41:31,818 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:41:31,818 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:41:31,818 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:41:31,818 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:41:31,818 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:41:31,818 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:41:31,818 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:41:31,818 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:41:31,818 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:41:31,819 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:41:31,819 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:41:31,819 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:41:31,819 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:41:31,819 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:41:31,819 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:41:31,819 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:41:31,819 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:41:31,819 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:41:31,819 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:41:31,819 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:41:31,819 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3cf25f06134410cf3fe2cb13bebb45512b92052388b257a9b0f3e089d05f1ab2 [2025-03-04 10:41:32,037 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:41:32,043 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:41:32,046 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:41:32,047 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:41:32,047 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:41:32,048 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/genady-alloca.i [2025-03-04 10:41:33,218 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18065c75b/1b626c7e83b3479d9eaa6e9abe770448/FLAG0147eff83 [2025-03-04 10:41:33,500 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:41:33,502 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/genady-alloca.i [2025-03-04 10:41:33,512 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18065c75b/1b626c7e83b3479d9eaa6e9abe770448/FLAG0147eff83 [2025-03-04 10:41:33,784 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18065c75b/1b626c7e83b3479d9eaa6e9abe770448 [2025-03-04 10:41:33,786 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:41:33,787 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:41:33,788 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:41:33,788 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:41:33,790 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:41:33,791 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:41:33" (1/1) ... [2025-03-04 10:41:33,791 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41cc7110 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:41:33, skipping insertion in model container [2025-03-04 10:41:33,791 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:41:33" (1/1) ... [2025-03-04 10:41:33,809 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:41:34,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:41:34,013 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:41:34,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:41:34,052 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:41:34,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:41:34 WrapperNode [2025-03-04 10:41:34,052 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:41:34,053 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:41:34,053 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:41:34,053 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:41:34,058 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:41:34" (1/1) ... [2025-03-04 10:41:34,063 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:41:34" (1/1) ... [2025-03-04 10:41:34,075 INFO L138 Inliner]: procedures = 109, calls = 14, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 39 [2025-03-04 10:41:34,075 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:41:34,076 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:41:34,076 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:41:34,076 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:41:34,081 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:41:34" (1/1) ... [2025-03-04 10:41:34,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:41:34" (1/1) ... [2025-03-04 10:41:34,084 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:41:34" (1/1) ... [2025-03-04 10:41:34,091 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [4, 4]. 50 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 4 writes are split as follows [2, 2]. [2025-03-04 10:41:34,091 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:41:34" (1/1) ... [2025-03-04 10:41:34,091 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:41:34" (1/1) ... [2025-03-04 10:41:34,097 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:41:34" (1/1) ... [2025-03-04 10:41:34,098 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:41:34" (1/1) ... [2025-03-04 10:41:34,098 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:41:34" (1/1) ... [2025-03-04 10:41:34,099 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:41:34" (1/1) ... [2025-03-04 10:41:34,100 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:41:34,100 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:41:34,100 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:41:34,100 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:41:34,101 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:41:34" (1/1) ... [2025-03-04 10:41:34,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:41:34,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:41:34,125 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:41:34,127 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:41:34,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:41:34,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:41:34,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:41:34,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:41:34,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 10:41:34,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 10:41:34,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:41:34,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:41:34,203 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:41:34,204 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:41:34,289 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-04 10:41:34,289 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:41:34,295 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:41:34,295 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:41:34,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:41:34 BoogieIcfgContainer [2025-03-04 10:41:34,295 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:41:34,297 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:41:34,297 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:41:34,300 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:41:34,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:41:33" (1/3) ... [2025-03-04 10:41:34,300 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c5a9a1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:41:34, skipping insertion in model container [2025-03-04 10:41:34,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:41:34" (2/3) ... [2025-03-04 10:41:34,300 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c5a9a1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:41:34, skipping insertion in model container [2025-03-04 10:41:34,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:41:34" (3/3) ... [2025-03-04 10:41:34,301 INFO L128 eAbstractionObserver]: Analyzing ICFG genady-alloca.i [2025-03-04 10:41:34,312 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:41:34,313 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG genady-alloca.i that has 1 procedures, 20 locations, 1 initial locations, 1 loop locations, and 6 error locations. [2025-03-04 10:41:34,352 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:41:34,362 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@57a3c7e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:41:34,362 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 10:41:34,365 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 19 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:41:34,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 10:41:34,370 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:41:34,370 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 10:41:34,371 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:41:34,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:41:34,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1568927, now seen corresponding path program 1 times [2025-03-04 10:41:34,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:41:34,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595304413] [2025-03-04 10:41:34,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:41:34,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:41:34,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 10:41:34,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 10:41:34,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:41:34,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:41:34,716 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:41:34,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:41:34,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595304413] [2025-03-04 10:41:34,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595304413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:41:34,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:41:34,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:41:34,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827344034] [2025-03-04 10:41:34,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:41:34,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:41:34,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:41:34,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:41:34,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:41:34,738 INFO L87 Difference]: Start difference. First operand has 20 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 19 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) 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:41:34,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:41:34,804 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2025-03-04 10:41:34,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:41:34,806 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:41:34,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:41:34,810 INFO L225 Difference]: With dead ends: 34 [2025-03-04 10:41:34,812 INFO L226 Difference]: Without dead ends: 24 [2025-03-04 10:41:34,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:41:34,817 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 9 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 39 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:41:34,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 39 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:41:34,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-04 10:41:34,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2025-03-04 10:41:34,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 18 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:41:34,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2025-03-04 10:41:34,842 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 4 [2025-03-04 10:41:34,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:41:34,842 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2025-03-04 10:41:34,842 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:41:34,842 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2025-03-04 10:41:34,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 10:41:34,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:41:34,842 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:41:34,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:41:34,843 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:41:34,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:41:34,843 INFO L85 PathProgramCache]: Analyzing trace with hash -504751924, now seen corresponding path program 1 times [2025-03-04 10:41:34,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:41:34,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176571247] [2025-03-04 10:41:34,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:41:34,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:41:34,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:41:34,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:41:34,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:41:34,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:41:34,976 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:41:34,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:41:34,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176571247] [2025-03-04 10:41:34,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176571247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:41:34,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:41:34,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:41:34,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369376135] [2025-03-04 10:41:34,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:41:34,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:41:34,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:41:34,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:41:34,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:41:34,980 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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:41:35,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:41:35,014 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2025-03-04 10:41:35,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:41:35,014 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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:41:35,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:41:35,014 INFO L225 Difference]: With dead ends: 24 [2025-03-04 10:41:35,015 INFO L226 Difference]: Without dead ends: 23 [2025-03-04 10:41:35,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:41:35,016 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 4 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:41:35,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 28 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:41:35,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-04 10:41:35,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2025-03-04 10:41:35,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.4) internal successors, (21), 20 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:41:35,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2025-03-04 10:41:35,020 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 7 [2025-03-04 10:41:35,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:41:35,020 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2025-03-04 10:41:35,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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:41:35,022 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2025-03-04 10:41:35,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 10:41:35,022 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:41:35,022 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:41:35,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:41:35,022 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:41:35,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:41:35,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1532559516, now seen corresponding path program 1 times [2025-03-04 10:41:35,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:41:35,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049024617] [2025-03-04 10:41:35,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:41:35,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:41:35,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:41:35,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:41:35,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:41:35,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:41:35,132 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:41:35,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:41:35,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049024617] [2025-03-04 10:41:35,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049024617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:41:35,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:41:35,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:41:35,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218070078] [2025-03-04 10:41:35,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:41:35,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:41:35,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:41:35,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:41:35,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:41:35,134 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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:41:35,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:41:35,165 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2025-03-04 10:41:35,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:41:35,166 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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:41:35,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:41:35,167 INFO L225 Difference]: With dead ends: 23 [2025-03-04 10:41:35,167 INFO L226 Difference]: Without dead ends: 22 [2025-03-04 10:41:35,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:41:35,168 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:41:35,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 29 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:41:35,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-04 10:41:35,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-03-04 10:41:35,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.375) internal successors, (22), 21 states have internal predecessors, (22), 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:41:35,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2025-03-04 10:41:35,173 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 8 [2025-03-04 10:41:35,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:41:35,174 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2025-03-04 10:41:35,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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:41:35,174 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2025-03-04 10:41:35,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 10:41:35,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:41:35,174 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:41:35,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:41:35,175 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:41:35,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:41:35,175 INFO L85 PathProgramCache]: Analyzing trace with hash 264704714, now seen corresponding path program 1 times [2025-03-04 10:41:35,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:41:35,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470237537] [2025-03-04 10:41:35,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:41:35,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:41:35,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:41:35,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:41:35,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:41:35,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:41:35,268 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:41:35,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:41:35,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470237537] [2025-03-04 10:41:35,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470237537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:41:35,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:41:35,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:41:35,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369675510] [2025-03-04 10:41:35,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:41:35,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:41:35,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:41:35,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:41:35,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:41:35,272 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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:41:35,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:41:35,300 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2025-03-04 10:41:35,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:41:35,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2025-03-04 10:41:35,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:41:35,301 INFO L225 Difference]: With dead ends: 26 [2025-03-04 10:41:35,301 INFO L226 Difference]: Without dead ends: 24 [2025-03-04 10:41:35,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:41:35,303 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 3 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:41:35,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 33 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:41:35,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-04 10:41:35,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-03-04 10:41:35,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 23 states have internal predecessors, (24), 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:41:35,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2025-03-04 10:41:35,308 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 9 [2025-03-04 10:41:35,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:41:35,308 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2025-03-04 10:41:35,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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:41:35,308 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2025-03-04 10:41:35,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 10:41:35,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:41:35,309 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:41:35,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:41:35,309 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:41:35,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:41:35,310 INFO L85 PathProgramCache]: Analyzing trace with hash 258152024, now seen corresponding path program 1 times [2025-03-04 10:41:35,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:41:35,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043826471] [2025-03-04 10:41:35,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:41:35,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:41:35,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:41:35,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:41:35,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:41:35,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:41:35,595 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:41:35,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:41:35,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043826471] [2025-03-04 10:41:35,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043826471] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:41:35,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401977227] [2025-03-04 10:41:35,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:41:35,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:41:35,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:41:35,598 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:41:35,600 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:41:35,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:41:35,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:41:35,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:41:35,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:41:35,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:41:35,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:41:35,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 10:41:35,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 10:41:35,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-03-04 10:41:35,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-03-04 10:41:35,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 10:41:35,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 10:41:35,826 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:41:35,827 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:41:35,914 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:41:35,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401977227] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:41:35,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:41:35,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2025-03-04 10:41:35,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071531214] [2025-03-04 10:41:35,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:41:35,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 10:41:35,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:41:35,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 10:41:35,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:41:35,915 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 17 states, 16 states have (on average 2.0625) internal successors, (33), 17 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:41:36,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:41:36,066 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2025-03-04 10:41:36,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:41:36,066 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.0625) internal successors, (33), 17 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 12 [2025-03-04 10:41:36,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:41:36,066 INFO L225 Difference]: With dead ends: 47 [2025-03-04 10:41:36,066 INFO L226 Difference]: Without dead ends: 46 [2025-03-04 10:41:36,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2025-03-04 10:41:36,067 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 38 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:41:36,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 28 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:41:36,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-04 10:41:36,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2025-03-04 10:41:36,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 33 states have internal predecessors, (39), 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:41:36,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2025-03-04 10:41:36,072 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 12 [2025-03-04 10:41:36,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:41:36,072 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2025-03-04 10:41:36,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0625) internal successors, (33), 17 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:41:36,072 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2025-03-04 10:41:36,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 10:41:36,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:41:36,072 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:41:36,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 10:41:36,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:41:36,276 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:41:36,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:41:36,277 INFO L85 PathProgramCache]: Analyzing trace with hash -587221864, now seen corresponding path program 1 times [2025-03-04 10:41:36,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:41:36,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766885086] [2025-03-04 10:41:36,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:41:36,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:41:36,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:41:36,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:41:36,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:41:36,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:41:36,474 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:41:36,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:41:36,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766885086] [2025-03-04 10:41:36,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766885086] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:41:36,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093610210] [2025-03-04 10:41:36,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:41:36,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:41:36,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:41:36,478 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:41:36,479 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:41:36,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:41:36,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:41:36,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:41:36,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:41:36,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:41:36,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:41:36,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 10:41:36,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 10:41:36,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-03-04 10:41:36,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-03-04 10:41:36,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 10:41:36,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 10:41:36,648 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:41:36,649 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:41:36,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:41:36,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093610210] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:41:36,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:41:36,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2025-03-04 10:41:36,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633035715] [2025-03-04 10:41:36,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:41:36,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 10:41:36,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:41:36,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 10:41:36,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:41:36,747 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 17 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:41:36,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:41:36,925 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2025-03-04 10:41:36,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:41:36,926 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 17 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) Word has length 13 [2025-03-04 10:41:36,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:41:36,926 INFO L225 Difference]: With dead ends: 36 [2025-03-04 10:41:36,926 INFO L226 Difference]: Without dead ends: 35 [2025-03-04 10:41:36,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2025-03-04 10:41:36,927 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 22 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:41:36,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 13 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:41:36,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-04 10:41:36,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2025-03-04 10:41:36,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 32 states have internal predecessors, (37), 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:41:36,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2025-03-04 10:41:36,930 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 13 [2025-03-04 10:41:36,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:41:36,930 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2025-03-04 10:41:36,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 17 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:41:36,930 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2025-03-04 10:41:36,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 10:41:36,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:41:36,931 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:41:36,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 10:41:37,131 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,SelfDestructingSolverStorable5 [2025-03-04 10:41:37,132 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:41:37,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:41:37,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1679496077, now seen corresponding path program 1 times [2025-03-04 10:41:37,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:41:37,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079709193] [2025-03-04 10:41:37,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:41:37,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:41:37,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:41:37,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:41:37,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:41:37,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:41:37,278 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:41:37,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:41:37,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079709193] [2025-03-04 10:41:37,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079709193] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:41:37,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461197632] [2025-03-04 10:41:37,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:41:37,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:41:37,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:41:37,281 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:41:37,282 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:41:37,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:41:37,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:41:37,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:41:37,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:41:37,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:41:37,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:41:37,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 10:41:37,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-03-04 10:41:37,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 10:41:37,379 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:41:37,379 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:41:37,438 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:41:37,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461197632] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:41:37,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:41:37,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 5] total 12 [2025-03-04 10:41:37,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278795467] [2025-03-04 10:41:37,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:41:37,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:41:37,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:41:37,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:41:37,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:41:37,440 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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:41:37,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:41:37,462 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2025-03-04 10:41:37,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:41:37,464 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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 15 [2025-03-04 10:41:37,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:41:37,464 INFO L225 Difference]: With dead ends: 33 [2025-03-04 10:41:37,464 INFO L226 Difference]: Without dead ends: 32 [2025-03-04 10:41:37,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:41:37,465 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 13 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:41:37,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 18 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:41:37,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-04 10:41:37,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-04 10:41:37,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.25) internal successors, (35), 31 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:41:37,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2025-03-04 10:41:37,467 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 15 [2025-03-04 10:41:37,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:41:37,471 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2025-03-04 10:41:37,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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:41:37,472 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2025-03-04 10:41:37,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 10:41:37,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:41:37,472 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 10:41:37,477 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:41:37,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:41:37,672 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:41:37,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:41:37,673 INFO L85 PathProgramCache]: Analyzing trace with hash -524770859, now seen corresponding path program 1 times [2025-03-04 10:41:37,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:41:37,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590400742] [2025-03-04 10:41:37,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:41:37,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:41:37,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:41:37,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:41:37,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:41:37,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:41:37,808 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:41:37,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:41:37,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590400742] [2025-03-04 10:41:37,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590400742] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:41:37,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998402747] [2025-03-04 10:41:37,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:41:37,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:41:37,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:41:37,810 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:41:37,812 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:41:37,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:41:37,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:41:37,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:41:37,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:41:37,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:41:37,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:41:37,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 10:41:37,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-03-04 10:41:37,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 10:41:37,897 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:41:37,897 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:41:37,936 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:41:37,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998402747] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:41:37,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:41:37,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 12 [2025-03-04 10:41:37,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337392653] [2025-03-04 10:41:37,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:41:37,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:41:37,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:41:37,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:41:37,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:41:37,937 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 13 states have internal predecessors, (41), 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:41:37,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:41:37,996 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2025-03-04 10:41:37,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:41:37,997 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 13 states have internal predecessors, (41), 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:41:37,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:41:37,997 INFO L225 Difference]: With dead ends: 50 [2025-03-04 10:41:37,997 INFO L226 Difference]: Without dead ends: 49 [2025-03-04 10:41:37,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:41:37,998 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 13 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:41:37,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 54 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:41:37,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-04 10:41:38,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2025-03-04 10:41:38,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.225) internal successors, (49), 43 states have internal predecessors, (49), 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:41:38,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2025-03-04 10:41:38,001 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 16 [2025-03-04 10:41:38,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:41:38,002 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2025-03-04 10:41:38,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 13 states have internal predecessors, (41), 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:41:38,002 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2025-03-04 10:41:38,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 10:41:38,003 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:41:38,003 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 10:41:38,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 10:41:38,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:41:38,208 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:41:38,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:41:38,208 INFO L85 PathProgramCache]: Analyzing trace with hash 911972529, now seen corresponding path program 1 times [2025-03-04 10:41:38,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:41:38,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254949204] [2025-03-04 10:41:38,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:41:38,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:41:38,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:41:38,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:41:38,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:41:38,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:41:38,285 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:41:38,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:41:38,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254949204] [2025-03-04 10:41:38,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254949204] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:41:38,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631061618] [2025-03-04 10:41:38,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:41:38,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:41:38,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:41:38,287 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:41:38,289 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:41:38,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:41:38,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:41:38,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:41:38,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:41:38,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 10:41:38,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:41:38,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 10:41:38,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-03-04 10:41:38,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 10:41:38,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 10:41:38,402 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:41:38,402 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:41:38,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-03-04 10:41:38,525 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:41:38,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631061618] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:41:38,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:41:38,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 17 [2025-03-04 10:41:38,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695404105] [2025-03-04 10:41:38,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:41:38,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 10:41:38,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:41:38,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 10:41:38,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:41:38,526 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 18 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 18 states have internal predecessors, (49), 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:41:38,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:41:38,781 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2025-03-04 10:41:38,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 10:41:38,781 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 18 states have internal predecessors, (49), 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 17 [2025-03-04 10:41:38,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:41:38,782 INFO L225 Difference]: With dead ends: 47 [2025-03-04 10:41:38,782 INFO L226 Difference]: Without dead ends: 46 [2025-03-04 10:41:38,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=251, Invalid=805, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 10:41:38,783 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 83 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:41:38,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 34 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:41:38,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-04 10:41:38,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2025-03-04 10:41:38,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:41:38,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2025-03-04 10:41:38,786 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 17 [2025-03-04 10:41:38,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:41:38,786 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2025-03-04 10:41:38,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 18 states have internal predecessors, (49), 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:41:38,787 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2025-03-04 10:41:38,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 10:41:38,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:41:38,787 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-03-04 10:41:38,793 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:41:38,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:41:38,988 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:41:38,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:41:38,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1793622701, now seen corresponding path program 1 times [2025-03-04 10:41:38,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:41:38,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652005126] [2025-03-04 10:41:38,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:41:38,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:41:38,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:41:38,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:41:38,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:41:38,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:41:39,073 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:41:39,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:41:39,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652005126] [2025-03-04 10:41:39,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652005126] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:41:39,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938361413] [2025-03-04 10:41:39,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:41:39,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:41:39,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:41:39,075 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:41:39,077 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:41:39,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:41:39,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:41:39,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:41:39,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:41:39,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:41:39,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:41:39,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 10:41:39,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-03-04 10:41:39,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 10:41:39,167 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:41:39,167 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:41:39,213 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:41:39,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938361413] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:41:39,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:41:39,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 10 [2025-03-04 10:41:39,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109518632] [2025-03-04 10:41:39,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:41:39,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:41:39,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:41:39,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:41:39,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:41:39,214 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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:41:39,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:41:39,230 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2025-03-04 10:41:39,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:41:39,230 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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 18 [2025-03-04 10:41:39,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:41:39,231 INFO L225 Difference]: With dead ends: 43 [2025-03-04 10:41:39,231 INFO L226 Difference]: Without dead ends: 42 [2025-03-04 10:41:39,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:41:39,231 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 8 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:41:39,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 23 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:41:39,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-04 10:41:39,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-03-04 10:41:39,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 40 states have (on average 1.075) internal successors, (43), 41 states have internal predecessors, (43), 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:41:39,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2025-03-04 10:41:39,234 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 18 [2025-03-04 10:41:39,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:41:39,234 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2025-03-04 10:41:39,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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:41:39,234 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2025-03-04 10:41:39,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 10:41:39,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:41:39,235 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1] [2025-03-04 10:41:39,241 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:41:39,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:41:39,435 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:41:39,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:41:39,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1638922550, now seen corresponding path program 2 times [2025-03-04 10:41:39,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:41:39,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387737208] [2025-03-04 10:41:39,436 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:41:39,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:41:39,445 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-04 10:41:39,451 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:41:39,452 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:41:39,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:41:39,586 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:41:39,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:41:39,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387737208] [2025-03-04 10:41:39,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387737208] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:41:39,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513876369] [2025-03-04 10:41:39,587 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:41:39,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:41:39,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:41:39,589 INFO L229 MonitoredProcess]: Starting monitored process 8 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:41:39,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:41:39,636 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-04 10:41:39,650 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:41:39,650 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:41:39,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:41:39,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 10:41:39,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:41:39,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 10:41:39,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 10:41:39,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-03-04 10:41:39,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-03-04 10:41:39,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 10:41:39,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 10:41:39,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 10:41:39,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 10:41:39,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 10:41:39,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 10:41:39,964 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:41:39,964 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:41:40,113 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:41:40,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513876369] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:41:40,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:41:40,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 12, 12] total 28 [2025-03-04 10:41:40,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793693054] [2025-03-04 10:41:40,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:41:40,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-04 10:41:40,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:41:40,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 10:41:40,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=631, Unknown=0, NotChecked=0, Total=812 [2025-03-04 10:41:40,115 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand has 29 states, 28 states have (on average 2.642857142857143) internal successors, (74), 29 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:41:40,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:41:40,280 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2025-03-04 10:41:40,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 10:41:40,281 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.642857142857143) internal successors, (74), 29 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) Word has length 28 [2025-03-04 10:41:40,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:41:40,281 INFO L225 Difference]: With dead ends: 42 [2025-03-04 10:41:40,281 INFO L226 Difference]: Without dead ends: 41 [2025-03-04 10:41:40,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=299, Invalid=1033, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 10:41:40,282 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 41 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:41:40,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 13 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:41:40,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-04 10:41:40,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-03-04 10:41:40,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 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:41:40,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2025-03-04 10:41:40,284 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 28 [2025-03-04 10:41:40,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:41:40,285 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2025-03-04 10:41:40,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.642857142857143) internal successors, (74), 29 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:41:40,285 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2025-03-04 10:41:40,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-04 10:41:40,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:41:40,285 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1] [2025-03-04 10:41:40,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 10:41:40,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:41:40,486 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:41:40,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:41:40,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1031917440, now seen corresponding path program 2 times [2025-03-04 10:41:40,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:41:40,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886841029] [2025-03-04 10:41:40,486 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:41:40,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:41:40,495 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-03-04 10:41:40,503 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 10:41:40,505 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:41:40,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:41:40,578 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-04 10:41:40,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:41:40,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886841029] [2025-03-04 10:41:40,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886841029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:41:40,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:41:40,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:41:40,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132442268] [2025-03-04 10:41:40,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:41:40,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:41:40,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:41:40,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:41:40,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:41:40,579 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 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:41:40,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:41:40,600 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2025-03-04 10:41:40,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:41:40,601 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 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 40 [2025-03-04 10:41:40,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:41:40,601 INFO L225 Difference]: With dead ends: 41 [2025-03-04 10:41:40,601 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 10:41:40,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:41:40,602 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 7 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:41:40,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 8 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:41:40,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 10:41:40,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 10:41:40,604 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:41:40,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 10:41:40,604 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2025-03-04 10:41:40,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:41:40,604 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 10:41:40,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 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:41:40,604 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 10:41:40,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 10:41:40,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-03-04 10:41:40,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-03-04 10:41:40,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-03-04 10:41:40,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-03-04 10:41:40,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-03-04 10:41:40,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-03-04 10:41:40,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 10:41:40,609 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:41:40,610 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 10:41:40,642 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 10:41:40,650 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-04 10:41:40,651 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-04 10:41:40,651 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~i~0!base,]]] [2025-03-04 10:41:40,652 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-04 10:41:40,652 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-04 10:41:40,652 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~i~0!base,]]] [2025-03-04 10:41:40,652 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-04 10:41:40,652 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-04 10:41:40,652 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~j~0!base,]]] [2025-03-04 10:41:40,653 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-04 10:41:40,653 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-04 10:41:40,653 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~j~0!base,]]] [2025-03-04 10:41:40,653 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-03-04 10:41:40,653 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-03-04 10:41:40,653 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~j~0!base,]]] [2025-03-04 10:41:40,653 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-04 10:41:40,653 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-04 10:41:40,653 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~i~0!base,]]] [2025-03-04 10:41:40,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 10:41:40 BoogieIcfgContainer [2025-03-04 10:41:40,654 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 10:41:40,654 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 10:41:40,654 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 10:41:40,655 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 10:41:40,655 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:41:34" (3/4) ... [2025-03-04 10:41:40,657 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 10:41:40,663 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-03-04 10:41:40,663 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 10:41:40,663 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-04 10:41:40,663 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-04 10:41:40,718 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 10:41:40,718 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 10:41:40,718 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 10:41:40,719 INFO L158 Benchmark]: Toolchain (without parser) took 6932.07ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 105.2MB in the beginning and 172.5MB in the end (delta: -67.3MB). Peak memory consumption was 94.0MB. Max. memory is 16.1GB. [2025-03-04 10:41:40,720 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:41:40,720 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.06ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 89.3MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 10:41:40,720 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.15ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 88.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:41:40,720 INFO L158 Benchmark]: Boogie Preprocessor took 23.88ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 86.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:41:40,720 INFO L158 Benchmark]: IcfgBuilder took 195.18ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 74.6MB in the end (delta: 11.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 10:41:40,721 INFO L158 Benchmark]: TraceAbstraction took 6357.15ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 74.6MB in the beginning and 177.2MB in the end (delta: -102.6MB). Peak memory consumption was 52.0MB. Max. memory is 16.1GB. [2025-03-04 10:41:40,721 INFO L158 Benchmark]: Witness Printer took 64.13ms. Allocated memory is still 302.0MB. Free memory was 177.2MB in the beginning and 172.5MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:41:40,722 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.21ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 265.06ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 89.3MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.15ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 88.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.88ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 86.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 195.18ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 74.6MB in the end (delta: 11.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6357.15ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 74.6MB in the beginning and 177.2MB in the end (delta: -102.6MB). Peak memory consumption was 52.0MB. Max. memory is 16.1GB. * Witness Printer took 64.13ms. Allocated memory is still 302.0MB. Free memory was 177.2MB in the beginning and 172.5MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~i~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~i~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~j~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~j~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~j~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~i~0!base,]]] * 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: 550]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 550]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 551]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 551]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 550]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 550]: 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, 20 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 12, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 243 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 243 mSDsluCounter, 320 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 234 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 724 IncrementalHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 86 mSDtfsCounter, 724 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 333 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 929 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=8, InterpolantAutomatonStates: 110, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 29 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 306 NumberOfCodeBlocks, 306 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 399 ConstructedInterpolants, 0 QuantifiedInterpolants, 3151 SizeOfPredicates, 36 NumberOfNonLiveVariables, 630 ConjunctsInSsa, 108 ConjunctsInUnsatCore, 26 InterpolantComputations, 7 PerfectInterpolantSequences, 117/255 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 10:41:40,736 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