/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-e106359-m [2022-04-15 05:41:51,920 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 05:41:51,932 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 05:41:51,995 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 05:41:51,995 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 05:41:51,997 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 05:41:51,999 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 05:41:52,002 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 05:41:52,004 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 05:41:52,007 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 05:41:52,007 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 05:41:52,008 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 05:41:52,008 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 05:41:52,010 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 05:41:52,011 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 05:41:52,013 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 05:41:52,013 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 05:41:52,014 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 05:41:52,015 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 05:41:52,019 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 05:41:52,034 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 05:41:52,035 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 05:41:52,036 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 05:41:52,036 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 05:41:52,037 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 05:41:52,038 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 05:41:52,038 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 05:41:52,039 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 05:41:52,039 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 05:41:52,039 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 05:41:52,040 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 05:41:52,040 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 05:41:52,040 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 05:41:52,041 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 05:41:52,041 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 05:41:52,042 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 05:41:52,042 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 05:41:52,042 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 05:41:52,042 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 05:41:52,042 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 05:41:52,046 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 05:41:52,055 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 05:41:52,055 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 05:41:52,063 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 05:41:52,063 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 05:41:52,064 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 05:41:52,064 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 05:41:52,064 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 05:41:52,065 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 05:41:52,065 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 05:41:52,065 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 05:41:52,065 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 05:41:52,065 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 05:41:52,066 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 05:41:52,066 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 05:41:52,066 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 05:41:52,066 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 05:41:52,066 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 05:41:52,066 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 05:41:52,066 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 05:41:52,066 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 05:41:52,066 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:41:52,066 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 05:41:52,067 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 05:41:52,067 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 05:41:52,067 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 05:41:52,067 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 05:41:52,067 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 05:41:52,067 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-15 05:41:52,260 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 05:41:52,278 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 05:41:52,280 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 05:41:52,281 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 05:41:52,281 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 05:41:52,282 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/ludcmp.c [2022-04-15 05:41:52,332 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/429c5825c/df2a52837da9416b98a3bbb0fbd9aa4c/FLAGb4a705a7e [2022-04-15 05:41:52,730 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 05:41:52,734 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/ludcmp.c [2022-04-15 05:41:52,739 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/429c5825c/df2a52837da9416b98a3bbb0fbd9aa4c/FLAGb4a705a7e [2022-04-15 05:41:53,166 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/429c5825c/df2a52837da9416b98a3bbb0fbd9aa4c [2022-04-15 05:41:53,168 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 05:41:53,169 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 05:41:53,182 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 05:41:53,182 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 05:41:53,192 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 05:41:53,193 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:41:53" (1/1) ... [2022-04-15 05:41:53,193 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53453db6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:53, skipping insertion in model container [2022-04-15 05:41:53,194 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:41:53" (1/1) ... [2022-04-15 05:41:53,204 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 05:41:53,217 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 05:41:53,314 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-15 05:41:53,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:41:53,367 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 05:41:53,375 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-15 05:41:53,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:41:53,405 INFO L208 MainTranslator]: Completed translation [2022-04-15 05:41:53,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:53 WrapperNode [2022-04-15 05:41:53,405 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 05:41:53,406 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 05:41:53,406 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 05:41:53,406 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 05:41:53,415 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:53" (1/1) ... [2022-04-15 05:41:53,416 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:53" (1/1) ... [2022-04-15 05:41:53,426 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:53" (1/1) ... [2022-04-15 05:41:53,426 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:53" (1/1) ... [2022-04-15 05:41:53,441 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:53" (1/1) ... [2022-04-15 05:41:53,446 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:53" (1/1) ... [2022-04-15 05:41:53,448 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:53" (1/1) ... [2022-04-15 05:41:53,450 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 05:41:53,451 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 05:41:53,451 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 05:41:53,451 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 05:41:53,452 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:53" (1/1) ... [2022-04-15 05:41:53,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:41:53,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:41:53,485 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-15 05:41:53,496 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-15 05:41:53,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 05:41:53,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 05:41:53,517 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 05:41:53,517 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 05:41:53,517 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs [2022-04-15 05:41:53,517 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 05:41:53,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ludcmp [2022-04-15 05:41:53,518 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 05:41:53,518 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 05:41:53,518 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 05:41:53,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 05:41:53,518 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 05:41:53,518 INFO L130 BoogieDeclarations]: Found specification of procedure ludcmp [2022-04-15 05:41:53,518 INFO L130 BoogieDeclarations]: Found specification of procedure fabs [2022-04-15 05:41:53,518 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 05:41:53,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-04-15 05:41:53,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-04-15 05:41:53,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-15 05:41:53,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 05:41:53,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 05:41:53,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 05:41:53,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 05:41:53,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 05:41:53,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 05:41:53,575 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 05:41:53,576 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 05:41:54,136 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 05:41:54,141 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 05:41:54,141 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2022-04-15 05:41:54,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:41:54 BoogieIcfgContainer [2022-04-15 05:41:54,142 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 05:41:54,143 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 05:41:54,143 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 05:41:54,155 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 05:41:54,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 05:41:53" (1/3) ... [2022-04-15 05:41:54,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@631527b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:41:54, skipping insertion in model container [2022-04-15 05:41:54,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:53" (2/3) ... [2022-04-15 05:41:54,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@631527b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:41:54, skipping insertion in model container [2022-04-15 05:41:54,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:41:54" (3/3) ... [2022-04-15 05:41:54,160 INFO L111 eAbstractionObserver]: Analyzing ICFG ludcmp.c [2022-04-15 05:41:54,169 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 05:41:54,169 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 05:41:54,215 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 05:41:54,245 INFO L340 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 [2022-04-15 05:41:54,245 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 05:41:54,279 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-15 05:41:54,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 05:41:54,291 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:54,291 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:41:54,292 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:54,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:54,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1448102218, now seen corresponding path program 1 times [2022-04-15 05:41:54,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:54,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [123472642] [2022-04-15 05:41:54,313 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 05:41:54,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1448102218, now seen corresponding path program 2 times [2022-04-15 05:41:54,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:54,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653876354] [2022-04-15 05:41:54,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:54,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:54,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:54,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:54,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:54,622 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-15 05:41:54,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-15 05:41:54,623 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67#true} {67#true} #214#return; {67#true} is VALID [2022-04-15 05:41:54,625 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-15 05:41:54,625 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-15 05:41:54,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-15 05:41:54,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67#true} {67#true} #214#return; {67#true} is VALID [2022-04-15 05:41:54,626 INFO L272 TraceCheckUtils]: 4: Hoare triple {67#true} call #t~ret37 := main(); {67#true} is VALID [2022-04-15 05:41:54,626 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-15 05:41:54,627 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-15 05:41:54,627 INFO L290 TraceCheckUtils]: 7: Hoare triple {67#true} assume !true; {68#false} is VALID [2022-04-15 05:41:54,627 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-15 05:41:54,628 INFO L290 TraceCheckUtils]: 9: Hoare triple {68#false} ~cond := #in~cond; {68#false} is VALID [2022-04-15 05:41:54,628 INFO L290 TraceCheckUtils]: 10: Hoare triple {68#false} assume 0 == ~cond; {68#false} is VALID [2022-04-15 05:41:54,629 INFO L290 TraceCheckUtils]: 11: Hoare triple {68#false} assume !false; {68#false} is VALID [2022-04-15 05:41:54,629 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-15 05:41:54,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:54,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653876354] [2022-04-15 05:41:54,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653876354] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:54,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:54,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 05:41:54,633 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:54,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [123472642] [2022-04-15 05:41:54,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [123472642] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:54,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:54,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 05:41:54,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270612493] [2022-04-15 05:41:54,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:54,638 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-15 05:41:54,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:54,642 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-15 05:41:54,663 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-15 05:41:54,663 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 05:41:54,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:54,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 05:41:54,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 05:41:54,688 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-15 05:41:55,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:55,080 INFO L93 Difference]: Finished difference Result 147 states and 225 transitions. [2022-04-15 05:41:55,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 05:41:55,080 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-15 05:41:55,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:41:55,081 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-15 05:41:55,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 225 transitions. [2022-04-15 05:41:55,105 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-15 05:41:55,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 225 transitions. [2022-04-15 05:41:55,111 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 225 transitions. [2022-04-15 05:41:55,283 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-15 05:41:55,289 INFO L225 Difference]: With dead ends: 147 [2022-04-15 05:41:55,289 INFO L226 Difference]: Without dead ends: 24 [2022-04-15 05:41:55,292 INFO L912 BasicCegarLoop]: 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-15 05:41:55,294 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 38 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-15 05:41:55,294 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 73 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 05:41:55,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-15 05:41:55,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2022-04-15 05:41:55,314 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:41:55,314 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-15 05:41:55,315 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-15 05:41:55,315 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-15 05:41:55,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:55,317 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-04-15 05:41:55,318 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-15 05:41:55,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:55,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:55,318 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-15 05:41:55,319 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-15 05:41:55,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:55,320 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-04-15 05:41:55,320 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-15 05:41:55,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:55,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:55,321 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:41:55,321 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:41:55,321 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-15 05:41:55,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-04-15 05:41:55,323 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 12 [2022-04-15 05:41:55,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:41:55,323 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-04-15 05:41:55,323 INFO L479 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-15 05:41:55,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 22 transitions. [2022-04-15 05:41:55,341 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-15 05:41:55,342 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-15 05:41:55,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 05:41:55,342 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:55,342 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:41:55,342 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 05:41:55,343 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:55,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:55,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1436096445, now seen corresponding path program 1 times [2022-04-15 05:41:55,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:55,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [355361671] [2022-04-15 05:41:55,344 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 05:41:55,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1436096445, now seen corresponding path program 2 times [2022-04-15 05:41:55,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:55,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727544838] [2022-04-15 05:41:55,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:55,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:55,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:55,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:55,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:55,459 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-15 05:41:55,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {457#true} assume true; {457#true} is VALID [2022-04-15 05:41:55,460 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {457#true} {457#true} #214#return; {457#true} is VALID [2022-04-15 05:41:55,461 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-15 05:41:55,461 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-15 05:41:55,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {457#true} assume true; {457#true} is VALID [2022-04-15 05:41:55,461 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {457#true} {457#true} #214#return; {457#true} is VALID [2022-04-15 05:41:55,461 INFO L272 TraceCheckUtils]: 4: Hoare triple {457#true} call #t~ret37 := main(); {457#true} is VALID [2022-04-15 05:41:55,462 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-15 05:41:55,462 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-15 05:41:55,463 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-15 05:41:55,463 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-15 05:41:55,463 INFO L290 TraceCheckUtils]: 9: Hoare triple {458#false} ~cond := #in~cond; {458#false} is VALID [2022-04-15 05:41:55,463 INFO L290 TraceCheckUtils]: 10: Hoare triple {458#false} assume 0 == ~cond; {458#false} is VALID [2022-04-15 05:41:55,463 INFO L290 TraceCheckUtils]: 11: Hoare triple {458#false} assume !false; {458#false} is VALID [2022-04-15 05:41:55,463 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-15 05:41:55,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:55,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727544838] [2022-04-15 05:41:55,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727544838] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:55,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:55,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 05:41:55,464 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:55,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [355361671] [2022-04-15 05:41:55,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [355361671] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:55,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:55,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 05:41:55,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282070196] [2022-04-15 05:41:55,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:55,465 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-15 05:41:55,466 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:55,466 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-15 05:41:55,477 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-15 05:41:55,478 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 05:41:55,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:55,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 05:41:55,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:41:55,479 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-15 05:41:55,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:55,607 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2022-04-15 05:41:55,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 05:41:55,608 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-15 05:41:55,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:41:55,608 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-15 05:41:55,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-04-15 05:41:55,610 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-15 05:41:55,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-04-15 05:41:55,611 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 47 transitions. [2022-04-15 05:41:55,644 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-15 05:41:55,646 INFO L225 Difference]: With dead ends: 40 [2022-04-15 05:41:55,646 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 05:41:55,646 INFO L912 BasicCegarLoop]: 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-15 05:41:55,647 INFO L913 BasicCegarLoop]: 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-15 05:41:55,647 INFO L914 BasicCegarLoop]: 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-15 05:41:55,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 05:41:55,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2022-04-15 05:41:55,651 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:41:55,651 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-15 05:41:55,652 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-15 05:41:55,652 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-15 05:41:55,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:55,653 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-15 05:41:55,653 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-15 05:41:55,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:55,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:55,653 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-15 05:41:55,654 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-15 05:41:55,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:55,655 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-15 05:41:55,655 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-15 05:41:55,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:55,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:55,655 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:41:55,655 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:41:55,655 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-15 05:41:55,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-04-15 05:41:55,656 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 12 [2022-04-15 05:41:55,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:41:55,656 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-04-15 05:41:55,656 INFO L479 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-15 05:41:55,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 23 transitions. [2022-04-15 05:41:55,675 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-15 05:41:55,675 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-15 05:41:55,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 05:41:55,676 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:55,676 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:41:55,676 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 05:41:55,677 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:55,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:55,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1858105272, now seen corresponding path program 1 times [2022-04-15 05:41:55,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:55,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1610041945] [2022-04-15 05:41:55,694 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:41:55,695 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 05:41:55,695 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:41:55,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1858105272, now seen corresponding path program 2 times [2022-04-15 05:41:55,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:55,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373848390] [2022-04-15 05:41:55,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:55,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:55,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:55,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:55,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:55,840 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-15 05:41:55,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {645#true} assume true; {645#true} is VALID [2022-04-15 05:41:55,840 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {645#true} {645#true} #214#return; {645#true} is VALID [2022-04-15 05:41:55,843 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-15 05:41:55,843 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-15 05:41:55,843 INFO L290 TraceCheckUtils]: 2: Hoare triple {645#true} assume true; {645#true} is VALID [2022-04-15 05:41:55,843 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {645#true} {645#true} #214#return; {645#true} is VALID [2022-04-15 05:41:55,844 INFO L272 TraceCheckUtils]: 4: Hoare triple {645#true} call #t~ret37 := main(); {645#true} is VALID [2022-04-15 05:41:55,845 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-15 05:41:55,846 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-15 05:41:55,846 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-15 05:41:55,847 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-15 05:41:55,847 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-15 05:41:55,848 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-15 05:41:55,848 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-15 05:41:55,848 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-15 05:41:55,848 INFO L290 TraceCheckUtils]: 13: Hoare triple {646#false} ~cond := #in~cond; {646#false} is VALID [2022-04-15 05:41:55,849 INFO L290 TraceCheckUtils]: 14: Hoare triple {646#false} assume 0 == ~cond; {646#false} is VALID [2022-04-15 05:41:55,849 INFO L290 TraceCheckUtils]: 15: Hoare triple {646#false} assume !false; {646#false} is VALID [2022-04-15 05:41:55,849 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-15 05:41:55,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:55,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373848390] [2022-04-15 05:41:55,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373848390] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:41:55,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210311448] [2022-04-15 05:41:55,850 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:41:55,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:41:55,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:41:55,885 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-15 05:41:55,887 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-15 05:41:55,939 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:41:55,939 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:41:55,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 05:41:55,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:55,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:41:56,165 INFO L272 TraceCheckUtils]: 0: Hoare triple {645#true} call ULTIMATE.init(); {645#true} is VALID [2022-04-15 05:41:56,165 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-15 05:41:56,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {645#true} assume true; {645#true} is VALID [2022-04-15 05:41:56,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {645#true} {645#true} #214#return; {645#true} is VALID [2022-04-15 05:41:56,166 INFO L272 TraceCheckUtils]: 4: Hoare triple {645#true} call #t~ret37 := main(); {645#true} is VALID [2022-04-15 05:41:56,166 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-15 05:41:56,166 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-15 05:41:56,167 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-15 05:41:56,167 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-15 05:41:56,168 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-15 05:41:56,168 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-15 05:41:56,169 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-15 05:41:56,169 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-15 05:41:56,169 INFO L290 TraceCheckUtils]: 13: Hoare triple {646#false} ~cond := #in~cond; {646#false} is VALID [2022-04-15 05:41:56,169 INFO L290 TraceCheckUtils]: 14: Hoare triple {646#false} assume 0 == ~cond; {646#false} is VALID [2022-04-15 05:41:56,169 INFO L290 TraceCheckUtils]: 15: Hoare triple {646#false} assume !false; {646#false} is VALID [2022-04-15 05:41:56,169 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-15 05:41:56,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:41:56,296 INFO L290 TraceCheckUtils]: 15: Hoare triple {646#false} assume !false; {646#false} is VALID [2022-04-15 05:41:56,296 INFO L290 TraceCheckUtils]: 14: Hoare triple {646#false} assume 0 == ~cond; {646#false} is VALID [2022-04-15 05:41:56,296 INFO L290 TraceCheckUtils]: 13: Hoare triple {646#false} ~cond := #in~cond; {646#false} is VALID [2022-04-15 05:41:56,296 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-15 05:41:56,297 INFO L290 TraceCheckUtils]: 11: Hoare triple {717#(<= main_~j~0 main_~n~0)} assume !(~j~0 <= ~n~0); {646#false} is VALID [2022-04-15 05:41:56,297 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-15 05:41:56,297 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-15 05:41:56,298 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-15 05:41:56,298 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-15 05:41:56,299 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-15 05:41:56,299 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-15 05:41:56,299 INFO L272 TraceCheckUtils]: 4: Hoare triple {645#true} call #t~ret37 := main(); {645#true} is VALID [2022-04-15 05:41:56,299 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {645#true} {645#true} #214#return; {645#true} is VALID [2022-04-15 05:41:56,299 INFO L290 TraceCheckUtils]: 2: Hoare triple {645#true} assume true; {645#true} is VALID [2022-04-15 05:41:56,299 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-15 05:41:56,300 INFO L272 TraceCheckUtils]: 0: Hoare triple {645#true} call ULTIMATE.init(); {645#true} is VALID [2022-04-15 05:41:56,300 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-15 05:41:56,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210311448] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:41:56,300 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:41:56,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2022-04-15 05:41:56,301 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:56,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1610041945] [2022-04-15 05:41:56,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1610041945] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:56,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:56,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 05:41:56,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494645990] [2022-04-15 05:41:56,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:56,301 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-15 05:41:56,302 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:56,302 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-15 05:41:56,318 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-15 05:41:56,318 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 05:41:56,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:56,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 05:41:56,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-04-15 05:41:56,319 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-15 05:41:56,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:56,463 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2022-04-15 05:41:56,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 05:41:56,464 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-15 05:41:56,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:41:56,464 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-15 05:41:56,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2022-04-15 05:41:56,466 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-15 05:41:56,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2022-04-15 05:41:56,468 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 51 transitions. [2022-04-15 05:41:56,500 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-15 05:41:56,502 INFO L225 Difference]: With dead ends: 45 [2022-04-15 05:41:56,502 INFO L226 Difference]: Without dead ends: 30 [2022-04-15 05:41:56,503 INFO L912 BasicCegarLoop]: 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-15 05:41:56,512 INFO L913 BasicCegarLoop]: 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-15 05:41:56,513 INFO L914 BasicCegarLoop]: 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-15 05:41:56,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-15 05:41:56,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2022-04-15 05:41:56,520 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:41:56,521 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-15 05:41:56,522 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-15 05:41:56,522 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-15 05:41:56,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:56,524 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-04-15 05:41:56,524 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-04-15 05:41:56,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:56,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:56,525 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-15 05:41:56,525 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-15 05:41:56,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:56,526 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-04-15 05:41:56,526 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-04-15 05:41:56,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:56,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:56,527 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:41:56,528 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:41:56,528 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-15 05:41:56,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-15 05:41:56,528 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2022-04-15 05:41:56,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:41:56,529 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-15 05:41:56,530 INFO L479 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-15 05:41:56,530 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 28 transitions. [2022-04-15 05:41:56,554 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-15 05:41:56,554 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-15 05:41:56,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 05:41:56,556 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:56,556 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:41:56,575 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-15 05:41:56,771 WARN L460 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-15 05:41:56,771 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:56,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:56,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1949651507, now seen corresponding path program 3 times [2022-04-15 05:41:56,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:56,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1757706689] [2022-04-15 05:41:56,777 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:41:56,778 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 05:41:56,778 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:41:56,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1949651507, now seen corresponding path program 4 times [2022-04-15 05:41:56,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:56,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737176061] [2022-04-15 05:41:56,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:56,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:56,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:56,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:56,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:56,866 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-15 05:41:56,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {959#true} assume true; {959#true} is VALID [2022-04-15 05:41:56,867 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {959#true} {959#true} #214#return; {959#true} is VALID [2022-04-15 05:41:56,867 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-15 05:41:56,868 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-15 05:41:56,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {959#true} assume true; {959#true} is VALID [2022-04-15 05:41:56,869 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {959#true} {959#true} #214#return; {959#true} is VALID [2022-04-15 05:41:56,869 INFO L272 TraceCheckUtils]: 4: Hoare triple {959#true} call #t~ret37 := main(); {959#true} is VALID [2022-04-15 05:41:56,869 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-15 05:41:56,870 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-15 05:41:56,870 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-15 05:41:56,871 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-15 05:41:56,871 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-15 05:41:56,871 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-15 05:41:56,873 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-15 05:41:56,874 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-15 05:41:56,874 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-15 05:41:56,874 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-15 05:41:56,874 INFO L290 TraceCheckUtils]: 15: Hoare triple {960#false} assume !(~j~0 <= ~n~0); {960#false} is VALID [2022-04-15 05:41:56,874 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-15 05:41:56,874 INFO L290 TraceCheckUtils]: 17: Hoare triple {960#false} ~cond := #in~cond; {960#false} is VALID [2022-04-15 05:41:56,876 INFO L290 TraceCheckUtils]: 18: Hoare triple {960#false} assume 0 == ~cond; {960#false} is VALID [2022-04-15 05:41:56,876 INFO L290 TraceCheckUtils]: 19: Hoare triple {960#false} assume !false; {960#false} is VALID [2022-04-15 05:41:56,876 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-15 05:41:56,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:56,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737176061] [2022-04-15 05:41:56,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737176061] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:41:56,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594197494] [2022-04-15 05:41:56,876 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:41:56,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:41:56,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:41:56,877 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-15 05:41:56,878 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-15 05:41:56,935 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:41:56,935 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:41:56,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 05:41:56,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:56,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:41:57,126 INFO L272 TraceCheckUtils]: 0: Hoare triple {959#true} call ULTIMATE.init(); {959#true} is VALID [2022-04-15 05:41:57,126 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-15 05:41:57,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {959#true} assume true; {959#true} is VALID [2022-04-15 05:41:57,127 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {959#true} {959#true} #214#return; {959#true} is VALID [2022-04-15 05:41:57,127 INFO L272 TraceCheckUtils]: 4: Hoare triple {959#true} call #t~ret37 := main(); {959#true} is VALID [2022-04-15 05:41:57,127 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-15 05:41:57,128 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-15 05:41:57,128 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-15 05:41:57,128 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-15 05:41:57,129 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-15 05:41:57,129 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-15 05:41:57,130 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-15 05:41:57,131 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-15 05:41:57,131 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-15 05:41:57,133 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-15 05:41:57,133 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-15 05:41:57,133 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-15 05:41:57,133 INFO L290 TraceCheckUtils]: 17: Hoare triple {960#false} ~cond := #in~cond; {960#false} is VALID [2022-04-15 05:41:57,133 INFO L290 TraceCheckUtils]: 18: Hoare triple {960#false} assume 0 == ~cond; {960#false} is VALID [2022-04-15 05:41:57,133 INFO L290 TraceCheckUtils]: 19: Hoare triple {960#false} assume !false; {960#false} is VALID [2022-04-15 05:41:57,134 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-15 05:41:57,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:41:57,242 INFO L290 TraceCheckUtils]: 19: Hoare triple {960#false} assume !false; {960#false} is VALID [2022-04-15 05:41:57,242 INFO L290 TraceCheckUtils]: 18: Hoare triple {960#false} assume 0 == ~cond; {960#false} is VALID [2022-04-15 05:41:57,242 INFO L290 TraceCheckUtils]: 17: Hoare triple {960#false} ~cond := #in~cond; {960#false} is VALID [2022-04-15 05:41:57,242 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-15 05:41:57,242 INFO L290 TraceCheckUtils]: 15: Hoare triple {1044#(<= main_~j~0 main_~n~0)} assume !(~j~0 <= ~n~0); {960#false} is VALID [2022-04-15 05:41:57,243 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-15 05:41:57,243 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-15 05:41:57,243 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-15 05:41:57,244 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-15 05:41:57,244 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-15 05:41:57,244 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-15 05:41:57,245 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-15 05:41:57,245 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-15 05:41:57,245 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-15 05:41:57,246 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-15 05:41:57,246 INFO L272 TraceCheckUtils]: 4: Hoare triple {959#true} call #t~ret37 := main(); {959#true} is VALID [2022-04-15 05:41:57,246 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {959#true} {959#true} #214#return; {959#true} is VALID [2022-04-15 05:41:57,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {959#true} assume true; {959#true} is VALID [2022-04-15 05:41:57,246 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-15 05:41:57,246 INFO L272 TraceCheckUtils]: 0: Hoare triple {959#true} call ULTIMATE.init(); {959#true} is VALID [2022-04-15 05:41:57,247 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-15 05:41:57,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594197494] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:41:57,247 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:41:57,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-04-15 05:41:57,247 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:57,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1757706689] [2022-04-15 05:41:57,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1757706689] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:57,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:57,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 05:41:57,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750328173] [2022-04-15 05:41:57,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:57,248 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-15 05:41:57,248 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:57,248 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-15 05:41:57,273 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-15 05:41:57,273 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 05:41:57,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:57,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 05:41:57,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-04-15 05:41:57,274 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-15 05:41:57,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:57,409 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-15 05:41:57,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 05:41:57,410 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-15 05:41:57,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:41:57,411 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-15 05:41:57,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2022-04-15 05:41:57,413 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-15 05:41:57,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2022-04-15 05:41:57,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 54 transitions. [2022-04-15 05:41:57,443 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-15 05:41:57,454 INFO L225 Difference]: With dead ends: 57 [2022-04-15 05:41:57,454 INFO L226 Difference]: Without dead ends: 38 [2022-04-15 05:41:57,454 INFO L912 BasicCegarLoop]: 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-15 05:41:57,455 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 19 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:41:57,456 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 26 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:41:57,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-15 05:41:57,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2022-04-15 05:41:57,468 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:41:57,475 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-15 05:41:57,476 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-15 05:41:57,476 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-15 05:41:57,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:57,477 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2022-04-15 05:41:57,477 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-04-15 05:41:57,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:57,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:57,481 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-15 05:41:57,481 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-15 05:41:57,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:57,484 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2022-04-15 05:41:57,484 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-04-15 05:41:57,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:57,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:57,484 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:41:57,484 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:41:57,485 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-15 05:41:57,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-04-15 05:41:57,485 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 20 [2022-04-15 05:41:57,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:41:57,486 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-04-15 05:41:57,486 INFO L479 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-15 05:41:57,486 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 39 transitions. [2022-04-15 05:41:57,512 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-15 05:41:57,512 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-15 05:41:57,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 05:41:57,512 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:57,513 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:41:57,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 05:41:57,741 WARN L460 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-15 05:41:57,741 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:57,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:57,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1140304881, now seen corresponding path program 1 times [2022-04-15 05:41:57,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:57,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1130699527] [2022-04-15 05:41:57,747 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:41:57,747 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 05:41:57,747 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:41:57,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1140304881, now seen corresponding path program 2 times [2022-04-15 05:41:57,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:57,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665817975] [2022-04-15 05:41:57,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:57,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:57,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:57,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:57,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:57,818 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-15 05:41:57,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {1359#true} assume true; {1359#true} is VALID [2022-04-15 05:41:57,818 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1359#true} {1359#true} #214#return; {1359#true} is VALID [2022-04-15 05:41:57,819 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-15 05:41:57,819 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-15 05:41:57,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {1359#true} assume true; {1359#true} is VALID [2022-04-15 05:41:57,819 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1359#true} {1359#true} #214#return; {1359#true} is VALID [2022-04-15 05:41:57,819 INFO L272 TraceCheckUtils]: 4: Hoare triple {1359#true} call #t~ret37 := main(); {1359#true} is VALID [2022-04-15 05:41:57,820 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-15 05:41:57,820 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-15 05:41:57,820 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-15 05:41:57,821 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-15 05:41:57,821 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-15 05:41:57,822 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-15 05:41:57,822 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-15 05:41:57,822 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-15 05:41:57,823 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-15 05:41:57,823 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-15 05:41:57,824 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-15 05:41:57,824 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-15 05:41:57,824 INFO L290 TraceCheckUtils]: 17: Hoare triple {1360#false} ~cond := #in~cond; {1360#false} is VALID [2022-04-15 05:41:57,824 INFO L290 TraceCheckUtils]: 18: Hoare triple {1360#false} assume 0 == ~cond; {1360#false} is VALID [2022-04-15 05:41:57,824 INFO L290 TraceCheckUtils]: 19: Hoare triple {1360#false} assume !false; {1360#false} is VALID [2022-04-15 05:41:57,824 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-15 05:41:57,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:57,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665817975] [2022-04-15 05:41:57,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665817975] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:41:57,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380893044] [2022-04-15 05:41:57,824 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:41:57,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:41:57,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:41:57,825 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-15 05:41:57,826 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-15 05:41:57,873 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:41:57,874 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:41:57,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 05:41:57,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:57,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:41:58,007 INFO L272 TraceCheckUtils]: 0: Hoare triple {1359#true} call ULTIMATE.init(); {1359#true} is VALID [2022-04-15 05:41:58,008 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-15 05:41:58,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {1359#true} assume true; {1359#true} is VALID [2022-04-15 05:41:58,008 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1359#true} {1359#true} #214#return; {1359#true} is VALID [2022-04-15 05:41:58,008 INFO L272 TraceCheckUtils]: 4: Hoare triple {1359#true} call #t~ret37 := main(); {1359#true} is VALID [2022-04-15 05:41:58,008 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-15 05:41:58,009 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-15 05:41:58,009 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-15 05:41:58,010 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-15 05:41:58,010 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-15 05:41:58,011 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-15 05:41:58,011 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-15 05:41:58,012 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-15 05:41:58,012 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-15 05:41:58,012 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-15 05:41:58,013 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-15 05:41:58,013 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-15 05:41:58,013 INFO L290 TraceCheckUtils]: 17: Hoare triple {1360#false} ~cond := #in~cond; {1360#false} is VALID [2022-04-15 05:41:58,013 INFO L290 TraceCheckUtils]: 18: Hoare triple {1360#false} assume 0 == ~cond; {1360#false} is VALID [2022-04-15 05:41:58,013 INFO L290 TraceCheckUtils]: 19: Hoare triple {1360#false} assume !false; {1360#false} is VALID [2022-04-15 05:41:58,013 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-15 05:41:58,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:41:58,113 INFO L290 TraceCheckUtils]: 19: Hoare triple {1360#false} assume !false; {1360#false} is VALID [2022-04-15 05:41:58,113 INFO L290 TraceCheckUtils]: 18: Hoare triple {1360#false} assume 0 == ~cond; {1360#false} is VALID [2022-04-15 05:41:58,113 INFO L290 TraceCheckUtils]: 17: Hoare triple {1360#false} ~cond := #in~cond; {1360#false} is VALID [2022-04-15 05:41:58,114 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-15 05:41:58,114 INFO L290 TraceCheckUtils]: 15: Hoare triple {1445#(<= main_~j~0 main_~n~0)} assume !(~j~0 <= ~n~0); {1360#false} is VALID [2022-04-15 05:41:58,114 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-15 05:41:58,115 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-15 05:41:58,115 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-15 05:41:58,116 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-15 05:41:58,116 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-15 05:41:58,117 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-15 05:41:58,117 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-15 05:41:58,117 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-15 05:41:58,118 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-15 05:41:58,124 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-15 05:41:58,124 INFO L272 TraceCheckUtils]: 4: Hoare triple {1359#true} call #t~ret37 := main(); {1359#true} is VALID [2022-04-15 05:41:58,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1359#true} {1359#true} #214#return; {1359#true} is VALID [2022-04-15 05:41:58,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {1359#true} assume true; {1359#true} is VALID [2022-04-15 05:41:58,124 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-15 05:41:58,124 INFO L272 TraceCheckUtils]: 0: Hoare triple {1359#true} call ULTIMATE.init(); {1359#true} is VALID [2022-04-15 05:41:58,124 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-15 05:41:58,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380893044] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:41:58,124 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:41:58,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2022-04-15 05:41:58,125 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:58,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1130699527] [2022-04-15 05:41:58,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1130699527] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:58,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:58,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 05:41:58,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634600811] [2022-04-15 05:41:58,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:58,125 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-15 05:41:58,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:58,125 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-15 05:41:58,137 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-15 05:41:58,138 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 05:41:58,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:58,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 05:41:58,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2022-04-15 05:41:58,138 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-15 05:41:58,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:58,299 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2022-04-15 05:41:58,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 05:41:58,299 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-15 05:41:58,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:41:58,299 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-15 05:41:58,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 56 transitions. [2022-04-15 05:41:58,300 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-15 05:41:58,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 56 transitions. [2022-04-15 05:41:58,301 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 56 transitions. [2022-04-15 05:41:58,341 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-15 05:41:58,342 INFO L225 Difference]: With dead ends: 68 [2022-04-15 05:41:58,342 INFO L226 Difference]: Without dead ends: 49 [2022-04-15 05:41:58,342 INFO L912 BasicCegarLoop]: 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-15 05:41:58,343 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 28 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:41:58,343 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 32 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:41:58,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-15 05:41:58,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2022-04-15 05:41:58,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:41:58,362 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-15 05:41:58,362 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-15 05:41:58,362 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-15 05:41:58,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:58,363 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2022-04-15 05:41:58,363 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2022-04-15 05:41:58,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:58,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:58,364 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-15 05:41:58,364 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-15 05:41:58,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:58,365 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2022-04-15 05:41:58,365 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2022-04-15 05:41:58,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:58,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:58,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:41:58,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:41:58,365 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-15 05:41:58,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2022-04-15 05:41:58,366 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 20 [2022-04-15 05:41:58,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:41:58,366 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2022-04-15 05:41:58,366 INFO L479 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-15 05:41:58,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 48 transitions. [2022-04-15 05:41:58,403 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-15 05:41:58,404 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-15 05:41:58,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 05:41:58,404 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:58,404 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:41:58,440 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-15 05:41:58,617 WARN L460 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-15 05:41:58,617 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:58,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:58,618 INFO L85 PathProgramCache]: Analyzing trace with hash -162258006, now seen corresponding path program 3 times [2022-04-15 05:41:58,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:58,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1083115177] [2022-04-15 05:41:58,624 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:41:58,624 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 05:41:58,624 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:41:58,624 INFO L85 PathProgramCache]: Analyzing trace with hash -162258006, now seen corresponding path program 4 times [2022-04-15 05:41:58,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:58,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503501900] [2022-04-15 05:41:58,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:58,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:58,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:58,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:58,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:58,704 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-15 05:41:58,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {1820#true} assume true; {1820#true} is VALID [2022-04-15 05:41:58,704 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1820#true} {1820#true} #214#return; {1820#true} is VALID [2022-04-15 05:41:58,705 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-15 05:41:58,705 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-15 05:41:58,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {1820#true} assume true; {1820#true} is VALID [2022-04-15 05:41:58,705 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1820#true} {1820#true} #214#return; {1820#true} is VALID [2022-04-15 05:41:58,705 INFO L272 TraceCheckUtils]: 4: Hoare triple {1820#true} call #t~ret37 := main(); {1820#true} is VALID [2022-04-15 05:41:58,706 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-15 05:41:58,706 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-15 05:41:58,707 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-15 05:41:58,707 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-15 05:41:58,707 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-15 05:41:58,708 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-15 05:41:58,708 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-15 05:41:58,709 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-15 05:41:58,709 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-15 05:41:58,710 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-15 05:41:58,710 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-15 05:41:58,710 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-15 05:41:58,711 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-15 05:41:58,711 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-15 05:41:58,712 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-15 05:41:58,712 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-15 05:41:58,712 INFO L290 TraceCheckUtils]: 21: Hoare triple {1821#false} ~cond := #in~cond; {1821#false} is VALID [2022-04-15 05:41:58,712 INFO L290 TraceCheckUtils]: 22: Hoare triple {1821#false} assume 0 == ~cond; {1821#false} is VALID [2022-04-15 05:41:58,712 INFO L290 TraceCheckUtils]: 23: Hoare triple {1821#false} assume !false; {1821#false} is VALID [2022-04-15 05:41:58,712 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-15 05:41:58,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:58,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503501900] [2022-04-15 05:41:58,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503501900] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:41:58,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107258233] [2022-04-15 05:41:58,713 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:41:58,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:41:58,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:41:58,728 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-15 05:41:58,729 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-15 05:41:58,800 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:41:58,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:41:58,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 05:41:58,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:58,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:41:59,000 INFO L272 TraceCheckUtils]: 0: Hoare triple {1820#true} call ULTIMATE.init(); {1820#true} is VALID [2022-04-15 05:41:59,000 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-15 05:41:59,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {1820#true} assume true; {1820#true} is VALID [2022-04-15 05:41:59,000 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1820#true} {1820#true} #214#return; {1820#true} is VALID [2022-04-15 05:41:59,000 INFO L272 TraceCheckUtils]: 4: Hoare triple {1820#true} call #t~ret37 := main(); {1820#true} is VALID [2022-04-15 05:41:59,000 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-15 05:41:59,001 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-15 05:41:59,001 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-15 05:41:59,002 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-15 05:41:59,002 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-15 05:41:59,002 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-15 05:41:59,003 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-15 05:41:59,003 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-15 05:41:59,004 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-15 05:41:59,006 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-15 05:41:59,007 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-15 05:41:59,008 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-15 05:41:59,008 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-15 05:41:59,009 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-15 05:41:59,009 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-15 05:41:59,009 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-15 05:41:59,009 INFO L290 TraceCheckUtils]: 21: Hoare triple {1821#false} ~cond := #in~cond; {1821#false} is VALID [2022-04-15 05:41:59,009 INFO L290 TraceCheckUtils]: 22: Hoare triple {1821#false} assume 0 == ~cond; {1821#false} is VALID [2022-04-15 05:41:59,009 INFO L290 TraceCheckUtils]: 23: Hoare triple {1821#false} assume !false; {1821#false} is VALID [2022-04-15 05:41:59,009 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-15 05:41:59,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:41:59,139 INFO L290 TraceCheckUtils]: 23: Hoare triple {1821#false} assume !false; {1821#false} is VALID [2022-04-15 05:41:59,140 INFO L290 TraceCheckUtils]: 22: Hoare triple {1821#false} assume 0 == ~cond; {1821#false} is VALID [2022-04-15 05:41:59,140 INFO L290 TraceCheckUtils]: 21: Hoare triple {1821#false} ~cond := #in~cond; {1821#false} is VALID [2022-04-15 05:41:59,140 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-15 05:41:59,140 INFO L290 TraceCheckUtils]: 19: Hoare triple {1920#(<= main_~j~0 main_~n~0)} assume !(~j~0 <= ~n~0); {1821#false} is VALID [2022-04-15 05:41:59,141 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-15 05:41:59,141 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-15 05:41:59,141 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-15 05:41:59,141 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-15 05:41:59,142 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-15 05:41:59,142 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-15 05:41:59,142 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-15 05:41:59,143 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-15 05:41:59,143 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-15 05:41:59,143 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-15 05:41:59,144 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-15 05:41:59,144 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-15 05:41:59,145 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-15 05:41:59,145 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-15 05:41:59,145 INFO L272 TraceCheckUtils]: 4: Hoare triple {1820#true} call #t~ret37 := main(); {1820#true} is VALID [2022-04-15 05:41:59,145 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1820#true} {1820#true} #214#return; {1820#true} is VALID [2022-04-15 05:41:59,145 INFO L290 TraceCheckUtils]: 2: Hoare triple {1820#true} assume true; {1820#true} is VALID [2022-04-15 05:41:59,145 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-15 05:41:59,145 INFO L272 TraceCheckUtils]: 0: Hoare triple {1820#true} call ULTIMATE.init(); {1820#true} is VALID [2022-04-15 05:41:59,145 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-15 05:41:59,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107258233] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:41:59,146 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:41:59,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2022-04-15 05:41:59,146 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:59,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1083115177] [2022-04-15 05:41:59,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1083115177] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:59,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:59,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 05:41:59,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597101761] [2022-04-15 05:41:59,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:59,146 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-15 05:41:59,147 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:59,147 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-15 05:41:59,161 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-15 05:41:59,161 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 05:41:59,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:59,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 05:41:59,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=192, Unknown=0, NotChecked=0, Total=306 [2022-04-15 05:41:59,162 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-15 05:41:59,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:59,333 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2022-04-15 05:41:59,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 05:41:59,333 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-15 05:41:59,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:41:59,333 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-15 05:41:59,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 61 transitions. [2022-04-15 05:41:59,334 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-15 05:41:59,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 61 transitions. [2022-04-15 05:41:59,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 61 transitions. [2022-04-15 05:41:59,372 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-15 05:41:59,373 INFO L225 Difference]: With dead ends: 80 [2022-04-15 05:41:59,373 INFO L226 Difference]: Without dead ends: 57 [2022-04-15 05:41:59,373 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=139, Invalid=241, Unknown=0, NotChecked=0, Total=380 [2022-04-15 05:41:59,374 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 33 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:41:59,374 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 33 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:41:59,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-15 05:41:59,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2022-04-15 05:41:59,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:41:59,401 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-15 05:41:59,401 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-15 05:41:59,401 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-15 05:41:59,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:59,403 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2022-04-15 05:41:59,403 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2022-04-15 05:41:59,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:59,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:59,403 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-15 05:41:59,403 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-15 05:41:59,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:59,404 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2022-04-15 05:41:59,404 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2022-04-15 05:41:59,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:59,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:59,404 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:41:59,405 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:41:59,405 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-15 05:41:59,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2022-04-15 05:41:59,406 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 24 [2022-04-15 05:41:59,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:41:59,406 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2022-04-15 05:41:59,406 INFO L479 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-15 05:41:59,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 57 transitions. [2022-04-15 05:41:59,448 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-15 05:41:59,448 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2022-04-15 05:41:59,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 05:41:59,448 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:59,448 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:41:59,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 05:41:59,665 WARN L460 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-15 05:41:59,665 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:59,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:59,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1312024861, now seen corresponding path program 5 times [2022-04-15 05:41:59,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:59,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [6110572] [2022-04-15 05:41:59,670 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:41:59,670 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 05:41:59,670 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:41:59,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1312024861, now seen corresponding path program 6 times [2022-04-15 05:41:59,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:59,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100364570] [2022-04-15 05:41:59,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:59,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:59,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:59,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:59,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:59,751 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-15 05:41:59,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {2364#true} assume true; {2364#true} is VALID [2022-04-15 05:41:59,752 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2364#true} {2364#true} #214#return; {2364#true} is VALID [2022-04-15 05:41:59,752 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-15 05:41:59,752 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-15 05:41:59,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {2364#true} assume true; {2364#true} is VALID [2022-04-15 05:41:59,753 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2364#true} {2364#true} #214#return; {2364#true} is VALID [2022-04-15 05:41:59,753 INFO L272 TraceCheckUtils]: 4: Hoare triple {2364#true} call #t~ret37 := main(); {2364#true} is VALID [2022-04-15 05:41:59,753 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-15 05:41:59,753 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-15 05:41:59,754 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-15 05:41:59,754 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-15 05:41:59,755 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-15 05:41:59,755 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-15 05:41:59,755 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-15 05:41:59,756 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-15 05:41:59,756 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-15 05:41:59,756 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-15 05:41:59,757 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-15 05:41:59,757 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-15 05:41:59,757 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-15 05:41:59,758 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-15 05:41:59,758 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-15 05:41:59,759 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-15 05:41:59,760 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-15 05:41:59,760 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-15 05:41:59,760 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-15 05:41:59,760 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-15 05:41:59,761 INFO L290 TraceCheckUtils]: 25: Hoare triple {2365#false} ~cond := #in~cond; {2365#false} is VALID [2022-04-15 05:41:59,761 INFO L290 TraceCheckUtils]: 26: Hoare triple {2365#false} assume 0 == ~cond; {2365#false} is VALID [2022-04-15 05:41:59,761 INFO L290 TraceCheckUtils]: 27: Hoare triple {2365#false} assume !false; {2365#false} is VALID [2022-04-15 05:41:59,761 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-15 05:41:59,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:59,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100364570] [2022-04-15 05:41:59,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100364570] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:41:59,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009153537] [2022-04-15 05:41:59,761 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:41:59,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:41:59,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:41:59,776 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-15 05:41:59,777 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-15 05:41:59,837 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 05:41:59,838 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:41:59,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 05:41:59,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:59,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:42:00,058 INFO L272 TraceCheckUtils]: 0: Hoare triple {2364#true} call ULTIMATE.init(); {2364#true} is VALID [2022-04-15 05:42:00,058 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-15 05:42:00,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {2364#true} assume true; {2364#true} is VALID [2022-04-15 05:42:00,059 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2364#true} {2364#true} #214#return; {2364#true} is VALID [2022-04-15 05:42:00,059 INFO L272 TraceCheckUtils]: 4: Hoare triple {2364#true} call #t~ret37 := main(); {2364#true} is VALID [2022-04-15 05:42:00,059 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-15 05:42:00,059 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-15 05:42:00,060 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-15 05:42:00,061 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-15 05:42:00,061 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-15 05:42:00,061 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-15 05:42:00,062 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-15 05:42:00,062 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-15 05:42:00,064 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-15 05:42:00,064 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-15 05:42:00,065 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-15 05:42:00,065 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-15 05:42:00,065 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-15 05:42:00,066 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-15 05:42:00,066 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-15 05:42:00,066 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-15 05:42:00,067 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-15 05:42:00,069 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-15 05:42:00,069 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-15 05:42:00,069 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-15 05:42:00,069 INFO L290 TraceCheckUtils]: 25: Hoare triple {2365#false} ~cond := #in~cond; {2365#false} is VALID [2022-04-15 05:42:00,070 INFO L290 TraceCheckUtils]: 26: Hoare triple {2365#false} assume 0 == ~cond; {2365#false} is VALID [2022-04-15 05:42:00,070 INFO L290 TraceCheckUtils]: 27: Hoare triple {2365#false} assume !false; {2365#false} is VALID [2022-04-15 05:42:00,070 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-15 05:42:00,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:42:00,219 INFO L290 TraceCheckUtils]: 27: Hoare triple {2365#false} assume !false; {2365#false} is VALID [2022-04-15 05:42:00,219 INFO L290 TraceCheckUtils]: 26: Hoare triple {2365#false} assume 0 == ~cond; {2365#false} is VALID [2022-04-15 05:42:00,219 INFO L290 TraceCheckUtils]: 25: Hoare triple {2365#false} ~cond := #in~cond; {2365#false} is VALID [2022-04-15 05:42:00,219 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-15 05:42:00,219 INFO L290 TraceCheckUtils]: 23: Hoare triple {2478#(<= main_~j~0 main_~n~0)} assume !(~j~0 <= ~n~0); {2365#false} is VALID [2022-04-15 05:42:00,220 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-15 05:42:00,220 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-15 05:42:00,220 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-15 05:42:00,221 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-15 05:42:00,221 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-15 05:42:00,221 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-15 05:42:00,221 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-15 05:42:00,222 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-15 05:42:00,222 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-15 05:42:00,223 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-15 05:42:00,223 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-15 05:42:00,223 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-15 05:42:00,224 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-15 05:42:00,224 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-15 05:42:00,224 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-15 05:42:00,224 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-15 05:42:00,225 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-15 05:42:00,225 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-15 05:42:00,225 INFO L272 TraceCheckUtils]: 4: Hoare triple {2364#true} call #t~ret37 := main(); {2364#true} is VALID [2022-04-15 05:42:00,225 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2364#true} {2364#true} #214#return; {2364#true} is VALID [2022-04-15 05:42:00,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {2364#true} assume true; {2364#true} is VALID [2022-04-15 05:42:00,225 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-15 05:42:00,225 INFO L272 TraceCheckUtils]: 0: Hoare triple {2364#true} call ULTIMATE.init(); {2364#true} is VALID [2022-04-15 05:42:00,226 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-15 05:42:00,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009153537] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:42:00,226 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:42:00,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2022-04-15 05:42:00,226 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:00,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [6110572] [2022-04-15 05:42:00,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [6110572] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:00,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:00,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 05:42:00,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847660461] [2022-04-15 05:42:00,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:00,227 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-15 05:42:00,227 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:00,227 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-15 05:42:00,243 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-15 05:42:00,244 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 05:42:00,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:00,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 05:42:00,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=270, Unknown=0, NotChecked=0, Total=420 [2022-04-15 05:42:00,244 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-15 05:42:00,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:00,472 INFO L93 Difference]: Finished difference Result 92 states and 107 transitions. [2022-04-15 05:42:00,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 05:42:00,472 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-15 05:42:00,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:00,472 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-15 05:42:00,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 66 transitions. [2022-04-15 05:42:00,474 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-15 05:42:00,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 66 transitions. [2022-04-15 05:42:00,475 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 66 transitions. [2022-04-15 05:42:00,517 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-15 05:42:00,518 INFO L225 Difference]: With dead ends: 92 [2022-04-15 05:42:00,518 INFO L226 Difference]: Without dead ends: 65 [2022-04-15 05:42:00,519 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=178, Invalid=328, Unknown=0, NotChecked=0, Total=506 [2022-04-15 05:42:00,519 INFO L913 BasicCegarLoop]: 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-15 05:42:00,519 INFO L914 BasicCegarLoop]: 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-15 05:42:00,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-15 05:42:00,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2022-04-15 05:42:00,561 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:00,561 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-15 05:42:00,562 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-15 05:42:00,562 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-15 05:42:00,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:00,563 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2022-04-15 05:42:00,563 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2022-04-15 05:42:00,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:00,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:00,564 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-15 05:42:00,564 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-15 05:42:00,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:00,565 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2022-04-15 05:42:00,565 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2022-04-15 05:42:00,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:00,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:00,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:00,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:00,566 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-15 05:42:00,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2022-04-15 05:42:00,567 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 28 [2022-04-15 05:42:00,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:00,567 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2022-04-15 05:42:00,567 INFO L479 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-15 05:42:00,567 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 66 transitions. [2022-04-15 05:42:00,624 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-15 05:42:00,625 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2022-04-15 05:42:00,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 05:42:00,625 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:00,625 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:42:00,642 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-15 05:42:00,829 WARN L460 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-15 05:42:00,830 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:00,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:00,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1026934172, now seen corresponding path program 7 times [2022-04-15 05:42:00,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:00,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [569095273] [2022-04-15 05:42:00,845 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:42:00,845 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 05:42:00,845 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:42:00,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1026934172, now seen corresponding path program 8 times [2022-04-15 05:42:00,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:00,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135820547] [2022-04-15 05:42:00,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:00,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:00,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:00,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:42:00,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:00,986 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-15 05:42:00,986 INFO L290 TraceCheckUtils]: 1: Hoare triple {2991#true} assume true; {2991#true} is VALID [2022-04-15 05:42:00,986 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2991#true} {2991#true} #214#return; {2991#true} is VALID [2022-04-15 05:42:00,987 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-15 05:42:00,987 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-15 05:42:00,987 INFO L290 TraceCheckUtils]: 2: Hoare triple {2991#true} assume true; {2991#true} is VALID [2022-04-15 05:42:00,987 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2991#true} {2991#true} #214#return; {2991#true} is VALID [2022-04-15 05:42:00,987 INFO L272 TraceCheckUtils]: 4: Hoare triple {2991#true} call #t~ret37 := main(); {2991#true} is VALID [2022-04-15 05:42:00,991 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-15 05:42:00,992 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-15 05:42:00,992 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-15 05:42:00,994 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-15 05:42:00,994 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-15 05:42:00,994 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-15 05:42:00,995 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-15 05:42:00,995 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-15 05:42:00,995 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-15 05:42:00,996 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-15 05:42:00,996 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-15 05:42:00,996 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-15 05:42:00,997 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-15 05:42:00,997 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-15 05:42:00,998 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-15 05:42:00,998 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-15 05:42:00,998 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-15 05:42:00,999 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-15 05:42:00,999 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-15 05:42:00,999 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-15 05:42:01,000 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-15 05:42:01,000 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-15 05:42:01,000 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-15 05:42:01,000 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-15 05:42:01,000 INFO L290 TraceCheckUtils]: 29: Hoare triple {2992#false} ~cond := #in~cond; {2992#false} is VALID [2022-04-15 05:42:01,001 INFO L290 TraceCheckUtils]: 30: Hoare triple {2992#false} assume 0 == ~cond; {2992#false} is VALID [2022-04-15 05:42:01,001 INFO L290 TraceCheckUtils]: 31: Hoare triple {2992#false} assume !false; {2992#false} is VALID [2022-04-15 05:42:01,001 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-15 05:42:01,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:01,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135820547] [2022-04-15 05:42:01,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135820547] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:42:01,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294326984] [2022-04-15 05:42:01,001 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:42:01,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:01,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:01,002 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-15 05:42:01,015 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-15 05:42:01,074 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:42:01,074 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:42:01,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 05:42:01,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:01,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:42:01,369 INFO L272 TraceCheckUtils]: 0: Hoare triple {2991#true} call ULTIMATE.init(); {2991#true} is VALID [2022-04-15 05:42:01,369 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-15 05:42:01,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {2991#true} assume true; {2991#true} is VALID [2022-04-15 05:42:01,369 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2991#true} {2991#true} #214#return; {2991#true} is VALID [2022-04-15 05:42:01,369 INFO L272 TraceCheckUtils]: 4: Hoare triple {2991#true} call #t~ret37 := main(); {2991#true} is VALID [2022-04-15 05:42:01,370 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-15 05:42:01,370 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-15 05:42:01,370 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-15 05:42:01,371 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-15 05:42:01,371 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-15 05:42:01,372 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-15 05:42:01,372 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-15 05:42:01,372 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-15 05:42:01,373 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-15 05:42:01,373 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-15 05:42:01,374 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-15 05:42:01,374 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-15 05:42:01,374 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-15 05:42:01,375 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-15 05:42:01,375 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-15 05:42:01,375 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-15 05:42:01,376 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-15 05:42:01,376 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-15 05:42:01,377 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-15 05:42:01,377 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-15 05:42:01,377 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-15 05:42:01,378 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-15 05:42:01,378 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-15 05:42:01,378 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-15 05:42:01,378 INFO L290 TraceCheckUtils]: 29: Hoare triple {2992#false} ~cond := #in~cond; {2992#false} is VALID [2022-04-15 05:42:01,378 INFO L290 TraceCheckUtils]: 30: Hoare triple {2992#false} assume 0 == ~cond; {2992#false} is VALID [2022-04-15 05:42:01,378 INFO L290 TraceCheckUtils]: 31: Hoare triple {2992#false} assume !false; {2992#false} is VALID [2022-04-15 05:42:01,378 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-15 05:42:01,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:42:01,569 INFO L290 TraceCheckUtils]: 31: Hoare triple {2992#false} assume !false; {2992#false} is VALID [2022-04-15 05:42:01,569 INFO L290 TraceCheckUtils]: 30: Hoare triple {2992#false} assume 0 == ~cond; {2992#false} is VALID [2022-04-15 05:42:01,569 INFO L290 TraceCheckUtils]: 29: Hoare triple {2992#false} ~cond := #in~cond; {2992#false} is VALID [2022-04-15 05:42:01,569 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-15 05:42:01,569 INFO L290 TraceCheckUtils]: 27: Hoare triple {3119#(<= main_~j~0 main_~n~0)} assume !(~j~0 <= ~n~0); {2992#false} is VALID [2022-04-15 05:42:01,570 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-15 05:42:01,570 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-15 05:42:01,570 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-15 05:42:01,571 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-15 05:42:01,571 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-15 05:42:01,571 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-15 05:42:01,572 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-15 05:42:01,572 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-15 05:42:01,572 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-15 05:42:01,573 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-15 05:42:01,573 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-15 05:42:01,573 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-15 05:42:01,574 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-15 05:42:01,574 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-15 05:42:01,574 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-15 05:42:01,575 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-15 05:42:01,575 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-15 05:42:01,575 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-15 05:42:01,576 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-15 05:42:01,576 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-15 05:42:01,576 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-15 05:42:01,577 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-15 05:42:01,577 INFO L272 TraceCheckUtils]: 4: Hoare triple {2991#true} call #t~ret37 := main(); {2991#true} is VALID [2022-04-15 05:42:01,577 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2991#true} {2991#true} #214#return; {2991#true} is VALID [2022-04-15 05:42:01,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {2991#true} assume true; {2991#true} is VALID [2022-04-15 05:42:01,577 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-15 05:42:01,577 INFO L272 TraceCheckUtils]: 0: Hoare triple {2991#true} call ULTIMATE.init(); {2991#true} is VALID [2022-04-15 05:42:01,577 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-15 05:42:01,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294326984] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:42:01,577 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:42:01,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 23 [2022-04-15 05:42:01,577 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:01,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [569095273] [2022-04-15 05:42:01,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [569095273] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:01,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:01,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 05:42:01,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93469233] [2022-04-15 05:42:01,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:01,578 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-15 05:42:01,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:01,578 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-15 05:42:01,598 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-15 05:42:01,599 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 05:42:01,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:01,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 05:42:01,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=336, Unknown=0, NotChecked=0, Total=506 [2022-04-15 05:42:01,600 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-15 05:42:01,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:01,809 INFO L93 Difference]: Finished difference Result 98 states and 114 transitions. [2022-04-15 05:42:01,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 05:42:01,809 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-15 05:42:01,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:01,810 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-15 05:42:01,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 67 transitions. [2022-04-15 05:42:01,811 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-15 05:42:01,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 67 transitions. [2022-04-15 05:42:01,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 67 transitions. [2022-04-15 05:42:01,855 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-15 05:42:01,856 INFO L225 Difference]: With dead ends: 98 [2022-04-15 05:42:01,856 INFO L226 Difference]: Without dead ends: 67 [2022-04-15 05:42:01,857 INFO L912 BasicCegarLoop]: 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-15 05:42:01,857 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 61 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:42:01,857 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 33 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:42:01,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-15 05:42:01,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-04-15 05:42:01,914 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:01,914 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-15 05:42:01,914 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-15 05:42:01,914 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-15 05:42:01,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:01,916 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2022-04-15 05:42:01,916 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2022-04-15 05:42:01,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:01,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:01,916 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-15 05:42:01,916 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-15 05:42:01,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:01,917 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2022-04-15 05:42:01,917 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2022-04-15 05:42:01,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:01,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:01,917 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:01,918 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:01,918 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-15 05:42:01,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2022-04-15 05:42:01,919 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 32 [2022-04-15 05:42:01,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:01,919 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2022-04-15 05:42:01,919 INFO L479 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-15 05:42:01,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 75 transitions. [2022-04-15 05:42:02,013 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-15 05:42:02,013 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2022-04-15 05:42:02,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 05:42:02,014 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:02,014 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:42:02,030 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-15 05:42:02,230 WARN L460 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-15 05:42:02,230 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:02,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:02,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1975029803, now seen corresponding path program 9 times [2022-04-15 05:42:02,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:02,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [836481043] [2022-04-15 05:42:02,241 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:42:02,241 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 05:42:02,241 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:42:02,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1975029803, now seen corresponding path program 10 times [2022-04-15 05:42:02,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:02,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204965875] [2022-04-15 05:42:02,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:02,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:02,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 05:42:02,267 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 05:42:02,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 05:42:02,294 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 05:42:02,294 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-15 05:42:02,294 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-15 05:42:02,296 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 05:42:02,296 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 05:42:02,298 INFO L719 BasicCegarLoop]: Path program histogram: [10, 4, 2, 2] [2022-04-15 05:42:02,300 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 05:42:02,308 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 05:42:02,308 WARN L170 areAnnotationChecker]: ludcmpENTRY has no Hoare annotation [2022-04-15 05:42:02,308 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-15 05:42:02,308 WARN L170 areAnnotationChecker]: fabsENTRY has no Hoare annotation [2022-04-15 05:42:02,308 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 05:42:02,308 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 05:42:02,308 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-15 05:42:02,308 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-15 05:42:02,308 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 05:42:02,308 WARN L170 areAnnotationChecker]: L117 has no Hoare annotation [2022-04-15 05:42:02,308 WARN L170 areAnnotationChecker]: L117 has no Hoare annotation [2022-04-15 05:42:02,308 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 05:42:02,308 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-04-15 05:42:02,308 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-04-15 05:42:02,309 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 05:42:02,309 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 05:42:02,309 WARN L170 areAnnotationChecker]: L93-3 has no Hoare annotation [2022-04-15 05:42:02,309 WARN L170 areAnnotationChecker]: L93-3 has no Hoare annotation [2022-04-15 05:42:02,309 WARN L170 areAnnotationChecker]: L93-3 has no Hoare annotation [2022-04-15 05:42:02,309 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-15 05:42:02,309 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-15 05:42:02,309 WARN L170 areAnnotationChecker]: ludcmpFINAL has no Hoare annotation [2022-04-15 05:42:02,309 WARN L170 areAnnotationChecker]: L118-3 has no Hoare annotation [2022-04-15 05:42:02,309 WARN L170 areAnnotationChecker]: L118-3 has no Hoare annotation [2022-04-15 05:42:02,309 WARN L170 areAnnotationChecker]: L118-3 has no Hoare annotation [2022-04-15 05:42:02,309 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 05:42:02,309 WARN L170 areAnnotationChecker]: L80-2 has no Hoare annotation [2022-04-15 05:42:02,309 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 05:42:02,309 WARN L170 areAnnotationChecker]: L93-4 has no Hoare annotation [2022-04-15 05:42:02,309 WARN L170 areAnnotationChecker]: L93-4 has no Hoare annotation [2022-04-15 05:42:02,309 WARN L170 areAnnotationChecker]: L96-3 has no Hoare annotation [2022-04-15 05:42:02,309 WARN L170 areAnnotationChecker]: L96-3 has no Hoare annotation [2022-04-15 05:42:02,309 WARN L170 areAnnotationChecker]: L96-3 has no Hoare annotation [2022-04-15 05:42:02,309 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-15 05:42:02,309 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-15 05:42:02,309 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-15 05:42:02,309 WARN L170 areAnnotationChecker]: ludcmpEXIT has no Hoare annotation [2022-04-15 05:42:02,309 WARN L170 areAnnotationChecker]: L118-4 has no Hoare annotation [2022-04-15 05:42:02,309 WARN L170 areAnnotationChecker]: L120 has no Hoare annotation [2022-04-15 05:42:02,309 WARN L170 areAnnotationChecker]: L120 has no Hoare annotation [2022-04-15 05:42:02,309 WARN L170 areAnnotationChecker]: fabsFINAL has no Hoare annotation [2022-04-15 05:42:02,309 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2022-04-15 05:42:02,309 WARN L170 areAnnotationChecker]: L96-4 has no Hoare annotation [2022-04-15 05:42:02,309 WARN L170 areAnnotationChecker]: L96-4 has no Hoare annotation [2022-04-15 05:42:02,309 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2022-04-15 05:42:02,309 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2022-04-15 05:42:02,309 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 05:42:02,310 WARN L170 areAnnotationChecker]: L138-3 has no Hoare annotation [2022-04-15 05:42:02,310 WARN L170 areAnnotationChecker]: L138-3 has no Hoare annotation [2022-04-15 05:42:02,310 WARN L170 areAnnotationChecker]: L138-3 has no Hoare annotation [2022-04-15 05:42:02,310 WARN L170 areAnnotationChecker]: L120-1 has no Hoare annotation [2022-04-15 05:42:02,310 WARN L170 areAnnotationChecker]: L120-1 has no Hoare annotation [2022-04-15 05:42:02,310 WARN L170 areAnnotationChecker]: fabsEXIT has no Hoare annotation [2022-04-15 05:42:02,310 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 05:42:02,310 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2022-04-15 05:42:02,310 WARN L170 areAnnotationChecker]: L99-2 has no Hoare annotation [2022-04-15 05:42:02,310 WARN L170 areAnnotationChecker]: L138-4 has no Hoare annotation [2022-04-15 05:42:02,310 WARN L170 areAnnotationChecker]: L141-3 has no Hoare annotation [2022-04-15 05:42:02,310 WARN L170 areAnnotationChecker]: L141-3 has no Hoare annotation [2022-04-15 05:42:02,310 WARN L170 areAnnotationChecker]: L141-3 has no Hoare annotation [2022-04-15 05:42:02,310 WARN L170 areAnnotationChecker]: L121-3 has no Hoare annotation [2022-04-15 05:42:02,310 WARN L170 areAnnotationChecker]: L121-3 has no Hoare annotation [2022-04-15 05:42:02,310 WARN L170 areAnnotationChecker]: L121-3 has no Hoare annotation [2022-04-15 05:42:02,310 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 05:42:02,310 WARN L170 areAnnotationChecker]: L93-2 has no Hoare annotation [2022-04-15 05:42:02,310 WARN L170 areAnnotationChecker]: L96-2 has no Hoare annotation [2022-04-15 05:42:02,310 WARN L170 areAnnotationChecker]: L146-3 has no Hoare annotation [2022-04-15 05:42:02,310 WARN L170 areAnnotationChecker]: L146-3 has no Hoare annotation [2022-04-15 05:42:02,310 WARN L170 areAnnotationChecker]: L146-3 has no Hoare annotation [2022-04-15 05:42:02,310 WARN L170 areAnnotationChecker]: L141-4 has no Hoare annotation [2022-04-15 05:42:02,310 WARN L170 areAnnotationChecker]: L141-2 has no Hoare annotation [2022-04-15 05:42:02,310 WARN L170 areAnnotationChecker]: L121-4 has no Hoare annotation [2022-04-15 05:42:02,310 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-04-15 05:42:02,310 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-04-15 05:42:02,310 WARN L170 areAnnotationChecker]: L146-4 has no Hoare annotation [2022-04-15 05:42:02,310 WARN L170 areAnnotationChecker]: L149-3 has no Hoare annotation [2022-04-15 05:42:02,310 WARN L170 areAnnotationChecker]: L149-3 has no Hoare annotation [2022-04-15 05:42:02,310 WARN L170 areAnnotationChecker]: L149-3 has no Hoare annotation [2022-04-15 05:42:02,310 WARN L170 areAnnotationChecker]: L138-2 has no Hoare annotation [2022-04-15 05:42:02,310 WARN L170 areAnnotationChecker]: L129-3 has no Hoare annotation [2022-04-15 05:42:02,310 WARN L170 areAnnotationChecker]: L129-3 has no Hoare annotation [2022-04-15 05:42:02,311 WARN L170 areAnnotationChecker]: L129-3 has no Hoare annotation [2022-04-15 05:42:02,311 WARN L170 areAnnotationChecker]: L125-3 has no Hoare annotation [2022-04-15 05:42:02,311 WARN L170 areAnnotationChecker]: L125-3 has no Hoare annotation [2022-04-15 05:42:02,311 WARN L170 areAnnotationChecker]: L125-3 has no Hoare annotation [2022-04-15 05:42:02,311 WARN L170 areAnnotationChecker]: L124-1 has no Hoare annotation [2022-04-15 05:42:02,311 WARN L170 areAnnotationChecker]: L149-4 has no Hoare annotation [2022-04-15 05:42:02,311 WARN L170 areAnnotationChecker]: L149-2 has no Hoare annotation [2022-04-15 05:42:02,311 WARN L170 areAnnotationChecker]: L118-2 has no Hoare annotation [2022-04-15 05:42:02,311 WARN L170 areAnnotationChecker]: L132-3 has no Hoare annotation [2022-04-15 05:42:02,311 WARN L170 areAnnotationChecker]: L132-3 has no Hoare annotation [2022-04-15 05:42:02,311 WARN L170 areAnnotationChecker]: L132-3 has no Hoare annotation [2022-04-15 05:42:02,311 WARN L170 areAnnotationChecker]: L125-2 has no Hoare annotation [2022-04-15 05:42:02,311 WARN L170 areAnnotationChecker]: L121-2 has no Hoare annotation [2022-04-15 05:42:02,311 WARN L170 areAnnotationChecker]: L146-2 has no Hoare annotation [2022-04-15 05:42:02,311 WARN L170 areAnnotationChecker]: L132-4 has no Hoare annotation [2022-04-15 05:42:02,311 WARN L170 areAnnotationChecker]: L132-2 has no Hoare annotation [2022-04-15 05:42:02,311 WARN L170 areAnnotationChecker]: L129-2 has no Hoare annotation [2022-04-15 05:42:02,311 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-15 05:42:02,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 05:42:02 BoogieIcfgContainer [2022-04-15 05:42:02,312 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 05:42:02,312 INFO L158 Benchmark]: Toolchain (without parser) took 9143.32ms. Allocated memory was 220.2MB in the beginning and 325.1MB in the end (delta: 104.9MB). Free memory was 169.3MB in the beginning and 282.9MB in the end (delta: -113.6MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 05:42:02,313 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 220.2MB. Free memory is still 185.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 05:42:02,313 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.38ms. Allocated memory is still 220.2MB. Free memory was 169.1MB in the beginning and 191.8MB in the end (delta: -22.7MB). Peak memory consumption was 6.0MB. Max. memory is 8.0GB. [2022-04-15 05:42:02,313 INFO L158 Benchmark]: Boogie Preprocessor took 44.15ms. Allocated memory is still 220.2MB. Free memory was 191.8MB in the beginning and 189.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 05:42:02,313 INFO L158 Benchmark]: RCFGBuilder took 691.56ms. Allocated memory is still 220.2MB. Free memory was 189.1MB in the beginning and 169.5MB in the end (delta: 19.7MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-04-15 05:42:02,313 INFO L158 Benchmark]: TraceAbstraction took 8168.67ms. Allocated memory was 220.2MB in the beginning and 325.1MB in the end (delta: 104.9MB). Free memory was 168.7MB in the beginning and 282.9MB in the end (delta: -114.1MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 05:42:02,314 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.10ms. Allocated memory is still 220.2MB. Free memory is still 185.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 223.38ms. Allocated memory is still 220.2MB. Free memory was 169.1MB in the beginning and 191.8MB in the end (delta: -22.7MB). Peak memory consumption was 6.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.15ms. Allocated memory is still 220.2MB. Free memory was 191.8MB in the beginning and 189.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 691.56ms. Allocated memory is still 220.2MB. Free memory was 189.1MB in the beginning and 169.5MB in the end (delta: 19.7MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 8168.67ms. Allocated memory was 220.2MB in the beginning and 325.1MB in the end (delta: 104.9MB). Free memory was 168.7MB in the beginning and 282.9MB in the end (delta: -114.1MB). There was no memory consumed. 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: 8.1s, OverallIterations: 9, TraceHistogramMax: 6, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 274 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 265 mSDsluCounter, 294 SdHoareTripleChecker+Invalid, 0.4s 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, 0.8s 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.2s 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-15 05:42:02,334 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...