/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/array-memsafety/lis-alloca-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 11:09:57,946 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 11:09:57,949 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 11:09:57,984 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 11:09:57,984 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 11:09:57,986 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 11:09:57,988 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 11:09:57,990 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 11:09:58,006 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 11:09:58,007 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 11:09:58,009 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 11:09:58,010 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 11:09:58,010 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 11:09:58,012 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 11:09:58,013 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 11:09:58,015 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 11:09:58,016 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 11:09:58,017 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 11:09:58,019 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 11:09:58,022 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 11:09:58,024 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 11:09:58,025 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 11:09:58,027 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 11:09:58,028 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 11:09:58,033 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 11:09:58,033 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 11:09:58,034 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 11:09:58,035 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 11:09:58,036 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 11:09:58,037 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 11:09:58,037 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 11:09:58,038 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 11:09:58,039 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 11:09:58,041 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 11:09:58,042 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 11:09:58,042 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 11:09:58,043 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 11:09:58,043 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 11:09:58,044 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 11:09:58,045 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 11:09:58,046 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 11:09:58,047 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf [2022-10-16 11:09:58,075 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 11:09:58,075 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 11:09:58,076 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 11:09:58,076 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 11:09:58,077 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 11:09:58,077 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 11:09:58,078 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 11:09:58,078 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 11:09:58,078 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 11:09:58,079 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 11:09:58,079 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 11:09:58,079 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 11:09:58,079 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 11:09:58,079 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 11:09:58,080 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 11:09:58,080 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 11:09:58,080 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 11:09:58,080 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 11:09:58,080 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 11:09:58,081 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 11:09:58,081 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 11:09:58,081 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 11:09:58,081 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 11:09:58,082 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 11:09:58,082 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 11:09:58,082 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 11:09:58,082 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 11:09:58,083 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 11:09:58,083 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 11:09:58,083 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 11:09:58,083 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 11:09:58,083 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 11:09:58,084 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 11:09:58,084 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-16 11:09:58,486 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 11:09:58,522 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 11:09:58,526 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 11:09:58,528 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 11:09:58,529 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 11:09:58,531 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2022-10-16 11:09:58,612 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35cced5ba/92ed17252ef54499b8cb3c5214496d62/FLAG7a7fb00c6 [2022-10-16 11:09:59,380 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 11:09:59,381 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2022-10-16 11:09:59,397 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35cced5ba/92ed17252ef54499b8cb3c5214496d62/FLAG7a7fb00c6 [2022-10-16 11:09:59,666 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35cced5ba/92ed17252ef54499b8cb3c5214496d62 [2022-10-16 11:09:59,673 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 11:09:59,678 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 11:09:59,681 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 11:09:59,681 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 11:09:59,691 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 11:09:59,692 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:09:59" (1/1) ... [2022-10-16 11:09:59,694 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a89d8da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:09:59, skipping insertion in model container [2022-10-16 11:09:59,694 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:09:59" (1/1) ... [2022-10-16 11:09:59,705 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 11:09:59,774 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 11:10:00,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 11:10:00,138 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 11:10:00,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 11:10:00,290 INFO L208 MainTranslator]: Completed translation [2022-10-16 11:10:00,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:10:00 WrapperNode [2022-10-16 11:10:00,291 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 11:10:00,292 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 11:10:00,292 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 11:10:00,292 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 11:10:00,301 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:10:00" (1/1) ... [2022-10-16 11:10:00,317 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:10:00" (1/1) ... [2022-10-16 11:10:00,351 INFO L138 Inliner]: procedures = 116, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 130 [2022-10-16 11:10:00,352 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 11:10:00,352 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 11:10:00,353 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 11:10:00,353 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 11:10:00,366 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:10:00" (1/1) ... [2022-10-16 11:10:00,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:10:00" (1/1) ... [2022-10-16 11:10:00,371 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:10:00" (1/1) ... [2022-10-16 11:10:00,371 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:10:00" (1/1) ... [2022-10-16 11:10:00,378 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:10:00" (1/1) ... [2022-10-16 11:10:00,384 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:10:00" (1/1) ... [2022-10-16 11:10:00,386 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:10:00" (1/1) ... [2022-10-16 11:10:00,388 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:10:00" (1/1) ... [2022-10-16 11:10:00,394 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 11:10:00,395 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 11:10:00,395 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 11:10:00,395 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 11:10:00,396 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:10:00" (1/1) ... [2022-10-16 11:10:00,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 11:10:00,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:10:00,440 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-16 11:10:00,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-16 11:10:00,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 11:10:00,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 11:10:00,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-16 11:10:00,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 11:10:00,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 11:10:00,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 11:10:00,731 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 11:10:00,734 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 11:10:01,048 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 11:10:01,062 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 11:10:01,062 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-10-16 11:10:01,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:10:01 BoogieIcfgContainer [2022-10-16 11:10:01,065 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 11:10:01,071 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 11:10:01,071 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 11:10:01,075 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 11:10:01,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 11:09:59" (1/3) ... [2022-10-16 11:10:01,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66d36c4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:10:01, skipping insertion in model container [2022-10-16 11:10:01,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:10:00" (2/3) ... [2022-10-16 11:10:01,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66d36c4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:10:01, skipping insertion in model container [2022-10-16 11:10:01,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:10:01" (3/3) ... [2022-10-16 11:10:01,079 INFO L112 eAbstractionObserver]: Analyzing ICFG lis-alloca-1.i [2022-10-16 11:10:01,106 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 11:10:01,107 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-10-16 11:10:01,189 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 11:10:01,198 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@17dabb6c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 11:10:01,199 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-10-16 11:10:01,205 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 38 states have (on average 1.736842105263158) internal successors, (66), 52 states have internal predecessors, (66), 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) [2022-10-16 11:10:01,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-16 11:10:01,213 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:10:01,214 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:10:01,215 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 11:10:01,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:10:01,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1804971307, now seen corresponding path program 1 times [2022-10-16 11:10:01,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:10:01,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601629767] [2022-10-16 11:10:01,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:10:01,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:10:01,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:10:01,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:10:01,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:10:01,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601629767] [2022-10-16 11:10:01,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601629767] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 11:10:01,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 11:10:01,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 11:10:01,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930306344] [2022-10-16 11:10:01,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 11:10:01,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 11:10:01,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:10:01,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 11:10:01,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 11:10:01,660 INFO L87 Difference]: Start difference. First operand has 53 states, 38 states have (on average 1.736842105263158) internal successors, (66), 52 states have internal predecessors, (66), 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 2.3333333333333335) internal successors, (7), 4 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) [2022-10-16 11:10:01,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:10:01,744 INFO L93 Difference]: Finished difference Result 145 states and 180 transitions. [2022-10-16 11:10:01,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 11:10:01,748 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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 [2022-10-16 11:10:01,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:10:01,773 INFO L225 Difference]: With dead ends: 145 [2022-10-16 11:10:01,773 INFO L226 Difference]: Without dead ends: 90 [2022-10-16 11:10:01,777 INFO L412 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 [2022-10-16 11:10:01,782 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 53 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 164 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 [2022-10-16 11:10:01,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 164 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 11:10:01,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-10-16 11:10:01,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 52. [2022-10-16 11:10:01,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 38 states have (on average 1.605263157894737) internal successors, (61), 51 states have internal predecessors, (61), 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) [2022-10-16 11:10:01,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2022-10-16 11:10:01,831 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 7 [2022-10-16 11:10:01,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:10:01,832 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2022-10-16 11:10:01,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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) [2022-10-16 11:10:01,832 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2022-10-16 11:10:01,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-16 11:10:01,833 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:10:01,833 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:10:01,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 11:10:01,834 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 11:10:01,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:10:01,835 INFO L85 PathProgramCache]: Analyzing trace with hash -590954671, now seen corresponding path program 1 times [2022-10-16 11:10:01,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:10:01,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141185435] [2022-10-16 11:10:01,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:10:01,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:10:01,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:10:02,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:10:02,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:10:02,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141185435] [2022-10-16 11:10:02,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141185435] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 11:10:02,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 11:10:02,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 11:10:02,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976469491] [2022-10-16 11:10:02,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 11:10:02,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 11:10:02,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:10:02,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 11:10:02,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 11:10:02,055 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand has 4 states, 4 states have (on average 2.25) 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) [2022-10-16 11:10:02,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:10:02,138 INFO L93 Difference]: Finished difference Result 90 states and 105 transitions. [2022-10-16 11:10:02,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 11:10:02,139 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) 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 [2022-10-16 11:10:02,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:10:02,140 INFO L225 Difference]: With dead ends: 90 [2022-10-16 11:10:02,140 INFO L226 Difference]: Without dead ends: 52 [2022-10-16 11:10:02,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 11:10:02,145 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 56 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 99 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.1s IncrementalHoareTripleChecker+Time [2022-10-16 11:10:02,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 99 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 11:10:02,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-10-16 11:10:02,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-10-16 11:10:02,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 51 states have internal predecessors, (60), 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) [2022-10-16 11:10:02,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2022-10-16 11:10:02,169 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 9 [2022-10-16 11:10:02,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:10:02,172 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2022-10-16 11:10:02,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) 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) [2022-10-16 11:10:02,173 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2022-10-16 11:10:02,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-16 11:10:02,173 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:10:02,175 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:10:02,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 11:10:02,176 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 11:10:02,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:10:02,177 INFO L85 PathProgramCache]: Analyzing trace with hash 560852455, now seen corresponding path program 1 times [2022-10-16 11:10:02,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:10:02,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084325430] [2022-10-16 11:10:02,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:10:02,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:10:02,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:10:02,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:10:02,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:10:02,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084325430] [2022-10-16 11:10:02,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084325430] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 11:10:02,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269593509] [2022-10-16 11:10:02,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:10:02,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:10:02,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:10:02,363 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) [2022-10-16 11:10:02,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-16 11:10:02,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:10:02,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 11:10:02,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:10:02,570 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:10:02,571 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 11:10:02,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269593509] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 11:10:02,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 11:10:02,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2022-10-16 11:10:02,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431090724] [2022-10-16 11:10:02,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 11:10:02,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 11:10:02,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:10:02,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 11:10:02,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-10-16 11:10:02,575 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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) [2022-10-16 11:10:02,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:10:02,638 INFO L93 Difference]: Finished difference Result 140 states and 162 transitions. [2022-10-16 11:10:02,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 11:10:02,639 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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 11 [2022-10-16 11:10:02,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:10:02,641 INFO L225 Difference]: With dead ends: 140 [2022-10-16 11:10:02,641 INFO L226 Difference]: Without dead ends: 96 [2022-10-16 11:10:02,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-10-16 11:10:02,645 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 96 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 11:10:02,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 141 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 11:10:02,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-10-16 11:10:02,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 58. [2022-10-16 11:10:02,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 44 states have (on average 1.5) internal successors, (66), 57 states have internal predecessors, (66), 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) [2022-10-16 11:10:02,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2022-10-16 11:10:02,658 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 11 [2022-10-16 11:10:02,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:10:02,658 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2022-10-16 11:10:02,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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) [2022-10-16 11:10:02,659 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2022-10-16 11:10:02,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-16 11:10:02,660 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:10:02,660 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:10:02,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-16 11:10:02,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:10:02,874 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 11:10:02,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:10:02,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1240910825, now seen corresponding path program 1 times [2022-10-16 11:10:02,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:10:02,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444826729] [2022-10-16 11:10:02,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:10:02,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:10:02,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:10:03,072 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:10:03,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:10:03,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444826729] [2022-10-16 11:10:03,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444826729] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 11:10:03,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966424472] [2022-10-16 11:10:03,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:10:03,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:10:03,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:10:03,078 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) [2022-10-16 11:10:03,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-16 11:10:03,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:10:03,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 11:10:03,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:10:03,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:10:03,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 11:10:03,297 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:10:03,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966424472] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 11:10:03,297 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 11:10:03,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-10-16 11:10:03,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278715738] [2022-10-16 11:10:03,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 11:10:03,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-16 11:10:03,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:10:03,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-16 11:10:03,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-10-16 11:10:03,300 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 12 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) [2022-10-16 11:10:03,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:10:03,466 INFO L93 Difference]: Finished difference Result 188 states and 219 transitions. [2022-10-16 11:10:03,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 11:10:03,467 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 12 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) Word has length 11 [2022-10-16 11:10:03,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:10:03,469 INFO L225 Difference]: With dead ends: 188 [2022-10-16 11:10:03,469 INFO L226 Difference]: Without dead ends: 187 [2022-10-16 11:10:03,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2022-10-16 11:10:03,471 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 254 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 11:10:03,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 327 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 11:10:03,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-10-16 11:10:03,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 69. [2022-10-16 11:10:03,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 55 states have (on average 1.490909090909091) internal successors, (82), 68 states have internal predecessors, (82), 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) [2022-10-16 11:10:03,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2022-10-16 11:10:03,486 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 82 transitions. Word has length 11 [2022-10-16 11:10:03,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:10:03,486 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 82 transitions. [2022-10-16 11:10:03,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 12 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) [2022-10-16 11:10:03,487 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2022-10-16 11:10:03,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-16 11:10:03,487 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:10:03,488 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-10-16 11:10:03,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-16 11:10:03,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-10-16 11:10:03,703 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 11:10:03,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:10:03,704 INFO L85 PathProgramCache]: Analyzing trace with hash -186470036, now seen corresponding path program 1 times [2022-10-16 11:10:03,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:10:03,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364871265] [2022-10-16 11:10:03,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:10:03,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:10:03,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:10:03,783 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:10:03,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:10:03,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364871265] [2022-10-16 11:10:03,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364871265] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 11:10:03,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510101021] [2022-10-16 11:10:03,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:10:03,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:10:03,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:10:03,786 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) [2022-10-16 11:10:03,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-16 11:10:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:10:03,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 11:10:03,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:10:03,896 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:10:03,897 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 11:10:03,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510101021] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 11:10:03,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 11:10:03,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-10-16 11:10:03,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418966620] [2022-10-16 11:10:03,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 11:10:03,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 11:10:03,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:10:03,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 11:10:03,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-16 11:10:03,899 INFO L87 Difference]: Start difference. First operand 69 states and 82 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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) [2022-10-16 11:10:03,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:10:03,940 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2022-10-16 11:10:03,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 11:10:03,940 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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 [2022-10-16 11:10:03,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:10:03,943 INFO L225 Difference]: With dead ends: 69 [2022-10-16 11:10:03,943 INFO L226 Difference]: Without dead ends: 68 [2022-10-16 11:10:03,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-10-16 11:10:03,945 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 52 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 11:10:03,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 103 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 11:10:03,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-10-16 11:10:03,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-10-16 11:10:03,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 67 states have internal predecessors, (79), 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) [2022-10-16 11:10:03,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2022-10-16 11:10:03,956 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 12 [2022-10-16 11:10:03,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:10:03,956 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2022-10-16 11:10:03,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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) [2022-10-16 11:10:03,957 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2022-10-16 11:10:03,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-16 11:10:03,957 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:10:03,958 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:10:03,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-16 11:10:04,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:10:04,173 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 11:10:04,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:10:04,174 INFO L85 PathProgramCache]: Analyzing trace with hash 2106704141, now seen corresponding path program 1 times [2022-10-16 11:10:04,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:10:04,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952210550] [2022-10-16 11:10:04,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:10:04,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:10:04,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:10:04,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 11:10:04,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:10:04,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952210550] [2022-10-16 11:10:04,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952210550] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 11:10:04,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 11:10:04,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 11:10:04,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688196449] [2022-10-16 11:10:04,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 11:10:04,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 11:10:04,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:10:04,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 11:10:04,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 11:10:04,246 INFO L87 Difference]: Start difference. First operand 68 states and 79 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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) [2022-10-16 11:10:04,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:10:04,302 INFO L93 Difference]: Finished difference Result 82 states and 95 transitions. [2022-10-16 11:10:04,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 11:10:04,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 [2022-10-16 11:10:04,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:10:04,304 INFO L225 Difference]: With dead ends: 82 [2022-10-16 11:10:04,304 INFO L226 Difference]: Without dead ends: 80 [2022-10-16 11:10:04,304 INFO L412 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 [2022-10-16 11:10:04,309 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 11 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 11:10:04,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 127 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 11:10:04,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-10-16 11:10:04,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 72. [2022-10-16 11:10:04,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 59 states have (on average 1.423728813559322) internal successors, (84), 71 states have internal predecessors, (84), 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) [2022-10-16 11:10:04,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2022-10-16 11:10:04,338 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 13 [2022-10-16 11:10:04,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:10:04,339 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2022-10-16 11:10:04,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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) [2022-10-16 11:10:04,339 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2022-10-16 11:10:04,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-16 11:10:04,341 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:10:04,341 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:10:04,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-16 11:10:04,342 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 11:10:04,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:10:04,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1583395606, now seen corresponding path program 1 times [2022-10-16 11:10:04,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:10:04,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318726252] [2022-10-16 11:10:04,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:10:04,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:10:04,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:10:04,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 11:10:04,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:10:04,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318726252] [2022-10-16 11:10:04,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318726252] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 11:10:04,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 11:10:04,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 11:10:04,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935041185] [2022-10-16 11:10:04,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 11:10:04,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 11:10:04,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:10:04,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 11:10:04,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 11:10:04,451 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 11:10:04,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:10:04,502 INFO L93 Difference]: Finished difference Result 141 states and 165 transitions. [2022-10-16 11:10:04,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 11:10:04,503 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-10-16 11:10:04,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:10:04,504 INFO L225 Difference]: With dead ends: 141 [2022-10-16 11:10:04,504 INFO L226 Difference]: Without dead ends: 111 [2022-10-16 11:10:04,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 11:10:04,511 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 60 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 11:10:04,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 97 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 11:10:04,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-10-16 11:10:04,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 74. [2022-10-16 11:10:04,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 73 states have internal predecessors, (87), 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) [2022-10-16 11:10:04,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 87 transitions. [2022-10-16 11:10:04,523 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 87 transitions. Word has length 16 [2022-10-16 11:10:04,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:10:04,524 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 87 transitions. [2022-10-16 11:10:04,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 11:10:04,524 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 87 transitions. [2022-10-16 11:10:04,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-16 11:10:04,525 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:10:04,525 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:10:04,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-16 11:10:04,526 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 11:10:04,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:10:04,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1583394516, now seen corresponding path program 1 times [2022-10-16 11:10:04,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:10:04,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364401376] [2022-10-16 11:10:04,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:10:04,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:10:04,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:10:04,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 11:10:04,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:10:04,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364401376] [2022-10-16 11:10:04,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364401376] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 11:10:04,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 11:10:04,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 11:10:04,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055297013] [2022-10-16 11:10:04,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 11:10:04,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 11:10:04,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:10:04,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 11:10:04,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 11:10:04,603 INFO L87 Difference]: Start difference. First operand 74 states and 87 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 11:10:04,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:10:04,655 INFO L93 Difference]: Finished difference Result 107 states and 126 transitions. [2022-10-16 11:10:04,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 11:10:04,656 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-10-16 11:10:04,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:10:04,657 INFO L225 Difference]: With dead ends: 107 [2022-10-16 11:10:04,657 INFO L226 Difference]: Without dead ends: 74 [2022-10-16 11:10:04,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 11:10:04,658 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 52 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 11:10:04,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 83 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 11:10:04,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-10-16 11:10:04,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-10-16 11:10:04,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 61 states have (on average 1.4098360655737705) internal successors, (86), 73 states have internal predecessors, (86), 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) [2022-10-16 11:10:04,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2022-10-16 11:10:04,667 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 86 transitions. Word has length 16 [2022-10-16 11:10:04,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:10:04,667 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 86 transitions. [2022-10-16 11:10:04,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 11:10:04,667 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 86 transitions. [2022-10-16 11:10:04,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-16 11:10:04,668 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:10:04,668 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:10:04,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-16 11:10:04,669 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 11:10:04,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:10:04,670 INFO L85 PathProgramCache]: Analyzing trace with hash -308169399, now seen corresponding path program 1 times [2022-10-16 11:10:04,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:10:04,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193066384] [2022-10-16 11:10:04,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:10:04,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:10:04,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:10:04,802 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 11:10:04,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:10:04,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193066384] [2022-10-16 11:10:04,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193066384] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 11:10:04,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676011009] [2022-10-16 11:10:04,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:10:04,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:10:04,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:10:04,806 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) [2022-10-16 11:10:04,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 [2022-10-16 11:10:04,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:10:04,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 7 conjunts are in the unsatisfiable core [2022-10-16 11:10:04,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:10:04,978 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 11:10:04,978 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 11:10:04,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676011009] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 11:10:04,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 11:10:04,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2022-10-16 11:10:04,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789789467] [2022-10-16 11:10:04,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 11:10:04,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 11:10:04,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:10:04,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 11:10:04,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-10-16 11:10:04,981 INFO L87 Difference]: Start difference. First operand 74 states and 86 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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) [2022-10-16 11:10:05,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:10:05,099 INFO L93 Difference]: Finished difference Result 136 states and 159 transitions. [2022-10-16 11:10:05,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 11:10:05,099 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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 17 [2022-10-16 11:10:05,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:10:05,100 INFO L225 Difference]: With dead ends: 136 [2022-10-16 11:10:05,101 INFO L226 Difference]: Without dead ends: 97 [2022-10-16 11:10:05,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-10-16 11:10:05,104 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 35 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 11:10:05,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 198 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 11:10:05,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-10-16 11:10:05,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 82. [2022-10-16 11:10:05,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 69 states have (on average 1.3623188405797102) internal successors, (94), 81 states have internal predecessors, (94), 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) [2022-10-16 11:10:05,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 94 transitions. [2022-10-16 11:10:05,115 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 94 transitions. Word has length 17 [2022-10-16 11:10:05,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:10:05,116 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 94 transitions. [2022-10-16 11:10:05,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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) [2022-10-16 11:10:05,116 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 94 transitions. [2022-10-16 11:10:05,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-16 11:10:05,122 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:10:05,122 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:10:05,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-10-16 11:10:05,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:10:05,338 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 11:10:05,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:10:05,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1588033077, now seen corresponding path program 1 times [2022-10-16 11:10:05,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:10:05,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840732827] [2022-10-16 11:10:05,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:10:05,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:10:05,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:10:05,494 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:10:05,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:10:05,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840732827] [2022-10-16 11:10:05,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840732827] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 11:10:05,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868181467] [2022-10-16 11:10:05,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:10:05,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:10:05,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:10:05,497 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) [2022-10-16 11:10:05,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-16 11:10:05,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:10:05,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 10 conjunts are in the unsatisfiable core [2022-10-16 11:10:05,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:10:05,679 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:10:05,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 11:10:05,771 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:10:05,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868181467] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 11:10:05,771 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 11:10:05,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-10-16 11:10:05,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345785939] [2022-10-16 11:10:05,772 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 11:10:05,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-16 11:10:05,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:10:05,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-16 11:10:05,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-10-16 11:10:05,774 INFO L87 Difference]: Start difference. First operand 82 states and 94 transitions. Second operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 16 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) [2022-10-16 11:10:06,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:10:06,020 INFO L93 Difference]: Finished difference Result 144 states and 167 transitions. [2022-10-16 11:10:06,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-16 11:10:06,021 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 16 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 17 [2022-10-16 11:10:06,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:10:06,022 INFO L225 Difference]: With dead ends: 144 [2022-10-16 11:10:06,022 INFO L226 Difference]: Without dead ends: 105 [2022-10-16 11:10:06,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2022-10-16 11:10:06,024 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 85 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 11:10:06,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 433 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 11:10:06,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-10-16 11:10:06,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 82. [2022-10-16 11:10:06,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 69 states have (on average 1.3623188405797102) internal successors, (94), 81 states have internal predecessors, (94), 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) [2022-10-16 11:10:06,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 94 transitions. [2022-10-16 11:10:06,032 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 94 transitions. Word has length 17 [2022-10-16 11:10:06,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:10:06,033 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 94 transitions. [2022-10-16 11:10:06,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 16 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) [2022-10-16 11:10:06,033 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 94 transitions. [2022-10-16 11:10:06,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-10-16 11:10:06,034 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:10:06,034 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:10:06,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-10-16 11:10:06,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-10-16 11:10:06,244 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 11:10:06,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:10:06,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1433534087, now seen corresponding path program 2 times [2022-10-16 11:10:06,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:10:06,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361171753] [2022-10-16 11:10:06,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:10:06,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:10:06,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:10:06,348 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 11:10:06,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:10:06,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361171753] [2022-10-16 11:10:06,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361171753] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 11:10:06,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47878592] [2022-10-16 11:10:06,349 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 11:10:06,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:10:06,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:10:06,350 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) [2022-10-16 11:10:06,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-10-16 11:10:06,425 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-16 11:10:06,425 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 11:10:06,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 6 conjunts are in the unsatisfiable core [2022-10-16 11:10:06,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:10:06,478 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-10-16 11:10:06,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 11:10:06,523 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-10-16 11:10:06,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47878592] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 11:10:06,523 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 11:10:06,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-10-16 11:10:06,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96666493] [2022-10-16 11:10:06,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 11:10:06,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-16 11:10:06,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:10:06,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-16 11:10:06,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-10-16 11:10:06,526 INFO L87 Difference]: Start difference. First operand 82 states and 94 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 10 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) [2022-10-16 11:10:06,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:10:06,702 INFO L93 Difference]: Finished difference Result 119 states and 138 transitions. [2022-10-16 11:10:06,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-16 11:10:06,702 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-10-16 11:10:06,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:10:06,704 INFO L225 Difference]: With dead ends: 119 [2022-10-16 11:10:06,704 INFO L226 Difference]: Without dead ends: 118 [2022-10-16 11:10:06,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2022-10-16 11:10:06,705 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 256 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 11:10:06,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 155 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 11:10:06,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-10-16 11:10:06,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 81. [2022-10-16 11:10:06,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 69 states have (on average 1.3478260869565217) internal successors, (93), 80 states have internal predecessors, (93), 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) [2022-10-16 11:10:06,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 93 transitions. [2022-10-16 11:10:06,715 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 93 transitions. Word has length 21 [2022-10-16 11:10:06,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:10:06,715 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 93 transitions. [2022-10-16 11:10:06,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 10 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) [2022-10-16 11:10:06,716 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2022-10-16 11:10:06,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-16 11:10:06,716 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:10:06,717 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:10:06,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-10-16 11:10:06,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:10:06,932 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 11:10:06,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:10:06,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1141995846, now seen corresponding path program 1 times [2022-10-16 11:10:06,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:10:06,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810756935] [2022-10-16 11:10:06,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:10:06,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:10:06,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:10:06,990 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 11:10:06,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:10:06,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810756935] [2022-10-16 11:10:06,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810756935] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 11:10:06,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 11:10:06,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 11:10:06,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102481934] [2022-10-16 11:10:06,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 11:10:06,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 11:10:06,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:10:06,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 11:10:06,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 11:10:06,993 INFO L87 Difference]: Start difference. First operand 81 states and 93 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 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) [2022-10-16 11:10:07,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:10:07,038 INFO L93 Difference]: Finished difference Result 88 states and 101 transitions. [2022-10-16 11:10:07,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 11:10:07,039 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 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) Word has length 22 [2022-10-16 11:10:07,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:10:07,040 INFO L225 Difference]: With dead ends: 88 [2022-10-16 11:10:07,040 INFO L226 Difference]: Without dead ends: 86 [2022-10-16 11:10:07,040 INFO L412 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 [2022-10-16 11:10:07,041 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 7 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 11:10:07,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 126 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 11:10:07,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-10-16 11:10:07,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-10-16 11:10:07,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 74 states have (on average 1.337837837837838) internal successors, (99), 85 states have internal predecessors, (99), 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) [2022-10-16 11:10:07,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2022-10-16 11:10:07,050 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 22 [2022-10-16 11:10:07,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:10:07,051 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2022-10-16 11:10:07,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 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) [2022-10-16 11:10:07,051 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2022-10-16 11:10:07,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-16 11:10:07,052 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:10:07,052 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:10:07,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-16 11:10:07,052 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 11:10:07,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:10:07,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1489883808, now seen corresponding path program 1 times [2022-10-16 11:10:07,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:10:07,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605785855] [2022-10-16 11:10:07,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:10:07,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:10:07,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:10:07,144 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 11:10:07,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:10:07,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605785855] [2022-10-16 11:10:07,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605785855] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 11:10:07,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064343197] [2022-10-16 11:10:07,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:10:07,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:10:07,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:10:07,147 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) [2022-10-16 11:10:07,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-10-16 11:10:07,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:10:07,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 11:10:07,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:10:07,249 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 11:10:07,250 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 11:10:07,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064343197] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 11:10:07,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 11:10:07,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-10-16 11:10:07,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236110312] [2022-10-16 11:10:07,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 11:10:07,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 11:10:07,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:10:07,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 11:10:07,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-16 11:10:07,252 INFO L87 Difference]: Start difference. First operand 86 states and 99 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) [2022-10-16 11:10:07,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:10:07,319 INFO L93 Difference]: Finished difference Result 108 states and 124 transitions. [2022-10-16 11:10:07,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 11:10:07,320 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 22 [2022-10-16 11:10:07,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:10:07,321 INFO L225 Difference]: With dead ends: 108 [2022-10-16 11:10:07,321 INFO L226 Difference]: Without dead ends: 107 [2022-10-16 11:10:07,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-10-16 11:10:07,322 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 61 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 11:10:07,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 110 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 11:10:07,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-10-16 11:10:07,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 82. [2022-10-16 11:10:07,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 81 states have internal predecessors, (95), 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) [2022-10-16 11:10:07,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 95 transitions. [2022-10-16 11:10:07,331 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 95 transitions. Word has length 22 [2022-10-16 11:10:07,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:10:07,331 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 95 transitions. [2022-10-16 11:10:07,332 INFO L496 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) [2022-10-16 11:10:07,332 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 95 transitions. [2022-10-16 11:10:07,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-16 11:10:07,333 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:10:07,333 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1, 1] [2022-10-16 11:10:07,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-10-16 11:10:07,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:10:07,549 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 11:10:07,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:10:07,550 INFO L85 PathProgramCache]: Analyzing trace with hash -868473059, now seen corresponding path program 2 times [2022-10-16 11:10:07,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:10:07,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031021599] [2022-10-16 11:10:07,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:10:07,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:10:07,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:10:07,710 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:10:07,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:10:07,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031021599] [2022-10-16 11:10:07,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031021599] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 11:10:07,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217434065] [2022-10-16 11:10:07,711 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 11:10:07,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:10:07,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:10:07,713 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 11:10:07,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-10-16 11:10:07,769 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-16 11:10:07,769 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 11:10:07,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-16 11:10:07,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:10:07,829 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-10-16 11:10:07,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 11:10:07,879 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-10-16 11:10:07,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217434065] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 11:10:07,880 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 11:10:07,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 14 [2022-10-16 11:10:07,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986231385] [2022-10-16 11:10:07,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 11:10:07,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-16 11:10:07,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:10:07,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-16 11:10:07,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-10-16 11:10:07,883 INFO L87 Difference]: Start difference. First operand 82 states and 95 transitions. Second operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 15 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) [2022-10-16 11:10:08,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:10:08,143 INFO L93 Difference]: Finished difference Result 277 states and 327 transitions. [2022-10-16 11:10:08,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 11:10:08,144 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 15 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 23 [2022-10-16 11:10:08,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:10:08,146 INFO L225 Difference]: With dead ends: 277 [2022-10-16 11:10:08,146 INFO L226 Difference]: Without dead ends: 276 [2022-10-16 11:10:08,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=207, Invalid=495, Unknown=0, NotChecked=0, Total=702 [2022-10-16 11:10:08,148 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 622 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 11:10:08,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 435 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 11:10:08,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2022-10-16 11:10:08,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 71. [2022-10-16 11:10:08,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 61 states have (on average 1.3442622950819672) internal successors, (82), 70 states have internal predecessors, (82), 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) [2022-10-16 11:10:08,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2022-10-16 11:10:08,160 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 23 [2022-10-16 11:10:08,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:10:08,160 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2022-10-16 11:10:08,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 15 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) [2022-10-16 11:10:08,161 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2022-10-16 11:10:08,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-16 11:10:08,161 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:10:08,162 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:10:08,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-10-16 11:10:08,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-10-16 11:10:08,378 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 11:10:08,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:10:08,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1504799090, now seen corresponding path program 1 times [2022-10-16 11:10:08,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:10:08,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562371213] [2022-10-16 11:10:08,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:10:08,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:10:08,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:10:08,594 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:10:08,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:10:08,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562371213] [2022-10-16 11:10:08,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562371213] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 11:10:08,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128205813] [2022-10-16 11:10:08,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:10:08,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:10:08,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:10:08,597 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 11:10:08,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-10-16 11:10:08,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:10:08,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 10 conjunts are in the unsatisfiable core [2022-10-16 11:10:08,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:10:08,785 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:10:08,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 11:10:08,882 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:10:08,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128205813] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 11:10:08,897 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 11:10:08,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-10-16 11:10:08,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915028646] [2022-10-16 11:10:08,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 11:10:08,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-16 11:10:08,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:10:08,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-16 11:10:08,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-10-16 11:10:08,899 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand has 16 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 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) [2022-10-16 11:10:09,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:10:09,163 INFO L93 Difference]: Finished difference Result 129 states and 150 transitions. [2022-10-16 11:10:09,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-16 11:10:09,164 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 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 24 [2022-10-16 11:10:09,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:10:09,165 INFO L225 Difference]: With dead ends: 129 [2022-10-16 11:10:09,165 INFO L226 Difference]: Without dead ends: 91 [2022-10-16 11:10:09,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2022-10-16 11:10:09,167 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 183 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 11:10:09,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 328 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 11:10:09,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-10-16 11:10:09,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 75. [2022-10-16 11:10:09,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 65 states have (on average 1.323076923076923) internal successors, (86), 74 states have internal predecessors, (86), 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) [2022-10-16 11:10:09,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 86 transitions. [2022-10-16 11:10:09,178 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 86 transitions. Word has length 24 [2022-10-16 11:10:09,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:10:09,178 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 86 transitions. [2022-10-16 11:10:09,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 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) [2022-10-16 11:10:09,179 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 86 transitions. [2022-10-16 11:10:09,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-10-16 11:10:09,179 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:10:09,179 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:10:09,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-10-16 11:10:09,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-10-16 11:10:09,394 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 11:10:09,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:10:09,395 INFO L85 PathProgramCache]: Analyzing trace with hash 2012351166, now seen corresponding path program 1 times [2022-10-16 11:10:09,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:10:09,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36478896] [2022-10-16 11:10:09,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:10:09,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:10:09,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:10:09,469 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 11:10:09,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:10:09,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36478896] [2022-10-16 11:10:09,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36478896] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 11:10:09,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496173859] [2022-10-16 11:10:09,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:10:09,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:10:09,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:10:09,472 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 11:10:09,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-10-16 11:10:09,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:10:09,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 7 conjunts are in the unsatisfiable core [2022-10-16 11:10:09,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:10:09,657 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 11:10:09,658 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 11:10:09,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496173859] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 11:10:09,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 11:10:09,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 11 [2022-10-16 11:10:09,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240259696] [2022-10-16 11:10:09,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 11:10:09,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 11:10:09,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:10:09,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 11:10:09,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-10-16 11:10:09,660 INFO L87 Difference]: Start difference. First operand 75 states and 86 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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) [2022-10-16 11:10:09,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:10:09,753 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2022-10-16 11:10:09,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 11:10:09,754 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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 27 [2022-10-16 11:10:09,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:10:09,754 INFO L225 Difference]: With dead ends: 97 [2022-10-16 11:10:09,755 INFO L226 Difference]: Without dead ends: 69 [2022-10-16 11:10:09,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-10-16 11:10:09,756 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 28 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 11:10:09,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 165 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 11:10:09,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-10-16 11:10:09,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-10-16 11:10:09,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 59 states have (on average 1.3389830508474576) internal successors, (79), 68 states have internal predecessors, (79), 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) [2022-10-16 11:10:09,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2022-10-16 11:10:09,766 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 27 [2022-10-16 11:10:09,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:10:09,766 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2022-10-16 11:10:09,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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) [2022-10-16 11:10:09,767 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2022-10-16 11:10:09,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-10-16 11:10:09,767 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:10:09,768 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:10:09,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-10-16 11:10:09,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-10-16 11:10:09,982 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 11:10:09,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:10:09,983 INFO L85 PathProgramCache]: Analyzing trace with hash -2142067520, now seen corresponding path program 1 times [2022-10-16 11:10:09,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:10:09,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079496556] [2022-10-16 11:10:09,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:10:09,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:10:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:10:10,056 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 11:10:10,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:10:10,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079496556] [2022-10-16 11:10:10,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079496556] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 11:10:10,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247158210] [2022-10-16 11:10:10,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:10:10,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:10:10,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:10:10,058 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 11:10:10,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-10-16 11:10:10,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:10:10,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjunts are in the unsatisfiable core [2022-10-16 11:10:10,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:10:10,252 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 11:10:10,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 11:10:10,364 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 11:10:10,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247158210] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 11:10:10,365 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 11:10:10,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 10] total 17 [2022-10-16 11:10:10,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783203748] [2022-10-16 11:10:10,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 11:10:10,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-10-16 11:10:10,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:10:10,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-10-16 11:10:10,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2022-10-16 11:10:10,368 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 17 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 11:10:10,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:10:10,719 INFO L93 Difference]: Finished difference Result 120 states and 138 transitions. [2022-10-16 11:10:10,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-10-16 11:10:10,720 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 17 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-10-16 11:10:10,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:10:10,721 INFO L225 Difference]: With dead ends: 120 [2022-10-16 11:10:10,721 INFO L226 Difference]: Without dead ends: 91 [2022-10-16 11:10:10,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=709, Unknown=0, NotChecked=0, Total=870 [2022-10-16 11:10:10,722 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 134 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 11:10:10,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 308 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 11:10:10,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-10-16 11:10:10,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 65. [2022-10-16 11:10:10,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 64 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) [2022-10-16 11:10:10,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2022-10-16 11:10:10,733 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 27 [2022-10-16 11:10:10,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:10:10,733 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2022-10-16 11:10:10,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 17 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 11:10:10,733 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2022-10-16 11:10:10,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-10-16 11:10:10,734 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:10:10,734 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:10:10,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-10-16 11:10:10,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-10-16 11:10:10,948 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 11:10:10,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:10:10,949 INFO L85 PathProgramCache]: Analyzing trace with hash 659990710, now seen corresponding path program 2 times [2022-10-16 11:10:10,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:10:10,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555853824] [2022-10-16 11:10:10,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:10:10,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:10:10,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:10:11,508 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 11:10:11,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:10:11,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555853824] [2022-10-16 11:10:11,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555853824] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 11:10:11,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287346685] [2022-10-16 11:10:11,509 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 11:10:11,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:10:11,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:10:11,511 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 11:10:11,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-10-16 11:10:11,582 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 11:10:11,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 11:10:11,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 26 conjunts are in the unsatisfiable core [2022-10-16 11:10:11,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:10:11,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2022-10-16 11:10:11,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2022-10-16 11:10:11,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-10-16 11:10:11,783 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-10-16 11:10:11,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2022-10-16 11:10:11,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 11:10:11,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-10-16 11:10:11,860 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 11:10:11,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 11:10:11,931 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_449 (Array Int Int)) (v_ArrVal_450 Int)) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* 4 |c_ULTIMATE.start_lis_~i~0#1|) |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_450)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_449) |c_ULTIMATE.start_lis_~best~0#1.base|) |c_ULTIMATE.start_lis_~best~0#1.offset|) 2147483647)) is different from false [2022-10-16 11:10:11,986 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_lis_~i~0#1_37| Int)) (or (forall ((v_ArrVal_449 (Array Int Int)) (v_ArrVal_450 Int)) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* |v_ULTIMATE.start_lis_~i~0#1_37| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_450)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_449) |c_ULTIMATE.start_lis_~best~0#1.base|) |c_ULTIMATE.start_lis_~best~0#1.offset|) 2147483647)) (not (<= (+ |c_ULTIMATE.start_lis_#t~post4#1| 1) |v_ULTIMATE.start_lis_~i~0#1_37|)))) is different from false [2022-10-16 11:10:12,031 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_449 (Array Int Int)) (|v_ULTIMATE.start_lis_~i~0#1_37| Int) (v_ArrVal_450 Int)) (or (< |v_ULTIMATE.start_lis_~i~0#1_37| (+ |c_ULTIMATE.start_lis_~i~0#1| 1)) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* |v_ULTIMATE.start_lis_~i~0#1_37| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_450)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_449) |c_ULTIMATE.start_lis_~best~0#1.base|) |c_ULTIMATE.start_lis_~best~0#1.offset|) 2147483647))) is different from false [2022-10-16 11:10:12,051 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 11:10:12,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 41 [2022-10-16 11:10:12,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 78 treesize of output 74 [2022-10-16 11:10:12,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 41 treesize of output 39 [2022-10-16 11:10:12,093 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 11:10:12,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 55 [2022-10-16 11:10:12,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 80 treesize of output 76 [2022-10-16 11:10:12,196 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 5 not checked. [2022-10-16 11:10:12,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287346685] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 11:10:12,196 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 11:10:12,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2022-10-16 11:10:12,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942651354] [2022-10-16 11:10:12,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 11:10:12,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-10-16 11:10:12,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:10:12,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-10-16 11:10:12,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=275, Unknown=3, NotChecked=108, Total=462 [2022-10-16 11:10:12,198 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand has 22 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 22 states have internal predecessors, (53), 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) [2022-10-16 11:10:12,785 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|))) (and (= (select .cse0 (+ (* 4 |c_ULTIMATE.start_lis_~i~0#1|) |c_ULTIMATE.start_lis_~best~0#1.offset|)) 1) (not (= |c_ULTIMATE.start_lis_~best~0#1.base| |c_ULTIMATE.start_lis_~prev~0#1.base|)) (forall ((v_ArrVal_449 (Array Int Int)) (|v_ULTIMATE.start_lis_~i~0#1_37| Int) (v_ArrVal_450 Int)) (or (< |v_ULTIMATE.start_lis_~i~0#1_37| (+ |c_ULTIMATE.start_lis_~i~0#1| 1)) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_lis_~i~0#1_37| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_450)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_449) |c_ULTIMATE.start_lis_~best~0#1.base|) |c_ULTIMATE.start_lis_~best~0#1.offset|) 2147483647))) (= 0 |c_ULTIMATE.start_lis_~best~0#1.offset|) (= |c_ULTIMATE.start_lis_~i~0#1| 0))) is different from false [2022-10-16 11:10:14,809 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|))) (and (not (= |c_ULTIMATE.start_lis_~best~0#1.base| |c_ULTIMATE.start_lis_~prev~0#1.base|)) (= 0 |c_ULTIMATE.start_lis_~best~0#1.offset|) (= |c_ULTIMATE.start_lis_#t~post4#1| 0) (= (select .cse0 0) 1) (forall ((|v_ULTIMATE.start_lis_~i~0#1_37| Int)) (or (forall ((v_ArrVal_449 (Array Int Int)) (v_ArrVal_450 Int)) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_lis_~i~0#1_37| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_450)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_449) |c_ULTIMATE.start_lis_~best~0#1.base|) |c_ULTIMATE.start_lis_~best~0#1.offset|) 2147483647)) (not (<= (+ |c_ULTIMATE.start_lis_#t~post4#1| 1) |v_ULTIMATE.start_lis_~i~0#1_37|)))))) is different from false [2022-10-16 11:10:15,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:10:15,141 INFO L93 Difference]: Finished difference Result 153 states and 180 transitions. [2022-10-16 11:10:15,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-16 11:10:15,142 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 22 states have internal predecessors, (53), 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 [2022-10-16 11:10:15,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:10:15,143 INFO L225 Difference]: With dead ends: 153 [2022-10-16 11:10:15,143 INFO L226 Difference]: Without dead ends: 151 [2022-10-16 11:10:15,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=114, Invalid=407, Unknown=5, NotChecked=230, Total=756 [2022-10-16 11:10:15,145 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 217 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 274 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 11:10:15,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 497 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 245 Invalid, 0 Unknown, 274 Unchecked, 0.2s Time] [2022-10-16 11:10:15,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-10-16 11:10:15,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 88. [2022-10-16 11:10:15,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 78 states have (on average 1.4102564102564104) internal successors, (110), 87 states have internal predecessors, (110), 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) [2022-10-16 11:10:15,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 110 transitions. [2022-10-16 11:10:15,165 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 110 transitions. Word has length 28 [2022-10-16 11:10:15,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:10:15,166 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 110 transitions. [2022-10-16 11:10:15,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 22 states have internal predecessors, (53), 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) [2022-10-16 11:10:15,166 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 110 transitions. [2022-10-16 11:10:15,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-10-16 11:10:15,167 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:10:15,167 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:10:15,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-10-16 11:10:15,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-10-16 11:10:15,381 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 11:10:15,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:10:15,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1015118350, now seen corresponding path program 1 times [2022-10-16 11:10:15,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:10:15,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739007379] [2022-10-16 11:10:15,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:10:15,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:10:15,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:10:15,427 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 11:10:15,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:10:15,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739007379] [2022-10-16 11:10:15,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739007379] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 11:10:15,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 11:10:15,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 11:10:15,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123890258] [2022-10-16 11:10:15,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 11:10:15,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 11:10:15,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:10:15,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 11:10:15,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 11:10:15,430 INFO L87 Difference]: Start difference. First operand 88 states and 110 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 11:10:15,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:10:15,454 INFO L93 Difference]: Finished difference Result 129 states and 160 transitions. [2022-10-16 11:10:15,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 11:10:15,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-10-16 11:10:15,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:10:15,456 INFO L225 Difference]: With dead ends: 129 [2022-10-16 11:10:15,456 INFO L226 Difference]: Without dead ends: 90 [2022-10-16 11:10:15,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 11:10:15,457 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 11:10:15,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 11:10:15,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-10-16 11:10:15,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-10-16 11:10:15,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 80 states have (on average 1.4) internal successors, (112), 89 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 11:10:15,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 112 transitions. [2022-10-16 11:10:15,474 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 112 transitions. Word has length 29 [2022-10-16 11:10:15,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:10:15,475 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 112 transitions. [2022-10-16 11:10:15,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 11:10:15,475 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 112 transitions. [2022-10-16 11:10:15,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-10-16 11:10:15,476 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:10:15,476 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:10:15,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-10-16 11:10:15,476 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 11:10:15,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:10:15,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1403891712, now seen corresponding path program 1 times [2022-10-16 11:10:15,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:10:15,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498708780] [2022-10-16 11:10:15,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:10:15,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:10:15,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:10:15,538 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 11:10:15,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:10:15,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498708780] [2022-10-16 11:10:15,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498708780] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 11:10:15,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 11:10:15,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 11:10:15,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377112718] [2022-10-16 11:10:15,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 11:10:15,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 11:10:15,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:10:15,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 11:10:15,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 11:10:15,541 INFO L87 Difference]: Start difference. First operand 90 states and 112 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 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) [2022-10-16 11:10:15,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:10:15,588 INFO L93 Difference]: Finished difference Result 139 states and 174 transitions. [2022-10-16 11:10:15,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 11:10:15,591 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 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) Word has length 30 [2022-10-16 11:10:15,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:10:15,593 INFO L225 Difference]: With dead ends: 139 [2022-10-16 11:10:15,593 INFO L226 Difference]: Without dead ends: 137 [2022-10-16 11:10:15,593 INFO L412 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 [2022-10-16 11:10:15,594 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 29 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 11:10:15,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 159 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 11:10:15,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-10-16 11:10:15,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 106. [2022-10-16 11:10:15,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 96 states have (on average 1.4166666666666667) internal successors, (136), 105 states have internal predecessors, (136), 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) [2022-10-16 11:10:15,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 136 transitions. [2022-10-16 11:10:15,610 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 136 transitions. Word has length 30 [2022-10-16 11:10:15,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:10:15,610 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 136 transitions. [2022-10-16 11:10:15,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 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) [2022-10-16 11:10:15,610 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 136 transitions. [2022-10-16 11:10:15,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-10-16 11:10:15,611 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:10:15,611 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:10:15,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-10-16 11:10:15,611 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 11:10:15,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:10:15,612 INFO L85 PathProgramCache]: Analyzing trace with hash -576941970, now seen corresponding path program 1 times [2022-10-16 11:10:15,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:10:15,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076460743] [2022-10-16 11:10:15,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:10:15,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:10:15,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:10:15,699 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 11:10:15,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:10:15,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076460743] [2022-10-16 11:10:15,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076460743] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 11:10:15,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 11:10:15,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 11:10:15,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32303628] [2022-10-16 11:10:15,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 11:10:15,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 11:10:15,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:10:15,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 11:10:15,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-16 11:10:15,702 INFO L87 Difference]: Start difference. First operand 106 states and 136 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 11:10:15,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:10:15,772 INFO L93 Difference]: Finished difference Result 120 states and 152 transitions. [2022-10-16 11:10:15,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 11:10:15,772 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-10-16 11:10:15,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:10:15,773 INFO L225 Difference]: With dead ends: 120 [2022-10-16 11:10:15,773 INFO L226 Difference]: Without dead ends: 119 [2022-10-16 11:10:15,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-10-16 11:10:15,775 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 15 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 11:10:15,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 157 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 11:10:15,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-10-16 11:10:15,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 105. [2022-10-16 11:10:15,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 96 states have (on average 1.3958333333333333) internal successors, (134), 104 states have internal predecessors, (134), 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) [2022-10-16 11:10:15,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 134 transitions. [2022-10-16 11:10:15,791 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 134 transitions. Word has length 31 [2022-10-16 11:10:15,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:10:15,792 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 134 transitions. [2022-10-16 11:10:15,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 11:10:15,792 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 134 transitions. [2022-10-16 11:10:15,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-10-16 11:10:15,793 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:10:15,793 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:10:15,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-10-16 11:10:15,793 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 11:10:15,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:10:15,794 INFO L85 PathProgramCache]: Analyzing trace with hash -705331778, now seen corresponding path program 1 times [2022-10-16 11:10:15,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:10:15,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095408789] [2022-10-16 11:10:15,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:10:15,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:10:15,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:10:15,875 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 11:10:15,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:10:15,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095408789] [2022-10-16 11:10:15,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095408789] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 11:10:15,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 11:10:15,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 11:10:15,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391002420] [2022-10-16 11:10:15,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 11:10:15,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 11:10:15,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:10:15,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 11:10:15,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 11:10:15,878 INFO L87 Difference]: Start difference. First operand 105 states and 134 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 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) [2022-10-16 11:10:15,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:10:15,946 INFO L93 Difference]: Finished difference Result 119 states and 150 transitions. [2022-10-16 11:10:15,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 11:10:15,947 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 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) Word has length 32 [2022-10-16 11:10:15,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:10:15,948 INFO L225 Difference]: With dead ends: 119 [2022-10-16 11:10:15,948 INFO L226 Difference]: Without dead ends: 118 [2022-10-16 11:10:15,948 INFO L412 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 [2022-10-16 11:10:15,949 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 9 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 11:10:15,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 157 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 11:10:15,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-10-16 11:10:15,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 104. [2022-10-16 11:10:15,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 96 states have (on average 1.375) internal successors, (132), 103 states have internal predecessors, (132), 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) [2022-10-16 11:10:15,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 132 transitions. [2022-10-16 11:10:15,982 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 132 transitions. Word has length 32 [2022-10-16 11:10:15,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:10:15,982 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 132 transitions. [2022-10-16 11:10:15,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 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) [2022-10-16 11:10:15,982 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 132 transitions. [2022-10-16 11:10:15,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-10-16 11:10:15,983 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:10:15,983 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:10:15,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-10-16 11:10:15,983 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 11:10:15,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:10:15,984 INFO L85 PathProgramCache]: Analyzing trace with hash 369272314, now seen corresponding path program 3 times [2022-10-16 11:10:15,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:10:15,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658363341] [2022-10-16 11:10:15,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:10:15,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:10:16,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:10:16,203 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:10:16,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:10:16,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658363341] [2022-10-16 11:10:16,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658363341] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 11:10:16,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883049386] [2022-10-16 11:10:16,204 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 11:10:16,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:10:16,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:10:16,208 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 11:10:16,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-10-16 11:10:16,309 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-10-16 11:10:16,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 11:10:16,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 14 conjunts are in the unsatisfiable core [2022-10-16 11:10:16,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:10:16,470 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:10:16,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 11:10:16,600 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:10:16,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883049386] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 11:10:16,601 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 11:10:16,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 22 [2022-10-16 11:10:16,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399559071] [2022-10-16 11:10:16,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 11:10:16,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-10-16 11:10:16,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:10:16,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-10-16 11:10:16,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2022-10-16 11:10:16,606 INFO L87 Difference]: Start difference. First operand 104 states and 132 transitions. Second operand has 22 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 22 states have internal predecessors, (52), 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) [2022-10-16 11:10:16,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:10:16,937 INFO L93 Difference]: Finished difference Result 296 states and 378 transitions. [2022-10-16 11:10:16,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 11:10:16,938 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 22 states have internal predecessors, (52), 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 32 [2022-10-16 11:10:16,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:10:16,939 INFO L225 Difference]: With dead ends: 296 [2022-10-16 11:10:16,940 INFO L226 Difference]: Without dead ends: 240 [2022-10-16 11:10:16,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 46 SyntacticMatches, 9 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=776, Unknown=0, NotChecked=0, Total=930 [2022-10-16 11:10:16,941 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 244 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 11:10:16,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 418 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 11:10:16,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-10-16 11:10:16,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 118. [2022-10-16 11:10:16,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 110 states have (on average 1.3363636363636364) internal successors, (147), 117 states have internal predecessors, (147), 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) [2022-10-16 11:10:16,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 147 transitions. [2022-10-16 11:10:16,962 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 147 transitions. Word has length 32 [2022-10-16 11:10:16,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:10:16,963 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 147 transitions. [2022-10-16 11:10:16,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 22 states have internal predecessors, (52), 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) [2022-10-16 11:10:16,963 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 147 transitions. [2022-10-16 11:10:16,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-10-16 11:10:16,964 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:10:16,964 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:10:17,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-10-16 11:10:17,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-10-16 11:10:17,180 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 11:10:17,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:10:17,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1696569305, now seen corresponding path program 1 times [2022-10-16 11:10:17,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:10:17,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84904905] [2022-10-16 11:10:17,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:10:17,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:10:17,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:10:17,246 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-10-16 11:10:17,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:10:17,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84904905] [2022-10-16 11:10:17,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84904905] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 11:10:17,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 11:10:17,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 11:10:17,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165787346] [2022-10-16 11:10:17,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 11:10:17,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 11:10:17,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:10:17,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 11:10:17,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 11:10:17,249 INFO L87 Difference]: Start difference. First operand 118 states and 147 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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) [2022-10-16 11:10:17,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:10:17,319 INFO L93 Difference]: Finished difference Result 168 states and 215 transitions. [2022-10-16 11:10:17,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 11:10:17,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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 34 [2022-10-16 11:10:17,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:10:17,321 INFO L225 Difference]: With dead ends: 168 [2022-10-16 11:10:17,321 INFO L226 Difference]: Without dead ends: 166 [2022-10-16 11:10:17,322 INFO L412 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 [2022-10-16 11:10:17,323 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 13 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 11:10:17,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 109 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 11:10:17,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-10-16 11:10:17,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 162. [2022-10-16 11:10:17,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 154 states have (on average 1.37012987012987) internal successors, (211), 161 states have internal predecessors, (211), 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) [2022-10-16 11:10:17,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 211 transitions. [2022-10-16 11:10:17,343 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 211 transitions. Word has length 34 [2022-10-16 11:10:17,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:10:17,343 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 211 transitions. [2022-10-16 11:10:17,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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) [2022-10-16 11:10:17,344 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 211 transitions. [2022-10-16 11:10:17,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-10-16 11:10:17,344 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:10:17,344 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:10:17,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-10-16 11:10:17,345 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 11:10:17,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:10:17,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1696568215, now seen corresponding path program 1 times [2022-10-16 11:10:17,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:10:17,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488818398] [2022-10-16 11:10:17,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:10:17,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:10:17,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:10:17,446 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 11:10:17,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:10:17,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488818398] [2022-10-16 11:10:17,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488818398] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 11:10:17,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070528410] [2022-10-16 11:10:17,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:10:17,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:10:17,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:10:17,449 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 11:10:17,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-10-16 11:10:17,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:10:17,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 11:10:17,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:10:17,587 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 11:10:17,588 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 11:10:17,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070528410] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 11:10:17,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 11:10:17,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2022-10-16 11:10:17,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915523431] [2022-10-16 11:10:17,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 11:10:17,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 11:10:17,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:10:17,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 11:10:17,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-10-16 11:10:17,590 INFO L87 Difference]: Start difference. First operand 162 states and 211 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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) [2022-10-16 11:10:17,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:10:17,687 INFO L93 Difference]: Finished difference Result 243 states and 317 transitions. [2022-10-16 11:10:17,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 11:10:17,688 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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 34 [2022-10-16 11:10:17,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:10:17,689 INFO L225 Difference]: With dead ends: 243 [2022-10-16 11:10:17,689 INFO L226 Difference]: Without dead ends: 146 [2022-10-16 11:10:17,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-10-16 11:10:17,690 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 25 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 11:10:17,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 141 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 11:10:17,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-10-16 11:10:17,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2022-10-16 11:10:17,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 136 states have (on average 1.3161764705882353) internal successors, (179), 143 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 11:10:17,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 179 transitions. [2022-10-16 11:10:17,709 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 179 transitions. Word has length 34 [2022-10-16 11:10:17,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:10:17,709 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 179 transitions. [2022-10-16 11:10:17,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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) [2022-10-16 11:10:17,710 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 179 transitions. [2022-10-16 11:10:17,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-10-16 11:10:17,710 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:10:17,710 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:10:17,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-10-16 11:10:17,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:10:17,926 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 11:10:17,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:10:17,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1282515390, now seen corresponding path program 4 times [2022-10-16 11:10:17,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:10:17,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222823714] [2022-10-16 11:10:17,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:10:17,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:10:17,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:10:18,930 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:10:18,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:10:18,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222823714] [2022-10-16 11:10:18,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222823714] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 11:10:18,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695931304] [2022-10-16 11:10:18,931 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-10-16 11:10:18,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:10:18,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:10:18,933 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 11:10:18,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-10-16 11:10:19,087 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-10-16 11:10:19,088 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 11:10:19,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 35 conjunts are in the unsatisfiable core [2022-10-16 11:10:19,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:10:19,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2022-10-16 11:10:19,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2022-10-16 11:10:19,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-10-16 11:10:19,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:10:19,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-10-16 11:10:19,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 11:10:19,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:10:19,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-10-16 11:10:19,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-10-16 11:10:19,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:10:19,650 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 11:10:19,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2022-10-16 11:10:19,673 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-16 11:10:19,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 11:10:19,830 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_lis_~i~0#1_47| Int)) (or (forall ((v_ArrVal_742 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_47| 4)) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_742) |c_ULTIMATE.start_lis_~best~0#1.base|) |c_ULTIMATE.start_lis_~best~0#1.offset|) 2147483647)) (not (<= (+ |c_ULTIMATE.start_lis_#t~post4#1| 1) |v_ULTIMATE.start_lis_~i~0#1_47|)))) is different from false [2022-10-16 11:10:19,856 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_lis_~i~0#1_47| Int) (v_ArrVal_742 (Array Int Int))) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_47| 4)) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_742) |c_ULTIMATE.start_lis_~best~0#1.base|) |c_ULTIMATE.start_lis_~best~0#1.offset|) 2147483647) (< |v_ULTIMATE.start_lis_~i~0#1_47| (+ |c_ULTIMATE.start_lis_~i~0#1| 1)))) is different from false [2022-10-16 11:10:19,872 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_738 (Array Int Int)) (|v_ULTIMATE.start_lis_~i~0#1_47| Int) (v_ArrVal_736 Int) (v_ArrVal_742 (Array Int Int))) (or (< (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* 4 |c_ULTIMATE.start_lis_~i~0#1|) |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_736)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_738))) (store .cse0 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_47| 4)) 1))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_742) |c_ULTIMATE.start_lis_~best~0#1.base|) |c_ULTIMATE.start_lis_~best~0#1.offset|) 2147483647) (< |v_ULTIMATE.start_lis_~i~0#1_47| (+ |c_ULTIMATE.start_lis_~i~0#1| 1)))) is different from false [2022-10-16 11:10:19,901 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_lis_~i~0#1_48| Int)) (or (forall ((v_ArrVal_738 (Array Int Int)) (|v_ULTIMATE.start_lis_~i~0#1_47| Int) (v_ArrVal_736 Int) (v_ArrVal_742 (Array Int Int))) (or (< (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* |v_ULTIMATE.start_lis_~i~0#1_48| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_736)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_738))) (store .cse0 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_47| 4)) 1))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_742) |c_ULTIMATE.start_lis_~best~0#1.base|) |c_ULTIMATE.start_lis_~best~0#1.offset|) 2147483647) (< |v_ULTIMATE.start_lis_~i~0#1_47| (+ |v_ULTIMATE.start_lis_~i~0#1_48| 1)))) (not (<= (+ |c_ULTIMATE.start_lis_#t~post4#1| 1) |v_ULTIMATE.start_lis_~i~0#1_48|)))) is different from false [2022-10-16 11:10:19,946 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_lis_~i~0#1_48| Int) (v_ArrVal_738 (Array Int Int)) (|v_ULTIMATE.start_lis_~i~0#1_47| Int) (v_ArrVal_736 Int) (v_ArrVal_742 (Array Int Int))) (or (< |v_ULTIMATE.start_lis_~i~0#1_48| (+ |c_ULTIMATE.start_lis_~i~0#1| 1)) (< (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* |v_ULTIMATE.start_lis_~i~0#1_48| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_736)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_738))) (store .cse0 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_47| 4)) 1))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_742) |c_ULTIMATE.start_lis_~best~0#1.base|) |c_ULTIMATE.start_lis_~best~0#1.offset|) 2147483647) (< |v_ULTIMATE.start_lis_~i~0#1_47| (+ |v_ULTIMATE.start_lis_~i~0#1_48| 1)))) is different from false [2022-10-16 11:10:19,967 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 11:10:19,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 77 [2022-10-16 11:10:19,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 166 treesize of output 162 [2022-10-16 11:10:20,003 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 11:10:20,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 118 [2022-10-16 11:10:20,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 165 treesize of output 157 [2022-10-16 11:10:20,032 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 100 treesize of output 98 [2022-10-16 11:10:20,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 182 treesize of output 178 [2022-10-16 11:10:20,184 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 12 not checked. [2022-10-16 11:10:20,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695931304] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 11:10:20,184 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 11:10:20,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 10, 11] total 38 [2022-10-16 11:10:20,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210344063] [2022-10-16 11:10:20,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 11:10:20,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-10-16 11:10:20,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:10:20,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-10-16 11:10:20,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=990, Unknown=5, NotChecked=340, Total=1482 [2022-10-16 11:10:20,187 INFO L87 Difference]: Start difference. First operand 144 states and 179 transitions. Second operand has 39 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 39 states have internal predecessors, (80), 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) [2022-10-16 11:10:21,213 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|))) (and (not (= |c_ULTIMATE.start_lis_~best~0#1.base| |c_ULTIMATE.start_lis_~prev~0#1.base|)) (= 0 |c_ULTIMATE.start_lis_~best~0#1.offset|) (= |c_ULTIMATE.start_lis_~i~0#1| 0) (= (select .cse0 0) 1) (<= 2 |c_ULTIMATE.start_main_~i~1#1|) (<= (select .cse0 (+ (* 4 |c_ULTIMATE.start_lis_~i~0#1|) |c_ULTIMATE.start_lis_~best~0#1.offset|)) 1) (forall ((|v_ULTIMATE.start_lis_~i~0#1_48| Int) (v_ArrVal_738 (Array Int Int)) (|v_ULTIMATE.start_lis_~i~0#1_47| Int) (v_ArrVal_736 Int) (v_ArrVal_742 (Array Int Int))) (or (< |v_ULTIMATE.start_lis_~i~0#1_48| (+ |c_ULTIMATE.start_lis_~i~0#1| 1)) (< (select (select (store (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_lis_~i~0#1_48| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_736)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_738))) (store .cse1 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_47| 4)) 1))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_742) |c_ULTIMATE.start_lis_~best~0#1.base|) |c_ULTIMATE.start_lis_~best~0#1.offset|) 2147483647) (< |v_ULTIMATE.start_lis_~i~0#1_47| (+ |v_ULTIMATE.start_lis_~i~0#1_48| 1)))))) is different from false [2022-10-16 11:10:23,230 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|))) (and (not (= |c_ULTIMATE.start_lis_~best~0#1.base| |c_ULTIMATE.start_lis_~prev~0#1.base|)) (forall ((|v_ULTIMATE.start_lis_~i~0#1_48| Int)) (or (forall ((v_ArrVal_738 (Array Int Int)) (|v_ULTIMATE.start_lis_~i~0#1_47| Int) (v_ArrVal_736 Int) (v_ArrVal_742 (Array Int Int))) (or (< (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse1 (+ (* |v_ULTIMATE.start_lis_~i~0#1_48| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_736)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_738))) (store .cse0 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_47| 4)) 1))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_742) |c_ULTIMATE.start_lis_~best~0#1.base|) |c_ULTIMATE.start_lis_~best~0#1.offset|) 2147483647) (< |v_ULTIMATE.start_lis_~i~0#1_47| (+ |v_ULTIMATE.start_lis_~i~0#1_48| 1)))) (not (<= (+ |c_ULTIMATE.start_lis_#t~post4#1| 1) |v_ULTIMATE.start_lis_~i~0#1_48|)))) (= 0 |c_ULTIMATE.start_lis_~best~0#1.offset|) (<= (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1) (<= 0 |c_ULTIMATE.start_lis_#t~post4#1|) (or (<= (+ |c_ULTIMATE.start_lis_#t~post4#1| 2) |c_ULTIMATE.start_lis_~N#1|) (= (select .cse1 0) 1)))) is different from false [2022-10-16 11:10:23,909 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|))) (and (= (select .cse0 (+ (* 4 |c_ULTIMATE.start_lis_~i~0#1|) |c_ULTIMATE.start_lis_~best~0#1.offset|)) 1) (not (= |c_ULTIMATE.start_lis_~best~0#1.base| |c_ULTIMATE.start_lis_~prev~0#1.base|)) (<= 3 |c_ULTIMATE.start_main_~array_size~0#1|) (= 0 |c_ULTIMATE.start_lis_~best~0#1.offset|) (= |c_ULTIMATE.start_lis_~i~0#1| 0) (<= 3 |c_ULTIMATE.start_lis_~N#1|) (<= 2 |c_ULTIMATE.start_main_~i~1#1|) (forall ((|v_ULTIMATE.start_lis_~i~0#1_48| Int) (v_ArrVal_738 (Array Int Int)) (|v_ULTIMATE.start_lis_~i~0#1_47| Int) (v_ArrVal_736 Int) (v_ArrVal_742 (Array Int Int))) (or (< |v_ULTIMATE.start_lis_~i~0#1_48| (+ |c_ULTIMATE.start_lis_~i~0#1| 1)) (< (select (select (store (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_lis_~i~0#1_48| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_736)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_738))) (store .cse1 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_47| 4)) 1))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_742) |c_ULTIMATE.start_lis_~best~0#1.base|) |c_ULTIMATE.start_lis_~best~0#1.offset|) 2147483647) (< |v_ULTIMATE.start_lis_~i~0#1_47| (+ |v_ULTIMATE.start_lis_~i~0#1_48| 1)))))) is different from false [2022-10-16 11:10:24,554 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_lis_~i~0#1| 1)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|))) (and (not (= |c_ULTIMATE.start_lis_~best~0#1.base| |c_ULTIMATE.start_lis_~prev~0#1.base|)) (forall ((|v_ULTIMATE.start_lis_~i~0#1_47| Int) (v_ArrVal_742 (Array Int Int))) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_47| 4)) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_742) |c_ULTIMATE.start_lis_~best~0#1.base|) |c_ULTIMATE.start_lis_~best~0#1.offset|) 2147483647) (< |v_ULTIMATE.start_lis_~i~0#1_47| .cse1))) (= 0 |c_ULTIMATE.start_lis_~best~0#1.offset|) (or (= (select .cse0 0) 1) (<= .cse1 |c_ULTIMATE.start_lis_~N#1|)) (<= (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1) (<= 1 |c_ULTIMATE.start_lis_~i~0#1|))) is different from false [2022-10-16 11:10:26,560 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|))) (and (not (= |c_ULTIMATE.start_lis_~best~0#1.base| |c_ULTIMATE.start_lis_~prev~0#1.base|)) (forall ((|v_ULTIMATE.start_lis_~i~0#1_48| Int)) (or (forall ((v_ArrVal_738 (Array Int Int)) (|v_ULTIMATE.start_lis_~i~0#1_47| Int) (v_ArrVal_736 Int) (v_ArrVal_742 (Array Int Int))) (or (< (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse1 (+ (* |v_ULTIMATE.start_lis_~i~0#1_48| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_736)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_738))) (store .cse0 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_47| 4)) 1))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_742) |c_ULTIMATE.start_lis_~best~0#1.base|) |c_ULTIMATE.start_lis_~best~0#1.offset|) 2147483647) (< |v_ULTIMATE.start_lis_~i~0#1_47| (+ |v_ULTIMATE.start_lis_~i~0#1_48| 1)))) (not (<= (+ |c_ULTIMATE.start_lis_#t~post4#1| 1) |v_ULTIMATE.start_lis_~i~0#1_48|)))) (= 0 |c_ULTIMATE.start_lis_~best~0#1.offset|) (<= (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1) (<= 0 |c_ULTIMATE.start_lis_#t~post4#1|) (= (select .cse1 0) 1) (<= (+ (div (* (- 1) |c_ULTIMATE.start_lis_~best~0#1.offset|) 4) 3) |c_ULTIMATE.start_lis_~N#1|))) is different from false [2022-10-16 11:10:28,564 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|))) (and (not (= |c_ULTIMATE.start_lis_~best~0#1.base| |c_ULTIMATE.start_lis_~prev~0#1.base|)) (= 0 |c_ULTIMATE.start_lis_~best~0#1.offset|) (forall ((|v_ULTIMATE.start_lis_~i~0#1_47| Int)) (or (forall ((v_ArrVal_742 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_47| 4)) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_742) |c_ULTIMATE.start_lis_~best~0#1.base|) |c_ULTIMATE.start_lis_~best~0#1.offset|) 2147483647)) (not (<= (+ |c_ULTIMATE.start_lis_#t~post4#1| 1) |v_ULTIMATE.start_lis_~i~0#1_47|)))) (<= (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1) (<= 1 |c_ULTIMATE.start_lis_#t~post4#1|))) is different from false [2022-10-16 11:10:29,390 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|))) (and (not (= |c_ULTIMATE.start_lis_~best~0#1.base| |c_ULTIMATE.start_lis_~prev~0#1.base|)) (or (<= (+ 3 |c_ULTIMATE.start_lis_~i~0#1|) |c_ULTIMATE.start_lis_~N#1|) (and (= (select .cse0 0) 1) (<= (+ (div (* (- 1) |c_ULTIMATE.start_lis_~best~0#1.offset|) 4) 3) |c_ULTIMATE.start_lis_~N#1|))) (forall ((|v_ULTIMATE.start_lis_~i~0#1_47| Int) (v_ArrVal_742 (Array Int Int))) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_47| 4)) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_742) |c_ULTIMATE.start_lis_~best~0#1.base|) |c_ULTIMATE.start_lis_~best~0#1.offset|) 2147483647) (< |v_ULTIMATE.start_lis_~i~0#1_47| (+ |c_ULTIMATE.start_lis_~i~0#1| 1)))) (= 0 |c_ULTIMATE.start_lis_~best~0#1.offset|) (<= (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1) (<= 1 |c_ULTIMATE.start_lis_~i~0#1|))) is different from false [2022-10-16 11:10:31,409 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|))) (and (not (= |c_ULTIMATE.start_lis_~best~0#1.base| |c_ULTIMATE.start_lis_~prev~0#1.base|)) (= 0 |c_ULTIMATE.start_lis_~best~0#1.offset|) (forall ((|v_ULTIMATE.start_lis_~i~0#1_47| Int)) (or (forall ((v_ArrVal_742 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_47| 4)) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_742) |c_ULTIMATE.start_lis_~best~0#1.base|) |c_ULTIMATE.start_lis_~best~0#1.offset|) 2147483647)) (not (<= (+ |c_ULTIMATE.start_lis_#t~post4#1| 1) |v_ULTIMATE.start_lis_~i~0#1_47|)))) (<= (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1) (<= 1 |c_ULTIMATE.start_lis_#t~post4#1|) (or (and (= (select .cse0 0) 1) (<= (+ (div (* (- 1) |c_ULTIMATE.start_lis_~best~0#1.offset|) 4) 3) |c_ULTIMATE.start_lis_~N#1|)) (<= (+ |c_ULTIMATE.start_lis_#t~post4#1| 3) |c_ULTIMATE.start_lis_~N#1|)))) is different from false [2022-10-16 11:10:33,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:10:33,803 INFO L93 Difference]: Finished difference Result 364 states and 453 transitions. [2022-10-16 11:10:33,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-10-16 11:10:33,804 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 39 states have internal predecessors, (80), 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 36 [2022-10-16 11:10:33,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:10:33,807 INFO L225 Difference]: With dead ends: 364 [2022-10-16 11:10:33,807 INFO L226 Difference]: Without dead ends: 362 [2022-10-16 11:10:33,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 1098 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=553, Invalid=4178, Unknown=13, NotChecked=1898, Total=6642 [2022-10-16 11:10:33,811 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 272 mSDsluCounter, 1295 mSDsCounter, 0 mSdLazyCounter, 1160 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 1371 SdHoareTripleChecker+Invalid, 2161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 961 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-10-16 11:10:33,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 1371 Invalid, 2161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1160 Invalid, 0 Unknown, 961 Unchecked, 0.8s Time] [2022-10-16 11:10:33,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-10-16 11:10:33,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 179. [2022-10-16 11:10:33,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 171 states have (on average 1.345029239766082) internal successors, (230), 178 states have internal predecessors, (230), 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) [2022-10-16 11:10:33,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 230 transitions. [2022-10-16 11:10:33,838 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 230 transitions. Word has length 36 [2022-10-16 11:10:33,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:10:33,838 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 230 transitions. [2022-10-16 11:10:33,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 39 states have internal predecessors, (80), 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) [2022-10-16 11:10:33,839 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 230 transitions. [2022-10-16 11:10:33,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-10-16 11:10:33,839 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:10:33,839 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:10:33,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-10-16 11:10:34,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-10-16 11:10:34,055 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 11:10:34,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:10:34,056 INFO L85 PathProgramCache]: Analyzing trace with hash -223866211, now seen corresponding path program 1 times [2022-10-16 11:10:34,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:10:34,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932772100] [2022-10-16 11:10:34,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:10:34,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:10:34,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:10:34,235 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-10-16 11:10:34,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:10:34,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932772100] [2022-10-16 11:10:34,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932772100] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 11:10:34,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41214299] [2022-10-16 11:10:34,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:10:34,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:10:34,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:10:34,237 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 11:10:34,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-10-16 11:10:34,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:10:34,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 12 conjunts are in the unsatisfiable core [2022-10-16 11:10:34,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:10:34,466 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-10-16 11:10:34,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 11:10:34,565 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-10-16 11:10:34,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41214299] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 11:10:34,566 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 11:10:34,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 19 [2022-10-16 11:10:34,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038777086] [2022-10-16 11:10:34,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 11:10:34,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-10-16 11:10:34,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:10:34,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-10-16 11:10:34,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2022-10-16 11:10:34,569 INFO L87 Difference]: Start difference. First operand 179 states and 230 transitions. Second operand has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 19 states have internal predecessors, (65), 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) [2022-10-16 11:10:34,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:10:34,838 INFO L93 Difference]: Finished difference Result 311 states and 406 transitions. [2022-10-16 11:10:34,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-16 11:10:34,839 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 19 states have internal predecessors, (65), 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 39 [2022-10-16 11:10:34,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:10:34,841 INFO L225 Difference]: With dead ends: 311 [2022-10-16 11:10:34,841 INFO L226 Difference]: Without dead ends: 218 [2022-10-16 11:10:34,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 63 SyntacticMatches, 8 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=573, Unknown=0, NotChecked=0, Total=702 [2022-10-16 11:10:34,842 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 118 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 11:10:34,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 402 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 11:10:34,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-10-16 11:10:34,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 190. [2022-10-16 11:10:34,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 182 states have (on average 1.3241758241758241) internal successors, (241), 189 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 11:10:34,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 241 transitions. [2022-10-16 11:10:34,869 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 241 transitions. Word has length 39 [2022-10-16 11:10:34,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:10:34,869 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 241 transitions. [2022-10-16 11:10:34,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 19 states have internal predecessors, (65), 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) [2022-10-16 11:10:34,870 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 241 transitions. [2022-10-16 11:10:34,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-10-16 11:10:34,870 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:10:34,870 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:10:34,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-10-16 11:10:35,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-10-16 11:10:35,085 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 11:10:35,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:10:35,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1714322016, now seen corresponding path program 1 times [2022-10-16 11:10:35,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:10:35,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290039989] [2022-10-16 11:10:35,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:10:35,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:10:35,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:10:35,432 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 19 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:10:35,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:10:35,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290039989] [2022-10-16 11:10:35,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290039989] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 11:10:35,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442012090] [2022-10-16 11:10:35,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:10:35,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:10:35,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:10:35,436 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 11:10:35,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-10-16 11:10:35,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:10:35,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 18 conjunts are in the unsatisfiable core [2022-10-16 11:10:35,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:10:35,896 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 28 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:10:35,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 11:10:36,138 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 28 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:10:36,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442012090] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 11:10:36,141 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 11:10:36,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 28 [2022-10-16 11:10:36,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356544815] [2022-10-16 11:10:36,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 11:10:36,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-10-16 11:10:36,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:10:36,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-10-16 11:10:36,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2022-10-16 11:10:36,146 INFO L87 Difference]: Start difference. First operand 190 states and 241 transitions. Second operand has 28 states, 28 states have (on average 2.3214285714285716) internal successors, (65), 28 states have internal predecessors, (65), 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) [2022-10-16 11:10:36,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:10:36,945 INFO L93 Difference]: Finished difference Result 409 states and 523 transitions. [2022-10-16 11:10:36,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-10-16 11:10:36,946 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.3214285714285716) internal successors, (65), 28 states have internal predecessors, (65), 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 41 [2022-10-16 11:10:36,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:10:36,948 INFO L225 Difference]: With dead ends: 409 [2022-10-16 11:10:36,949 INFO L226 Difference]: Without dead ends: 317 [2022-10-16 11:10:36,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 58 SyntacticMatches, 13 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 715 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=365, Invalid=1987, Unknown=0, NotChecked=0, Total=2352 [2022-10-16 11:10:36,951 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 259 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 11:10:36,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 545 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 11:10:36,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-10-16 11:10:36,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 208. [2022-10-16 11:10:36,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 200 states have (on average 1.305) internal successors, (261), 207 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 11:10:36,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 261 transitions. [2022-10-16 11:10:36,996 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 261 transitions. Word has length 41 [2022-10-16 11:10:36,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:10:36,996 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 261 transitions. [2022-10-16 11:10:36,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.3214285714285716) internal successors, (65), 28 states have internal predecessors, (65), 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) [2022-10-16 11:10:36,997 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 261 transitions. [2022-10-16 11:10:36,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-10-16 11:10:36,997 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:10:36,997 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:10:37,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-10-16 11:10:37,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-10-16 11:10:37,210 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 11:10:37,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:10:37,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1814097319, now seen corresponding path program 2 times [2022-10-16 11:10:37,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:10:37,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605424236] [2022-10-16 11:10:37,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:10:37,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:10:37,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:10:37,467 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 11:10:37,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:10:37,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605424236] [2022-10-16 11:10:37,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605424236] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 11:10:37,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731265325] [2022-10-16 11:10:37,468 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 11:10:37,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:10:37,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:10:37,470 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 11:10:37,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-10-16 11:10:37,565 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-16 11:10:37,565 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 11:10:37,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjunts are in the unsatisfiable core [2022-10-16 11:10:37,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:10:37,659 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-10-16 11:10:37,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 11:10:37,758 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-10-16 11:10:37,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731265325] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 11:10:37,759 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 11:10:37,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5, 5] total 17 [2022-10-16 11:10:37,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194720199] [2022-10-16 11:10:37,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 11:10:37,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-10-16 11:10:37,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:10:37,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-10-16 11:10:37,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2022-10-16 11:10:37,762 INFO L87 Difference]: Start difference. First operand 208 states and 261 transitions. Second operand has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 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) [2022-10-16 11:10:38,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:10:38,429 INFO L93 Difference]: Finished difference Result 312 states and 396 transitions. [2022-10-16 11:10:38,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-10-16 11:10:38,429 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 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 43 [2022-10-16 11:10:38,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:10:38,431 INFO L225 Difference]: With dead ends: 312 [2022-10-16 11:10:38,431 INFO L226 Difference]: Without dead ends: 224 [2022-10-16 11:10:38,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 79 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=274, Invalid=986, Unknown=0, NotChecked=0, Total=1260 [2022-10-16 11:10:38,433 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 224 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 11:10:38,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 333 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 11:10:38,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-10-16 11:10:38,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 207. [2022-10-16 11:10:38,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 200 states have (on average 1.28) internal successors, (256), 206 states have internal predecessors, (256), 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) [2022-10-16 11:10:38,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 256 transitions. [2022-10-16 11:10:38,470 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 256 transitions. Word has length 43 [2022-10-16 11:10:38,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:10:38,470 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 256 transitions. [2022-10-16 11:10:38,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 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) [2022-10-16 11:10:38,471 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 256 transitions. [2022-10-16 11:10:38,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-10-16 11:10:38,471 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:10:38,472 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:10:38,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-10-16 11:10:38,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-10-16 11:10:38,686 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 11:10:38,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:10:38,686 INFO L85 PathProgramCache]: Analyzing trace with hash -918059428, now seen corresponding path program 2 times [2022-10-16 11:10:38,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:10:38,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921412808] [2022-10-16 11:10:38,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:10:38,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:10:38,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:10:40,230 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 6 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 11:10:40,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:10:40,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921412808] [2022-10-16 11:10:40,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921412808] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 11:10:40,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247616861] [2022-10-16 11:10:40,231 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 11:10:40,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:10:40,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:10:40,232 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 11:10:40,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-10-16 11:10:40,343 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 11:10:40,343 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 11:10:40,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 37 conjunts are in the unsatisfiable core [2022-10-16 11:10:40,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:10:40,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2022-10-16 11:10:40,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2022-10-16 11:10:40,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-10-16 11:10:40,496 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-10-16 11:10:40,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2022-10-16 11:10:40,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 11:10:40,603 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-10-16 11:10:40,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2022-10-16 11:10:40,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-10-16 11:10:40,855 INFO L356 Elim1Store]: treesize reduction 58, result has 24.7 percent of original size [2022-10-16 11:10:40,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 42 [2022-10-16 11:10:40,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2022-10-16 11:10:41,220 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-10-16 11:10:41,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 13 [2022-10-16 11:10:41,249 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-10-16 11:10:41,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 11:10:41,450 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_lis_~i~0#1_69| Int)) (or (forall ((v_ArrVal_1003 (Array Int Int))) (< 0 (+ 2147483650 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* |v_ULTIMATE.start_lis_~i~0#1_69| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_lis_~best~0#1.base|) |c_ULTIMATE.start_lis_~best~0#1.offset|)))) (not (<= (+ |c_ULTIMATE.start_lis_#t~post4#1| 1) |v_ULTIMATE.start_lis_~i~0#1_69|)))) is different from false [2022-10-16 11:10:41,470 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_lis_~i~0#1_69| Int) (v_ArrVal_1003 (Array Int Int))) (or (< 0 (+ 2147483650 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* |v_ULTIMATE.start_lis_~i~0#1_69| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_lis_~best~0#1.base|) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (< |v_ULTIMATE.start_lis_~i~0#1_69| (+ |c_ULTIMATE.start_lis_~i~0#1| 1)))) is different from false [2022-10-16 11:10:43,610 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_lis_~i~0#1_70| Int)) (or (not (<= (+ |c_ULTIMATE.start_lis_#t~post4#1| 1) |v_ULTIMATE.start_lis_~i~0#1_70|)) (forall ((|v_ULTIMATE.start_lis_~i~0#1_69| Int) (v_ArrVal_1003 (Array Int Int)) (v_ArrVal_1001 (Array Int Int))) (or (< 0 (+ (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* |v_ULTIMATE.start_lis_~i~0#1_70| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1001))) (store .cse0 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* |v_ULTIMATE.start_lis_~i~0#1_69| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_lis_~best~0#1.base|) |c_ULTIMATE.start_lis_~best~0#1.offset|) 2147483650)) (< |v_ULTIMATE.start_lis_~i~0#1_69| (+ |v_ULTIMATE.start_lis_~i~0#1_70| 1)))))) is different from false [2022-10-16 11:10:43,652 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_lis_~i~0#1_69| Int) (v_ArrVal_1003 (Array Int Int)) (|v_ULTIMATE.start_lis_~i~0#1_70| Int) (v_ArrVal_1001 (Array Int Int))) (or (< |v_ULTIMATE.start_lis_~i~0#1_70| (+ |c_ULTIMATE.start_lis_~i~0#1| 1)) (< 0 (+ (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* |v_ULTIMATE.start_lis_~i~0#1_70| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1001))) (store .cse0 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* |v_ULTIMATE.start_lis_~i~0#1_69| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_lis_~best~0#1.base|) |c_ULTIMATE.start_lis_~best~0#1.offset|) 2147483650)) (< |v_ULTIMATE.start_lis_~i~0#1_69| (+ |v_ULTIMATE.start_lis_~i~0#1_70| 1)))) is different from false [2022-10-16 11:10:43,677 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_995 Int) (v_ArrVal_997 (Array Int Int)) (|v_ULTIMATE.start_lis_~i~0#1_69| Int) (v_ArrVal_1003 (Array Int Int)) (|v_ULTIMATE.start_lis_~i~0#1_70| Int) (v_ArrVal_1001 (Array Int Int))) (or (< |v_ULTIMATE.start_lis_~i~0#1_70| (+ |c_ULTIMATE.start_lis_~i~0#1| 1)) (< 0 (+ (select (select (store (let ((.cse0 (store (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* 4 |c_ULTIMATE.start_lis_~i~0#1|) |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_995)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_997))) (store .cse1 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* |v_ULTIMATE.start_lis_~i~0#1_70| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1001))) (store .cse0 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* |v_ULTIMATE.start_lis_~i~0#1_69| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_lis_~best~0#1.base|) |c_ULTIMATE.start_lis_~best~0#1.offset|) 2147483650)) (< |v_ULTIMATE.start_lis_~i~0#1_69| (+ |v_ULTIMATE.start_lis_~i~0#1_70| 1)))) is different from false [2022-10-16 11:10:43,718 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_lis_~i~0#1_71| Int)) (or (forall ((v_ArrVal_995 Int) (v_ArrVal_997 (Array Int Int)) (|v_ULTIMATE.start_lis_~i~0#1_69| Int) (v_ArrVal_1003 (Array Int Int)) (|v_ULTIMATE.start_lis_~i~0#1_70| Int) (v_ArrVal_1001 (Array Int Int))) (or (< |v_ULTIMATE.start_lis_~i~0#1_70| (+ |v_ULTIMATE.start_lis_~i~0#1_71| 1)) (< |v_ULTIMATE.start_lis_~i~0#1_69| (+ |v_ULTIMATE.start_lis_~i~0#1_70| 1)) (< 0 (+ 2147483650 (select (select (store (let ((.cse0 (store (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* |v_ULTIMATE.start_lis_~i~0#1_71| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_995)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_997))) (store .cse1 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* |v_ULTIMATE.start_lis_~i~0#1_70| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1001))) (store .cse0 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* |v_ULTIMATE.start_lis_~i~0#1_69| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_lis_~best~0#1.base|) |c_ULTIMATE.start_lis_~best~0#1.offset|))))) (not (<= (+ |c_ULTIMATE.start_lis_#t~post4#1| 1) |v_ULTIMATE.start_lis_~i~0#1_71|)))) is different from false [2022-10-16 11:10:43,780 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_995 Int) (v_ArrVal_997 (Array Int Int)) (|v_ULTIMATE.start_lis_~i~0#1_69| Int) (v_ArrVal_1003 (Array Int Int)) (|v_ULTIMATE.start_lis_~i~0#1_70| Int) (v_ArrVal_1001 (Array Int Int)) (|v_ULTIMATE.start_lis_~i~0#1_71| Int)) (or (< |v_ULTIMATE.start_lis_~i~0#1_71| (+ |c_ULTIMATE.start_lis_~i~0#1| 1)) (< |v_ULTIMATE.start_lis_~i~0#1_70| (+ |v_ULTIMATE.start_lis_~i~0#1_71| 1)) (< |v_ULTIMATE.start_lis_~i~0#1_69| (+ |v_ULTIMATE.start_lis_~i~0#1_70| 1)) (< 0 (+ 2147483650 (select (select (store (let ((.cse0 (store (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* |v_ULTIMATE.start_lis_~i~0#1_71| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_995)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_997))) (store .cse1 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* |v_ULTIMATE.start_lis_~i~0#1_70| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1001))) (store .cse0 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* |v_ULTIMATE.start_lis_~i~0#1_69| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_lis_~best~0#1.base|) |c_ULTIMATE.start_lis_~best~0#1.offset|))))) is different from false [2022-10-16 11:10:43,808 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 11:10:43,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 234 treesize of output 151 [2022-10-16 11:10:43,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 374 treesize of output 370 [2022-10-16 11:10:43,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 308 treesize of output 304 [2022-10-16 11:10:43,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 373 treesize of output 357 [2022-10-16 11:10:43,908 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 11:10:43,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 312 treesize of output 312 [2022-10-16 11:10:43,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 394 treesize of output 386 [2022-10-16 11:10:43,996 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 382 treesize of output 378 [2022-10-16 11:10:44,165 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 28 trivial. 22 not checked. [2022-10-16 11:10:44,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247616861] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 11:10:44,166 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 11:10:44,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13, 14] total 47 [2022-10-16 11:10:44,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412590319] [2022-10-16 11:10:44,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 11:10:44,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-10-16 11:10:44,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:10:44,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-10-16 11:10:44,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1459, Unknown=10, NotChecked=588, Total=2256 [2022-10-16 11:10:44,169 INFO L87 Difference]: Start difference. First operand 207 states and 256 transitions. Second operand has 48 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 48 states have internal predecessors, (98), 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) [2022-10-16 11:10:45,279 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_lis_~i~0#1| 1)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|))) (and (not (= |c_ULTIMATE.start_lis_~best~0#1.base| |c_ULTIMATE.start_lis_~prev~0#1.base|)) (= |c_ULTIMATE.start_lis_~i~0#1| 0) (forall ((|v_ULTIMATE.start_lis_~i~0#1_69| Int) (v_ArrVal_1003 (Array Int Int))) (or (< 0 (+ 2147483650 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_lis_~i~0#1_69| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_lis_~best~0#1.base|) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (< |v_ULTIMATE.start_lis_~i~0#1_69| .cse1))) (<= 2 |c_ULTIMATE.start_main_~i~1#1|) (<= 1 (select .cse0 (+ (* 4 |c_ULTIMATE.start_lis_~i~0#1|) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (forall ((v_ArrVal_995 Int) (v_ArrVal_997 (Array Int Int)) (|v_ULTIMATE.start_lis_~i~0#1_69| Int) (v_ArrVal_1003 (Array Int Int)) (|v_ULTIMATE.start_lis_~i~0#1_70| Int) (v_ArrVal_1001 (Array Int Int)) (|v_ULTIMATE.start_lis_~i~0#1_71| Int)) (or (< |v_ULTIMATE.start_lis_~i~0#1_71| .cse1) (< |v_ULTIMATE.start_lis_~i~0#1_70| (+ |v_ULTIMATE.start_lis_~i~0#1_71| 1)) (< |v_ULTIMATE.start_lis_~i~0#1_69| (+ |v_ULTIMATE.start_lis_~i~0#1_70| 1)) (< 0 (+ 2147483650 (select (select (store (let ((.cse2 (store (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_lis_~i~0#1_71| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_995)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_997))) (store .cse3 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse3 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* |v_ULTIMATE.start_lis_~i~0#1_70| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1001))) (store .cse2 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse2 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* |v_ULTIMATE.start_lis_~i~0#1_69| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_lis_~best~0#1.base|) |c_ULTIMATE.start_lis_~best~0#1.offset|))))))) is different from false [2022-10-16 11:10:47,293 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_lis_#t~post4#1| 1))) (and (not (= |c_ULTIMATE.start_lis_~best~0#1.base| |c_ULTIMATE.start_lis_~prev~0#1.base|)) (forall ((|v_ULTIMATE.start_lis_~i~0#1_69| Int)) (or (forall ((v_ArrVal_1003 (Array Int Int))) (< 0 (+ 2147483650 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_lis_~i~0#1_69| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_lis_~best~0#1.base|) |c_ULTIMATE.start_lis_~best~0#1.offset|)))) (not (<= .cse1 |v_ULTIMATE.start_lis_~i~0#1_69|)))) (<= 1 (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (<= 0 |c_ULTIMATE.start_lis_#t~post4#1|) (forall ((|v_ULTIMATE.start_lis_~i~0#1_71| Int)) (or (forall ((v_ArrVal_995 Int) (v_ArrVal_997 (Array Int Int)) (|v_ULTIMATE.start_lis_~i~0#1_69| Int) (v_ArrVal_1003 (Array Int Int)) (|v_ULTIMATE.start_lis_~i~0#1_70| Int) (v_ArrVal_1001 (Array Int Int))) (or (< |v_ULTIMATE.start_lis_~i~0#1_70| (+ |v_ULTIMATE.start_lis_~i~0#1_71| 1)) (< |v_ULTIMATE.start_lis_~i~0#1_69| (+ |v_ULTIMATE.start_lis_~i~0#1_70| 1)) (< 0 (+ 2147483650 (select (select (store (let ((.cse2 (store (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_lis_~i~0#1_71| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_995)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_997))) (store .cse3 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse3 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* |v_ULTIMATE.start_lis_~i~0#1_70| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1001))) (store .cse2 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse2 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* |v_ULTIMATE.start_lis_~i~0#1_69| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_lis_~best~0#1.base|) |c_ULTIMATE.start_lis_~best~0#1.offset|))))) (not (<= .cse1 |v_ULTIMATE.start_lis_~i~0#1_71|)))))) is different from false [2022-10-16 11:10:48,400 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_lis_~i~0#1| 1)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|))) (and (not (= |c_ULTIMATE.start_lis_~best~0#1.base| |c_ULTIMATE.start_lis_~prev~0#1.base|)) (<= 3 |c_ULTIMATE.start_main_~i~1#1|) (= |c_ULTIMATE.start_lis_~i~0#1| 0) (forall ((|v_ULTIMATE.start_lis_~i~0#1_69| Int) (v_ArrVal_1003 (Array Int Int))) (or (< 0 (+ 2147483650 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_lis_~i~0#1_69| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_lis_~best~0#1.base|) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (< |v_ULTIMATE.start_lis_~i~0#1_69| .cse1))) (<= 1 (select .cse0 (+ (* 4 |c_ULTIMATE.start_lis_~i~0#1|) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (forall ((v_ArrVal_995 Int) (v_ArrVal_997 (Array Int Int)) (|v_ULTIMATE.start_lis_~i~0#1_69| Int) (v_ArrVal_1003 (Array Int Int)) (|v_ULTIMATE.start_lis_~i~0#1_70| Int) (v_ArrVal_1001 (Array Int Int)) (|v_ULTIMATE.start_lis_~i~0#1_71| Int)) (or (< |v_ULTIMATE.start_lis_~i~0#1_71| .cse1) (< |v_ULTIMATE.start_lis_~i~0#1_70| (+ |v_ULTIMATE.start_lis_~i~0#1_71| 1)) (< |v_ULTIMATE.start_lis_~i~0#1_69| (+ |v_ULTIMATE.start_lis_~i~0#1_70| 1)) (< 0 (+ 2147483650 (select (select (store (let ((.cse2 (store (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_lis_~i~0#1_71| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_995)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_997))) (store .cse3 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse3 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* |v_ULTIMATE.start_lis_~i~0#1_70| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1001))) (store .cse2 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse2 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* |v_ULTIMATE.start_lis_~i~0#1_69| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_lis_~best~0#1.base|) |c_ULTIMATE.start_lis_~best~0#1.offset|))))))) is different from false [2022-10-16 11:10:50,418 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_lis_~i~0#1| 1)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|))) (and (not (= |c_ULTIMATE.start_lis_~best~0#1.base| |c_ULTIMATE.start_lis_~prev~0#1.base|)) (forall ((|v_ULTIMATE.start_lis_~i~0#1_69| Int) (v_ArrVal_1003 (Array Int Int)) (|v_ULTIMATE.start_lis_~i~0#1_70| Int) (v_ArrVal_1001 (Array Int Int))) (or (< |v_ULTIMATE.start_lis_~i~0#1_70| .cse0) (< 0 (+ (select (select (store (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse2 (+ (* |v_ULTIMATE.start_lis_~i~0#1_70| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1001))) (store .cse1 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* |v_ULTIMATE.start_lis_~i~0#1_69| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_lis_~best~0#1.base|) |c_ULTIMATE.start_lis_~best~0#1.offset|) 2147483650)) (< |v_ULTIMATE.start_lis_~i~0#1_69| (+ |v_ULTIMATE.start_lis_~i~0#1_70| 1)))) (forall ((|v_ULTIMATE.start_lis_~i~0#1_69| Int) (v_ArrVal_1003 (Array Int Int))) (or (< 0 (+ 2147483650 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse2 (+ (* |v_ULTIMATE.start_lis_~i~0#1_69| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_lis_~best~0#1.base|) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (< |v_ULTIMATE.start_lis_~i~0#1_69| .cse0))) (<= 1 (select .cse2 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (<= 1 |c_ULTIMATE.start_lis_~i~0#1|))) is different from false [2022-10-16 11:10:52,431 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_lis_#t~post4#1| 1)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|))) (and (not (= |c_ULTIMATE.start_lis_~best~0#1.base| |c_ULTIMATE.start_lis_~prev~0#1.base|)) (forall ((|v_ULTIMATE.start_lis_~i~0#1_69| Int)) (or (forall ((v_ArrVal_1003 (Array Int Int))) (< 0 (+ 2147483650 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_lis_~i~0#1_69| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_lis_~best~0#1.base|) |c_ULTIMATE.start_lis_~best~0#1.offset|)))) (not (<= .cse1 |v_ULTIMATE.start_lis_~i~0#1_69|)))) (<= 1 (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (<= 1 |c_ULTIMATE.start_lis_#t~post4#1|) (forall ((|v_ULTIMATE.start_lis_~i~0#1_70| Int)) (or (not (<= .cse1 |v_ULTIMATE.start_lis_~i~0#1_70|)) (forall ((|v_ULTIMATE.start_lis_~i~0#1_69| Int) (v_ArrVal_1003 (Array Int Int)) (v_ArrVal_1001 (Array Int Int))) (or (< 0 (+ (select (select (store (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_lis_~i~0#1_70| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1001))) (store .cse2 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse2 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* |v_ULTIMATE.start_lis_~i~0#1_69| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_lis_~best~0#1.base|) |c_ULTIMATE.start_lis_~best~0#1.offset|) 2147483650)) (< |v_ULTIMATE.start_lis_~i~0#1_69| (+ |v_ULTIMATE.start_lis_~i~0#1_70| 1)))))))) is different from false [2022-10-16 11:10:53,353 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_lis_~i~0#1| 1)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|))) (and (= (select .cse0 (+ (* 4 |c_ULTIMATE.start_lis_~i~0#1|) |c_ULTIMATE.start_lis_~best~0#1.offset|)) 1) (not (= |c_ULTIMATE.start_lis_~best~0#1.base| |c_ULTIMATE.start_lis_~prev~0#1.base|)) (<= 4 |c_ULTIMATE.start_main_~array_size~0#1|) (<= 3 |c_ULTIMATE.start_main_~i~1#1|) (= 0 |c_ULTIMATE.start_lis_~best~0#1.offset|) (= |c_ULTIMATE.start_lis_~i~0#1| 0) (forall ((|v_ULTIMATE.start_lis_~i~0#1_69| Int) (v_ArrVal_1003 (Array Int Int))) (or (< 0 (+ 2147483650 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_lis_~i~0#1_69| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_lis_~best~0#1.base|) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (< |v_ULTIMATE.start_lis_~i~0#1_69| .cse1))) (<= 4 |c_ULTIMATE.start_lis_~N#1|) (forall ((v_ArrVal_995 Int) (v_ArrVal_997 (Array Int Int)) (|v_ULTIMATE.start_lis_~i~0#1_69| Int) (v_ArrVal_1003 (Array Int Int)) (|v_ULTIMATE.start_lis_~i~0#1_70| Int) (v_ArrVal_1001 (Array Int Int)) (|v_ULTIMATE.start_lis_~i~0#1_71| Int)) (or (< |v_ULTIMATE.start_lis_~i~0#1_71| .cse1) (< |v_ULTIMATE.start_lis_~i~0#1_70| (+ |v_ULTIMATE.start_lis_~i~0#1_71| 1)) (< |v_ULTIMATE.start_lis_~i~0#1_69| (+ |v_ULTIMATE.start_lis_~i~0#1_70| 1)) (< 0 (+ 2147483650 (select (select (store (let ((.cse2 (store (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_lis_~i~0#1_71| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_995)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_997))) (store .cse3 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse3 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* |v_ULTIMATE.start_lis_~i~0#1_70| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1001))) (store .cse2 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse2 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* |v_ULTIMATE.start_lis_~i~0#1_69| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_lis_~best~0#1.base|) |c_ULTIMATE.start_lis_~best~0#1.offset|))))))) is different from false [2022-10-16 11:10:55,377 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_lis_#t~post4#1| 1))) (and (not (= |c_ULTIMATE.start_lis_~best~0#1.base| |c_ULTIMATE.start_lis_~prev~0#1.base|)) (<= (+ (div (* (- 1) |c_ULTIMATE.start_lis_~best~0#1.offset|) 4) 4) |c_ULTIMATE.start_lis_~N#1|) (= 0 |c_ULTIMATE.start_lis_~best~0#1.offset|) (forall ((|v_ULTIMATE.start_lis_~i~0#1_69| Int)) (or (forall ((v_ArrVal_1003 (Array Int Int))) (< 0 (+ 2147483650 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_lis_~i~0#1_69| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_lis_~best~0#1.base|) |c_ULTIMATE.start_lis_~best~0#1.offset|)))) (not (<= .cse1 |v_ULTIMATE.start_lis_~i~0#1_69|)))) (<= 1 (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (<= 0 |c_ULTIMATE.start_lis_#t~post4#1|) (= (select .cse0 0) 1) (forall ((|v_ULTIMATE.start_lis_~i~0#1_71| Int)) (or (forall ((v_ArrVal_995 Int) (v_ArrVal_997 (Array Int Int)) (|v_ULTIMATE.start_lis_~i~0#1_69| Int) (v_ArrVal_1003 (Array Int Int)) (|v_ULTIMATE.start_lis_~i~0#1_70| Int) (v_ArrVal_1001 (Array Int Int))) (or (< |v_ULTIMATE.start_lis_~i~0#1_70| (+ |v_ULTIMATE.start_lis_~i~0#1_71| 1)) (< |v_ULTIMATE.start_lis_~i~0#1_69| (+ |v_ULTIMATE.start_lis_~i~0#1_70| 1)) (< 0 (+ 2147483650 (select (select (store (let ((.cse2 (store (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_lis_~i~0#1_71| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_995)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_997))) (store .cse3 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse3 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* |v_ULTIMATE.start_lis_~i~0#1_70| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1001))) (store .cse2 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse2 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* |v_ULTIMATE.start_lis_~i~0#1_69| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_lis_~best~0#1.base|) |c_ULTIMATE.start_lis_~best~0#1.offset|))))) (not (<= .cse1 |v_ULTIMATE.start_lis_~i~0#1_71|)))))) is different from false [2022-10-16 11:10:56,761 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_lis_~i~0#1| 1)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|))) (and (not (= |c_ULTIMATE.start_lis_~best~0#1.base| |c_ULTIMATE.start_lis_~prev~0#1.base|)) (forall ((|v_ULTIMATE.start_lis_~i~0#1_69| Int) (v_ArrVal_1003 (Array Int Int)) (|v_ULTIMATE.start_lis_~i~0#1_70| Int) (v_ArrVal_1001 (Array Int Int))) (or (< |v_ULTIMATE.start_lis_~i~0#1_70| .cse0) (< 0 (+ (select (select (store (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse2 (+ (* |v_ULTIMATE.start_lis_~i~0#1_70| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1001))) (store .cse1 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* |v_ULTIMATE.start_lis_~i~0#1_69| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_lis_~best~0#1.base|) |c_ULTIMATE.start_lis_~best~0#1.offset|) 2147483650)) (< |v_ULTIMATE.start_lis_~i~0#1_69| (+ |v_ULTIMATE.start_lis_~i~0#1_70| 1)))) (= 0 |c_ULTIMATE.start_lis_~best~0#1.offset|) (forall ((|v_ULTIMATE.start_lis_~i~0#1_69| Int) (v_ArrVal_1003 (Array Int Int))) (or (< 0 (+ 2147483650 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse2 (+ (* |v_ULTIMATE.start_lis_~i~0#1_69| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_lis_~best~0#1.base|) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (< |v_ULTIMATE.start_lis_~i~0#1_69| .cse0))) (or (<= (+ 4 |c_ULTIMATE.start_lis_~i~0#1|) |c_ULTIMATE.start_lis_~N#1|) (and (<= (+ (div (* (- 1) |c_ULTIMATE.start_lis_~best~0#1.offset|) 4) 4) |c_ULTIMATE.start_lis_~N#1|) (= (select .cse2 0) 1))) (<= 1 (select .cse2 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (<= 1 |c_ULTIMATE.start_lis_~i~0#1|))) is different from false [2022-10-16 11:10:57,469 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|))) (and (= (select .cse0 (+ (* 4 |c_ULTIMATE.start_lis_~i~0#1|) |c_ULTIMATE.start_lis_~best~0#1.offset|)) 1) (not (= |c_ULTIMATE.start_lis_~best~0#1.base| |c_ULTIMATE.start_lis_~prev~0#1.base|)) (forall ((|v_ULTIMATE.start_lis_~i~0#1_69| Int) (v_ArrVal_1003 (Array Int Int))) (or (< 0 (+ 2147483650 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_lis_~i~0#1_69| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_lis_~best~0#1.base|) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (< |v_ULTIMATE.start_lis_~i~0#1_69| (+ |c_ULTIMATE.start_lis_~i~0#1| 1)))) (<= 1 (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (<= 2 |c_ULTIMATE.start_lis_~i~0#1|))) is different from false [2022-10-16 11:10:59,507 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_lis_#t~post4#1| 1)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|))) (and (not (= |c_ULTIMATE.start_lis_~best~0#1.base| |c_ULTIMATE.start_lis_~prev~0#1.base|)) (= 0 |c_ULTIMATE.start_lis_~best~0#1.offset|) (forall ((|v_ULTIMATE.start_lis_~i~0#1_69| Int)) (or (forall ((v_ArrVal_1003 (Array Int Int))) (< 0 (+ 2147483650 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_lis_~i~0#1_69| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_lis_~best~0#1.base|) |c_ULTIMATE.start_lis_~best~0#1.offset|)))) (not (<= .cse1 |v_ULTIMATE.start_lis_~i~0#1_69|)))) (<= 1 (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (<= 1 |c_ULTIMATE.start_lis_#t~post4#1|) (or (and (<= (+ (div (* (- 1) |c_ULTIMATE.start_lis_~best~0#1.offset|) 4) 4) |c_ULTIMATE.start_lis_~N#1|) (= (select .cse0 0) 1)) (<= (+ |c_ULTIMATE.start_lis_#t~post4#1| 4) |c_ULTIMATE.start_lis_~N#1|)) (forall ((|v_ULTIMATE.start_lis_~i~0#1_70| Int)) (or (not (<= .cse1 |v_ULTIMATE.start_lis_~i~0#1_70|)) (forall ((|v_ULTIMATE.start_lis_~i~0#1_69| Int) (v_ArrVal_1003 (Array Int Int)) (v_ArrVal_1001 (Array Int Int))) (or (< 0 (+ (select (select (store (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_lis_~i~0#1_70| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1001))) (store .cse2 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse2 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* |v_ULTIMATE.start_lis_~i~0#1_69| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_lis_~best~0#1.base|) |c_ULTIMATE.start_lis_~best~0#1.offset|) 2147483650)) (< |v_ULTIMATE.start_lis_~i~0#1_69| (+ |v_ULTIMATE.start_lis_~i~0#1_70| 1)))))))) is different from false [2022-10-16 11:11:01,513 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|))) (and (not (= |c_ULTIMATE.start_lis_~best~0#1.base| |c_ULTIMATE.start_lis_~prev~0#1.base|)) (forall ((|v_ULTIMATE.start_lis_~i~0#1_69| Int)) (or (forall ((v_ArrVal_1003 (Array Int Int))) (< 0 (+ 2147483650 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_lis_~i~0#1_69| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_lis_~best~0#1.base|) |c_ULTIMATE.start_lis_~best~0#1.offset|)))) (not (<= (+ |c_ULTIMATE.start_lis_#t~post4#1| 1) |v_ULTIMATE.start_lis_~i~0#1_69|)))) (<= 1 (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (exists ((|ULTIMATE.start_lis_~i~0#1| Int)) (and (<= |ULTIMATE.start_lis_~i~0#1| |c_ULTIMATE.start_lis_#t~post4#1|) (<= 2 |ULTIMATE.start_lis_~i~0#1|) (= (select .cse0 (+ (* |ULTIMATE.start_lis_~i~0#1| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|)) 1))))) is different from false [2022-10-16 11:11:02,616 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|))) (and (= (select .cse0 (+ (* 4 |c_ULTIMATE.start_lis_~i~0#1|) |c_ULTIMATE.start_lis_~best~0#1.offset|)) 1) (not (= |c_ULTIMATE.start_lis_~best~0#1.base| |c_ULTIMATE.start_lis_~prev~0#1.base|)) (= 0 |c_ULTIMATE.start_lis_~best~0#1.offset|) (forall ((|v_ULTIMATE.start_lis_~i~0#1_69| Int) (v_ArrVal_1003 (Array Int Int))) (or (< 0 (+ 2147483650 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_lis_~i~0#1_69| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_lis_~best~0#1.base|) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (< |v_ULTIMATE.start_lis_~i~0#1_69| (+ |c_ULTIMATE.start_lis_~i~0#1| 1)))) (<= 1 (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (or (and (<= (+ (div (* (- 1) |c_ULTIMATE.start_lis_~best~0#1.offset|) 4) 4) |c_ULTIMATE.start_lis_~N#1|) (= (select .cse0 0) 1)) (<= (+ 3 |c_ULTIMATE.start_lis_~i~0#1|) |c_ULTIMATE.start_lis_~N#1|)) (<= 2 |c_ULTIMATE.start_lis_~i~0#1|))) is different from false [2022-10-16 11:11:04,624 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|))) (and (not (= |c_ULTIMATE.start_lis_~best~0#1.base| |c_ULTIMATE.start_lis_~prev~0#1.base|)) (= 0 |c_ULTIMATE.start_lis_~best~0#1.offset|) (forall ((|v_ULTIMATE.start_lis_~i~0#1_69| Int)) (or (forall ((v_ArrVal_1003 (Array Int Int))) (< 0 (+ 2147483650 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_lis_~i~0#1_69| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_lis_~best~0#1.base|) |c_ULTIMATE.start_lis_~best~0#1.offset|)))) (not (<= (+ |c_ULTIMATE.start_lis_#t~post4#1| 1) |v_ULTIMATE.start_lis_~i~0#1_69|)))) (or (and (<= (+ (div (* (- 1) |c_ULTIMATE.start_lis_~best~0#1.offset|) 4) 4) |c_ULTIMATE.start_lis_~N#1|) (= (select .cse0 0) 1)) (<= (+ |c_ULTIMATE.start_lis_#t~post4#1| 3) |c_ULTIMATE.start_lis_~N#1|)) (<= 1 (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (exists ((|ULTIMATE.start_lis_~i~0#1| Int)) (and (<= |ULTIMATE.start_lis_~i~0#1| |c_ULTIMATE.start_lis_#t~post4#1|) (<= 2 |ULTIMATE.start_lis_~i~0#1|) (= (select .cse0 (+ (* |ULTIMATE.start_lis_~i~0#1| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|)) 1))))) is different from false [2022-10-16 11:11:05,501 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|))) (and (= (select .cse0 (+ (* 4 |c_ULTIMATE.start_lis_~i~0#1|) |c_ULTIMATE.start_lis_~best~0#1.offset|)) 1) (not (= |c_ULTIMATE.start_lis_~best~0#1.base| |c_ULTIMATE.start_lis_~prev~0#1.base|)) (= 0 |c_ULTIMATE.start_lis_~best~0#1.offset|) (forall ((|v_ULTIMATE.start_lis_~i~0#1_69| Int) (v_ArrVal_1003 (Array Int Int))) (or (< 0 (+ 2147483650 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_lis_~i~0#1_69| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_lis_~best~0#1.base|) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (< |v_ULTIMATE.start_lis_~i~0#1_69| (+ |c_ULTIMATE.start_lis_~i~0#1| 1)))) (<= 1 (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (exists ((|v_ULTIMATE.start_lis_~i~0#1_66| Int) (|ULTIMATE.start_lis_~i~0#1| Int)) (and (<= (+ |v_ULTIMATE.start_lis_~i~0#1_66| 1) |ULTIMATE.start_lis_~i~0#1|) (<= 2 |v_ULTIMATE.start_lis_~i~0#1_66|) (= (select .cse0 (+ (* |v_ULTIMATE.start_lis_~i~0#1_66| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|)) 1) (= (select .cse0 (+ (* |ULTIMATE.start_lis_~i~0#1| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|)) 1))) (<= 2 |c_ULTIMATE.start_lis_~i~0#1|) (or (<= (+ 2 |c_ULTIMATE.start_lis_~i~0#1|) |c_ULTIMATE.start_lis_~N#1|) (= (select .cse0 0) 1)))) is different from false [2022-10-16 11:11:07,569 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|))) (and (not (= |c_ULTIMATE.start_lis_~best~0#1.base| |c_ULTIMATE.start_lis_~prev~0#1.base|)) (= 0 |c_ULTIMATE.start_lis_~best~0#1.offset|) (forall ((|v_ULTIMATE.start_lis_~i~0#1_69| Int)) (or (forall ((v_ArrVal_1003 (Array Int Int))) (< 0 (+ 2147483650 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_lis_~i~0#1_69| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_lis_~best~0#1.base|) |c_ULTIMATE.start_lis_~best~0#1.offset|)))) (not (<= (+ |c_ULTIMATE.start_lis_#t~post4#1| 1) |v_ULTIMATE.start_lis_~i~0#1_69|)))) (<= 1 (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (exists ((|v_ULTIMATE.start_lis_~i~0#1_66| Int) (|ULTIMATE.start_lis_~i~0#1| Int)) (and (<= (+ |v_ULTIMATE.start_lis_~i~0#1_66| 1) |ULTIMATE.start_lis_~i~0#1|) (<= 2 |v_ULTIMATE.start_lis_~i~0#1_66|) (= (select .cse0 (+ (* |v_ULTIMATE.start_lis_~i~0#1_66| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|)) 1) (= (select .cse0 (+ (* |ULTIMATE.start_lis_~i~0#1| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|)) 1))) (or (<= (+ |c_ULTIMATE.start_lis_#t~post4#1| 2) |c_ULTIMATE.start_lis_~N#1|) (= (select .cse0 0) 1)) (exists ((|ULTIMATE.start_lis_~i~0#1| Int)) (and (<= |ULTIMATE.start_lis_~i~0#1| |c_ULTIMATE.start_lis_#t~post4#1|) (<= 2 |ULTIMATE.start_lis_~i~0#1|) (= (select .cse0 (+ (* |ULTIMATE.start_lis_~i~0#1| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|)) 1))))) is different from false [2022-10-16 11:11:10,622 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|))) (and (= (select .cse0 (+ (* 4 |c_ULTIMATE.start_lis_~i~0#1|) |c_ULTIMATE.start_lis_~best~0#1.offset|)) 1) (not (= |c_ULTIMATE.start_lis_~best~0#1.base| |c_ULTIMATE.start_lis_~prev~0#1.base|)) (forall ((|v_ULTIMATE.start_lis_~i~0#1_69| Int) (v_ArrVal_1003 (Array Int Int))) (or (< 0 (+ 2147483650 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_lis_~i~0#1_69| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_lis_~best~0#1.base|) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (< |v_ULTIMATE.start_lis_~i~0#1_69| (+ |c_ULTIMATE.start_lis_~i~0#1| 1)))) (<= 1 (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (exists ((|v_ULTIMATE.start_lis_~i~0#1_66| Int) (|ULTIMATE.start_lis_~i~0#1| Int)) (and (<= (+ |v_ULTIMATE.start_lis_~i~0#1_66| 1) |ULTIMATE.start_lis_~i~0#1|) (<= 2 |v_ULTIMATE.start_lis_~i~0#1_66|) (= (select .cse0 (+ (* |v_ULTIMATE.start_lis_~i~0#1_66| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|)) 1) (= (select .cse0 (+ (* |ULTIMATE.start_lis_~i~0#1| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|)) 1))) (<= 2 |c_ULTIMATE.start_lis_~i~0#1|))) is different from false [2022-10-16 11:11:12,718 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|))) (and (not (= |c_ULTIMATE.start_lis_~best~0#1.base| |c_ULTIMATE.start_lis_~prev~0#1.base|)) (forall ((|v_ULTIMATE.start_lis_~i~0#1_69| Int)) (or (forall ((v_ArrVal_1003 (Array Int Int))) (< 0 (+ 2147483650 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_lis_~i~0#1_69| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_lis_~best~0#1.base|) |c_ULTIMATE.start_lis_~best~0#1.offset|)))) (not (<= (+ |c_ULTIMATE.start_lis_#t~post4#1| 1) |v_ULTIMATE.start_lis_~i~0#1_69|)))) (<= 1 (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (exists ((|v_ULTIMATE.start_lis_~i~0#1_66| Int) (|ULTIMATE.start_lis_~i~0#1| Int)) (and (<= (+ |v_ULTIMATE.start_lis_~i~0#1_66| 1) |ULTIMATE.start_lis_~i~0#1|) (<= 2 |v_ULTIMATE.start_lis_~i~0#1_66|) (= (select .cse0 (+ (* |v_ULTIMATE.start_lis_~i~0#1_66| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|)) 1) (= (select .cse0 (+ (* |ULTIMATE.start_lis_~i~0#1| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|)) 1))) (exists ((|ULTIMATE.start_lis_~i~0#1| Int)) (and (<= |ULTIMATE.start_lis_~i~0#1| |c_ULTIMATE.start_lis_#t~post4#1|) (<= 2 |ULTIMATE.start_lis_~i~0#1|) (= (select .cse0 (+ (* |ULTIMATE.start_lis_~i~0#1| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|)) 1))))) is different from false [2022-10-16 11:11:13,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:11:13,349 INFO L93 Difference]: Finished difference Result 295 states and 357 transitions. [2022-10-16 11:11:13,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-10-16 11:11:13,350 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 48 states have internal predecessors, (98), 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 45 [2022-10-16 11:11:13,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:11:13,352 INFO L225 Difference]: With dead ends: 295 [2022-10-16 11:11:13,352 INFO L226 Difference]: Without dead ends: 294 [2022-10-16 11:11:13,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 91 ConstructedPredicates, 24 IntricatePredicates, 0 DeprecatedPredicates, 1218 ImplicationChecksByTransitivity, 31.7s TimeCoverageRelationStatistics Valid=535, Invalid=4226, Unknown=27, NotChecked=3768, Total=8556 [2022-10-16 11:11:13,356 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 147 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 1532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 789 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-16 11:11:13,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 831 Invalid, 1532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 719 Invalid, 0 Unknown, 789 Unchecked, 0.5s Time] [2022-10-16 11:11:13,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-10-16 11:11:13,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 207. [2022-10-16 11:11:13,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 200 states have (on average 1.275) internal successors, (255), 206 states have internal predecessors, (255), 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) [2022-10-16 11:11:13,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 255 transitions. [2022-10-16 11:11:13,387 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 255 transitions. Word has length 45 [2022-10-16 11:11:13,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:11:13,387 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 255 transitions. [2022-10-16 11:11:13,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 48 states have internal predecessors, (98), 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) [2022-10-16 11:11:13,388 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 255 transitions. [2022-10-16 11:11:13,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-10-16 11:11:13,388 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:11:13,389 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:11:13,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-10-16 11:11:13,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:11:13,604 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 11:11:13,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:11:13,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1154114052, now seen corresponding path program 1 times [2022-10-16 11:11:13,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:11:13,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475857580] [2022-10-16 11:11:13,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:11:13,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:11:13,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:11:13,699 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-10-16 11:11:13,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:11:13,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475857580] [2022-10-16 11:11:13,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475857580] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 11:11:13,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759263581] [2022-10-16 11:11:13,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:11:13,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:11:13,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:11:13,702 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 11:11:13,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-10-16 11:11:13,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:11:13,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 11:11:13,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:11:13,846 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-10-16 11:11:13,846 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 11:11:13,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759263581] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 11:11:13,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 11:11:13,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-10-16 11:11:13,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969633482] [2022-10-16 11:11:13,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 11:11:13,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 11:11:13,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:11:13,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 11:11:13,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-16 11:11:13,848 INFO L87 Difference]: Start difference. First operand 207 states and 255 transitions. Second operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 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) [2022-10-16 11:11:13,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:11:13,950 INFO L93 Difference]: Finished difference Result 207 states and 255 transitions. [2022-10-16 11:11:13,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 11:11:13,951 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 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) Word has length 47 [2022-10-16 11:11:13,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:11:13,953 INFO L225 Difference]: With dead ends: 207 [2022-10-16 11:11:13,953 INFO L226 Difference]: Without dead ends: 206 [2022-10-16 11:11:13,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-10-16 11:11:13,954 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 28 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 11:11:13,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 118 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 11:11:13,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-10-16 11:11:13,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2022-10-16 11:11:13,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 200 states have (on average 1.27) internal successors, (254), 205 states have internal predecessors, (254), 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) [2022-10-16 11:11:13,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 254 transitions. [2022-10-16 11:11:13,985 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 254 transitions. Word has length 47 [2022-10-16 11:11:13,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:11:13,985 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 254 transitions. [2022-10-16 11:11:13,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 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) [2022-10-16 11:11:13,985 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 254 transitions. [2022-10-16 11:11:13,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-10-16 11:11:13,986 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:11:13,986 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:11:14,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-10-16 11:11:14,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-10-16 11:11:14,188 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 11:11:14,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:11:14,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1780486521, now seen corresponding path program 1 times [2022-10-16 11:11:14,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:11:14,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297164899] [2022-10-16 11:11:14,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:11:14,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:11:14,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:11:14,298 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-10-16 11:11:14,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:11:14,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297164899] [2022-10-16 11:11:14,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297164899] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 11:11:14,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779346271] [2022-10-16 11:11:14,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:11:14,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:11:14,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:11:14,301 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 11:11:14,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-10-16 11:11:14,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:11:14,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 11:11:14,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:11:14,448 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-10-16 11:11:14,448 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 11:11:14,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779346271] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 11:11:14,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 11:11:14,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2022-10-16 11:11:14,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767747461] [2022-10-16 11:11:14,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 11:11:14,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 11:11:14,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:11:14,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 11:11:14,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-10-16 11:11:14,451 INFO L87 Difference]: Start difference. First operand 206 states and 254 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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) [2022-10-16 11:11:14,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:11:14,561 INFO L93 Difference]: Finished difference Result 298 states and 382 transitions. [2022-10-16 11:11:14,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 11:11:14,562 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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 48 [2022-10-16 11:11:14,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:11:14,563 INFO L225 Difference]: With dead ends: 298 [2022-10-16 11:11:14,563 INFO L226 Difference]: Without dead ends: 207 [2022-10-16 11:11:14,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-10-16 11:11:14,566 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 48 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 11:11:14,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 142 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 11:11:14,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-10-16 11:11:14,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 199. [2022-10-16 11:11:14,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 194 states have (on average 1.2474226804123711) internal successors, (242), 198 states have internal predecessors, (242), 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) [2022-10-16 11:11:14,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 242 transitions. [2022-10-16 11:11:14,599 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 242 transitions. Word has length 48 [2022-10-16 11:11:14,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:11:14,599 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 242 transitions. [2022-10-16 11:11:14,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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) [2022-10-16 11:11:14,600 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 242 transitions. [2022-10-16 11:11:14,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-10-16 11:11:14,600 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:11:14,600 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:11:14,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-10-16 11:11:14,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:11:14,815 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 11:11:14,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:11:14,815 INFO L85 PathProgramCache]: Analyzing trace with hash 893496873, now seen corresponding path program 1 times [2022-10-16 11:11:14,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:11:14,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127287277] [2022-10-16 11:11:14,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:11:14,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:11:14,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:11:14,926 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-10-16 11:11:14,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:11:14,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127287277] [2022-10-16 11:11:14,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127287277] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 11:11:14,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419211210] [2022-10-16 11:11:14,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:11:14,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:11:14,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:11:14,929 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 11:11:14,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-10-16 11:11:15,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:11:15,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 14 conjunts are in the unsatisfiable core [2022-10-16 11:11:15,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:11:15,241 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-10-16 11:11:15,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 11:11:15,427 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-10-16 11:11:15,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419211210] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 11:11:15,427 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 11:11:15,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 14, 14] total 25 [2022-10-16 11:11:15,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702981698] [2022-10-16 11:11:15,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 11:11:15,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-10-16 11:11:15,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:11:15,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-10-16 11:11:15,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2022-10-16 11:11:15,430 INFO L87 Difference]: Start difference. First operand 199 states and 242 transitions. Second operand has 25 states, 25 states have (on average 3.96) internal successors, (99), 25 states have internal predecessors, (99), 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) [2022-10-16 11:11:15,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:11:15,957 INFO L93 Difference]: Finished difference Result 229 states and 277 transitions. [2022-10-16 11:11:15,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-10-16 11:11:15,957 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.96) internal successors, (99), 25 states have internal predecessors, (99), 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 51 [2022-10-16 11:11:15,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:11:15,959 INFO L225 Difference]: With dead ends: 229 [2022-10-16 11:11:15,959 INFO L226 Difference]: Without dead ends: 183 [2022-10-16 11:11:15,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 79 SyntacticMatches, 7 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=229, Invalid=1253, Unknown=0, NotChecked=0, Total=1482 [2022-10-16 11:11:15,960 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 259 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 11:11:15,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 380 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 11:11:15,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-10-16 11:11:15,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 176. [2022-10-16 11:11:15,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 171 states have (on average 1.2690058479532165) internal successors, (217), 175 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 11:11:15,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 217 transitions. [2022-10-16 11:11:15,987 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 217 transitions. Word has length 51 [2022-10-16 11:11:15,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:11:15,987 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 217 transitions. [2022-10-16 11:11:15,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.96) internal successors, (99), 25 states have internal predecessors, (99), 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) [2022-10-16 11:11:15,987 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 217 transitions. [2022-10-16 11:11:15,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-10-16 11:11:15,988 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:11:15,988 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:11:16,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-10-16 11:11:16,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:11:16,202 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 11:11:16,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:11:16,202 INFO L85 PathProgramCache]: Analyzing trace with hash -949219382, now seen corresponding path program 1 times [2022-10-16 11:11:16,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:11:16,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530605111] [2022-10-16 11:11:16,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:11:16,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:11:16,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:11:17,880 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 7 proven. 35 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 11:11:17,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:11:17,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530605111] [2022-10-16 11:11:17,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530605111] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 11:11:17,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661093340] [2022-10-16 11:11:17,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:11:17,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:11:17,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:11:17,882 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 11:11:17,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-10-16 11:11:17,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:11:17,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 38 conjunts are in the unsatisfiable core [2022-10-16 11:11:17,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:11:18,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2022-10-16 11:11:18,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2022-10-16 11:11:18,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-10-16 11:11:18,234 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 11:11:18,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2022-10-16 11:11:18,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-10-16 11:11:18,689 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-10-16 11:11:18,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 10 [2022-10-16 11:11:18,720 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-10-16 11:11:18,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 11:11:19,056 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_lis_~i~0#1_84| Int)) (or (not (<= (+ |c_ULTIMATE.start_lis_#t~post4#1| 1) |v_ULTIMATE.start_lis_~i~0#1_84|)) (forall ((v_ArrVal_1229 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* |v_ULTIMATE.start_lis_~i~0#1_84| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1229) |c_ULTIMATE.start_lis_~best~0#1.base|) (+ 4 |c_ULTIMATE.start_lis_~best~0#1.offset|)) 2147483647)))) is different from false [2022-10-16 11:11:19,078 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1229 (Array Int Int)) (|v_ULTIMATE.start_lis_~i~0#1_84| Int)) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* |v_ULTIMATE.start_lis_~i~0#1_84| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1229) |c_ULTIMATE.start_lis_~best~0#1.base|) (+ 4 |c_ULTIMATE.start_lis_~best~0#1.offset|)) 2147483647) (< |v_ULTIMATE.start_lis_~i~0#1_84| (+ |c_ULTIMATE.start_lis_~i~0#1| 1)))) is different from false [2022-10-16 11:11:19,091 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 11:11:19,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 43 [2022-10-16 11:11:19,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 86 treesize of output 82 [2022-10-16 11:11:19,116 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 11:11:19,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 53 [2022-10-16 11:11:19,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 41 treesize of output 37 [2022-10-16 11:11:19,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 62 treesize of output 54 [2022-10-16 11:11:19,187 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 17 trivial. 6 not checked. [2022-10-16 11:11:19,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661093340] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 11:11:19,188 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 11:11:19,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12, 12] total 40 [2022-10-16 11:11:19,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614753107] [2022-10-16 11:11:19,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 11:11:19,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-10-16 11:11:19,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 11:11:19,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-10-16 11:11:19,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1352, Unknown=8, NotChecked=150, Total=1640 [2022-10-16 11:11:19,190 INFO L87 Difference]: Start difference. First operand 176 states and 217 transitions. Second operand has 41 states, 40 states have (on average 3.15) internal successors, (126), 41 states have internal predecessors, (126), 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) [2022-10-16 11:11:20,407 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (* 4 |c_ULTIMATE.start_lis_~i~0#1|))) (let ((.cse2 (* |c_ULTIMATE.start_lis_~N#1| 4)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|)) (.cse11 (+ .cse10 |c_ULTIMATE.start_lis_~best~0#1.offset|))) (let ((.cse0 (not (= |c_ULTIMATE.start_lis_~best~0#1.base| |c_ULTIMATE.start_lis_~prev~0#1.base|))) (.cse7 (+ 2 |c_ULTIMATE.start_lis_~i~0#1|)) (.cse1 (= (select .cse6 .cse11) 1)) (.cse9 (<= (+ .cse10 9 |c_ULTIMATE.start_lis_~best~0#1.offset|) .cse2)) (.cse8 (= .cse11 4)) (.cse3 (= (select .cse6 4) 1))) (and (or .cse0 (<= (+ 3 |c_ULTIMATE.start_lis_~i~0#1|) |c_ULTIMATE.start_lis_~N#1|)) .cse1 .cse0 (= |c_ULTIMATE.start_lis_~i~0#1| 1) (= 0 |c_ULTIMATE.start_lis_~best~0#1.offset|) (or (<= (+ (* |c_ULTIMATE.start_lis_#t~post4#1| 4) 9 |c_ULTIMATE.start_lis_~best~0#1.offset|) .cse2) (and (<= (div (+ (* (- 1) |c_ULTIMATE.start_lis_~best~0#1.offset|) 4) 4) |c_ULTIMATE.start_lis_#t~post4#1|) .cse3)) (let ((.cse4 (* |c_ULTIMATE.start_main_~array_size~0#1| 4))) (or (< 12 .cse4) (= .cse4 12))) (let ((.cse5 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (or (< 8 .cse5) (= 8 .cse5))) (forall ((v_ArrVal_1229 (Array Int Int)) (|v_ULTIMATE.start_lis_~i~0#1_84| Int)) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse6 (+ (* |v_ULTIMATE.start_lis_~i~0#1_84| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1229) |c_ULTIMATE.start_lis_~best~0#1.base|) (+ 4 |c_ULTIMATE.start_lis_~best~0#1.offset|)) 2147483647) (< |v_ULTIMATE.start_lis_~i~0#1_84| (+ |c_ULTIMATE.start_lis_~i~0#1| 1)))) (or .cse0 (<= (+ |c_ULTIMATE.start_lis_#t~post4#1| 3) |c_ULTIMATE.start_lis_~N#1|)) (or .cse0 (and (<= 3 |c_ULTIMATE.start_lis_~N#1|) (< .cse7 |c_ULTIMATE.start_lis_~N#1|) (<= |c_ULTIMATE.start_lis_~i~0#1| 1))) (or .cse0 (<= .cse7 |c_ULTIMATE.start_lis_~N#1|)) (or .cse8 .cse9) (= |c_ULTIMATE.start_main_~numbers~0#1.offset| 0) (or (and .cse1 .cse8) .cse9) (or (<= (+ 5 .cse10 |c_ULTIMATE.start_lis_~best~0#1.offset|) .cse2) (and (not .cse8) .cse3)) .cse3)))) is different from false [2022-10-16 11:11:22,415 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_lis_~best~0#1.base| |c_ULTIMATE.start_lis_~prev~0#1.base|))) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|)) (.cse2 (+ 4 |c_ULTIMATE.start_lis_~best~0#1.offset|))) (and .cse0 (= 0 |c_ULTIMATE.start_lis_~best~0#1.offset|) (= (select .cse1 .cse2) 1) (or (<= (+ (* |c_ULTIMATE.start_lis_#t~post4#1| 4) 9 |c_ULTIMATE.start_lis_~best~0#1.offset|) (* |c_ULTIMATE.start_lis_~N#1| 4)) (and (<= (div (+ (* (- 1) |c_ULTIMATE.start_lis_~best~0#1.offset|) 4) 4) |c_ULTIMATE.start_lis_#t~post4#1|) (= (select .cse1 4) 1))) (or .cse0 (<= (+ |c_ULTIMATE.start_lis_#t~post4#1| 3) |c_ULTIMATE.start_lis_~N#1|)) (<= 1 |c_ULTIMATE.start_lis_#t~post4#1|) (forall ((|v_ULTIMATE.start_lis_~i~0#1_84| Int)) (or (not (<= (+ |c_ULTIMATE.start_lis_#t~post4#1| 1) |v_ULTIMATE.start_lis_~i~0#1_84|)) (forall ((v_ArrVal_1229 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse1 (+ (* |v_ULTIMATE.start_lis_~i~0#1_84| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1229) |c_ULTIMATE.start_lis_~best~0#1.base|) .cse2) 2147483647)))))) is different from false [2022-10-16 11:11:23,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 11:11:23,050 INFO L93 Difference]: Finished difference Result 209 states and 257 transitions. [2022-10-16 11:11:23,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-10-16 11:11:23,051 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 3.15) internal successors, (126), 41 states have internal predecessors, (126), 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 53 [2022-10-16 11:11:23,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 11:11:23,052 INFO L225 Difference]: With dead ends: 209 [2022-10-16 11:11:23,052 INFO L226 Difference]: Without dead ends: 207 [2022-10-16 11:11:23,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 87 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=260, Invalid=2398, Unknown=10, NotChecked=412, Total=3080 [2022-10-16 11:11:23,054 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 100 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 302 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 11:11:23,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 759 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 579 Invalid, 0 Unknown, 302 Unchecked, 0.4s Time] [2022-10-16 11:11:23,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-10-16 11:11:23,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 200. [2022-10-16 11:11:23,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 195 states have (on average 1.2769230769230768) internal successors, (249), 199 states have internal predecessors, (249), 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) [2022-10-16 11:11:23,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 249 transitions. [2022-10-16 11:11:23,088 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 249 transitions. Word has length 53 [2022-10-16 11:11:23,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 11:11:23,088 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 249 transitions. [2022-10-16 11:11:23,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 3.15) internal successors, (126), 41 states have internal predecessors, (126), 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) [2022-10-16 11:11:23,088 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 249 transitions. [2022-10-16 11:11:23,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-10-16 11:11:23,089 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 11:11:23,089 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 11:11:23,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-10-16 11:11:23,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:11:23,302 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-10-16 11:11:23,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 11:11:23,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1175422022, now seen corresponding path program 1 times [2022-10-16 11:11:23,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 11:11:23,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311515470] [2022-10-16 11:11:23,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:11:23,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 11:11:23,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:11:24,437 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-16 11:11:24,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 11:11:24,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311515470] [2022-10-16 11:11:24,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311515470] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 11:11:24,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072418526] [2022-10-16 11:11:24,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 11:11:24,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 11:11:24,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 11:11:24,440 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 11:11:24,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-10-16 11:11:24,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 11:11:24,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 54 conjunts are in the unsatisfiable core [2022-10-16 11:11:24,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 11:11:24,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2022-10-16 11:11:24,625 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-16 11:11:24,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 18 treesize of output 24 [2022-10-16 11:11:24,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 3 [2022-10-16 11:11:24,792 INFO L356 Elim1Store]: treesize reduction 17, result has 51.4 percent of original size [2022-10-16 11:11:24,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 75 [2022-10-16 11:11:24,825 INFO L356 Elim1Store]: treesize reduction 43, result has 29.5 percent of original size [2022-10-16 11:11:24,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 83 [2022-10-16 11:11:24,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 11 [2022-10-16 11:11:24,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 18 [2022-10-16 11:11:24,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 20 treesize of output 19 [2022-10-16 11:11:24,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:11:24,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:11:24,956 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 11:11:24,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 153 [2022-10-16 11:11:25,016 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 [2022-10-16 11:11:25,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 [2022-10-16 11:11:25,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:11:25,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:11:25,082 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 11:11:25,083 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 11:11:25,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 9 [2022-10-16 11:11:25,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:11:25,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:11:25,099 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 11:11:25,101 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 11:11:25,103 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 5 [2022-10-16 11:11:25,144 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 3 [2022-10-16 11:11:25,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:11:25,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:11:25,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:11:25,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:11:25,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:11:25,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:11:25,496 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 11:11:25,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:11:25,498 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 11:11:25,513 INFO L356 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-10-16 11:11:25,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 113 treesize of output 105 [2022-10-16 11:11:25,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 11:11:25,524 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 11:11:25,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 65 [2022-10-16 11:11:26,130 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 11:11:26,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2022-10-16 11:11:26,162 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-16 11:11:26,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 11:11:28,820 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_lis_~i~0#1_90| Int)) (or (not (<= (+ |c_ULTIMATE.start_lis_#t~post4#1| 1) |v_ULTIMATE.start_lis_~i~0#1_90|)) (forall ((v_ArrVal_1305 Int)) (let ((.cse1 (select (let ((.cse3 (* |v_ULTIMATE.start_lis_~i~0#1_90| 4))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ .cse3 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)))) (store .cse2 |c_ULTIMATE.start_lis_~prev~0#1.base| (store (select .cse2 |c_ULTIMATE.start_lis_~prev~0#1.base|) (+ .cse3 |c_ULTIMATE.start_lis_~prev~0#1.offset|) v_ArrVal_1305)))) |c_ULTIMATE.start_lis_~best~0#1.base|))) (let ((.cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_lis_~best~0#1.offset|)))) (or (< .cse0 2147483647) (< .cse0 (+ (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)))))))) is different from false [2022-10-16 11:11:30,856 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_lis_~i~0#1_90| Int) (v_ArrVal_1305 Int)) (let ((.cse1 (select (let ((.cse3 (* |v_ULTIMATE.start_lis_~i~0#1_90| 4))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ .cse3 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)))) (store .cse2 |c_ULTIMATE.start_lis_~prev~0#1.base| (store (select .cse2 |c_ULTIMATE.start_lis_~prev~0#1.base|) (+ .cse3 |c_ULTIMATE.start_lis_~prev~0#1.offset|) v_ArrVal_1305)))) |c_ULTIMATE.start_lis_~best~0#1.base|))) (let ((.cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_lis_~best~0#1.offset|)))) (or (< |v_ULTIMATE.start_lis_~i~0#1_90| (+ |c_ULTIMATE.start_lis_~i~0#1| 1)) (< .cse0 2147483647) (< .cse0 (+ (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)))))) is different from false [2022-10-16 11:11:30,919 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1302 (Array Int Int)) (v_ArrVal_1300 Int) (|v_ULTIMATE.start_lis_~i~0#1_90| Int) (v_ArrVal_1305 Int)) (let ((.cse1 (select (let ((.cse3 (* |v_ULTIMATE.start_lis_~i~0#1_90| 4))) (let ((.cse2 (let ((.cse4 (let ((.cse5 (* 4 |c_ULTIMATE.start_lis_~i~0#1|))) (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ .cse5 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| v_ArrVal_1302) |c_ULTIMATE.start_lis_~prev~0#1.base|) (+ |c_ULTIMATE.start_lis_~prev~0#1.offset| .cse5) v_ArrVal_1300))))) (store .cse4 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse4 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ .cse3 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))))) (store .cse2 |c_ULTIMATE.start_lis_~prev~0#1.base| (store (select .cse2 |c_ULTIMATE.start_lis_~prev~0#1.base|) (+ .cse3 |c_ULTIMATE.start_lis_~prev~0#1.offset|) v_ArrVal_1305)))) |c_ULTIMATE.start_lis_~best~0#1.base|))) (let ((.cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_lis_~best~0#1.offset|)))) (or (not (<= v_ArrVal_1300 |c_ULTIMATE.start_lis_~i~0#1|)) (< |v_ULTIMATE.start_lis_~i~0#1_90| (+ |c_ULTIMATE.start_lis_~i~0#1| 1)) (< .cse0 (+ (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)) (< .cse0 2147483647))))) is different from false [2022-10-16 11:11:44,577 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1302 (Array Int Int)) (v_ArrVal_1300 Int) (|v_ULTIMATE.start_lis_~i~0#1_90| Int) (v_ArrVal_1305 Int)) (let ((.cse1 (select (let ((.cse3 (* |v_ULTIMATE.start_lis_~i~0#1_90| 4))) (let ((.cse2 (let ((.cse4 (let ((.cse5 (* 4 |c_ULTIMATE.start_lis_~i~0#1|))) (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ .cse5 4 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| v_ArrVal_1302) |c_ULTIMATE.start_lis_~prev~0#1.base|) (+ |c_ULTIMATE.start_lis_~prev~0#1.offset| .cse5 4) v_ArrVal_1300))))) (store .cse4 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse4 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ .cse3 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))))) (store .cse2 |c_ULTIMATE.start_lis_~prev~0#1.base| (store (select .cse2 |c_ULTIMATE.start_lis_~prev~0#1.base|) (+ .cse3 |c_ULTIMATE.start_lis_~prev~0#1.offset|) v_ArrVal_1305)))) |c_ULTIMATE.start_lis_~best~0#1.base|))) (let ((.cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_lis_~best~0#1.offset|)))) (or (< .cse0 2147483647) (not (<= v_ArrVal_1300 (+ |c_ULTIMATE.start_lis_~i~0#1| 1))) (< |v_ULTIMATE.start_lis_~i~0#1_90| (+ 2 |c_ULTIMATE.start_lis_~i~0#1|)) (< .cse0 (+ (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)))))) is different from false [2022-10-16 11:11:44,600 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 11:11:44,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 1021 treesize of output 601 [2022-10-16 11:11:44,664 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2851 treesize of output 2813 [2022-10-16 11:11:44,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35443 treesize of output 33811 [2022-10-16 11:11:47,059 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 11:11:47,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52101 treesize of output 50563 [2022-10-16 11:11:50,319 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 11:11:50,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55859 treesize of output 55115