/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops/ludcmp.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 02:41:36,478 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 02:41:36,480 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 02:41:36,544 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 02:41:36,544 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 02:41:36,545 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 02:41:36,548 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 02:41:36,550 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 02:41:36,552 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 02:41:36,556 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 02:41:36,556 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 02:41:36,558 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 02:41:36,558 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 02:41:36,560 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 02:41:36,561 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 02:41:36,563 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 02:41:36,564 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 02:41:36,564 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 02:41:36,567 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 02:41:36,571 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 02:41:36,573 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 02:41:36,574 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 02:41:36,576 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 02:41:36,576 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 02:41:36,578 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 02:41:36,580 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 02:41:36,580 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 02:41:36,580 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 02:41:36,581 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 02:41:36,581 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 02:41:36,582 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 02:41:36,582 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 02:41:36,584 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 02:41:36,584 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 02:41:36,585 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 02:41:36,585 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 02:41:36,586 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 02:41:36,586 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 02:41:36,586 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 02:41:36,587 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 02:41:36,587 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 02:41:36,589 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 02:41:36,589 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 02:41:36,599 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 02:41:36,600 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 02:41:36,601 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 02:41:36,601 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 02:41:36,601 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 02:41:36,601 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 02:41:36,602 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 02:41:36,602 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 02:41:36,602 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 02:41:36,603 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 02:41:36,603 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 02:41:36,603 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 02:41:36,603 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 02:41:36,603 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 02:41:36,603 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 02:41:36,604 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 02:41:36,604 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 02:41:36,604 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 02:41:36,604 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:41:36,604 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 02:41:36,604 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 02:41:36,604 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 02:41:36,605 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 02:41:36,605 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 02:41:36,605 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 02:41:36,605 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 02:41:36,846 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 02:41:36,867 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 02:41:36,869 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 02:41:36,870 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 02:41:36,871 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 02:41:36,872 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/ludcmp.c [2022-04-28 02:41:36,926 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aebb0aa4/6aab8007656d433aa43826894c0ccf01/FLAG7a57fa5d4 [2022-04-28 02:41:37,327 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 02:41:37,327 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/ludcmp.c [2022-04-28 02:41:37,338 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aebb0aa4/6aab8007656d433aa43826894c0ccf01/FLAG7a57fa5d4 [2022-04-28 02:41:37,726 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aebb0aa4/6aab8007656d433aa43826894c0ccf01 [2022-04-28 02:41:37,728 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 02:41:37,729 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 02:41:37,732 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 02:41:37,732 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 02:41:37,734 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 02:41:37,735 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:41:37" (1/1) ... [2022-04-28 02:41:37,736 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1393e86e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:37, skipping insertion in model container [2022-04-28 02:41:37,736 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:41:37" (1/1) ... [2022-04-28 02:41:37,742 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 02:41:37,766 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 02:41:37,897 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/ludcmp.c[318,331] [2022-04-28 02:41:37,965 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:41:37,973 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 02:41:37,988 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/ludcmp.c[318,331] [2022-04-28 02:41:38,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:41:38,023 INFO L208 MainTranslator]: Completed translation [2022-04-28 02:41:38,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:38 WrapperNode [2022-04-28 02:41:38,024 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 02:41:38,025 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 02:41:38,025 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 02:41:38,025 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 02:41:38,035 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:38" (1/1) ... [2022-04-28 02:41:38,035 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:38" (1/1) ... [2022-04-28 02:41:38,052 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:38" (1/1) ... [2022-04-28 02:41:38,053 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:38" (1/1) ... [2022-04-28 02:41:38,077 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:38" (1/1) ... [2022-04-28 02:41:38,084 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:38" (1/1) ... [2022-04-28 02:41:38,085 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:38" (1/1) ... [2022-04-28 02:41:38,088 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 02:41:38,089 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 02:41:38,089 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 02:41:38,089 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 02:41:38,091 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:38" (1/1) ... [2022-04-28 02:41:38,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:41:38,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:41:38,133 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-04-28 02:41:38,152 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-04-28 02:41:38,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 02:41:38,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 02:41:38,176 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 02:41:38,177 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 02:41:38,177 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs [2022-04-28 02:41:38,177 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 02:41:38,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ludcmp [2022-04-28 02:41:38,177 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 02:41:38,177 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 02:41:38,177 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 02:41:38,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 02:41:38,178 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 02:41:38,179 INFO L130 BoogieDeclarations]: Found specification of procedure ludcmp [2022-04-28 02:41:38,179 INFO L130 BoogieDeclarations]: Found specification of procedure fabs [2022-04-28 02:41:38,179 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 02:41:38,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-04-28 02:41:38,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-04-28 02:41:38,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-28 02:41:38,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 02:41:38,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 02:41:38,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 02:41:38,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 02:41:38,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 02:41:38,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 02:41:38,301 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 02:41:38,302 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 02:41:38,712 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 02:41:38,718 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 02:41:38,718 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2022-04-28 02:41:38,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:41:38 BoogieIcfgContainer [2022-04-28 02:41:38,720 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 02:41:38,721 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 02:41:38,721 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 02:41:38,726 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 02:41:38,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 02:41:37" (1/3) ... [2022-04-28 02:41:38,727 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a94035b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:41:38, skipping insertion in model container [2022-04-28 02:41:38,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:38" (2/3) ... [2022-04-28 02:41:38,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a94035b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:41:38, skipping insertion in model container [2022-04-28 02:41:38,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:41:38" (3/3) ... [2022-04-28 02:41:38,729 INFO L111 eAbstractionObserver]: Analyzing ICFG ludcmp.c [2022-04-28 02:41:38,743 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 02:41:38,743 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 02:41:38,779 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 02:41:38,784 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2026a5aa, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@422f3625 [2022-04-28 02:41:38,785 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 02:41:38,792 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 52 states have (on average 1.5576923076923077) internal successors, (81), 53 states have internal predecessors, (81), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 02:41:38,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 02:41:38,798 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:41:38,798 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:41:38,799 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:41:38,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:41:38,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1448102218, now seen corresponding path program 1 times [2022-04-28 02:41:38,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:38,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [299358365] [2022-04-28 02:41:38,819 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 02:41:38,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1448102218, now seen corresponding path program 2 times [2022-04-28 02:41:38,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:41:38,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790631457] [2022-04-28 02:41:38,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:41:38,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:41:38,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:38,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:41:39,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:39,018 INFO L290 TraceCheckUtils]: 0: Hoare triple {72#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {67#true} is VALID [2022-04-28 02:41:39,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-28 02:41:39,019 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67#true} {67#true} #214#return; {67#true} is VALID [2022-04-28 02:41:39,022 INFO L272 TraceCheckUtils]: 0: Hoare triple {67#true} call ULTIMATE.init(); {72#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:41:39,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {72#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {67#true} is VALID [2022-04-28 02:41:39,022 INFO L290 TraceCheckUtils]: 2: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-28 02:41:39,023 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67#true} {67#true} #214#return; {67#true} is VALID [2022-04-28 02:41:39,023 INFO L272 TraceCheckUtils]: 4: Hoare triple {67#true} call #t~ret37 := main(); {67#true} is VALID [2022-04-28 02:41:39,023 INFO L290 TraceCheckUtils]: 5: Hoare triple {67#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {67#true} is VALID [2022-04-28 02:41:39,024 INFO L290 TraceCheckUtils]: 6: Hoare triple {67#true} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {67#true} is VALID [2022-04-28 02:41:39,025 INFO L290 TraceCheckUtils]: 7: Hoare triple {67#true} assume !true; {68#false} is VALID [2022-04-28 02:41:39,025 INFO L272 TraceCheckUtils]: 8: Hoare triple {68#false} call __VERIFIER_assert((if 2 == ~i~0 then 1 else 0)); {68#false} is VALID [2022-04-28 02:41:39,025 INFO L290 TraceCheckUtils]: 9: Hoare triple {68#false} ~cond := #in~cond; {68#false} is VALID [2022-04-28 02:41:39,026 INFO L290 TraceCheckUtils]: 10: Hoare triple {68#false} assume 0 == ~cond; {68#false} is VALID [2022-04-28 02:41:39,026 INFO L290 TraceCheckUtils]: 11: Hoare triple {68#false} assume !false; {68#false} is VALID [2022-04-28 02:41:39,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:41:39,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:41:39,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790631457] [2022-04-28 02:41:39,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790631457] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:39,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:39,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 02:41:39,030 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:41:39,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [299358365] [2022-04-28 02:41:39,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [299358365] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:39,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:39,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 02:41:39,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192124059] [2022-04-28 02:41:39,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:41:39,036 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 02:41:39,038 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:41:39,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:39,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:39,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 02:41:39,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:39,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 02:41:39,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 02:41:39,094 INFO L87 Difference]: Start difference. First operand has 64 states, 52 states have (on average 1.5576923076923077) internal successors, (81), 53 states have internal predecessors, (81), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:39,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:39,566 INFO L93 Difference]: Finished difference Result 147 states and 225 transitions. [2022-04-28 02:41:39,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 02:41:39,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 02:41:39,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:41:39,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:39,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 225 transitions. [2022-04-28 02:41:39,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:39,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 225 transitions. [2022-04-28 02:41:39,585 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 225 transitions. [2022-04-28 02:41:39,807 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 225 edges. 225 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:39,814 INFO L225 Difference]: With dead ends: 147 [2022-04-28 02:41:39,814 INFO L226 Difference]: Without dead ends: 24 [2022-04-28 02:41:39,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-04-28 02:41:39,820 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 38 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:41:39,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 73 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:41:39,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-28 02:41:39,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2022-04-28 02:41:39,845 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:41:39,845 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 20 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:41:39,846 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 20 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:41:39,846 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 20 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:41:39,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:39,849 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-04-28 02:41:39,849 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-28 02:41:39,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:39,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:39,850 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 24 states. [2022-04-28 02:41:39,850 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 24 states. [2022-04-28 02:41:39,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:39,852 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-04-28 02:41:39,852 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-28 02:41:39,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:39,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:39,853 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:41:39,853 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:41:39,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:41:39,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-04-28 02:41:39,855 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 12 [2022-04-28 02:41:39,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:41:39,856 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-04-28 02:41:39,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:39,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 22 transitions. [2022-04-28 02:41:39,879 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:39,880 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-28 02:41:39,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 02:41:39,880 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:41:39,881 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:41:39,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 02:41:39,883 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:41:39,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:41:39,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1436096445, now seen corresponding path program 1 times [2022-04-28 02:41:39,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:39,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [531137105] [2022-04-28 02:41:39,887 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 02:41:39,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1436096445, now seen corresponding path program 2 times [2022-04-28 02:41:39,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:41:39,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952316268] [2022-04-28 02:41:39,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:41:39,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:41:39,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:40,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:41:40,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:40,036 INFO L290 TraceCheckUtils]: 0: Hoare triple {464#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {457#true} is VALID [2022-04-28 02:41:40,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {457#true} assume true; {457#true} is VALID [2022-04-28 02:41:40,037 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {457#true} {457#true} #214#return; {457#true} is VALID [2022-04-28 02:41:40,038 INFO L272 TraceCheckUtils]: 0: Hoare triple {457#true} call ULTIMATE.init(); {464#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:41:40,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {464#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {457#true} is VALID [2022-04-28 02:41:40,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {457#true} assume true; {457#true} is VALID [2022-04-28 02:41:40,039 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {457#true} {457#true} #214#return; {457#true} is VALID [2022-04-28 02:41:40,039 INFO L272 TraceCheckUtils]: 4: Hoare triple {457#true} call #t~ret37 := main(); {457#true} is VALID [2022-04-28 02:41:40,040 INFO L290 TraceCheckUtils]: 5: Hoare triple {457#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {462#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-28 02:41:40,040 INFO L290 TraceCheckUtils]: 6: Hoare triple {462#(= (+ main_~n~0 (- 5)) 0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {463#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:40,041 INFO L290 TraceCheckUtils]: 7: Hoare triple {463#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} assume !(~j~0 <= ~n~0); {458#false} is VALID [2022-04-28 02:41:40,041 INFO L272 TraceCheckUtils]: 8: Hoare triple {458#false} call __VERIFIER_assert((if 2 == ~i~0 then 1 else 0)); {458#false} is VALID [2022-04-28 02:41:40,041 INFO L290 TraceCheckUtils]: 9: Hoare triple {458#false} ~cond := #in~cond; {458#false} is VALID [2022-04-28 02:41:40,041 INFO L290 TraceCheckUtils]: 10: Hoare triple {458#false} assume 0 == ~cond; {458#false} is VALID [2022-04-28 02:41:40,042 INFO L290 TraceCheckUtils]: 11: Hoare triple {458#false} assume !false; {458#false} is VALID [2022-04-28 02:41:40,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:41:40,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:41:40,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952316268] [2022-04-28 02:41:40,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952316268] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:40,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:40,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:41:40,043 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:41:40,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [531137105] [2022-04-28 02:41:40,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [531137105] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:40,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:40,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:41:40,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509145124] [2022-04-28 02:41:40,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:41:40,044 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 02:41:40,045 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:41:40,045 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:40,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:40,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 02:41:40,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:40,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 02:41:40,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:41:40,057 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:40,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:40,233 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2022-04-28 02:41:40,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 02:41:40,234 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 02:41:40,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:41:40,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:40,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-04-28 02:41:40,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:40,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-04-28 02:41:40,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 47 transitions. [2022-04-28 02:41:40,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:40,302 INFO L225 Difference]: With dead ends: 40 [2022-04-28 02:41:40,302 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 02:41:40,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-28 02:41:40,303 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 24 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:41:40,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 25 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:41:40,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 02:41:40,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2022-04-28 02:41:40,310 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:41:40,310 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:41:40,313 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:41:40,313 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:41:40,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:40,316 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-28 02:41:40,316 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-28 02:41:40,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:40,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:40,317 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 26 states. [2022-04-28 02:41:40,318 INFO L87 Difference]: Start difference. First operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 26 states. [2022-04-28 02:41:40,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:40,321 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-28 02:41:40,321 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-28 02:41:40,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:40,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:40,321 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:41:40,322 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:41:40,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:41:40,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-04-28 02:41:40,326 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 12 [2022-04-28 02:41:40,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:41:40,327 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-04-28 02:41:40,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:40,327 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 23 transitions. [2022-04-28 02:41:40,353 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:40,353 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-28 02:41:40,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 02:41:40,354 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:41:40,354 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:41:40,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 02:41:40,355 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:41:40,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:41:40,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1858105272, now seen corresponding path program 1 times [2022-04-28 02:41:40,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:40,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [963982853] [2022-04-28 02:41:40,375 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:41:40,375 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 02:41:40,375 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:41:40,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1858105272, now seen corresponding path program 2 times [2022-04-28 02:41:40,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:41:40,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138348635] [2022-04-28 02:41:40,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:41:40,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:41:40,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:40,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:41:40,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:40,515 INFO L290 TraceCheckUtils]: 0: Hoare triple {653#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {645#true} is VALID [2022-04-28 02:41:40,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {645#true} assume true; {645#true} is VALID [2022-04-28 02:41:40,518 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {645#true} {645#true} #214#return; {645#true} is VALID [2022-04-28 02:41:40,525 INFO L272 TraceCheckUtils]: 0: Hoare triple {645#true} call ULTIMATE.init(); {653#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:41:40,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {653#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {645#true} is VALID [2022-04-28 02:41:40,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {645#true} assume true; {645#true} is VALID [2022-04-28 02:41:40,527 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {645#true} {645#true} #214#return; {645#true} is VALID [2022-04-28 02:41:40,527 INFO L272 TraceCheckUtils]: 4: Hoare triple {645#true} call #t~ret37 := main(); {645#true} is VALID [2022-04-28 02:41:40,527 INFO L290 TraceCheckUtils]: 5: Hoare triple {645#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {650#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-28 02:41:40,528 INFO L290 TraceCheckUtils]: 6: Hoare triple {650#(= (+ main_~n~0 (- 5)) 0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {651#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:40,530 INFO L290 TraceCheckUtils]: 7: Hoare triple {651#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {651#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:40,531 INFO L290 TraceCheckUtils]: 8: Hoare triple {651#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {651#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:40,531 INFO L290 TraceCheckUtils]: 9: Hoare triple {651#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {651#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:40,532 INFO L290 TraceCheckUtils]: 10: Hoare triple {651#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {652#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:40,533 INFO L290 TraceCheckUtils]: 11: Hoare triple {652#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} assume !(~j~0 <= ~n~0); {646#false} is VALID [2022-04-28 02:41:40,533 INFO L272 TraceCheckUtils]: 12: Hoare triple {646#false} call __VERIFIER_assert((if 2 == ~i~0 then 1 else 0)); {646#false} is VALID [2022-04-28 02:41:40,533 INFO L290 TraceCheckUtils]: 13: Hoare triple {646#false} ~cond := #in~cond; {646#false} is VALID [2022-04-28 02:41:40,535 INFO L290 TraceCheckUtils]: 14: Hoare triple {646#false} assume 0 == ~cond; {646#false} is VALID [2022-04-28 02:41:40,538 INFO L290 TraceCheckUtils]: 15: Hoare triple {646#false} assume !false; {646#false} is VALID [2022-04-28 02:41:40,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:41:40,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:41:40,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138348635] [2022-04-28 02:41:40,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138348635] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:41:40,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885357012] [2022-04-28 02:41:40,540 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:41:40,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:41:40,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:41:40,547 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-04-28 02:41:40,556 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-04-28 02:41:40,653 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:41:40,654 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:41:40,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 02:41:40,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:40,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:41:40,907 INFO L272 TraceCheckUtils]: 0: Hoare triple {645#true} call ULTIMATE.init(); {645#true} is VALID [2022-04-28 02:41:40,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {645#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {645#true} is VALID [2022-04-28 02:41:40,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {645#true} assume true; {645#true} is VALID [2022-04-28 02:41:40,908 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {645#true} {645#true} #214#return; {645#true} is VALID [2022-04-28 02:41:40,908 INFO L272 TraceCheckUtils]: 4: Hoare triple {645#true} call #t~ret37 := main(); {645#true} is VALID [2022-04-28 02:41:40,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {645#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {672#(<= 5 main_~n~0)} is VALID [2022-04-28 02:41:40,910 INFO L290 TraceCheckUtils]: 6: Hoare triple {672#(<= 5 main_~n~0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {676#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-28 02:41:40,911 INFO L290 TraceCheckUtils]: 7: Hoare triple {676#(and (<= 5 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {676#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-28 02:41:40,912 INFO L290 TraceCheckUtils]: 8: Hoare triple {676#(and (<= 5 main_~n~0) (<= main_~j~0 0))} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {676#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-28 02:41:40,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {676#(and (<= 5 main_~n~0) (<= main_~j~0 0))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {676#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-28 02:41:40,913 INFO L290 TraceCheckUtils]: 10: Hoare triple {676#(and (<= 5 main_~n~0) (<= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {689#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:41:40,913 INFO L290 TraceCheckUtils]: 11: Hoare triple {689#(and (<= 5 main_~n~0) (<= main_~j~0 1))} assume !(~j~0 <= ~n~0); {646#false} is VALID [2022-04-28 02:41:40,914 INFO L272 TraceCheckUtils]: 12: Hoare triple {646#false} call __VERIFIER_assert((if 2 == ~i~0 then 1 else 0)); {646#false} is VALID [2022-04-28 02:41:40,914 INFO L290 TraceCheckUtils]: 13: Hoare triple {646#false} ~cond := #in~cond; {646#false} is VALID [2022-04-28 02:41:40,914 INFO L290 TraceCheckUtils]: 14: Hoare triple {646#false} assume 0 == ~cond; {646#false} is VALID [2022-04-28 02:41:40,914 INFO L290 TraceCheckUtils]: 15: Hoare triple {646#false} assume !false; {646#false} is VALID [2022-04-28 02:41:40,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:41:40,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:41:41,047 INFO L290 TraceCheckUtils]: 15: Hoare triple {646#false} assume !false; {646#false} is VALID [2022-04-28 02:41:41,048 INFO L290 TraceCheckUtils]: 14: Hoare triple {646#false} assume 0 == ~cond; {646#false} is VALID [2022-04-28 02:41:41,048 INFO L290 TraceCheckUtils]: 13: Hoare triple {646#false} ~cond := #in~cond; {646#false} is VALID [2022-04-28 02:41:41,048 INFO L272 TraceCheckUtils]: 12: Hoare triple {646#false} call __VERIFIER_assert((if 2 == ~i~0 then 1 else 0)); {646#false} is VALID [2022-04-28 02:41:41,048 INFO L290 TraceCheckUtils]: 11: Hoare triple {717#(<= main_~j~0 main_~n~0)} assume !(~j~0 <= ~n~0); {646#false} is VALID [2022-04-28 02:41:41,049 INFO L290 TraceCheckUtils]: 10: Hoare triple {721#(<= (+ main_~j~0 1) main_~n~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {717#(<= main_~j~0 main_~n~0)} is VALID [2022-04-28 02:41:41,050 INFO L290 TraceCheckUtils]: 9: Hoare triple {721#(<= (+ main_~j~0 1) main_~n~0)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {721#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-28 02:41:41,050 INFO L290 TraceCheckUtils]: 8: Hoare triple {721#(<= (+ main_~j~0 1) main_~n~0)} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {721#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-28 02:41:41,055 INFO L290 TraceCheckUtils]: 7: Hoare triple {721#(<= (+ main_~j~0 1) main_~n~0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {721#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-28 02:41:41,056 INFO L290 TraceCheckUtils]: 6: Hoare triple {734#(<= 1 main_~n~0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {721#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-28 02:41:41,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {645#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {734#(<= 1 main_~n~0)} is VALID [2022-04-28 02:41:41,057 INFO L272 TraceCheckUtils]: 4: Hoare triple {645#true} call #t~ret37 := main(); {645#true} is VALID [2022-04-28 02:41:41,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {645#true} {645#true} #214#return; {645#true} is VALID [2022-04-28 02:41:41,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {645#true} assume true; {645#true} is VALID [2022-04-28 02:41:41,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {645#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {645#true} is VALID [2022-04-28 02:41:41,058 INFO L272 TraceCheckUtils]: 0: Hoare triple {645#true} call ULTIMATE.init(); {645#true} is VALID [2022-04-28 02:41:41,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:41:41,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885357012] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:41:41,058 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:41:41,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2022-04-28 02:41:41,059 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:41:41,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [963982853] [2022-04-28 02:41:41,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [963982853] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:41,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:41,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 02:41:41,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957086504] [2022-04-28 02:41:41,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:41:41,060 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 02:41:41,060 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:41:41,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:41,075 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:41,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 02:41:41,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:41,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 02:41:41,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-04-28 02:41:41,076 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:41,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:41,239 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2022-04-28 02:41:41,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 02:41:41,239 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 02:41:41,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:41:41,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:41,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2022-04-28 02:41:41,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:41,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2022-04-28 02:41:41,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 51 transitions. [2022-04-28 02:41:41,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:41,289 INFO L225 Difference]: With dead ends: 45 [2022-04-28 02:41:41,289 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 02:41:41,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2022-04-28 02:41:41,291 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 23 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:41:41,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 31 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:41:41,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 02:41:41,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2022-04-28 02:41:41,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:41:41,298 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:41:41,299 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:41:41,299 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:41:41,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:41,300 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-04-28 02:41:41,300 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-04-28 02:41:41,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:41,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:41,301 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 30 states. [2022-04-28 02:41:41,301 INFO L87 Difference]: Start difference. First operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 30 states. [2022-04-28 02:41:41,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:41,302 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-04-28 02:41:41,302 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-04-28 02:41:41,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:41,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:41,303 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:41:41,303 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:41:41,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:41:41,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-28 02:41:41,304 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2022-04-28 02:41:41,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:41:41,304 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-28 02:41:41,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:41,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 28 transitions. [2022-04-28 02:41:41,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:41,337 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-28 02:41:41,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 02:41:41,338 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:41:41,338 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:41:41,368 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-04-28 02:41:41,560 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-04-28 02:41:41,560 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:41:41,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:41:41,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1949651507, now seen corresponding path program 3 times [2022-04-28 02:41:41,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:41,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1517021703] [2022-04-28 02:41:41,569 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:41:41,569 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 02:41:41,569 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:41:41,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1949651507, now seen corresponding path program 4 times [2022-04-28 02:41:41,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:41:41,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171011146] [2022-04-28 02:41:41,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:41:41,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:41:41,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:41,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:41:41,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:41,685 INFO L290 TraceCheckUtils]: 0: Hoare triple {967#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {959#true} is VALID [2022-04-28 02:41:41,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {959#true} assume true; {959#true} is VALID [2022-04-28 02:41:41,686 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {959#true} {959#true} #214#return; {959#true} is VALID [2022-04-28 02:41:41,687 INFO L272 TraceCheckUtils]: 0: Hoare triple {959#true} call ULTIMATE.init(); {967#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:41:41,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {967#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {959#true} is VALID [2022-04-28 02:41:41,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {959#true} assume true; {959#true} is VALID [2022-04-28 02:41:41,687 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {959#true} {959#true} #214#return; {959#true} is VALID [2022-04-28 02:41:41,688 INFO L272 TraceCheckUtils]: 4: Hoare triple {959#true} call #t~ret37 := main(); {959#true} is VALID [2022-04-28 02:41:41,688 INFO L290 TraceCheckUtils]: 5: Hoare triple {959#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {964#(= main_~i~0 0)} is VALID [2022-04-28 02:41:41,688 INFO L290 TraceCheckUtils]: 6: Hoare triple {964#(= main_~i~0 0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {965#(and (= main_~j~0 0) (= main_~i~0 0))} is VALID [2022-04-28 02:41:41,689 INFO L290 TraceCheckUtils]: 7: Hoare triple {965#(and (= main_~j~0 0) (= main_~i~0 0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {965#(and (= main_~j~0 0) (= main_~i~0 0))} is VALID [2022-04-28 02:41:41,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {965#(and (= main_~j~0 0) (= main_~i~0 0))} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {965#(and (= main_~j~0 0) (= main_~i~0 0))} is VALID [2022-04-28 02:41:41,691 INFO L290 TraceCheckUtils]: 9: Hoare triple {965#(and (= main_~j~0 0) (= main_~i~0 0))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {965#(and (= main_~j~0 0) (= main_~i~0 0))} is VALID [2022-04-28 02:41:41,692 INFO L290 TraceCheckUtils]: 10: Hoare triple {965#(and (= main_~j~0 0) (= main_~i~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {966#(and (<= 1 main_~j~0) (= main_~i~0 0))} is VALID [2022-04-28 02:41:41,692 INFO L290 TraceCheckUtils]: 11: Hoare triple {966#(and (<= 1 main_~j~0) (= main_~i~0 0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {966#(and (<= 1 main_~j~0) (= main_~i~0 0))} is VALID [2022-04-28 02:41:41,693 INFO L290 TraceCheckUtils]: 12: Hoare triple {966#(and (<= 1 main_~j~0) (= main_~i~0 0))} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {960#false} is VALID [2022-04-28 02:41:41,693 INFO L290 TraceCheckUtils]: 13: Hoare triple {960#false} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {960#false} is VALID [2022-04-28 02:41:41,693 INFO L290 TraceCheckUtils]: 14: Hoare triple {960#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {960#false} is VALID [2022-04-28 02:41:41,693 INFO L290 TraceCheckUtils]: 15: Hoare triple {960#false} assume !(~j~0 <= ~n~0); {960#false} is VALID [2022-04-28 02:41:41,694 INFO L272 TraceCheckUtils]: 16: Hoare triple {960#false} call __VERIFIER_assert((if 2 == ~i~0 then 1 else 0)); {960#false} is VALID [2022-04-28 02:41:41,694 INFO L290 TraceCheckUtils]: 17: Hoare triple {960#false} ~cond := #in~cond; {960#false} is VALID [2022-04-28 02:41:41,694 INFO L290 TraceCheckUtils]: 18: Hoare triple {960#false} assume 0 == ~cond; {960#false} is VALID [2022-04-28 02:41:41,694 INFO L290 TraceCheckUtils]: 19: Hoare triple {960#false} assume !false; {960#false} is VALID [2022-04-28 02:41:41,694 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:41:41,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:41:41,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171011146] [2022-04-28 02:41:41,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171011146] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:41:41,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325247408] [2022-04-28 02:41:41,695 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:41:41,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:41:41,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:41:41,696 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-04-28 02:41:41,731 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-04-28 02:41:41,786 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:41:41,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:41:41,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 02:41:41,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:41,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:41:41,990 INFO L272 TraceCheckUtils]: 0: Hoare triple {959#true} call ULTIMATE.init(); {959#true} is VALID [2022-04-28 02:41:41,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {959#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {959#true} is VALID [2022-04-28 02:41:41,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {959#true} assume true; {959#true} is VALID [2022-04-28 02:41:41,991 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {959#true} {959#true} #214#return; {959#true} is VALID [2022-04-28 02:41:41,991 INFO L272 TraceCheckUtils]: 4: Hoare triple {959#true} call #t~ret37 := main(); {959#true} is VALID [2022-04-28 02:41:41,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {959#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {986#(<= 5 main_~n~0)} is VALID [2022-04-28 02:41:41,992 INFO L290 TraceCheckUtils]: 6: Hoare triple {986#(<= 5 main_~n~0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {990#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-28 02:41:41,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {990#(and (<= 5 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {990#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-28 02:41:41,994 INFO L290 TraceCheckUtils]: 8: Hoare triple {990#(and (<= 5 main_~n~0) (<= main_~j~0 0))} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {990#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-28 02:41:41,994 INFO L290 TraceCheckUtils]: 9: Hoare triple {990#(and (<= 5 main_~n~0) (<= main_~j~0 0))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {990#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-28 02:41:41,995 INFO L290 TraceCheckUtils]: 10: Hoare triple {990#(and (<= 5 main_~n~0) (<= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1003#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:41:41,996 INFO L290 TraceCheckUtils]: 11: Hoare triple {1003#(and (<= 5 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1003#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:41:41,997 INFO L290 TraceCheckUtils]: 12: Hoare triple {1003#(and (<= 5 main_~n~0) (<= main_~j~0 1))} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {1003#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:41:42,004 INFO L290 TraceCheckUtils]: 13: Hoare triple {1003#(and (<= 5 main_~n~0) (<= main_~j~0 1))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1003#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:41:42,005 INFO L290 TraceCheckUtils]: 14: Hoare triple {1003#(and (<= 5 main_~n~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1016#(and (<= 5 main_~n~0) (<= main_~j~0 2))} is VALID [2022-04-28 02:41:42,006 INFO L290 TraceCheckUtils]: 15: Hoare triple {1016#(and (<= 5 main_~n~0) (<= main_~j~0 2))} assume !(~j~0 <= ~n~0); {960#false} is VALID [2022-04-28 02:41:42,006 INFO L272 TraceCheckUtils]: 16: Hoare triple {960#false} call __VERIFIER_assert((if 2 == ~i~0 then 1 else 0)); {960#false} is VALID [2022-04-28 02:41:42,006 INFO L290 TraceCheckUtils]: 17: Hoare triple {960#false} ~cond := #in~cond; {960#false} is VALID [2022-04-28 02:41:42,006 INFO L290 TraceCheckUtils]: 18: Hoare triple {960#false} assume 0 == ~cond; {960#false} is VALID [2022-04-28 02:41:42,006 INFO L290 TraceCheckUtils]: 19: Hoare triple {960#false} assume !false; {960#false} is VALID [2022-04-28 02:41:42,006 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:41:42,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:41:42,139 INFO L290 TraceCheckUtils]: 19: Hoare triple {960#false} assume !false; {960#false} is VALID [2022-04-28 02:41:42,140 INFO L290 TraceCheckUtils]: 18: Hoare triple {960#false} assume 0 == ~cond; {960#false} is VALID [2022-04-28 02:41:42,140 INFO L290 TraceCheckUtils]: 17: Hoare triple {960#false} ~cond := #in~cond; {960#false} is VALID [2022-04-28 02:41:42,140 INFO L272 TraceCheckUtils]: 16: Hoare triple {960#false} call __VERIFIER_assert((if 2 == ~i~0 then 1 else 0)); {960#false} is VALID [2022-04-28 02:41:42,141 INFO L290 TraceCheckUtils]: 15: Hoare triple {1044#(<= main_~j~0 main_~n~0)} assume !(~j~0 <= ~n~0); {960#false} is VALID [2022-04-28 02:41:42,141 INFO L290 TraceCheckUtils]: 14: Hoare triple {1048#(<= (+ main_~j~0 1) main_~n~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1044#(<= main_~j~0 main_~n~0)} is VALID [2022-04-28 02:41:42,142 INFO L290 TraceCheckUtils]: 13: Hoare triple {1048#(<= (+ main_~j~0 1) main_~n~0)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1048#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-28 02:41:42,142 INFO L290 TraceCheckUtils]: 12: Hoare triple {1048#(<= (+ main_~j~0 1) main_~n~0)} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {1048#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-28 02:41:42,142 INFO L290 TraceCheckUtils]: 11: Hoare triple {1048#(<= (+ main_~j~0 1) main_~n~0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1048#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-28 02:41:42,143 INFO L290 TraceCheckUtils]: 10: Hoare triple {1061#(<= (+ main_~j~0 2) main_~n~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1048#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-28 02:41:42,143 INFO L290 TraceCheckUtils]: 9: Hoare triple {1061#(<= (+ main_~j~0 2) main_~n~0)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1061#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-28 02:41:42,145 INFO L290 TraceCheckUtils]: 8: Hoare triple {1061#(<= (+ main_~j~0 2) main_~n~0)} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {1061#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-28 02:41:42,145 INFO L290 TraceCheckUtils]: 7: Hoare triple {1061#(<= (+ main_~j~0 2) main_~n~0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1061#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-28 02:41:42,146 INFO L290 TraceCheckUtils]: 6: Hoare triple {1074#(<= 2 main_~n~0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {1061#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-28 02:41:42,146 INFO L290 TraceCheckUtils]: 5: Hoare triple {959#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {1074#(<= 2 main_~n~0)} is VALID [2022-04-28 02:41:42,146 INFO L272 TraceCheckUtils]: 4: Hoare triple {959#true} call #t~ret37 := main(); {959#true} is VALID [2022-04-28 02:41:42,147 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {959#true} {959#true} #214#return; {959#true} is VALID [2022-04-28 02:41:42,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {959#true} assume true; {959#true} is VALID [2022-04-28 02:41:42,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {959#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {959#true} is VALID [2022-04-28 02:41:42,147 INFO L272 TraceCheckUtils]: 0: Hoare triple {959#true} call ULTIMATE.init(); {959#true} is VALID [2022-04-28 02:41:42,147 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:41:42,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325247408] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:41:42,148 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:41:42,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-04-28 02:41:42,148 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:41:42,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1517021703] [2022-04-28 02:41:42,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1517021703] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:42,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:42,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 02:41:42,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128678885] [2022-04-28 02:41:42,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:41:42,149 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 02:41:42,149 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:41:42,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:42,164 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:42,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 02:41:42,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:42,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 02:41:42,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-04-28 02:41:42,165 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:42,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:42,348 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-28 02:41:42,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 02:41:42,349 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 02:41:42,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:41:42,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:42,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2022-04-28 02:41:42,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:42,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2022-04-28 02:41:42,354 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 54 transitions. [2022-04-28 02:41:42,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:42,396 INFO L225 Difference]: With dead ends: 57 [2022-04-28 02:41:42,396 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 02:41:42,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-04-28 02:41:42,400 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 19 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:41:42,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 26 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:41:42,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 02:41:42,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2022-04-28 02:41:42,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:41:42,426 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 35 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:41:42,426 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 35 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:41:42,426 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 35 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:41:42,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:42,428 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2022-04-28 02:41:42,428 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-04-28 02:41:42,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:42,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:42,429 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 38 states. [2022-04-28 02:41:42,429 INFO L87 Difference]: Start difference. First operand has 35 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 38 states. [2022-04-28 02:41:42,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:42,430 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2022-04-28 02:41:42,430 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-04-28 02:41:42,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:42,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:42,431 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:41:42,431 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:41:42,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:41:42,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-04-28 02:41:42,432 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 20 [2022-04-28 02:41:42,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:41:42,433 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-04-28 02:41:42,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:42,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 39 transitions. [2022-04-28 02:41:42,471 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:42,471 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-28 02:41:42,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 02:41:42,472 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:41:42,472 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:41:42,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-28 02:41:42,691 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-04-28 02:41:42,692 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:41:42,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:41:42,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1140304881, now seen corresponding path program 1 times [2022-04-28 02:41:42,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:42,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [971580562] [2022-04-28 02:41:42,707 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:41:42,707 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 02:41:42,708 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:41:42,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1140304881, now seen corresponding path program 2 times [2022-04-28 02:41:42,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:41:42,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632276937] [2022-04-28 02:41:42,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:41:42,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:41:42,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:42,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:41:42,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:42,808 INFO L290 TraceCheckUtils]: 0: Hoare triple {1368#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {1359#true} is VALID [2022-04-28 02:41:42,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {1359#true} assume true; {1359#true} is VALID [2022-04-28 02:41:42,808 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1359#true} {1359#true} #214#return; {1359#true} is VALID [2022-04-28 02:41:42,809 INFO L272 TraceCheckUtils]: 0: Hoare triple {1359#true} call ULTIMATE.init(); {1368#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:41:42,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {1368#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {1359#true} is VALID [2022-04-28 02:41:42,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {1359#true} assume true; {1359#true} is VALID [2022-04-28 02:41:42,810 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1359#true} {1359#true} #214#return; {1359#true} is VALID [2022-04-28 02:41:42,810 INFO L272 TraceCheckUtils]: 4: Hoare triple {1359#true} call #t~ret37 := main(); {1359#true} is VALID [2022-04-28 02:41:42,810 INFO L290 TraceCheckUtils]: 5: Hoare triple {1359#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {1364#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-28 02:41:42,811 INFO L290 TraceCheckUtils]: 6: Hoare triple {1364#(= (+ main_~n~0 (- 5)) 0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {1365#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:42,811 INFO L290 TraceCheckUtils]: 7: Hoare triple {1365#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1365#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:42,812 INFO L290 TraceCheckUtils]: 8: Hoare triple {1365#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {1365#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:42,812 INFO L290 TraceCheckUtils]: 9: Hoare triple {1365#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1365#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:42,813 INFO L290 TraceCheckUtils]: 10: Hoare triple {1365#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1366#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:42,813 INFO L290 TraceCheckUtils]: 11: Hoare triple {1366#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1366#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:42,814 INFO L290 TraceCheckUtils]: 12: Hoare triple {1366#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} assume !(~i~0 == ~j~0); {1366#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:42,814 INFO L290 TraceCheckUtils]: 13: Hoare triple {1366#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1366#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:42,815 INFO L290 TraceCheckUtils]: 14: Hoare triple {1366#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1367#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:42,815 INFO L290 TraceCheckUtils]: 15: Hoare triple {1367#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} assume !(~j~0 <= ~n~0); {1360#false} is VALID [2022-04-28 02:41:42,816 INFO L272 TraceCheckUtils]: 16: Hoare triple {1360#false} call __VERIFIER_assert((if 2 == ~i~0 then 1 else 0)); {1360#false} is VALID [2022-04-28 02:41:42,816 INFO L290 TraceCheckUtils]: 17: Hoare triple {1360#false} ~cond := #in~cond; {1360#false} is VALID [2022-04-28 02:41:42,816 INFO L290 TraceCheckUtils]: 18: Hoare triple {1360#false} assume 0 == ~cond; {1360#false} is VALID [2022-04-28 02:41:42,816 INFO L290 TraceCheckUtils]: 19: Hoare triple {1360#false} assume !false; {1360#false} is VALID [2022-04-28 02:41:42,816 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:41:42,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:41:42,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632276937] [2022-04-28 02:41:42,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632276937] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:41:42,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618439462] [2022-04-28 02:41:42,817 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:41:42,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:41:42,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:41:42,818 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-04-28 02:41:42,835 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-04-28 02:41:42,891 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:41:42,891 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:41:42,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 02:41:42,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:42,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:41:43,063 INFO L272 TraceCheckUtils]: 0: Hoare triple {1359#true} call ULTIMATE.init(); {1359#true} is VALID [2022-04-28 02:41:43,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {1359#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {1359#true} is VALID [2022-04-28 02:41:43,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {1359#true} assume true; {1359#true} is VALID [2022-04-28 02:41:43,064 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1359#true} {1359#true} #214#return; {1359#true} is VALID [2022-04-28 02:41:43,064 INFO L272 TraceCheckUtils]: 4: Hoare triple {1359#true} call #t~ret37 := main(); {1359#true} is VALID [2022-04-28 02:41:43,065 INFO L290 TraceCheckUtils]: 5: Hoare triple {1359#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {1387#(<= 5 main_~n~0)} is VALID [2022-04-28 02:41:43,065 INFO L290 TraceCheckUtils]: 6: Hoare triple {1387#(<= 5 main_~n~0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {1391#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-28 02:41:43,066 INFO L290 TraceCheckUtils]: 7: Hoare triple {1391#(and (<= 5 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1391#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-28 02:41:43,067 INFO L290 TraceCheckUtils]: 8: Hoare triple {1391#(and (<= 5 main_~n~0) (<= main_~j~0 0))} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {1391#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-28 02:41:43,067 INFO L290 TraceCheckUtils]: 9: Hoare triple {1391#(and (<= 5 main_~n~0) (<= main_~j~0 0))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1391#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-28 02:41:43,068 INFO L290 TraceCheckUtils]: 10: Hoare triple {1391#(and (<= 5 main_~n~0) (<= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1404#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:41:43,068 INFO L290 TraceCheckUtils]: 11: Hoare triple {1404#(and (<= 5 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1404#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:41:43,069 INFO L290 TraceCheckUtils]: 12: Hoare triple {1404#(and (<= 5 main_~n~0) (<= main_~j~0 1))} assume !(~i~0 == ~j~0); {1404#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:41:43,069 INFO L290 TraceCheckUtils]: 13: Hoare triple {1404#(and (<= 5 main_~n~0) (<= main_~j~0 1))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1404#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:41:43,070 INFO L290 TraceCheckUtils]: 14: Hoare triple {1404#(and (<= 5 main_~n~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1417#(and (<= 5 main_~n~0) (<= main_~j~0 2))} is VALID [2022-04-28 02:41:43,070 INFO L290 TraceCheckUtils]: 15: Hoare triple {1417#(and (<= 5 main_~n~0) (<= main_~j~0 2))} assume !(~j~0 <= ~n~0); {1360#false} is VALID [2022-04-28 02:41:43,070 INFO L272 TraceCheckUtils]: 16: Hoare triple {1360#false} call __VERIFIER_assert((if 2 == ~i~0 then 1 else 0)); {1360#false} is VALID [2022-04-28 02:41:43,070 INFO L290 TraceCheckUtils]: 17: Hoare triple {1360#false} ~cond := #in~cond; {1360#false} is VALID [2022-04-28 02:41:43,071 INFO L290 TraceCheckUtils]: 18: Hoare triple {1360#false} assume 0 == ~cond; {1360#false} is VALID [2022-04-28 02:41:43,071 INFO L290 TraceCheckUtils]: 19: Hoare triple {1360#false} assume !false; {1360#false} is VALID [2022-04-28 02:41:43,071 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:41:43,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:41:43,225 INFO L290 TraceCheckUtils]: 19: Hoare triple {1360#false} assume !false; {1360#false} is VALID [2022-04-28 02:41:43,225 INFO L290 TraceCheckUtils]: 18: Hoare triple {1360#false} assume 0 == ~cond; {1360#false} is VALID [2022-04-28 02:41:43,226 INFO L290 TraceCheckUtils]: 17: Hoare triple {1360#false} ~cond := #in~cond; {1360#false} is VALID [2022-04-28 02:41:43,226 INFO L272 TraceCheckUtils]: 16: Hoare triple {1360#false} call __VERIFIER_assert((if 2 == ~i~0 then 1 else 0)); {1360#false} is VALID [2022-04-28 02:41:43,226 INFO L290 TraceCheckUtils]: 15: Hoare triple {1445#(<= main_~j~0 main_~n~0)} assume !(~j~0 <= ~n~0); {1360#false} is VALID [2022-04-28 02:41:43,227 INFO L290 TraceCheckUtils]: 14: Hoare triple {1449#(<= (+ main_~j~0 1) main_~n~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1445#(<= main_~j~0 main_~n~0)} is VALID [2022-04-28 02:41:43,227 INFO L290 TraceCheckUtils]: 13: Hoare triple {1449#(<= (+ main_~j~0 1) main_~n~0)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1449#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-28 02:41:43,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {1449#(<= (+ main_~j~0 1) main_~n~0)} assume !(~i~0 == ~j~0); {1449#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-28 02:41:43,228 INFO L290 TraceCheckUtils]: 11: Hoare triple {1449#(<= (+ main_~j~0 1) main_~n~0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1449#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-28 02:41:43,229 INFO L290 TraceCheckUtils]: 10: Hoare triple {1462#(<= (+ main_~j~0 2) main_~n~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1449#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-28 02:41:43,229 INFO L290 TraceCheckUtils]: 9: Hoare triple {1462#(<= (+ main_~j~0 2) main_~n~0)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1462#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-28 02:41:43,230 INFO L290 TraceCheckUtils]: 8: Hoare triple {1462#(<= (+ main_~j~0 2) main_~n~0)} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {1462#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-28 02:41:43,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {1462#(<= (+ main_~j~0 2) main_~n~0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1462#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-28 02:41:43,231 INFO L290 TraceCheckUtils]: 6: Hoare triple {1475#(<= 2 main_~n~0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {1462#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-28 02:41:43,232 INFO L290 TraceCheckUtils]: 5: Hoare triple {1359#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {1475#(<= 2 main_~n~0)} is VALID [2022-04-28 02:41:43,232 INFO L272 TraceCheckUtils]: 4: Hoare triple {1359#true} call #t~ret37 := main(); {1359#true} is VALID [2022-04-28 02:41:43,232 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1359#true} {1359#true} #214#return; {1359#true} is VALID [2022-04-28 02:41:43,232 INFO L290 TraceCheckUtils]: 2: Hoare triple {1359#true} assume true; {1359#true} is VALID [2022-04-28 02:41:43,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {1359#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {1359#true} is VALID [2022-04-28 02:41:43,232 INFO L272 TraceCheckUtils]: 0: Hoare triple {1359#true} call ULTIMATE.init(); {1359#true} is VALID [2022-04-28 02:41:43,232 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:41:43,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618439462] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:41:43,233 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:41:43,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2022-04-28 02:41:43,233 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:41:43,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [971580562] [2022-04-28 02:41:43,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [971580562] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:43,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:43,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 02:41:43,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599615478] [2022-04-28 02:41:43,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:41:43,234 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 02:41:43,234 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:41:43,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:43,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:43,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 02:41:43,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:43,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 02:41:43,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2022-04-28 02:41:43,253 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:43,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:43,454 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2022-04-28 02:41:43,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 02:41:43,454 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 02:41:43,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:41:43,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:43,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 56 transitions. [2022-04-28 02:41:43,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:43,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 56 transitions. [2022-04-28 02:41:43,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 56 transitions. [2022-04-28 02:41:43,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:43,511 INFO L225 Difference]: With dead ends: 68 [2022-04-28 02:41:43,511 INFO L226 Difference]: Without dead ends: 49 [2022-04-28 02:41:43,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2022-04-28 02:41:43,512 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 28 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:41:43,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 32 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:41:43,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-28 02:41:43,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2022-04-28 02:41:43,540 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:41:43,540 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 43 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:41:43,541 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 43 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:41:43,541 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 43 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:41:43,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:43,542 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2022-04-28 02:41:43,542 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2022-04-28 02:41:43,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:43,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:43,543 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 49 states. [2022-04-28 02:41:43,543 INFO L87 Difference]: Start difference. First operand has 43 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 49 states. [2022-04-28 02:41:43,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:43,545 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2022-04-28 02:41:43,545 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2022-04-28 02:41:43,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:43,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:43,546 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:41:43,546 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:41:43,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:41:43,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2022-04-28 02:41:43,547 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 20 [2022-04-28 02:41:43,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:41:43,547 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2022-04-28 02:41:43,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:43,548 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 48 transitions. [2022-04-28 02:41:43,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:43,597 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-28 02:41:43,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 02:41:43,598 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:41:43,598 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:41:43,617 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-04-28 02:41:43,807 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-04-28 02:41:43,807 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:41:43,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:41:43,808 INFO L85 PathProgramCache]: Analyzing trace with hash -162258006, now seen corresponding path program 3 times [2022-04-28 02:41:43,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:43,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [462000208] [2022-04-28 02:41:43,813 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:41:43,813 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 02:41:43,813 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:41:43,813 INFO L85 PathProgramCache]: Analyzing trace with hash -162258006, now seen corresponding path program 4 times [2022-04-28 02:41:43,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:41:43,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372980738] [2022-04-28 02:41:43,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:41:43,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:41:43,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:43,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:41:43,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:43,900 INFO L290 TraceCheckUtils]: 0: Hoare triple {1830#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {1820#true} is VALID [2022-04-28 02:41:43,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {1820#true} assume true; {1820#true} is VALID [2022-04-28 02:41:43,900 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1820#true} {1820#true} #214#return; {1820#true} is VALID [2022-04-28 02:41:43,901 INFO L272 TraceCheckUtils]: 0: Hoare triple {1820#true} call ULTIMATE.init(); {1830#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:41:43,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {1830#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {1820#true} is VALID [2022-04-28 02:41:43,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {1820#true} assume true; {1820#true} is VALID [2022-04-28 02:41:43,902 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1820#true} {1820#true} #214#return; {1820#true} is VALID [2022-04-28 02:41:43,902 INFO L272 TraceCheckUtils]: 4: Hoare triple {1820#true} call #t~ret37 := main(); {1820#true} is VALID [2022-04-28 02:41:43,902 INFO L290 TraceCheckUtils]: 5: Hoare triple {1820#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {1825#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-28 02:41:43,903 INFO L290 TraceCheckUtils]: 6: Hoare triple {1825#(= (+ main_~n~0 (- 5)) 0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {1826#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:43,903 INFO L290 TraceCheckUtils]: 7: Hoare triple {1826#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1826#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:43,904 INFO L290 TraceCheckUtils]: 8: Hoare triple {1826#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {1826#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:43,904 INFO L290 TraceCheckUtils]: 9: Hoare triple {1826#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1826#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:43,905 INFO L290 TraceCheckUtils]: 10: Hoare triple {1826#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1827#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:43,905 INFO L290 TraceCheckUtils]: 11: Hoare triple {1827#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1827#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:43,906 INFO L290 TraceCheckUtils]: 12: Hoare triple {1827#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} assume !(~i~0 == ~j~0); {1827#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:43,906 INFO L290 TraceCheckUtils]: 13: Hoare triple {1827#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1827#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:43,907 INFO L290 TraceCheckUtils]: 14: Hoare triple {1827#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1828#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:43,907 INFO L290 TraceCheckUtils]: 15: Hoare triple {1828#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1828#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:43,908 INFO L290 TraceCheckUtils]: 16: Hoare triple {1828#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} assume !(~i~0 == ~j~0); {1828#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:43,908 INFO L290 TraceCheckUtils]: 17: Hoare triple {1828#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1828#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:43,909 INFO L290 TraceCheckUtils]: 18: Hoare triple {1828#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1829#(and (= (+ main_~n~0 (- 5)) 0) (<= main_~j~0 3))} is VALID [2022-04-28 02:41:43,909 INFO L290 TraceCheckUtils]: 19: Hoare triple {1829#(and (= (+ main_~n~0 (- 5)) 0) (<= main_~j~0 3))} assume !(~j~0 <= ~n~0); {1821#false} is VALID [2022-04-28 02:41:43,909 INFO L272 TraceCheckUtils]: 20: Hoare triple {1821#false} call __VERIFIER_assert((if 2 == ~i~0 then 1 else 0)); {1821#false} is VALID [2022-04-28 02:41:43,909 INFO L290 TraceCheckUtils]: 21: Hoare triple {1821#false} ~cond := #in~cond; {1821#false} is VALID [2022-04-28 02:41:43,909 INFO L290 TraceCheckUtils]: 22: Hoare triple {1821#false} assume 0 == ~cond; {1821#false} is VALID [2022-04-28 02:41:43,910 INFO L290 TraceCheckUtils]: 23: Hoare triple {1821#false} assume !false; {1821#false} is VALID [2022-04-28 02:41:43,910 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:41:43,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:41:43,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372980738] [2022-04-28 02:41:43,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372980738] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:41:43,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007467026] [2022-04-28 02:41:43,910 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:41:43,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:41:43,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:41:43,912 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-04-28 02:41:43,922 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-04-28 02:41:44,001 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:41:44,002 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:41:44,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 02:41:44,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:44,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:41:44,252 INFO L272 TraceCheckUtils]: 0: Hoare triple {1820#true} call ULTIMATE.init(); {1820#true} is VALID [2022-04-28 02:41:44,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {1820#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {1820#true} is VALID [2022-04-28 02:41:44,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {1820#true} assume true; {1820#true} is VALID [2022-04-28 02:41:44,253 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1820#true} {1820#true} #214#return; {1820#true} is VALID [2022-04-28 02:41:44,253 INFO L272 TraceCheckUtils]: 4: Hoare triple {1820#true} call #t~ret37 := main(); {1820#true} is VALID [2022-04-28 02:41:44,254 INFO L290 TraceCheckUtils]: 5: Hoare triple {1820#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {1849#(<= 5 main_~n~0)} is VALID [2022-04-28 02:41:44,259 INFO L290 TraceCheckUtils]: 6: Hoare triple {1849#(<= 5 main_~n~0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {1853#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-28 02:41:44,260 INFO L290 TraceCheckUtils]: 7: Hoare triple {1853#(and (<= 5 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1853#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-28 02:41:44,261 INFO L290 TraceCheckUtils]: 8: Hoare triple {1853#(and (<= 5 main_~n~0) (<= main_~j~0 0))} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {1853#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-28 02:41:44,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {1853#(and (<= 5 main_~n~0) (<= main_~j~0 0))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1853#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-28 02:41:44,262 INFO L290 TraceCheckUtils]: 10: Hoare triple {1853#(and (<= 5 main_~n~0) (<= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1866#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:41:44,262 INFO L290 TraceCheckUtils]: 11: Hoare triple {1866#(and (<= 5 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1866#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:41:44,263 INFO L290 TraceCheckUtils]: 12: Hoare triple {1866#(and (<= 5 main_~n~0) (<= main_~j~0 1))} assume !(~i~0 == ~j~0); {1866#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:41:44,263 INFO L290 TraceCheckUtils]: 13: Hoare triple {1866#(and (<= 5 main_~n~0) (<= main_~j~0 1))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1866#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:41:44,264 INFO L290 TraceCheckUtils]: 14: Hoare triple {1866#(and (<= 5 main_~n~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1879#(and (<= 5 main_~n~0) (<= main_~j~0 2))} is VALID [2022-04-28 02:41:44,264 INFO L290 TraceCheckUtils]: 15: Hoare triple {1879#(and (<= 5 main_~n~0) (<= main_~j~0 2))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1879#(and (<= 5 main_~n~0) (<= main_~j~0 2))} is VALID [2022-04-28 02:41:44,265 INFO L290 TraceCheckUtils]: 16: Hoare triple {1879#(and (<= 5 main_~n~0) (<= main_~j~0 2))} assume !(~i~0 == ~j~0); {1879#(and (<= 5 main_~n~0) (<= main_~j~0 2))} is VALID [2022-04-28 02:41:44,265 INFO L290 TraceCheckUtils]: 17: Hoare triple {1879#(and (<= 5 main_~n~0) (<= main_~j~0 2))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1879#(and (<= 5 main_~n~0) (<= main_~j~0 2))} is VALID [2022-04-28 02:41:44,266 INFO L290 TraceCheckUtils]: 18: Hoare triple {1879#(and (<= 5 main_~n~0) (<= main_~j~0 2))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1892#(and (<= 5 main_~n~0) (<= main_~j~0 3))} is VALID [2022-04-28 02:41:44,266 INFO L290 TraceCheckUtils]: 19: Hoare triple {1892#(and (<= 5 main_~n~0) (<= main_~j~0 3))} assume !(~j~0 <= ~n~0); {1821#false} is VALID [2022-04-28 02:41:44,266 INFO L272 TraceCheckUtils]: 20: Hoare triple {1821#false} call __VERIFIER_assert((if 2 == ~i~0 then 1 else 0)); {1821#false} is VALID [2022-04-28 02:41:44,267 INFO L290 TraceCheckUtils]: 21: Hoare triple {1821#false} ~cond := #in~cond; {1821#false} is VALID [2022-04-28 02:41:44,267 INFO L290 TraceCheckUtils]: 22: Hoare triple {1821#false} assume 0 == ~cond; {1821#false} is VALID [2022-04-28 02:41:44,267 INFO L290 TraceCheckUtils]: 23: Hoare triple {1821#false} assume !false; {1821#false} is VALID [2022-04-28 02:41:44,267 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:41:44,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:41:44,467 INFO L290 TraceCheckUtils]: 23: Hoare triple {1821#false} assume !false; {1821#false} is VALID [2022-04-28 02:41:44,467 INFO L290 TraceCheckUtils]: 22: Hoare triple {1821#false} assume 0 == ~cond; {1821#false} is VALID [2022-04-28 02:41:44,468 INFO L290 TraceCheckUtils]: 21: Hoare triple {1821#false} ~cond := #in~cond; {1821#false} is VALID [2022-04-28 02:41:44,468 INFO L272 TraceCheckUtils]: 20: Hoare triple {1821#false} call __VERIFIER_assert((if 2 == ~i~0 then 1 else 0)); {1821#false} is VALID [2022-04-28 02:41:44,468 INFO L290 TraceCheckUtils]: 19: Hoare triple {1920#(<= main_~j~0 main_~n~0)} assume !(~j~0 <= ~n~0); {1821#false} is VALID [2022-04-28 02:41:44,469 INFO L290 TraceCheckUtils]: 18: Hoare triple {1924#(<= (+ main_~j~0 1) main_~n~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1920#(<= main_~j~0 main_~n~0)} is VALID [2022-04-28 02:41:44,469 INFO L290 TraceCheckUtils]: 17: Hoare triple {1924#(<= (+ main_~j~0 1) main_~n~0)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1924#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-28 02:41:44,470 INFO L290 TraceCheckUtils]: 16: Hoare triple {1924#(<= (+ main_~j~0 1) main_~n~0)} assume !(~i~0 == ~j~0); {1924#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-28 02:41:44,470 INFO L290 TraceCheckUtils]: 15: Hoare triple {1924#(<= (+ main_~j~0 1) main_~n~0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1924#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-28 02:41:44,471 INFO L290 TraceCheckUtils]: 14: Hoare triple {1937#(<= (+ main_~j~0 2) main_~n~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1924#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-28 02:41:44,471 INFO L290 TraceCheckUtils]: 13: Hoare triple {1937#(<= (+ main_~j~0 2) main_~n~0)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1937#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-28 02:41:44,472 INFO L290 TraceCheckUtils]: 12: Hoare triple {1937#(<= (+ main_~j~0 2) main_~n~0)} assume !(~i~0 == ~j~0); {1937#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-28 02:41:44,473 INFO L290 TraceCheckUtils]: 11: Hoare triple {1937#(<= (+ main_~j~0 2) main_~n~0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1937#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-28 02:41:44,473 INFO L290 TraceCheckUtils]: 10: Hoare triple {1950#(<= (+ main_~j~0 3) main_~n~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1937#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-28 02:41:44,474 INFO L290 TraceCheckUtils]: 9: Hoare triple {1950#(<= (+ main_~j~0 3) main_~n~0)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1950#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2022-04-28 02:41:44,474 INFO L290 TraceCheckUtils]: 8: Hoare triple {1950#(<= (+ main_~j~0 3) main_~n~0)} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {1950#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2022-04-28 02:41:44,475 INFO L290 TraceCheckUtils]: 7: Hoare triple {1950#(<= (+ main_~j~0 3) main_~n~0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1950#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2022-04-28 02:41:44,475 INFO L290 TraceCheckUtils]: 6: Hoare triple {1963#(<= 3 main_~n~0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {1950#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2022-04-28 02:41:44,476 INFO L290 TraceCheckUtils]: 5: Hoare triple {1820#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {1963#(<= 3 main_~n~0)} is VALID [2022-04-28 02:41:44,476 INFO L272 TraceCheckUtils]: 4: Hoare triple {1820#true} call #t~ret37 := main(); {1820#true} is VALID [2022-04-28 02:41:44,476 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1820#true} {1820#true} #214#return; {1820#true} is VALID [2022-04-28 02:41:44,476 INFO L290 TraceCheckUtils]: 2: Hoare triple {1820#true} assume true; {1820#true} is VALID [2022-04-28 02:41:44,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {1820#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {1820#true} is VALID [2022-04-28 02:41:44,476 INFO L272 TraceCheckUtils]: 0: Hoare triple {1820#true} call ULTIMATE.init(); {1820#true} is VALID [2022-04-28 02:41:44,479 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:41:44,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007467026] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:41:44,479 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:41:44,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2022-04-28 02:41:44,479 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:41:44,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [462000208] [2022-04-28 02:41:44,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [462000208] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:44,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:44,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 02:41:44,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588254015] [2022-04-28 02:41:44,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:41:44,480 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 02:41:44,481 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:41:44,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:44,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:44,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 02:41:44,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:44,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 02:41:44,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=192, Unknown=0, NotChecked=0, Total=306 [2022-04-28 02:41:44,501 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:44,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:44,743 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2022-04-28 02:41:44,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 02:41:44,743 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 02:41:44,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:41:44,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:44,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 61 transitions. [2022-04-28 02:41:44,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:44,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 61 transitions. [2022-04-28 02:41:44,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 61 transitions. [2022-04-28 02:41:44,805 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:44,808 INFO L225 Difference]: With dead ends: 80 [2022-04-28 02:41:44,808 INFO L226 Difference]: Without dead ends: 57 [2022-04-28 02:41:44,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=241, Unknown=0, NotChecked=0, Total=380 [2022-04-28 02:41:44,810 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 33 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:41:44,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 33 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:41:44,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-28 02:41:44,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2022-04-28 02:41:44,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:41:44,863 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 51 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:41:44,864 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 51 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:41:44,864 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 51 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:41:44,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:44,866 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2022-04-28 02:41:44,866 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2022-04-28 02:41:44,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:44,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:44,867 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 57 states. [2022-04-28 02:41:44,867 INFO L87 Difference]: Start difference. First operand has 51 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 57 states. [2022-04-28 02:41:44,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:44,869 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2022-04-28 02:41:44,869 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2022-04-28 02:41:44,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:44,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:44,870 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:41:44,870 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:41:44,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:41:44,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2022-04-28 02:41:44,872 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 24 [2022-04-28 02:41:44,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:41:44,872 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2022-04-28 02:41:44,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:44,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 57 transitions. [2022-04-28 02:41:44,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:44,933 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2022-04-28 02:41:44,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 02:41:44,934 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:41:44,934 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:41:44,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-28 02:41:45,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:41:45,151 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:41:45,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:41:45,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1312024861, now seen corresponding path program 5 times [2022-04-28 02:41:45,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:45,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [897112923] [2022-04-28 02:41:45,158 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:41:45,158 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 02:41:45,158 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:41:45,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1312024861, now seen corresponding path program 6 times [2022-04-28 02:41:45,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:41:45,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061554348] [2022-04-28 02:41:45,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:41:45,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:41:45,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:45,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:41:45,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:45,305 INFO L290 TraceCheckUtils]: 0: Hoare triple {2375#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {2364#true} is VALID [2022-04-28 02:41:45,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {2364#true} assume true; {2364#true} is VALID [2022-04-28 02:41:45,305 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2364#true} {2364#true} #214#return; {2364#true} is VALID [2022-04-28 02:41:45,306 INFO L272 TraceCheckUtils]: 0: Hoare triple {2364#true} call ULTIMATE.init(); {2375#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:41:45,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {2375#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {2364#true} is VALID [2022-04-28 02:41:45,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {2364#true} assume true; {2364#true} is VALID [2022-04-28 02:41:45,307 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2364#true} {2364#true} #214#return; {2364#true} is VALID [2022-04-28 02:41:45,307 INFO L272 TraceCheckUtils]: 4: Hoare triple {2364#true} call #t~ret37 := main(); {2364#true} is VALID [2022-04-28 02:41:45,307 INFO L290 TraceCheckUtils]: 5: Hoare triple {2364#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {2369#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-28 02:41:45,308 INFO L290 TraceCheckUtils]: 6: Hoare triple {2369#(= (+ main_~n~0 (- 5)) 0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {2370#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:45,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {2370#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {2370#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:45,309 INFO L290 TraceCheckUtils]: 8: Hoare triple {2370#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {2370#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:45,310 INFO L290 TraceCheckUtils]: 9: Hoare triple {2370#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {2370#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:45,310 INFO L290 TraceCheckUtils]: 10: Hoare triple {2370#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2371#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:45,311 INFO L290 TraceCheckUtils]: 11: Hoare triple {2371#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {2371#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:45,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {2371#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} assume !(~i~0 == ~j~0); {2371#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:45,312 INFO L290 TraceCheckUtils]: 13: Hoare triple {2371#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {2371#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:45,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {2371#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2372#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:45,313 INFO L290 TraceCheckUtils]: 15: Hoare triple {2372#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {2372#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:45,313 INFO L290 TraceCheckUtils]: 16: Hoare triple {2372#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} assume !(~i~0 == ~j~0); {2372#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:45,314 INFO L290 TraceCheckUtils]: 17: Hoare triple {2372#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {2372#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:45,314 INFO L290 TraceCheckUtils]: 18: Hoare triple {2372#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2373#(and (= (+ main_~n~0 (- 5)) 0) (<= main_~j~0 3))} is VALID [2022-04-28 02:41:45,316 INFO L290 TraceCheckUtils]: 19: Hoare triple {2373#(and (= (+ main_~n~0 (- 5)) 0) (<= main_~j~0 3))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {2373#(and (= (+ main_~n~0 (- 5)) 0) (<= main_~j~0 3))} is VALID [2022-04-28 02:41:45,317 INFO L290 TraceCheckUtils]: 20: Hoare triple {2373#(and (= (+ main_~n~0 (- 5)) 0) (<= main_~j~0 3))} assume !(~i~0 == ~j~0); {2373#(and (= (+ main_~n~0 (- 5)) 0) (<= main_~j~0 3))} is VALID [2022-04-28 02:41:45,317 INFO L290 TraceCheckUtils]: 21: Hoare triple {2373#(and (= (+ main_~n~0 (- 5)) 0) (<= main_~j~0 3))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {2373#(and (= (+ main_~n~0 (- 5)) 0) (<= main_~j~0 3))} is VALID [2022-04-28 02:41:45,318 INFO L290 TraceCheckUtils]: 22: Hoare triple {2373#(and (= (+ main_~n~0 (- 5)) 0) (<= main_~j~0 3))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2374#(and (<= main_~j~0 4) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:45,318 INFO L290 TraceCheckUtils]: 23: Hoare triple {2374#(and (<= main_~j~0 4) (= (+ main_~n~0 (- 5)) 0))} assume !(~j~0 <= ~n~0); {2365#false} is VALID [2022-04-28 02:41:45,318 INFO L272 TraceCheckUtils]: 24: Hoare triple {2365#false} call __VERIFIER_assert((if 2 == ~i~0 then 1 else 0)); {2365#false} is VALID [2022-04-28 02:41:45,319 INFO L290 TraceCheckUtils]: 25: Hoare triple {2365#false} ~cond := #in~cond; {2365#false} is VALID [2022-04-28 02:41:45,319 INFO L290 TraceCheckUtils]: 26: Hoare triple {2365#false} assume 0 == ~cond; {2365#false} is VALID [2022-04-28 02:41:45,319 INFO L290 TraceCheckUtils]: 27: Hoare triple {2365#false} assume !false; {2365#false} is VALID [2022-04-28 02:41:45,319 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:41:45,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:41:45,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061554348] [2022-04-28 02:41:45,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061554348] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:41:45,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307192057] [2022-04-28 02:41:45,320 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:41:45,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:41:45,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:41:45,321 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-04-28 02:41:45,322 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-04-28 02:41:45,400 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 02:41:45,401 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:41:45,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 02:41:45,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:45,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:41:45,684 INFO L272 TraceCheckUtils]: 0: Hoare triple {2364#true} call ULTIMATE.init(); {2364#true} is VALID [2022-04-28 02:41:45,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {2364#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {2364#true} is VALID [2022-04-28 02:41:45,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {2364#true} assume true; {2364#true} is VALID [2022-04-28 02:41:45,685 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2364#true} {2364#true} #214#return; {2364#true} is VALID [2022-04-28 02:41:45,685 INFO L272 TraceCheckUtils]: 4: Hoare triple {2364#true} call #t~ret37 := main(); {2364#true} is VALID [2022-04-28 02:41:45,685 INFO L290 TraceCheckUtils]: 5: Hoare triple {2364#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {2394#(<= 5 main_~n~0)} is VALID [2022-04-28 02:41:45,686 INFO L290 TraceCheckUtils]: 6: Hoare triple {2394#(<= 5 main_~n~0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {2398#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-28 02:41:45,686 INFO L290 TraceCheckUtils]: 7: Hoare triple {2398#(and (<= 5 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {2398#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-28 02:41:45,687 INFO L290 TraceCheckUtils]: 8: Hoare triple {2398#(and (<= 5 main_~n~0) (<= main_~j~0 0))} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {2398#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-28 02:41:45,687 INFO L290 TraceCheckUtils]: 9: Hoare triple {2398#(and (<= 5 main_~n~0) (<= main_~j~0 0))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {2398#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-28 02:41:45,688 INFO L290 TraceCheckUtils]: 10: Hoare triple {2398#(and (<= 5 main_~n~0) (<= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2411#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:41:45,688 INFO L290 TraceCheckUtils]: 11: Hoare triple {2411#(and (<= 5 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {2411#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:41:45,689 INFO L290 TraceCheckUtils]: 12: Hoare triple {2411#(and (<= 5 main_~n~0) (<= main_~j~0 1))} assume !(~i~0 == ~j~0); {2411#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:41:45,690 INFO L290 TraceCheckUtils]: 13: Hoare triple {2411#(and (<= 5 main_~n~0) (<= main_~j~0 1))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {2411#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:41:45,691 INFO L290 TraceCheckUtils]: 14: Hoare triple {2411#(and (<= 5 main_~n~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2424#(and (<= 5 main_~n~0) (<= main_~j~0 2))} is VALID [2022-04-28 02:41:45,691 INFO L290 TraceCheckUtils]: 15: Hoare triple {2424#(and (<= 5 main_~n~0) (<= main_~j~0 2))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {2424#(and (<= 5 main_~n~0) (<= main_~j~0 2))} is VALID [2022-04-28 02:41:45,692 INFO L290 TraceCheckUtils]: 16: Hoare triple {2424#(and (<= 5 main_~n~0) (<= main_~j~0 2))} assume !(~i~0 == ~j~0); {2424#(and (<= 5 main_~n~0) (<= main_~j~0 2))} is VALID [2022-04-28 02:41:45,692 INFO L290 TraceCheckUtils]: 17: Hoare triple {2424#(and (<= 5 main_~n~0) (<= main_~j~0 2))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {2424#(and (<= 5 main_~n~0) (<= main_~j~0 2))} is VALID [2022-04-28 02:41:45,693 INFO L290 TraceCheckUtils]: 18: Hoare triple {2424#(and (<= 5 main_~n~0) (<= main_~j~0 2))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2437#(and (<= 5 main_~n~0) (<= main_~j~0 3))} is VALID [2022-04-28 02:41:45,693 INFO L290 TraceCheckUtils]: 19: Hoare triple {2437#(and (<= 5 main_~n~0) (<= main_~j~0 3))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {2437#(and (<= 5 main_~n~0) (<= main_~j~0 3))} is VALID [2022-04-28 02:41:45,694 INFO L290 TraceCheckUtils]: 20: Hoare triple {2437#(and (<= 5 main_~n~0) (<= main_~j~0 3))} assume !(~i~0 == ~j~0); {2437#(and (<= 5 main_~n~0) (<= main_~j~0 3))} is VALID [2022-04-28 02:41:45,694 INFO L290 TraceCheckUtils]: 21: Hoare triple {2437#(and (<= 5 main_~n~0) (<= main_~j~0 3))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {2437#(and (<= 5 main_~n~0) (<= main_~j~0 3))} is VALID [2022-04-28 02:41:45,697 INFO L290 TraceCheckUtils]: 22: Hoare triple {2437#(and (<= 5 main_~n~0) (<= main_~j~0 3))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2450#(and (<= 5 main_~n~0) (<= main_~j~0 4))} is VALID [2022-04-28 02:41:45,697 INFO L290 TraceCheckUtils]: 23: Hoare triple {2450#(and (<= 5 main_~n~0) (<= main_~j~0 4))} assume !(~j~0 <= ~n~0); {2365#false} is VALID [2022-04-28 02:41:45,698 INFO L272 TraceCheckUtils]: 24: Hoare triple {2365#false} call __VERIFIER_assert((if 2 == ~i~0 then 1 else 0)); {2365#false} is VALID [2022-04-28 02:41:45,698 INFO L290 TraceCheckUtils]: 25: Hoare triple {2365#false} ~cond := #in~cond; {2365#false} is VALID [2022-04-28 02:41:45,698 INFO L290 TraceCheckUtils]: 26: Hoare triple {2365#false} assume 0 == ~cond; {2365#false} is VALID [2022-04-28 02:41:45,698 INFO L290 TraceCheckUtils]: 27: Hoare triple {2365#false} assume !false; {2365#false} is VALID [2022-04-28 02:41:45,698 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:41:45,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:41:45,892 INFO L290 TraceCheckUtils]: 27: Hoare triple {2365#false} assume !false; {2365#false} is VALID [2022-04-28 02:41:45,893 INFO L290 TraceCheckUtils]: 26: Hoare triple {2365#false} assume 0 == ~cond; {2365#false} is VALID [2022-04-28 02:41:45,893 INFO L290 TraceCheckUtils]: 25: Hoare triple {2365#false} ~cond := #in~cond; {2365#false} is VALID [2022-04-28 02:41:45,893 INFO L272 TraceCheckUtils]: 24: Hoare triple {2365#false} call __VERIFIER_assert((if 2 == ~i~0 then 1 else 0)); {2365#false} is VALID [2022-04-28 02:41:45,893 INFO L290 TraceCheckUtils]: 23: Hoare triple {2478#(<= main_~j~0 main_~n~0)} assume !(~j~0 <= ~n~0); {2365#false} is VALID [2022-04-28 02:41:45,894 INFO L290 TraceCheckUtils]: 22: Hoare triple {2482#(<= (+ main_~j~0 1) main_~n~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2478#(<= main_~j~0 main_~n~0)} is VALID [2022-04-28 02:41:45,894 INFO L290 TraceCheckUtils]: 21: Hoare triple {2482#(<= (+ main_~j~0 1) main_~n~0)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {2482#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-28 02:41:45,895 INFO L290 TraceCheckUtils]: 20: Hoare triple {2482#(<= (+ main_~j~0 1) main_~n~0)} assume !(~i~0 == ~j~0); {2482#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-28 02:41:45,895 INFO L290 TraceCheckUtils]: 19: Hoare triple {2482#(<= (+ main_~j~0 1) main_~n~0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {2482#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-28 02:41:45,896 INFO L290 TraceCheckUtils]: 18: Hoare triple {2495#(<= (+ main_~j~0 2) main_~n~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2482#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-28 02:41:45,896 INFO L290 TraceCheckUtils]: 17: Hoare triple {2495#(<= (+ main_~j~0 2) main_~n~0)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {2495#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-28 02:41:45,897 INFO L290 TraceCheckUtils]: 16: Hoare triple {2495#(<= (+ main_~j~0 2) main_~n~0)} assume !(~i~0 == ~j~0); {2495#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-28 02:41:45,897 INFO L290 TraceCheckUtils]: 15: Hoare triple {2495#(<= (+ main_~j~0 2) main_~n~0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {2495#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-28 02:41:45,898 INFO L290 TraceCheckUtils]: 14: Hoare triple {2508#(<= (+ main_~j~0 3) main_~n~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2495#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-28 02:41:45,898 INFO L290 TraceCheckUtils]: 13: Hoare triple {2508#(<= (+ main_~j~0 3) main_~n~0)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {2508#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2022-04-28 02:41:45,899 INFO L290 TraceCheckUtils]: 12: Hoare triple {2508#(<= (+ main_~j~0 3) main_~n~0)} assume !(~i~0 == ~j~0); {2508#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2022-04-28 02:41:45,899 INFO L290 TraceCheckUtils]: 11: Hoare triple {2508#(<= (+ main_~j~0 3) main_~n~0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {2508#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2022-04-28 02:41:45,900 INFO L290 TraceCheckUtils]: 10: Hoare triple {2521#(<= (+ main_~j~0 4) main_~n~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2508#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2022-04-28 02:41:45,900 INFO L290 TraceCheckUtils]: 9: Hoare triple {2521#(<= (+ main_~j~0 4) main_~n~0)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {2521#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2022-04-28 02:41:45,901 INFO L290 TraceCheckUtils]: 8: Hoare triple {2521#(<= (+ main_~j~0 4) main_~n~0)} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {2521#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2022-04-28 02:41:45,901 INFO L290 TraceCheckUtils]: 7: Hoare triple {2521#(<= (+ main_~j~0 4) main_~n~0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {2521#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2022-04-28 02:41:45,902 INFO L290 TraceCheckUtils]: 6: Hoare triple {2534#(<= 4 main_~n~0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {2521#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2022-04-28 02:41:45,902 INFO L290 TraceCheckUtils]: 5: Hoare triple {2364#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {2534#(<= 4 main_~n~0)} is VALID [2022-04-28 02:41:45,902 INFO L272 TraceCheckUtils]: 4: Hoare triple {2364#true} call #t~ret37 := main(); {2364#true} is VALID [2022-04-28 02:41:45,903 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2364#true} {2364#true} #214#return; {2364#true} is VALID [2022-04-28 02:41:45,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {2364#true} assume true; {2364#true} is VALID [2022-04-28 02:41:45,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {2364#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {2364#true} is VALID [2022-04-28 02:41:45,903 INFO L272 TraceCheckUtils]: 0: Hoare triple {2364#true} call ULTIMATE.init(); {2364#true} is VALID [2022-04-28 02:41:45,903 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:41:45,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307192057] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:41:45,903 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:41:45,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2022-04-28 02:41:45,904 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:41:45,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [897112923] [2022-04-28 02:41:45,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [897112923] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:45,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:45,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 02:41:45,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325064305] [2022-04-28 02:41:45,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:41:45,905 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-28 02:41:45,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:41:45,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:45,931 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:45,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 02:41:45,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:45,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 02:41:45,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=270, Unknown=0, NotChecked=0, Total=420 [2022-04-28 02:41:45,932 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:46,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:46,206 INFO L93 Difference]: Finished difference Result 92 states and 107 transitions. [2022-04-28 02:41:46,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 02:41:46,207 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-28 02:41:46,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:41:46,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:46,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 66 transitions. [2022-04-28 02:41:46,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:46,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 66 transitions. [2022-04-28 02:41:46,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 66 transitions. [2022-04-28 02:41:46,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:46,265 INFO L225 Difference]: With dead ends: 92 [2022-04-28 02:41:46,265 INFO L226 Difference]: Without dead ends: 65 [2022-04-28 02:41:46,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=178, Invalid=328, Unknown=0, NotChecked=0, Total=506 [2022-04-28 02:41:46,266 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 39 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:41:46,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 41 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:41:46,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-28 02:41:46,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2022-04-28 02:41:46,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:41:46,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 59 states, 53 states have (on average 1.150943396226415) internal successors, (61), 53 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:41:46,314 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 59 states, 53 states have (on average 1.150943396226415) internal successors, (61), 53 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:41:46,314 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 59 states, 53 states have (on average 1.150943396226415) internal successors, (61), 53 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:41:46,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:46,316 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2022-04-28 02:41:46,316 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2022-04-28 02:41:46,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:46,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:46,317 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 53 states have (on average 1.150943396226415) internal successors, (61), 53 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 65 states. [2022-04-28 02:41:46,317 INFO L87 Difference]: Start difference. First operand has 59 states, 53 states have (on average 1.150943396226415) internal successors, (61), 53 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 65 states. [2022-04-28 02:41:46,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:46,319 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2022-04-28 02:41:46,319 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2022-04-28 02:41:46,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:46,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:46,319 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:41:46,319 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:41:46,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 53 states have (on average 1.150943396226415) internal successors, (61), 53 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:41:46,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2022-04-28 02:41:46,321 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 28 [2022-04-28 02:41:46,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:41:46,322 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2022-04-28 02:41:46,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:46,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 66 transitions. [2022-04-28 02:41:46,404 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:46,405 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2022-04-28 02:41:46,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 02:41:46,405 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:41:46,405 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:41:46,431 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-04-28 02:41:46,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:41:46,628 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:41:46,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:41:46,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1026934172, now seen corresponding path program 7 times [2022-04-28 02:41:46,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:46,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1551948767] [2022-04-28 02:41:46,636 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:41:46,636 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 02:41:46,636 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:41:46,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1026934172, now seen corresponding path program 8 times [2022-04-28 02:41:46,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:41:46,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239904848] [2022-04-28 02:41:46,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:41:46,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:41:46,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:46,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:41:46,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:46,765 INFO L290 TraceCheckUtils]: 0: Hoare triple {3003#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {2991#true} is VALID [2022-04-28 02:41:46,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {2991#true} assume true; {2991#true} is VALID [2022-04-28 02:41:46,766 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2991#true} {2991#true} #214#return; {2991#true} is VALID [2022-04-28 02:41:46,772 INFO L272 TraceCheckUtils]: 0: Hoare triple {2991#true} call ULTIMATE.init(); {3003#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:41:46,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {3003#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {2991#true} is VALID [2022-04-28 02:41:46,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {2991#true} assume true; {2991#true} is VALID [2022-04-28 02:41:46,772 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2991#true} {2991#true} #214#return; {2991#true} is VALID [2022-04-28 02:41:46,772 INFO L272 TraceCheckUtils]: 4: Hoare triple {2991#true} call #t~ret37 := main(); {2991#true} is VALID [2022-04-28 02:41:46,774 INFO L290 TraceCheckUtils]: 5: Hoare triple {2991#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {2996#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-28 02:41:46,775 INFO L290 TraceCheckUtils]: 6: Hoare triple {2996#(= (+ main_~n~0 (- 5)) 0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {2997#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:46,776 INFO L290 TraceCheckUtils]: 7: Hoare triple {2997#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {2997#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:46,776 INFO L290 TraceCheckUtils]: 8: Hoare triple {2997#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {2997#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:46,777 INFO L290 TraceCheckUtils]: 9: Hoare triple {2997#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {2997#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:46,777 INFO L290 TraceCheckUtils]: 10: Hoare triple {2997#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2998#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:46,778 INFO L290 TraceCheckUtils]: 11: Hoare triple {2998#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {2998#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:46,778 INFO L290 TraceCheckUtils]: 12: Hoare triple {2998#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} assume !(~i~0 == ~j~0); {2998#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:46,778 INFO L290 TraceCheckUtils]: 13: Hoare triple {2998#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {2998#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:46,779 INFO L290 TraceCheckUtils]: 14: Hoare triple {2998#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2999#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:46,779 INFO L290 TraceCheckUtils]: 15: Hoare triple {2999#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {2999#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:46,780 INFO L290 TraceCheckUtils]: 16: Hoare triple {2999#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} assume !(~i~0 == ~j~0); {2999#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:46,780 INFO L290 TraceCheckUtils]: 17: Hoare triple {2999#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {2999#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:46,781 INFO L290 TraceCheckUtils]: 18: Hoare triple {2999#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3000#(and (= (+ main_~n~0 (- 5)) 0) (<= main_~j~0 3))} is VALID [2022-04-28 02:41:46,781 INFO L290 TraceCheckUtils]: 19: Hoare triple {3000#(and (= (+ main_~n~0 (- 5)) 0) (<= main_~j~0 3))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {3000#(and (= (+ main_~n~0 (- 5)) 0) (<= main_~j~0 3))} is VALID [2022-04-28 02:41:46,782 INFO L290 TraceCheckUtils]: 20: Hoare triple {3000#(and (= (+ main_~n~0 (- 5)) 0) (<= main_~j~0 3))} assume !(~i~0 == ~j~0); {3000#(and (= (+ main_~n~0 (- 5)) 0) (<= main_~j~0 3))} is VALID [2022-04-28 02:41:46,782 INFO L290 TraceCheckUtils]: 21: Hoare triple {3000#(and (= (+ main_~n~0 (- 5)) 0) (<= main_~j~0 3))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {3000#(and (= (+ main_~n~0 (- 5)) 0) (<= main_~j~0 3))} is VALID [2022-04-28 02:41:46,782 INFO L290 TraceCheckUtils]: 22: Hoare triple {3000#(and (= (+ main_~n~0 (- 5)) 0) (<= main_~j~0 3))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3001#(and (<= main_~j~0 4) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:46,783 INFO L290 TraceCheckUtils]: 23: Hoare triple {3001#(and (<= main_~j~0 4) (= (+ main_~n~0 (- 5)) 0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {3001#(and (<= main_~j~0 4) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:46,783 INFO L290 TraceCheckUtils]: 24: Hoare triple {3001#(and (<= main_~j~0 4) (= (+ main_~n~0 (- 5)) 0))} assume !(~i~0 == ~j~0); {3001#(and (<= main_~j~0 4) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:46,784 INFO L290 TraceCheckUtils]: 25: Hoare triple {3001#(and (<= main_~j~0 4) (= (+ main_~n~0 (- 5)) 0))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {3001#(and (<= main_~j~0 4) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:46,784 INFO L290 TraceCheckUtils]: 26: Hoare triple {3001#(and (<= main_~j~0 4) (= (+ main_~n~0 (- 5)) 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3002#(and (<= main_~j~0 5) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-28 02:41:46,785 INFO L290 TraceCheckUtils]: 27: Hoare triple {3002#(and (<= main_~j~0 5) (= (+ main_~n~0 (- 5)) 0))} assume !(~j~0 <= ~n~0); {2992#false} is VALID [2022-04-28 02:41:46,785 INFO L272 TraceCheckUtils]: 28: Hoare triple {2992#false} call __VERIFIER_assert((if 2 == ~i~0 then 1 else 0)); {2992#false} is VALID [2022-04-28 02:41:46,785 INFO L290 TraceCheckUtils]: 29: Hoare triple {2992#false} ~cond := #in~cond; {2992#false} is VALID [2022-04-28 02:41:46,785 INFO L290 TraceCheckUtils]: 30: Hoare triple {2992#false} assume 0 == ~cond; {2992#false} is VALID [2022-04-28 02:41:46,785 INFO L290 TraceCheckUtils]: 31: Hoare triple {2992#false} assume !false; {2992#false} is VALID [2022-04-28 02:41:46,785 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:41:46,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:41:46,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239904848] [2022-04-28 02:41:46,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239904848] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:41:46,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324552707] [2022-04-28 02:41:46,786 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:41:46,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:41:46,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:41:46,787 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-04-28 02:41:46,818 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-04-28 02:41:46,870 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:41:46,871 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:41:46,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 02:41:46,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:46,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:41:47,208 INFO L272 TraceCheckUtils]: 0: Hoare triple {2991#true} call ULTIMATE.init(); {2991#true} is VALID [2022-04-28 02:41:47,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {2991#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {2991#true} is VALID [2022-04-28 02:41:47,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {2991#true} assume true; {2991#true} is VALID [2022-04-28 02:41:47,208 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2991#true} {2991#true} #214#return; {2991#true} is VALID [2022-04-28 02:41:47,208 INFO L272 TraceCheckUtils]: 4: Hoare triple {2991#true} call #t~ret37 := main(); {2991#true} is VALID [2022-04-28 02:41:47,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {2991#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {3022#(<= 5 main_~n~0)} is VALID [2022-04-28 02:41:47,209 INFO L290 TraceCheckUtils]: 6: Hoare triple {3022#(<= 5 main_~n~0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {3026#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-28 02:41:47,209 INFO L290 TraceCheckUtils]: 7: Hoare triple {3026#(and (<= 5 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {3026#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-28 02:41:47,210 INFO L290 TraceCheckUtils]: 8: Hoare triple {3026#(and (<= 5 main_~n~0) (<= main_~j~0 0))} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {3026#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-28 02:41:47,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {3026#(and (<= 5 main_~n~0) (<= main_~j~0 0))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {3026#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-28 02:41:47,211 INFO L290 TraceCheckUtils]: 10: Hoare triple {3026#(and (<= 5 main_~n~0) (<= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3039#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:41:47,211 INFO L290 TraceCheckUtils]: 11: Hoare triple {3039#(and (<= 5 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {3039#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:41:47,212 INFO L290 TraceCheckUtils]: 12: Hoare triple {3039#(and (<= 5 main_~n~0) (<= main_~j~0 1))} assume !(~i~0 == ~j~0); {3039#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:41:47,212 INFO L290 TraceCheckUtils]: 13: Hoare triple {3039#(and (<= 5 main_~n~0) (<= main_~j~0 1))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {3039#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:41:47,212 INFO L290 TraceCheckUtils]: 14: Hoare triple {3039#(and (<= 5 main_~n~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3052#(and (<= 5 main_~n~0) (<= main_~j~0 2))} is VALID [2022-04-28 02:41:47,213 INFO L290 TraceCheckUtils]: 15: Hoare triple {3052#(and (<= 5 main_~n~0) (<= main_~j~0 2))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {3052#(and (<= 5 main_~n~0) (<= main_~j~0 2))} is VALID [2022-04-28 02:41:47,213 INFO L290 TraceCheckUtils]: 16: Hoare triple {3052#(and (<= 5 main_~n~0) (<= main_~j~0 2))} assume !(~i~0 == ~j~0); {3052#(and (<= 5 main_~n~0) (<= main_~j~0 2))} is VALID [2022-04-28 02:41:47,213 INFO L290 TraceCheckUtils]: 17: Hoare triple {3052#(and (<= 5 main_~n~0) (<= main_~j~0 2))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {3052#(and (<= 5 main_~n~0) (<= main_~j~0 2))} is VALID [2022-04-28 02:41:47,214 INFO L290 TraceCheckUtils]: 18: Hoare triple {3052#(and (<= 5 main_~n~0) (<= main_~j~0 2))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3065#(and (<= 5 main_~n~0) (<= main_~j~0 3))} is VALID [2022-04-28 02:41:47,214 INFO L290 TraceCheckUtils]: 19: Hoare triple {3065#(and (<= 5 main_~n~0) (<= main_~j~0 3))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {3065#(and (<= 5 main_~n~0) (<= main_~j~0 3))} is VALID [2022-04-28 02:41:47,215 INFO L290 TraceCheckUtils]: 20: Hoare triple {3065#(and (<= 5 main_~n~0) (<= main_~j~0 3))} assume !(~i~0 == ~j~0); {3065#(and (<= 5 main_~n~0) (<= main_~j~0 3))} is VALID [2022-04-28 02:41:47,215 INFO L290 TraceCheckUtils]: 21: Hoare triple {3065#(and (<= 5 main_~n~0) (<= main_~j~0 3))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {3065#(and (<= 5 main_~n~0) (<= main_~j~0 3))} is VALID [2022-04-28 02:41:47,215 INFO L290 TraceCheckUtils]: 22: Hoare triple {3065#(and (<= 5 main_~n~0) (<= main_~j~0 3))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3078#(and (<= 5 main_~n~0) (<= main_~j~0 4))} is VALID [2022-04-28 02:41:47,216 INFO L290 TraceCheckUtils]: 23: Hoare triple {3078#(and (<= 5 main_~n~0) (<= main_~j~0 4))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {3078#(and (<= 5 main_~n~0) (<= main_~j~0 4))} is VALID [2022-04-28 02:41:47,216 INFO L290 TraceCheckUtils]: 24: Hoare triple {3078#(and (<= 5 main_~n~0) (<= main_~j~0 4))} assume !(~i~0 == ~j~0); {3078#(and (<= 5 main_~n~0) (<= main_~j~0 4))} is VALID [2022-04-28 02:41:47,217 INFO L290 TraceCheckUtils]: 25: Hoare triple {3078#(and (<= 5 main_~n~0) (<= main_~j~0 4))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {3078#(and (<= 5 main_~n~0) (<= main_~j~0 4))} is VALID [2022-04-28 02:41:47,217 INFO L290 TraceCheckUtils]: 26: Hoare triple {3078#(and (<= 5 main_~n~0) (<= main_~j~0 4))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3091#(and (<= 5 main_~n~0) (<= main_~j~0 5))} is VALID [2022-04-28 02:41:47,217 INFO L290 TraceCheckUtils]: 27: Hoare triple {3091#(and (<= 5 main_~n~0) (<= main_~j~0 5))} assume !(~j~0 <= ~n~0); {2992#false} is VALID [2022-04-28 02:41:47,217 INFO L272 TraceCheckUtils]: 28: Hoare triple {2992#false} call __VERIFIER_assert((if 2 == ~i~0 then 1 else 0)); {2992#false} is VALID [2022-04-28 02:41:47,218 INFO L290 TraceCheckUtils]: 29: Hoare triple {2992#false} ~cond := #in~cond; {2992#false} is VALID [2022-04-28 02:41:47,218 INFO L290 TraceCheckUtils]: 30: Hoare triple {2992#false} assume 0 == ~cond; {2992#false} is VALID [2022-04-28 02:41:47,218 INFO L290 TraceCheckUtils]: 31: Hoare triple {2992#false} assume !false; {2992#false} is VALID [2022-04-28 02:41:47,218 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:41:47,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:41:47,436 INFO L290 TraceCheckUtils]: 31: Hoare triple {2992#false} assume !false; {2992#false} is VALID [2022-04-28 02:41:47,436 INFO L290 TraceCheckUtils]: 30: Hoare triple {2992#false} assume 0 == ~cond; {2992#false} is VALID [2022-04-28 02:41:47,436 INFO L290 TraceCheckUtils]: 29: Hoare triple {2992#false} ~cond := #in~cond; {2992#false} is VALID [2022-04-28 02:41:47,436 INFO L272 TraceCheckUtils]: 28: Hoare triple {2992#false} call __VERIFIER_assert((if 2 == ~i~0 then 1 else 0)); {2992#false} is VALID [2022-04-28 02:41:47,436 INFO L290 TraceCheckUtils]: 27: Hoare triple {3119#(<= main_~j~0 main_~n~0)} assume !(~j~0 <= ~n~0); {2992#false} is VALID [2022-04-28 02:41:47,437 INFO L290 TraceCheckUtils]: 26: Hoare triple {3123#(<= (+ main_~j~0 1) main_~n~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3119#(<= main_~j~0 main_~n~0)} is VALID [2022-04-28 02:41:47,437 INFO L290 TraceCheckUtils]: 25: Hoare triple {3123#(<= (+ main_~j~0 1) main_~n~0)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {3123#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-28 02:41:47,437 INFO L290 TraceCheckUtils]: 24: Hoare triple {3123#(<= (+ main_~j~0 1) main_~n~0)} assume !(~i~0 == ~j~0); {3123#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-28 02:41:47,438 INFO L290 TraceCheckUtils]: 23: Hoare triple {3123#(<= (+ main_~j~0 1) main_~n~0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {3123#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-28 02:41:47,438 INFO L290 TraceCheckUtils]: 22: Hoare triple {3136#(<= (+ main_~j~0 2) main_~n~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3123#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-28 02:41:47,439 INFO L290 TraceCheckUtils]: 21: Hoare triple {3136#(<= (+ main_~j~0 2) main_~n~0)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {3136#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-28 02:41:47,439 INFO L290 TraceCheckUtils]: 20: Hoare triple {3136#(<= (+ main_~j~0 2) main_~n~0)} assume !(~i~0 == ~j~0); {3136#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-28 02:41:47,439 INFO L290 TraceCheckUtils]: 19: Hoare triple {3136#(<= (+ main_~j~0 2) main_~n~0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {3136#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-28 02:41:47,440 INFO L290 TraceCheckUtils]: 18: Hoare triple {3149#(<= (+ main_~j~0 3) main_~n~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3136#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-28 02:41:47,440 INFO L290 TraceCheckUtils]: 17: Hoare triple {3149#(<= (+ main_~j~0 3) main_~n~0)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {3149#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2022-04-28 02:41:47,440 INFO L290 TraceCheckUtils]: 16: Hoare triple {3149#(<= (+ main_~j~0 3) main_~n~0)} assume !(~i~0 == ~j~0); {3149#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2022-04-28 02:41:47,441 INFO L290 TraceCheckUtils]: 15: Hoare triple {3149#(<= (+ main_~j~0 3) main_~n~0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {3149#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2022-04-28 02:41:47,441 INFO L290 TraceCheckUtils]: 14: Hoare triple {3162#(<= (+ main_~j~0 4) main_~n~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3149#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2022-04-28 02:41:47,441 INFO L290 TraceCheckUtils]: 13: Hoare triple {3162#(<= (+ main_~j~0 4) main_~n~0)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {3162#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2022-04-28 02:41:47,442 INFO L290 TraceCheckUtils]: 12: Hoare triple {3162#(<= (+ main_~j~0 4) main_~n~0)} assume !(~i~0 == ~j~0); {3162#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2022-04-28 02:41:47,442 INFO L290 TraceCheckUtils]: 11: Hoare triple {3162#(<= (+ main_~j~0 4) main_~n~0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {3162#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2022-04-28 02:41:47,442 INFO L290 TraceCheckUtils]: 10: Hoare triple {3175#(<= (+ 5 main_~j~0) main_~n~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3162#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2022-04-28 02:41:47,443 INFO L290 TraceCheckUtils]: 9: Hoare triple {3175#(<= (+ 5 main_~j~0) main_~n~0)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {3175#(<= (+ 5 main_~j~0) main_~n~0)} is VALID [2022-04-28 02:41:47,443 INFO L290 TraceCheckUtils]: 8: Hoare triple {3175#(<= (+ 5 main_~j~0) main_~n~0)} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {3175#(<= (+ 5 main_~j~0) main_~n~0)} is VALID [2022-04-28 02:41:47,443 INFO L290 TraceCheckUtils]: 7: Hoare triple {3175#(<= (+ 5 main_~j~0) main_~n~0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {3175#(<= (+ 5 main_~j~0) main_~n~0)} is VALID [2022-04-28 02:41:47,444 INFO L290 TraceCheckUtils]: 6: Hoare triple {3022#(<= 5 main_~n~0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {3175#(<= (+ 5 main_~j~0) main_~n~0)} is VALID [2022-04-28 02:41:47,444 INFO L290 TraceCheckUtils]: 5: Hoare triple {2991#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {3022#(<= 5 main_~n~0)} is VALID [2022-04-28 02:41:47,444 INFO L272 TraceCheckUtils]: 4: Hoare triple {2991#true} call #t~ret37 := main(); {2991#true} is VALID [2022-04-28 02:41:47,444 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2991#true} {2991#true} #214#return; {2991#true} is VALID [2022-04-28 02:41:47,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {2991#true} assume true; {2991#true} is VALID [2022-04-28 02:41:47,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {2991#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {2991#true} is VALID [2022-04-28 02:41:47,445 INFO L272 TraceCheckUtils]: 0: Hoare triple {2991#true} call ULTIMATE.init(); {2991#true} is VALID [2022-04-28 02:41:47,445 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:41:47,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324552707] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:41:47,445 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:41:47,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 23 [2022-04-28 02:41:47,445 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:41:47,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1551948767] [2022-04-28 02:41:47,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1551948767] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:47,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:47,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 02:41:47,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359422271] [2022-04-28 02:41:47,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:41:47,446 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-28 02:41:47,446 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:41:47,446 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:47,474 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:47,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 02:41:47,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:47,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 02:41:47,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=336, Unknown=0, NotChecked=0, Total=506 [2022-04-28 02:41:47,476 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:47,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:47,733 INFO L93 Difference]: Finished difference Result 98 states and 114 transitions. [2022-04-28 02:41:47,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 02:41:47,734 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-28 02:41:47,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:41:47,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:47,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 67 transitions. [2022-04-28 02:41:47,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:47,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 67 transitions. [2022-04-28 02:41:47,737 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 67 transitions. [2022-04-28 02:41:47,795 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:47,797 INFO L225 Difference]: With dead ends: 98 [2022-04-28 02:41:47,797 INFO L226 Difference]: Without dead ends: 67 [2022-04-28 02:41:47,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=199, Invalid=401, Unknown=0, NotChecked=0, Total=600 [2022-04-28 02:41:47,798 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 61 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:41:47,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 33 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:41:47,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-28 02:41:47,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-04-28 02:41:47,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:41:47,863 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 67 states, 61 states have (on average 1.1475409836065573) internal successors, (70), 61 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:41:47,864 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 67 states, 61 states have (on average 1.1475409836065573) internal successors, (70), 61 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:41:47,864 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 67 states, 61 states have (on average 1.1475409836065573) internal successors, (70), 61 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:41:47,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:47,866 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2022-04-28 02:41:47,866 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2022-04-28 02:41:47,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:47,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:47,867 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 61 states have (on average 1.1475409836065573) internal successors, (70), 61 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 67 states. [2022-04-28 02:41:47,867 INFO L87 Difference]: Start difference. First operand has 67 states, 61 states have (on average 1.1475409836065573) internal successors, (70), 61 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 67 states. [2022-04-28 02:41:47,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:47,869 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2022-04-28 02:41:47,869 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2022-04-28 02:41:47,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:47,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:47,870 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:41:47,870 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:41:47,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 61 states have (on average 1.1475409836065573) internal successors, (70), 61 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:41:47,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2022-04-28 02:41:47,872 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 32 [2022-04-28 02:41:47,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:41:47,872 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2022-04-28 02:41:47,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:41:47,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 75 transitions. [2022-04-28 02:41:47,943 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:47,943 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2022-04-28 02:41:47,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 02:41:47,944 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:41:47,944 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:41:47,963 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-04-28 02:41:48,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:41:48,156 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:41:48,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:41:48,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1975029803, now seen corresponding path program 9 times [2022-04-28 02:41:48,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:48,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [782164369] [2022-04-28 02:41:48,160 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:41:48,160 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 02:41:48,160 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:41:48,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1975029803, now seen corresponding path program 10 times [2022-04-28 02:41:48,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:41:48,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522665925] [2022-04-28 02:41:48,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:41:48,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:41:48,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:41:48,182 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 02:41:48,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:41:48,211 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 02:41:48,211 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-28 02:41:48,211 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-28 02:41:48,213 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 02:41:48,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 02:41:48,217 INFO L356 BasicCegarLoop]: Path program histogram: [10, 4, 2, 2] [2022-04-28 02:41:48,219 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 02:41:48,230 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 02:41:48,230 WARN L170 areAnnotationChecker]: ludcmpENTRY has no Hoare annotation [2022-04-28 02:41:48,230 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-28 02:41:48,230 WARN L170 areAnnotationChecker]: fabsENTRY has no Hoare annotation [2022-04-28 02:41:48,230 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 02:41:48,230 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 02:41:48,230 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-28 02:41:48,230 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-28 02:41:48,230 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 02:41:48,231 WARN L170 areAnnotationChecker]: L117 has no Hoare annotation [2022-04-28 02:41:48,231 WARN L170 areAnnotationChecker]: L117 has no Hoare annotation [2022-04-28 02:41:48,231 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 02:41:48,231 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-04-28 02:41:48,231 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-04-28 02:41:48,231 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 02:41:48,231 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 02:41:48,231 WARN L170 areAnnotationChecker]: L93-3 has no Hoare annotation [2022-04-28 02:41:48,231 WARN L170 areAnnotationChecker]: L93-3 has no Hoare annotation [2022-04-28 02:41:48,231 WARN L170 areAnnotationChecker]: L93-3 has no Hoare annotation [2022-04-28 02:41:48,231 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-28 02:41:48,231 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-28 02:41:48,231 WARN L170 areAnnotationChecker]: ludcmpFINAL has no Hoare annotation [2022-04-28 02:41:48,231 WARN L170 areAnnotationChecker]: L118-3 has no Hoare annotation [2022-04-28 02:41:48,231 WARN L170 areAnnotationChecker]: L118-3 has no Hoare annotation [2022-04-28 02:41:48,231 WARN L170 areAnnotationChecker]: L118-3 has no Hoare annotation [2022-04-28 02:41:48,231 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 02:41:48,231 WARN L170 areAnnotationChecker]: L80-2 has no Hoare annotation [2022-04-28 02:41:48,231 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 02:41:48,231 WARN L170 areAnnotationChecker]: L93-4 has no Hoare annotation [2022-04-28 02:41:48,232 WARN L170 areAnnotationChecker]: L93-4 has no Hoare annotation [2022-04-28 02:41:48,232 WARN L170 areAnnotationChecker]: L96-3 has no Hoare annotation [2022-04-28 02:41:48,232 WARN L170 areAnnotationChecker]: L96-3 has no Hoare annotation [2022-04-28 02:41:48,232 WARN L170 areAnnotationChecker]: L96-3 has no Hoare annotation [2022-04-28 02:41:48,232 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-28 02:41:48,232 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-28 02:41:48,232 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-28 02:41:48,232 WARN L170 areAnnotationChecker]: ludcmpEXIT has no Hoare annotation [2022-04-28 02:41:48,232 WARN L170 areAnnotationChecker]: L118-4 has no Hoare annotation [2022-04-28 02:41:48,232 WARN L170 areAnnotationChecker]: L120 has no Hoare annotation [2022-04-28 02:41:48,232 WARN L170 areAnnotationChecker]: L120 has no Hoare annotation [2022-04-28 02:41:48,232 WARN L170 areAnnotationChecker]: fabsFINAL has no Hoare annotation [2022-04-28 02:41:48,232 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2022-04-28 02:41:48,232 WARN L170 areAnnotationChecker]: L96-4 has no Hoare annotation [2022-04-28 02:41:48,232 WARN L170 areAnnotationChecker]: L96-4 has no Hoare annotation [2022-04-28 02:41:48,232 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2022-04-28 02:41:48,232 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2022-04-28 02:41:48,232 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 02:41:48,233 WARN L170 areAnnotationChecker]: L138-3 has no Hoare annotation [2022-04-28 02:41:48,233 WARN L170 areAnnotationChecker]: L138-3 has no Hoare annotation [2022-04-28 02:41:48,233 WARN L170 areAnnotationChecker]: L138-3 has no Hoare annotation [2022-04-28 02:41:48,233 WARN L170 areAnnotationChecker]: L120-1 has no Hoare annotation [2022-04-28 02:41:48,233 WARN L170 areAnnotationChecker]: L120-1 has no Hoare annotation [2022-04-28 02:41:48,233 WARN L170 areAnnotationChecker]: fabsEXIT has no Hoare annotation [2022-04-28 02:41:48,233 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 02:41:48,233 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2022-04-28 02:41:48,233 WARN L170 areAnnotationChecker]: L99-2 has no Hoare annotation [2022-04-28 02:41:48,233 WARN L170 areAnnotationChecker]: L138-4 has no Hoare annotation [2022-04-28 02:41:48,233 WARN L170 areAnnotationChecker]: L141-3 has no Hoare annotation [2022-04-28 02:41:48,233 WARN L170 areAnnotationChecker]: L141-3 has no Hoare annotation [2022-04-28 02:41:48,233 WARN L170 areAnnotationChecker]: L141-3 has no Hoare annotation [2022-04-28 02:41:48,233 WARN L170 areAnnotationChecker]: L121-3 has no Hoare annotation [2022-04-28 02:41:48,233 WARN L170 areAnnotationChecker]: L121-3 has no Hoare annotation [2022-04-28 02:41:48,233 WARN L170 areAnnotationChecker]: L121-3 has no Hoare annotation [2022-04-28 02:41:48,233 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 02:41:48,233 WARN L170 areAnnotationChecker]: L93-2 has no Hoare annotation [2022-04-28 02:41:48,233 WARN L170 areAnnotationChecker]: L96-2 has no Hoare annotation [2022-04-28 02:41:48,234 WARN L170 areAnnotationChecker]: L146-3 has no Hoare annotation [2022-04-28 02:41:48,234 WARN L170 areAnnotationChecker]: L146-3 has no Hoare annotation [2022-04-28 02:41:48,234 WARN L170 areAnnotationChecker]: L146-3 has no Hoare annotation [2022-04-28 02:41:48,234 WARN L170 areAnnotationChecker]: L141-4 has no Hoare annotation [2022-04-28 02:41:48,234 WARN L170 areAnnotationChecker]: L141-2 has no Hoare annotation [2022-04-28 02:41:48,234 WARN L170 areAnnotationChecker]: L121-4 has no Hoare annotation [2022-04-28 02:41:48,234 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-04-28 02:41:48,234 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-04-28 02:41:48,234 WARN L170 areAnnotationChecker]: L146-4 has no Hoare annotation [2022-04-28 02:41:48,234 WARN L170 areAnnotationChecker]: L149-3 has no Hoare annotation [2022-04-28 02:41:48,234 WARN L170 areAnnotationChecker]: L149-3 has no Hoare annotation [2022-04-28 02:41:48,234 WARN L170 areAnnotationChecker]: L149-3 has no Hoare annotation [2022-04-28 02:41:48,234 WARN L170 areAnnotationChecker]: L138-2 has no Hoare annotation [2022-04-28 02:41:48,234 WARN L170 areAnnotationChecker]: L129-3 has no Hoare annotation [2022-04-28 02:41:48,234 WARN L170 areAnnotationChecker]: L129-3 has no Hoare annotation [2022-04-28 02:41:48,234 WARN L170 areAnnotationChecker]: L129-3 has no Hoare annotation [2022-04-28 02:41:48,234 WARN L170 areAnnotationChecker]: L125-3 has no Hoare annotation [2022-04-28 02:41:48,234 WARN L170 areAnnotationChecker]: L125-3 has no Hoare annotation [2022-04-28 02:41:48,234 WARN L170 areAnnotationChecker]: L125-3 has no Hoare annotation [2022-04-28 02:41:48,235 WARN L170 areAnnotationChecker]: L124-1 has no Hoare annotation [2022-04-28 02:41:48,235 WARN L170 areAnnotationChecker]: L149-4 has no Hoare annotation [2022-04-28 02:41:48,235 WARN L170 areAnnotationChecker]: L149-2 has no Hoare annotation [2022-04-28 02:41:48,235 WARN L170 areAnnotationChecker]: L118-2 has no Hoare annotation [2022-04-28 02:41:48,235 WARN L170 areAnnotationChecker]: L132-3 has no Hoare annotation [2022-04-28 02:41:48,235 WARN L170 areAnnotationChecker]: L132-3 has no Hoare annotation [2022-04-28 02:41:48,235 WARN L170 areAnnotationChecker]: L132-3 has no Hoare annotation [2022-04-28 02:41:48,235 WARN L170 areAnnotationChecker]: L125-2 has no Hoare annotation [2022-04-28 02:41:48,235 WARN L170 areAnnotationChecker]: L121-2 has no Hoare annotation [2022-04-28 02:41:48,235 WARN L170 areAnnotationChecker]: L146-2 has no Hoare annotation [2022-04-28 02:41:48,235 WARN L170 areAnnotationChecker]: L132-4 has no Hoare annotation [2022-04-28 02:41:48,235 WARN L170 areAnnotationChecker]: L132-2 has no Hoare annotation [2022-04-28 02:41:48,235 WARN L170 areAnnotationChecker]: L129-2 has no Hoare annotation [2022-04-28 02:41:48,235 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 02:41:48,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 02:41:48 BoogieIcfgContainer [2022-04-28 02:41:48,237 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 02:41:48,238 INFO L158 Benchmark]: Toolchain (without parser) took 10508.85ms. Allocated memory was 187.7MB in the beginning and 323.0MB in the end (delta: 135.3MB). Free memory was 134.3MB in the beginning and 139.5MB in the end (delta: -5.2MB). Peak memory consumption was 131.6MB. Max. memory is 8.0GB. [2022-04-28 02:41:48,238 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 187.7MB. Free memory is still 151.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 02:41:48,238 INFO L158 Benchmark]: CACSL2BoogieTranslator took 292.74ms. Allocated memory was 187.7MB in the beginning and 268.4MB in the end (delta: 80.7MB). Free memory was 134.2MB in the beginning and 238.3MB in the end (delta: -104.1MB). Peak memory consumption was 8.7MB. Max. memory is 8.0GB. [2022-04-28 02:41:48,238 INFO L158 Benchmark]: Boogie Preprocessor took 63.56ms. Allocated memory is still 268.4MB. Free memory was 238.3MB in the beginning and 235.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 02:41:48,239 INFO L158 Benchmark]: RCFGBuilder took 630.43ms. Allocated memory is still 268.4MB. Free memory was 235.7MB in the beginning and 216.0MB in the end (delta: 19.7MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-04-28 02:41:48,239 INFO L158 Benchmark]: TraceAbstraction took 9515.73ms. Allocated memory was 268.4MB in the beginning and 323.0MB in the end (delta: 54.5MB). Free memory was 215.4MB in the beginning and 139.5MB in the end (delta: 75.9MB). Peak memory consumption was 131.4MB. Max. memory is 8.0GB. [2022-04-28 02:41:48,240 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 187.7MB. Free memory is still 151.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 292.74ms. Allocated memory was 187.7MB in the beginning and 268.4MB in the end (delta: 80.7MB). Free memory was 134.2MB in the beginning and 238.3MB in the end (delta: -104.1MB). Peak memory consumption was 8.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 63.56ms. Allocated memory is still 268.4MB. Free memory was 238.3MB in the beginning and 235.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 630.43ms. Allocated memory is still 268.4MB. Free memory was 235.7MB in the beginning and 216.0MB in the end (delta: 19.7MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 9515.73ms. Allocated memory was 268.4MB in the beginning and 323.0MB in the end (delta: 54.5MB). Free memory was 215.4MB in the beginning and 139.5MB in the end (delta: 75.9MB). Peak memory consumption was 131.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 7]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of to_real at line 98, overapproximation of someBinaryArithmeticDOUBLEoperation at line 100. Possible FailurePath: [L71] double a[50][50], b[50], x[50]; [L88] int i, j, nmax = 50, n = 5, chkerr; [L89] double eps, w; [L91] eps = 1.0e-6 [L93] i = 0 [L93] COND TRUE i <= n [L95] w = 0.0 [L96] j = 0 [L96] COND TRUE j <= n [L98] a[i][j] = (i + 1) + (j + 1) [L99] COND TRUE i == j [L99] EXPR a[i][j] [L99] a[i][j] *= 10.0 [L100] EXPR a[i][j] [L100] w += a[i][j] [L96] j++ [L96] COND TRUE j <= n [L98] a[i][j] = (i + 1) + (j + 1) [L99] COND FALSE !(i == j) [L100] EXPR a[i][j] [L100] w += a[i][j] [L96] j++ [L96] COND TRUE j <= n [L98] a[i][j] = (i + 1) + (j + 1) [L99] COND FALSE !(i == j) [L100] EXPR a[i][j] [L100] w += a[i][j] [L96] j++ [L96] COND TRUE j <= n [L98] a[i][j] = (i + 1) + (j + 1) [L99] COND FALSE !(i == j) [L100] EXPR a[i][j] [L100] w += a[i][j] [L96] j++ [L96] COND TRUE j <= n [L98] a[i][j] = (i + 1) + (j + 1) [L99] COND FALSE !(i == j) [L100] EXPR a[i][j] [L100] w += a[i][j] [L96] j++ [L96] COND TRUE j <= n [L98] a[i][j] = (i + 1) + (j + 1) [L99] COND FALSE !(i == j) [L100] EXPR a[i][j] [L100] w += a[i][j] [L96] j++ [L96] COND FALSE !(j <= n) [L102] CALL __VERIFIER_assert(i==2) [L6] COND TRUE !(cond) [L7] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 67 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.5s, OverallIterations: 9, TraceHistogramMax: 6, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 274 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 265 mSDsluCounter, 294 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 119 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 412 IncrementalHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 175 mSDtfsCounter, 412 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 351 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=8, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 35 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-04-28 02:41:48,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...