/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-34549b5 [2022-04-08 03:35:07,482 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 03:35:07,485 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 03:35:07,528 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 03:35:07,529 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 03:35:07,530 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 03:35:07,533 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 03:35:07,536 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 03:35:07,537 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 03:35:07,542 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 03:35:07,543 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 03:35:07,544 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 03:35:07,545 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 03:35:07,547 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 03:35:07,548 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 03:35:07,551 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 03:35:07,552 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 03:35:07,553 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 03:35:07,555 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 03:35:07,560 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 03:35:07,562 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 03:35:07,563 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 03:35:07,564 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 03:35:07,565 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 03:35:07,567 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 03:35:07,571 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 03:35:07,571 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 03:35:07,572 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 03:35:07,572 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 03:35:07,573 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 03:35:07,574 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 03:35:07,575 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 03:35:07,576 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 03:35:07,577 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 03:35:07,577 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 03:35:07,578 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 03:35:07,578 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 03:35:07,579 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 03:35:07,579 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 03:35:07,579 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 03:35:07,580 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 03:35:07,582 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 03:35:07,582 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 03:35:07,594 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 03:35:07,595 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 03:35:07,596 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 03:35:07,596 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 03:35:07,597 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 03:35:07,597 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 03:35:07,597 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 03:35:07,597 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 03:35:07,597 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 03:35:07,598 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 03:35:07,598 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 03:35:07,598 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 03:35:07,598 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 03:35:07,599 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 03:35:07,599 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 03:35:07,599 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 03:35:07,599 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 03:35:07,599 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 03:35:07,599 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 03:35:07,600 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 03:35:07,600 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 03:35:07,600 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 03:35:07,600 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 03:35:07,600 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 03:35:07,600 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 03:35:07,600 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-08 03:35:07,852 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 03:35:07,882 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 03:35:07,884 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 03:35:07,885 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 03:35:07,886 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 03:35:07,887 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/ludcmp.c [2022-04-08 03:35:07,949 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66a0a39cb/6b83d112e989481f8bffe089202f764a/FLAG0c5906e23 [2022-04-08 03:35:08,304 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 03:35:08,305 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/ludcmp.c [2022-04-08 03:35:08,316 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66a0a39cb/6b83d112e989481f8bffe089202f764a/FLAG0c5906e23 [2022-04-08 03:35:08,713 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66a0a39cb/6b83d112e989481f8bffe089202f764a [2022-04-08 03:35:08,715 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 03:35:08,716 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 03:35:08,721 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 03:35:08,721 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 03:35:08,724 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 03:35:08,725 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:35:08" (1/1) ... [2022-04-08 03:35:08,726 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d4163ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:35:08, skipping insertion in model container [2022-04-08 03:35:08,727 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:35:08" (1/1) ... [2022-04-08 03:35:08,734 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 03:35:08,764 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 03:35:08,906 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-08 03:35:08,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 03:35:08,983 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 03:35:08,996 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-08 03:35:09,018 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 03:35:09,032 INFO L208 MainTranslator]: Completed translation [2022-04-08 03:35:09,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:35:09 WrapperNode [2022-04-08 03:35:09,032 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 03:35:09,033 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 03:35:09,034 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 03:35:09,034 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 03:35:09,046 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:35:09" (1/1) ... [2022-04-08 03:35:09,046 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:35:09" (1/1) ... [2022-04-08 03:35:09,060 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:35:09" (1/1) ... [2022-04-08 03:35:09,061 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:35:09" (1/1) ... [2022-04-08 03:35:09,086 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:35:09" (1/1) ... [2022-04-08 03:35:09,102 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:35:09" (1/1) ... [2022-04-08 03:35:09,105 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:35:09" (1/1) ... [2022-04-08 03:35:09,108 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 03:35:09,109 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 03:35:09,109 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 03:35:09,109 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 03:35:09,110 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:35:09" (1/1) ... [2022-04-08 03:35:09,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 03:35:09,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:35:09,153 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-08 03:35:09,164 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-08 03:35:09,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 03:35:09,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 03:35:09,202 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 03:35:09,202 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 03:35:09,202 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs [2022-04-08 03:35:09,202 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 03:35:09,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ludcmp [2022-04-08 03:35:09,203 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 03:35:09,203 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 03:35:09,203 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 03:35:09,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 03:35:09,204 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 03:35:09,205 INFO L130 BoogieDeclarations]: Found specification of procedure ludcmp [2022-04-08 03:35:09,205 INFO L130 BoogieDeclarations]: Found specification of procedure fabs [2022-04-08 03:35:09,205 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 03:35:09,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-04-08 03:35:09,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-04-08 03:35:09,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-08 03:35:09,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 03:35:09,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 03:35:09,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 03:35:09,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 03:35:09,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 03:35:09,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 03:35:09,294 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 03:35:09,296 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 03:35:09,787 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 03:35:09,798 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 03:35:09,798 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2022-04-08 03:35:09,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:35:09 BoogieIcfgContainer [2022-04-08 03:35:09,800 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 03:35:09,801 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 03:35:09,802 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 03:35:09,805 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 03:35:09,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 03:35:08" (1/3) ... [2022-04-08 03:35:09,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52764a70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:35:09, skipping insertion in model container [2022-04-08 03:35:09,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:35:09" (2/3) ... [2022-04-08 03:35:09,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52764a70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:35:09, skipping insertion in model container [2022-04-08 03:35:09,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:35:09" (3/3) ... [2022-04-08 03:35:09,808 INFO L111 eAbstractionObserver]: Analyzing ICFG ludcmp.c [2022-04-08 03:35:09,812 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 03:35:09,812 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 03:35:09,844 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 03:35:09,850 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-08 03:35:09,850 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 03:35:09,868 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-08 03:35:09,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 03:35:09,873 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:09,873 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:35:09,874 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:09,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:09,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1448102218, now seen corresponding path program 1 times [2022-04-08 03:35:09,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:09,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [186088995] [2022-04-08 03:35:09,893 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:35:09,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1448102218, now seen corresponding path program 2 times [2022-04-08 03:35:09,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:09,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73167247] [2022-04-08 03:35:09,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:09,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:10,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:10,153 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-08 03:35:10,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-08 03:35:10,154 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67#true} {67#true} #214#return; {67#true} is VALID [2022-04-08 03:35:10,156 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-08 03:35:10,157 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-08 03:35:10,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-08 03:35:10,157 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67#true} {67#true} #214#return; {67#true} is VALID [2022-04-08 03:35:10,158 INFO L272 TraceCheckUtils]: 4: Hoare triple {67#true} call #t~ret37 := main(); {67#true} is VALID [2022-04-08 03:35:10,159 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-08 03:35:10,159 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-08 03:35:10,160 INFO L290 TraceCheckUtils]: 7: Hoare triple {67#true} assume !true; {68#false} is VALID [2022-04-08 03:35:10,160 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-08 03:35:10,161 INFO L290 TraceCheckUtils]: 9: Hoare triple {68#false} ~cond := #in~cond; {68#false} is VALID [2022-04-08 03:35:10,161 INFO L290 TraceCheckUtils]: 10: Hoare triple {68#false} assume 0 == ~cond; {68#false} is VALID [2022-04-08 03:35:10,161 INFO L290 TraceCheckUtils]: 11: Hoare triple {68#false} assume !false; {68#false} is VALID [2022-04-08 03:35:10,161 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-08 03:35:10,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:10,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73167247] [2022-04-08 03:35:10,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73167247] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:10,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:10,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 03:35:10,166 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:10,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [186088995] [2022-04-08 03:35:10,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [186088995] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:10,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:10,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 03:35:10,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153774542] [2022-04-08 03:35:10,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:10,173 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-08 03:35:10,176 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:10,180 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-08 03:35:10,208 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-08 03:35:10,208 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 03:35:10,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:10,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 03:35:10,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 03:35:10,238 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-08 03:35:10,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:10,752 INFO L93 Difference]: Finished difference Result 147 states and 225 transitions. [2022-04-08 03:35:10,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 03:35:10,752 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-08 03:35:10,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:10,755 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-08 03:35:10,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 225 transitions. [2022-04-08 03:35:10,777 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-08 03:35:10,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 225 transitions. [2022-04-08 03:35:10,789 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 225 transitions. [2022-04-08 03:35:11,057 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-08 03:35:11,065 INFO L225 Difference]: With dead ends: 147 [2022-04-08 03:35:11,066 INFO L226 Difference]: Without dead ends: 24 [2022-04-08 03:35:11,069 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-08 03:35:11,073 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 38 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:35:11,074 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.1s Time] [2022-04-08 03:35:11,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-08 03:35:11,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2022-04-08 03:35:11,101 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:11,102 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-08 03:35:11,103 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-08 03:35:11,103 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-08 03:35:11,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:11,106 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-04-08 03:35:11,107 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-08 03:35:11,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:11,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:11,108 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-08 03:35:11,108 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-08 03:35:11,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:11,110 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-04-08 03:35:11,110 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-08 03:35:11,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:11,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:11,111 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:11,111 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:11,112 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-08 03:35:11,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-04-08 03:35:11,114 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 12 [2022-04-08 03:35:11,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:11,121 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-04-08 03:35:11,122 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-08 03:35:11,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 22 transitions. [2022-04-08 03:35:11,149 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-08 03:35:11,149 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-08 03:35:11,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 03:35:11,150 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:11,150 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:35:11,151 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 03:35:11,151 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:11,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:11,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1436096445, now seen corresponding path program 1 times [2022-04-08 03:35:11,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:11,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [828757273] [2022-04-08 03:35:11,159 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:35:11,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1436096445, now seen corresponding path program 2 times [2022-04-08 03:35:11,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:11,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918141072] [2022-04-08 03:35:11,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:11,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:11,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:11,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:11,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:11,322 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-08 03:35:11,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {457#true} assume true; {457#true} is VALID [2022-04-08 03:35:11,323 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {457#true} {457#true} #214#return; {457#true} is VALID [2022-04-08 03:35:11,325 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-08 03:35:11,325 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-08 03:35:11,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {457#true} assume true; {457#true} is VALID [2022-04-08 03:35:11,326 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {457#true} {457#true} #214#return; {457#true} is VALID [2022-04-08 03:35:11,326 INFO L272 TraceCheckUtils]: 4: Hoare triple {457#true} call #t~ret37 := main(); {457#true} is VALID [2022-04-08 03:35:11,327 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-08 03:35:11,327 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-08 03:35:11,328 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-08 03:35:11,328 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-08 03:35:11,328 INFO L290 TraceCheckUtils]: 9: Hoare triple {458#false} ~cond := #in~cond; {458#false} is VALID [2022-04-08 03:35:11,328 INFO L290 TraceCheckUtils]: 10: Hoare triple {458#false} assume 0 == ~cond; {458#false} is VALID [2022-04-08 03:35:11,329 INFO L290 TraceCheckUtils]: 11: Hoare triple {458#false} assume !false; {458#false} is VALID [2022-04-08 03:35:11,329 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-08 03:35:11,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:11,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918141072] [2022-04-08 03:35:11,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918141072] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:11,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:11,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 03:35:11,330 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:11,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [828757273] [2022-04-08 03:35:11,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [828757273] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:11,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:11,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 03:35:11,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798995831] [2022-04-08 03:35:11,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:11,332 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-08 03:35:11,332 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:11,332 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-08 03:35:11,345 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-08 03:35:11,345 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 03:35:11,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:11,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 03:35:11,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 03:35:11,348 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-08 03:35:11,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:11,552 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2022-04-08 03:35:11,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 03:35:11,552 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-08 03:35:11,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:11,553 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-08 03:35:11,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-04-08 03:35:11,557 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-08 03:35:11,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-04-08 03:35:11,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 47 transitions. [2022-04-08 03:35:11,618 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-08 03:35:11,620 INFO L225 Difference]: With dead ends: 40 [2022-04-08 03:35:11,620 INFO L226 Difference]: Without dead ends: 26 [2022-04-08 03:35:11,623 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-08 03:35:11,625 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.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:35:11,630 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.1s Time] [2022-04-08 03:35:11,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-08 03:35:11,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2022-04-08 03:35:11,635 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:11,635 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-08 03:35:11,636 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-08 03:35:11,636 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-08 03:35:11,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:11,637 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-08 03:35:11,637 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-08 03:35:11,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:11,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:11,638 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-08 03:35:11,638 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-08 03:35:11,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:11,641 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-08 03:35:11,642 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-08 03:35:11,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:11,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:11,642 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:11,642 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:11,643 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-08 03:35:11,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-04-08 03:35:11,644 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 12 [2022-04-08 03:35:11,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:11,644 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-04-08 03:35:11,644 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-08 03:35:11,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 23 transitions. [2022-04-08 03:35:11,673 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-08 03:35:11,673 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-08 03:35:11,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 03:35:11,674 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:11,674 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:35:11,674 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 03:35:11,675 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:11,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:11,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1858105272, now seen corresponding path program 1 times [2022-04-08 03:35:11,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:11,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2032712796] [2022-04-08 03:35:11,696 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:35:11,696 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 03:35:11,696 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:35:11,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1858105272, now seen corresponding path program 2 times [2022-04-08 03:35:11,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:11,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55665751] [2022-04-08 03:35:11,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:11,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:11,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:11,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:11,800 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-08 03:35:11,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {645#true} assume true; {645#true} is VALID [2022-04-08 03:35:11,801 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {645#true} {645#true} #214#return; {645#true} is VALID [2022-04-08 03:35:11,803 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-08 03:35:11,804 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-08 03:35:11,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {645#true} assume true; {645#true} is VALID [2022-04-08 03:35:11,804 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {645#true} {645#true} #214#return; {645#true} is VALID [2022-04-08 03:35:11,804 INFO L272 TraceCheckUtils]: 4: Hoare triple {645#true} call #t~ret37 := main(); {645#true} is VALID [2022-04-08 03:35:11,805 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-08 03:35:11,805 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-08 03:35:11,806 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-08 03:35:11,807 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-08 03:35:11,808 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-08 03:35:11,808 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-08 03:35:11,809 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-08 03:35:11,810 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-08 03:35:11,810 INFO L290 TraceCheckUtils]: 13: Hoare triple {646#false} ~cond := #in~cond; {646#false} is VALID [2022-04-08 03:35:11,810 INFO L290 TraceCheckUtils]: 14: Hoare triple {646#false} assume 0 == ~cond; {646#false} is VALID [2022-04-08 03:35:11,810 INFO L290 TraceCheckUtils]: 15: Hoare triple {646#false} assume !false; {646#false} is VALID [2022-04-08 03:35:11,811 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-08 03:35:11,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:11,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55665751] [2022-04-08 03:35:11,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55665751] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:35:11,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65854480] [2022-04-08 03:35:11,812 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:35:11,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:11,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:35:11,815 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-08 03:35:11,839 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-08 03:35:11,895 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 03:35:11,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:35:11,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 03:35:11,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:11,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:35:12,145 INFO L272 TraceCheckUtils]: 0: Hoare triple {645#true} call ULTIMATE.init(); {645#true} is VALID [2022-04-08 03:35:12,145 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-08 03:35:12,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {645#true} assume true; {645#true} is VALID [2022-04-08 03:35:12,146 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {645#true} {645#true} #214#return; {645#true} is VALID [2022-04-08 03:35:12,146 INFO L272 TraceCheckUtils]: 4: Hoare triple {645#true} call #t~ret37 := main(); {645#true} is VALID [2022-04-08 03:35:12,147 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-08 03:35:12,148 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-08 03:35:12,148 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-08 03:35:12,149 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-08 03:35:12,150 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-08 03:35:12,151 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-08 03:35:12,151 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-08 03:35:12,152 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-08 03:35:12,152 INFO L290 TraceCheckUtils]: 13: Hoare triple {646#false} ~cond := #in~cond; {646#false} is VALID [2022-04-08 03:35:12,152 INFO L290 TraceCheckUtils]: 14: Hoare triple {646#false} assume 0 == ~cond; {646#false} is VALID [2022-04-08 03:35:12,152 INFO L290 TraceCheckUtils]: 15: Hoare triple {646#false} assume !false; {646#false} is VALID [2022-04-08 03:35:12,152 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-08 03:35:12,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:35:12,261 INFO L290 TraceCheckUtils]: 15: Hoare triple {646#false} assume !false; {646#false} is VALID [2022-04-08 03:35:12,261 INFO L290 TraceCheckUtils]: 14: Hoare triple {646#false} assume 0 == ~cond; {646#false} is VALID [2022-04-08 03:35:12,261 INFO L290 TraceCheckUtils]: 13: Hoare triple {646#false} ~cond := #in~cond; {646#false} is VALID [2022-04-08 03:35:12,261 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-08 03:35:12,262 INFO L290 TraceCheckUtils]: 11: Hoare triple {717#(<= main_~j~0 main_~n~0)} assume !(~j~0 <= ~n~0); {646#false} is VALID [2022-04-08 03:35:12,262 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-08 03:35:12,263 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-08 03:35:12,263 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-08 03:35:12,264 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-08 03:35:12,265 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-08 03:35:12,265 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-08 03:35:12,265 INFO L272 TraceCheckUtils]: 4: Hoare triple {645#true} call #t~ret37 := main(); {645#true} is VALID [2022-04-08 03:35:12,265 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {645#true} {645#true} #214#return; {645#true} is VALID [2022-04-08 03:35:12,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {645#true} assume true; {645#true} is VALID [2022-04-08 03:35:12,266 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-08 03:35:12,266 INFO L272 TraceCheckUtils]: 0: Hoare triple {645#true} call ULTIMATE.init(); {645#true} is VALID [2022-04-08 03:35:12,266 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-08 03:35:12,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65854480] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:35:12,267 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:35:12,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2022-04-08 03:35:12,267 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:12,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2032712796] [2022-04-08 03:35:12,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2032712796] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:12,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:12,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:35:12,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981192041] [2022-04-08 03:35:12,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:12,268 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-08 03:35:12,269 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:12,269 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-08 03:35:12,283 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-08 03:35:12,284 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 03:35:12,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:12,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 03:35:12,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-04-08 03:35:12,285 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-08 03:35:12,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:12,467 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2022-04-08 03:35:12,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 03:35:12,468 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-08 03:35:12,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:12,469 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-08 03:35:12,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2022-04-08 03:35:12,473 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-08 03:35:12,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2022-04-08 03:35:12,476 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 51 transitions. [2022-04-08 03:35:12,522 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-08 03:35:12,524 INFO L225 Difference]: With dead ends: 45 [2022-04-08 03:35:12,524 INFO L226 Difference]: Without dead ends: 30 [2022-04-08 03:35:12,525 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-08 03:35:12,532 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.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:35:12,534 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.1s Time] [2022-04-08 03:35:12,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-08 03:35:12,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2022-04-08 03:35:12,547 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:12,547 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-08 03:35:12,547 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-08 03:35:12,548 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-08 03:35:12,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:12,549 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-04-08 03:35:12,549 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-04-08 03:35:12,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:12,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:12,550 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-08 03:35:12,550 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-08 03:35:12,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:12,552 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-04-08 03:35:12,552 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-04-08 03:35:12,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:12,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:12,552 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:12,553 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:12,553 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-08 03:35:12,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-08 03:35:12,554 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2022-04-08 03:35:12,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:12,554 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-08 03:35:12,555 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-08 03:35:12,555 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 28 transitions. [2022-04-08 03:35:12,586 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-08 03:35:12,586 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-08 03:35:12,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 03:35:12,587 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:12,587 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:35:12,613 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-08 03:35:12,807 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-08 03:35:12,808 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:12,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:12,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1949651507, now seen corresponding path program 3 times [2022-04-08 03:35:12,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:12,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1621603212] [2022-04-08 03:35:12,813 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:35:12,813 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 03:35:12,813 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:35:12,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1949651507, now seen corresponding path program 4 times [2022-04-08 03:35:12,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:12,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456213675] [2022-04-08 03:35:12,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:12,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:12,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:12,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:12,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:12,933 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-08 03:35:12,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {959#true} assume true; {959#true} is VALID [2022-04-08 03:35:12,934 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {959#true} {959#true} #214#return; {959#true} is VALID [2022-04-08 03:35:12,935 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-08 03:35:12,935 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-08 03:35:12,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {959#true} assume true; {959#true} is VALID [2022-04-08 03:35:12,936 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {959#true} {959#true} #214#return; {959#true} is VALID [2022-04-08 03:35:12,936 INFO L272 TraceCheckUtils]: 4: Hoare triple {959#true} call #t~ret37 := main(); {959#true} is VALID [2022-04-08 03:35:12,937 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-08 03:35:12,937 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-08 03:35:12,938 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-08 03:35:12,938 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-08 03:35:12,941 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-08 03:35:12,941 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-08 03:35:12,942 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-08 03:35:12,943 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-08 03:35:12,943 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-08 03:35:12,944 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-08 03:35:12,944 INFO L290 TraceCheckUtils]: 15: Hoare triple {960#false} assume !(~j~0 <= ~n~0); {960#false} is VALID [2022-04-08 03:35:12,944 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-08 03:35:12,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {960#false} ~cond := #in~cond; {960#false} is VALID [2022-04-08 03:35:12,944 INFO L290 TraceCheckUtils]: 18: Hoare triple {960#false} assume 0 == ~cond; {960#false} is VALID [2022-04-08 03:35:12,946 INFO L290 TraceCheckUtils]: 19: Hoare triple {960#false} assume !false; {960#false} is VALID [2022-04-08 03:35:12,947 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-08 03:35:12,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:12,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456213675] [2022-04-08 03:35:12,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456213675] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:35:12,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27025961] [2022-04-08 03:35:12,947 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 03:35:12,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:12,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:35:12,949 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-08 03:35:12,950 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-08 03:35:13,020 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 03:35:13,020 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:35:13,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 03:35:13,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:13,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:35:13,281 INFO L272 TraceCheckUtils]: 0: Hoare triple {959#true} call ULTIMATE.init(); {959#true} is VALID [2022-04-08 03:35:13,281 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-08 03:35:13,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {959#true} assume true; {959#true} is VALID [2022-04-08 03:35:13,281 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {959#true} {959#true} #214#return; {959#true} is VALID [2022-04-08 03:35:13,282 INFO L272 TraceCheckUtils]: 4: Hoare triple {959#true} call #t~ret37 := main(); {959#true} is VALID [2022-04-08 03:35:13,282 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-08 03:35:13,283 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-08 03:35:13,283 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-08 03:35:13,284 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-08 03:35:13,285 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-08 03:35:13,285 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-08 03:35:13,286 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-08 03:35:13,287 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-08 03:35:13,288 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-08 03:35:13,289 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-08 03:35:13,290 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-08 03:35:13,291 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-08 03:35:13,292 INFO L290 TraceCheckUtils]: 17: Hoare triple {960#false} ~cond := #in~cond; {960#false} is VALID [2022-04-08 03:35:13,300 INFO L290 TraceCheckUtils]: 18: Hoare triple {960#false} assume 0 == ~cond; {960#false} is VALID [2022-04-08 03:35:13,300 INFO L290 TraceCheckUtils]: 19: Hoare triple {960#false} assume !false; {960#false} is VALID [2022-04-08 03:35:13,301 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-08 03:35:13,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:35:13,447 INFO L290 TraceCheckUtils]: 19: Hoare triple {960#false} assume !false; {960#false} is VALID [2022-04-08 03:35:13,447 INFO L290 TraceCheckUtils]: 18: Hoare triple {960#false} assume 0 == ~cond; {960#false} is VALID [2022-04-08 03:35:13,448 INFO L290 TraceCheckUtils]: 17: Hoare triple {960#false} ~cond := #in~cond; {960#false} is VALID [2022-04-08 03:35:13,448 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-08 03:35:13,448 INFO L290 TraceCheckUtils]: 15: Hoare triple {1044#(<= main_~j~0 main_~n~0)} assume !(~j~0 <= ~n~0); {960#false} is VALID [2022-04-08 03:35:13,449 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-08 03:35:13,449 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-08 03:35:13,450 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-08 03:35:13,450 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-08 03:35:13,451 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-08 03:35:13,451 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-08 03:35:13,452 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-08 03:35:13,452 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-08 03:35:13,453 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-08 03:35:13,453 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-08 03:35:13,454 INFO L272 TraceCheckUtils]: 4: Hoare triple {959#true} call #t~ret37 := main(); {959#true} is VALID [2022-04-08 03:35:13,454 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {959#true} {959#true} #214#return; {959#true} is VALID [2022-04-08 03:35:13,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {959#true} assume true; {959#true} is VALID [2022-04-08 03:35:13,455 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-08 03:35:13,455 INFO L272 TraceCheckUtils]: 0: Hoare triple {959#true} call ULTIMATE.init(); {959#true} is VALID [2022-04-08 03:35:13,455 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-08 03:35:13,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27025961] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:35:13,455 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:35:13,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-04-08 03:35:13,456 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:13,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1621603212] [2022-04-08 03:35:13,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1621603212] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:13,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:13,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:35:13,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905256575] [2022-04-08 03:35:13,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:13,457 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-08 03:35:13,457 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:13,457 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-08 03:35:13,473 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-08 03:35:13,474 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 03:35:13,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:13,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 03:35:13,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-04-08 03:35:13,475 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-08 03:35:13,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:13,688 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-08 03:35:13,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 03:35:13,689 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-08 03:35:13,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:13,689 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-08 03:35:13,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2022-04-08 03:35:13,691 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-08 03:35:13,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2022-04-08 03:35:13,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 54 transitions. [2022-04-08 03:35:13,746 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-08 03:35:13,748 INFO L225 Difference]: With dead ends: 57 [2022-04-08 03:35:13,748 INFO L226 Difference]: Without dead ends: 38 [2022-04-08 03:35:13,748 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-08 03:35:13,749 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 19 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:35:13,749 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.1s Time] [2022-04-08 03:35:13,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-08 03:35:13,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2022-04-08 03:35:13,767 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:13,767 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-08 03:35:13,767 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-08 03:35:13,768 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-08 03:35:13,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:13,770 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2022-04-08 03:35:13,770 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-04-08 03:35:13,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:13,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:13,771 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-08 03:35:13,771 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-08 03:35:13,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:13,773 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2022-04-08 03:35:13,773 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-04-08 03:35:13,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:13,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:13,774 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:13,774 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:13,774 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-08 03:35:13,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-04-08 03:35:13,775 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 20 [2022-04-08 03:35:13,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:13,776 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-04-08 03:35:13,776 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-08 03:35:13,776 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 39 transitions. [2022-04-08 03:35:13,819 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-08 03:35:13,820 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-08 03:35:13,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 03:35:13,820 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:13,820 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:35:13,847 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-08 03:35:14,045 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-08 03:35:14,046 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:14,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:14,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1140304881, now seen corresponding path program 1 times [2022-04-08 03:35:14,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:14,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1085572531] [2022-04-08 03:35:14,054 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:35:14,054 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 03:35:14,054 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:35:14,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1140304881, now seen corresponding path program 2 times [2022-04-08 03:35:14,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:14,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615030334] [2022-04-08 03:35:14,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:14,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:14,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:14,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:14,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:14,145 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-08 03:35:14,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {1359#true} assume true; {1359#true} is VALID [2022-04-08 03:35:14,145 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1359#true} {1359#true} #214#return; {1359#true} is VALID [2022-04-08 03:35:14,146 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-08 03:35:14,147 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-08 03:35:14,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {1359#true} assume true; {1359#true} is VALID [2022-04-08 03:35:14,147 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1359#true} {1359#true} #214#return; {1359#true} is VALID [2022-04-08 03:35:14,147 INFO L272 TraceCheckUtils]: 4: Hoare triple {1359#true} call #t~ret37 := main(); {1359#true} is VALID [2022-04-08 03:35:14,148 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-08 03:35:14,148 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-08 03:35:14,149 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-08 03:35:14,149 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-08 03:35:14,150 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-08 03:35:14,150 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-08 03:35:14,151 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-08 03:35:14,152 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-08 03:35:14,152 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-08 03:35:14,153 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-08 03:35:14,153 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-08 03:35:14,153 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-08 03:35:14,153 INFO L290 TraceCheckUtils]: 17: Hoare triple {1360#false} ~cond := #in~cond; {1360#false} is VALID [2022-04-08 03:35:14,154 INFO L290 TraceCheckUtils]: 18: Hoare triple {1360#false} assume 0 == ~cond; {1360#false} is VALID [2022-04-08 03:35:14,154 INFO L290 TraceCheckUtils]: 19: Hoare triple {1360#false} assume !false; {1360#false} is VALID [2022-04-08 03:35:14,154 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-08 03:35:14,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:14,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615030334] [2022-04-08 03:35:14,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615030334] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:35:14,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810757338] [2022-04-08 03:35:14,155 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:35:14,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:14,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:35:14,156 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-08 03:35:14,183 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-08 03:35:14,238 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 03:35:14,239 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:35:14,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 03:35:14,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:14,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:35:14,421 INFO L272 TraceCheckUtils]: 0: Hoare triple {1359#true} call ULTIMATE.init(); {1359#true} is VALID [2022-04-08 03:35:14,421 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-08 03:35:14,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {1359#true} assume true; {1359#true} is VALID [2022-04-08 03:35:14,422 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1359#true} {1359#true} #214#return; {1359#true} is VALID [2022-04-08 03:35:14,422 INFO L272 TraceCheckUtils]: 4: Hoare triple {1359#true} call #t~ret37 := main(); {1359#true} is VALID [2022-04-08 03:35:14,423 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-08 03:35:14,423 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-08 03:35:14,424 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-08 03:35:14,424 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-08 03:35:14,425 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-08 03:35:14,426 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-08 03:35:14,427 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-08 03:35:14,427 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-08 03:35:14,428 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-08 03:35:14,428 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-08 03:35:14,428 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-08 03:35:14,429 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-08 03:35:14,429 INFO L290 TraceCheckUtils]: 17: Hoare triple {1360#false} ~cond := #in~cond; {1360#false} is VALID [2022-04-08 03:35:14,429 INFO L290 TraceCheckUtils]: 18: Hoare triple {1360#false} assume 0 == ~cond; {1360#false} is VALID [2022-04-08 03:35:14,429 INFO L290 TraceCheckUtils]: 19: Hoare triple {1360#false} assume !false; {1360#false} is VALID [2022-04-08 03:35:14,429 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-08 03:35:14,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:35:14,560 INFO L290 TraceCheckUtils]: 19: Hoare triple {1360#false} assume !false; {1360#false} is VALID [2022-04-08 03:35:14,560 INFO L290 TraceCheckUtils]: 18: Hoare triple {1360#false} assume 0 == ~cond; {1360#false} is VALID [2022-04-08 03:35:14,560 INFO L290 TraceCheckUtils]: 17: Hoare triple {1360#false} ~cond := #in~cond; {1360#false} is VALID [2022-04-08 03:35:14,561 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-08 03:35:14,563 INFO L290 TraceCheckUtils]: 15: Hoare triple {1445#(<= main_~j~0 main_~n~0)} assume !(~j~0 <= ~n~0); {1360#false} is VALID [2022-04-08 03:35:14,564 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-08 03:35:14,564 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-08 03:35:14,564 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-08 03:35:14,565 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-08 03:35:14,565 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-08 03:35:14,566 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-08 03:35:14,566 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-08 03:35:14,567 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-08 03:35:14,567 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-08 03:35:14,568 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-08 03:35:14,568 INFO L272 TraceCheckUtils]: 4: Hoare triple {1359#true} call #t~ret37 := main(); {1359#true} is VALID [2022-04-08 03:35:14,568 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1359#true} {1359#true} #214#return; {1359#true} is VALID [2022-04-08 03:35:14,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {1359#true} assume true; {1359#true} is VALID [2022-04-08 03:35:14,568 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-08 03:35:14,569 INFO L272 TraceCheckUtils]: 0: Hoare triple {1359#true} call ULTIMATE.init(); {1359#true} is VALID [2022-04-08 03:35:14,569 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-08 03:35:14,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810757338] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:35:14,569 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:35:14,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2022-04-08 03:35:14,570 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:14,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1085572531] [2022-04-08 03:35:14,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1085572531] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:14,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:14,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 03:35:14,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663445942] [2022-04-08 03:35:14,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:14,570 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-08 03:35:14,571 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:14,571 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-08 03:35:14,587 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-08 03:35:14,587 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 03:35:14,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:14,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 03:35:14,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2022-04-08 03:35:14,588 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-08 03:35:14,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:14,779 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2022-04-08 03:35:14,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 03:35:14,779 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-08 03:35:14,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:14,780 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-08 03:35:14,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 56 transitions. [2022-04-08 03:35:14,781 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-08 03:35:14,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 56 transitions. [2022-04-08 03:35:14,783 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 56 transitions. [2022-04-08 03:35:14,827 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-08 03:35:14,828 INFO L225 Difference]: With dead ends: 68 [2022-04-08 03:35:14,828 INFO L226 Difference]: Without dead ends: 49 [2022-04-08 03:35:14,829 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-08 03:35:14,829 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-08 03:35:14,830 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-08 03:35:14,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-08 03:35:14,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2022-04-08 03:35:14,855 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:14,855 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-08 03:35:14,855 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-08 03:35:14,856 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-08 03:35:14,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:14,857 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2022-04-08 03:35:14,858 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2022-04-08 03:35:14,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:14,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:14,858 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-08 03:35:14,859 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-08 03:35:14,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:14,860 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2022-04-08 03:35:14,860 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2022-04-08 03:35:14,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:14,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:14,886 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:14,886 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:14,886 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-08 03:35:14,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2022-04-08 03:35:14,887 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 20 [2022-04-08 03:35:14,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:14,888 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2022-04-08 03:35:14,888 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-08 03:35:14,888 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 48 transitions. [2022-04-08 03:35:14,936 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-08 03:35:14,937 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-08 03:35:14,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 03:35:14,937 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:14,937 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:35:14,967 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-08 03:35:15,154 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-08 03:35:15,155 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:15,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:15,155 INFO L85 PathProgramCache]: Analyzing trace with hash -162258006, now seen corresponding path program 3 times [2022-04-08 03:35:15,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:15,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1071066848] [2022-04-08 03:35:15,161 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:35:15,162 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 03:35:15,162 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:35:15,162 INFO L85 PathProgramCache]: Analyzing trace with hash -162258006, now seen corresponding path program 4 times [2022-04-08 03:35:15,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:15,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313736091] [2022-04-08 03:35:15,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:15,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:15,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:15,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:15,260 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-08 03:35:15,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {1820#true} assume true; {1820#true} is VALID [2022-04-08 03:35:15,261 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1820#true} {1820#true} #214#return; {1820#true} is VALID [2022-04-08 03:35:15,262 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-08 03:35:15,262 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-08 03:35:15,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {1820#true} assume true; {1820#true} is VALID [2022-04-08 03:35:15,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1820#true} {1820#true} #214#return; {1820#true} is VALID [2022-04-08 03:35:15,262 INFO L272 TraceCheckUtils]: 4: Hoare triple {1820#true} call #t~ret37 := main(); {1820#true} is VALID [2022-04-08 03:35:15,263 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-08 03:35:15,263 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-08 03:35:15,264 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-08 03:35:15,264 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-08 03:35:15,265 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-08 03:35:15,265 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-08 03:35:15,266 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-08 03:35:15,266 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-08 03:35:15,267 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-08 03:35:15,267 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-08 03:35:15,268 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-08 03:35:15,269 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-08 03:35:15,269 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-08 03:35:15,270 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-08 03:35:15,270 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-08 03:35:15,270 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-08 03:35:15,270 INFO L290 TraceCheckUtils]: 21: Hoare triple {1821#false} ~cond := #in~cond; {1821#false} is VALID [2022-04-08 03:35:15,270 INFO L290 TraceCheckUtils]: 22: Hoare triple {1821#false} assume 0 == ~cond; {1821#false} is VALID [2022-04-08 03:35:15,271 INFO L290 TraceCheckUtils]: 23: Hoare triple {1821#false} assume !false; {1821#false} is VALID [2022-04-08 03:35:15,271 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-08 03:35:15,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:15,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313736091] [2022-04-08 03:35:15,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313736091] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:35:15,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488481398] [2022-04-08 03:35:15,272 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 03:35:15,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:15,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:35:15,273 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-08 03:35:15,300 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-08 03:35:15,357 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 03:35:15,357 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:35:15,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-08 03:35:15,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:15,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:35:15,587 INFO L272 TraceCheckUtils]: 0: Hoare triple {1820#true} call ULTIMATE.init(); {1820#true} is VALID [2022-04-08 03:35:15,588 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-08 03:35:15,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {1820#true} assume true; {1820#true} is VALID [2022-04-08 03:35:15,588 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1820#true} {1820#true} #214#return; {1820#true} is VALID [2022-04-08 03:35:15,588 INFO L272 TraceCheckUtils]: 4: Hoare triple {1820#true} call #t~ret37 := main(); {1820#true} is VALID [2022-04-08 03:35:15,589 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-08 03:35:15,589 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-08 03:35:15,590 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-08 03:35:15,591 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-08 03:35:15,591 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-08 03:35:15,592 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-08 03:35:15,592 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-08 03:35:15,593 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-08 03:35:15,593 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-08 03:35:15,594 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-08 03:35:15,600 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-08 03:35:15,602 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-08 03:35:15,609 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-08 03:35:15,610 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-08 03:35:15,612 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-08 03:35:15,612 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-08 03:35:15,612 INFO L290 TraceCheckUtils]: 21: Hoare triple {1821#false} ~cond := #in~cond; {1821#false} is VALID [2022-04-08 03:35:15,612 INFO L290 TraceCheckUtils]: 22: Hoare triple {1821#false} assume 0 == ~cond; {1821#false} is VALID [2022-04-08 03:35:15,612 INFO L290 TraceCheckUtils]: 23: Hoare triple {1821#false} assume !false; {1821#false} is VALID [2022-04-08 03:35:15,613 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-08 03:35:15,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:35:15,788 INFO L290 TraceCheckUtils]: 23: Hoare triple {1821#false} assume !false; {1821#false} is VALID [2022-04-08 03:35:15,788 INFO L290 TraceCheckUtils]: 22: Hoare triple {1821#false} assume 0 == ~cond; {1821#false} is VALID [2022-04-08 03:35:15,789 INFO L290 TraceCheckUtils]: 21: Hoare triple {1821#false} ~cond := #in~cond; {1821#false} is VALID [2022-04-08 03:35:15,789 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-08 03:35:15,789 INFO L290 TraceCheckUtils]: 19: Hoare triple {1920#(<= main_~j~0 main_~n~0)} assume !(~j~0 <= ~n~0); {1821#false} is VALID [2022-04-08 03:35:15,790 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-08 03:35:15,790 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-08 03:35:15,791 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-08 03:35:15,791 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-08 03:35:15,791 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-08 03:35:15,792 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-08 03:35:15,792 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-08 03:35:15,793 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-08 03:35:15,793 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-08 03:35:15,794 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-08 03:35:15,794 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-08 03:35:15,795 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-08 03:35:15,795 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-08 03:35:15,796 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-08 03:35:15,796 INFO L272 TraceCheckUtils]: 4: Hoare triple {1820#true} call #t~ret37 := main(); {1820#true} is VALID [2022-04-08 03:35:15,796 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1820#true} {1820#true} #214#return; {1820#true} is VALID [2022-04-08 03:35:15,796 INFO L290 TraceCheckUtils]: 2: Hoare triple {1820#true} assume true; {1820#true} is VALID [2022-04-08 03:35:15,796 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-08 03:35:15,796 INFO L272 TraceCheckUtils]: 0: Hoare triple {1820#true} call ULTIMATE.init(); {1820#true} is VALID [2022-04-08 03:35:15,798 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-08 03:35:15,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488481398] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:35:15,799 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:35:15,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2022-04-08 03:35:15,799 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:15,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1071066848] [2022-04-08 03:35:15,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1071066848] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:15,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:15,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 03:35:15,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518874569] [2022-04-08 03:35:15,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:15,800 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-08 03:35:15,800 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:15,800 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-08 03:35:15,819 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-08 03:35:15,819 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 03:35:15,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:15,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 03:35:15,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=192, Unknown=0, NotChecked=0, Total=306 [2022-04-08 03:35:15,820 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-08 03:35:16,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:16,034 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2022-04-08 03:35:16,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 03:35:16,035 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-08 03:35:16,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:16,035 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-08 03:35:16,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 61 transitions. [2022-04-08 03:35:16,037 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-08 03:35:16,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 61 transitions. [2022-04-08 03:35:16,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 61 transitions. [2022-04-08 03:35:16,088 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-08 03:35:16,089 INFO L225 Difference]: With dead ends: 80 [2022-04-08 03:35:16,089 INFO L226 Difference]: Without dead ends: 57 [2022-04-08 03:35:16,090 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=241, Unknown=0, NotChecked=0, Total=380 [2022-04-08 03:35:16,090 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 33 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:35:16,091 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.1s Time] [2022-04-08 03:35:16,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-08 03:35:16,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2022-04-08 03:35:16,126 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:16,127 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-08 03:35:16,127 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-08 03:35:16,127 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-08 03:35:16,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:16,129 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2022-04-08 03:35:16,129 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2022-04-08 03:35:16,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:16,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:16,130 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-08 03:35:16,130 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-08 03:35:16,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:16,132 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2022-04-08 03:35:16,132 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2022-04-08 03:35:16,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:16,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:16,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:16,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:16,133 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-08 03:35:16,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2022-04-08 03:35:16,134 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 24 [2022-04-08 03:35:16,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:16,135 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2022-04-08 03:35:16,135 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-08 03:35:16,135 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 57 transitions. [2022-04-08 03:35:16,193 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-08 03:35:16,193 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2022-04-08 03:35:16,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 03:35:16,193 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:16,194 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:35:16,226 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-08 03:35:16,415 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-08 03:35:16,415 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:16,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:16,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1312024861, now seen corresponding path program 5 times [2022-04-08 03:35:16,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:16,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1305600557] [2022-04-08 03:35:16,422 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:35:16,423 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 03:35:16,423 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:35:16,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1312024861, now seen corresponding path program 6 times [2022-04-08 03:35:16,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:16,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181479524] [2022-04-08 03:35:16,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:16,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:16,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:16,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:16,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:16,544 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-08 03:35:16,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {2364#true} assume true; {2364#true} is VALID [2022-04-08 03:35:16,544 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2364#true} {2364#true} #214#return; {2364#true} is VALID [2022-04-08 03:35:16,545 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-08 03:35:16,546 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-08 03:35:16,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {2364#true} assume true; {2364#true} is VALID [2022-04-08 03:35:16,546 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2364#true} {2364#true} #214#return; {2364#true} is VALID [2022-04-08 03:35:16,546 INFO L272 TraceCheckUtils]: 4: Hoare triple {2364#true} call #t~ret37 := main(); {2364#true} is VALID [2022-04-08 03:35:16,547 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-08 03:35:16,547 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-08 03:35:16,548 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-08 03:35:16,548 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-08 03:35:16,549 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-08 03:35:16,549 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-08 03:35:16,550 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-08 03:35:16,550 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-08 03:35:16,551 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-08 03:35:16,551 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-08 03:35:16,552 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-08 03:35:16,552 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-08 03:35:16,553 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-08 03:35:16,553 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-08 03:35:16,554 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-08 03:35:16,554 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-08 03:35:16,555 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-08 03:35:16,556 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-08 03:35:16,557 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-08 03:35:16,557 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-08 03:35:16,557 INFO L290 TraceCheckUtils]: 25: Hoare triple {2365#false} ~cond := #in~cond; {2365#false} is VALID [2022-04-08 03:35:16,557 INFO L290 TraceCheckUtils]: 26: Hoare triple {2365#false} assume 0 == ~cond; {2365#false} is VALID [2022-04-08 03:35:16,557 INFO L290 TraceCheckUtils]: 27: Hoare triple {2365#false} assume !false; {2365#false} is VALID [2022-04-08 03:35:16,557 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-08 03:35:16,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:16,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181479524] [2022-04-08 03:35:16,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181479524] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:35:16,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053547328] [2022-04-08 03:35:16,558 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 03:35:16,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:16,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:35:16,560 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-08 03:35:16,591 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-08 03:35:16,653 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 03:35:16,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:35:16,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 03:35:16,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:16,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:35:16,999 INFO L272 TraceCheckUtils]: 0: Hoare triple {2364#true} call ULTIMATE.init(); {2364#true} is VALID [2022-04-08 03:35:16,999 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-08 03:35:16,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {2364#true} assume true; {2364#true} is VALID [2022-04-08 03:35:17,000 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2364#true} {2364#true} #214#return; {2364#true} is VALID [2022-04-08 03:35:17,000 INFO L272 TraceCheckUtils]: 4: Hoare triple {2364#true} call #t~ret37 := main(); {2364#true} is VALID [2022-04-08 03:35:17,000 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-08 03:35:17,001 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-08 03:35:17,002 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-08 03:35:17,003 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-08 03:35:17,003 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-08 03:35:17,004 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-08 03:35:17,005 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-08 03:35:17,005 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-08 03:35:17,007 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-08 03:35:17,008 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-08 03:35:17,008 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-08 03:35:17,009 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-08 03:35:17,009 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-08 03:35:17,010 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-08 03:35:17,011 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-08 03:35:17,011 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-08 03:35:17,012 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-08 03:35:17,012 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-08 03:35:17,015 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-08 03:35:17,016 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-08 03:35:17,016 INFO L290 TraceCheckUtils]: 25: Hoare triple {2365#false} ~cond := #in~cond; {2365#false} is VALID [2022-04-08 03:35:17,016 INFO L290 TraceCheckUtils]: 26: Hoare triple {2365#false} assume 0 == ~cond; {2365#false} is VALID [2022-04-08 03:35:17,016 INFO L290 TraceCheckUtils]: 27: Hoare triple {2365#false} assume !false; {2365#false} is VALID [2022-04-08 03:35:17,016 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-08 03:35:17,017 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:35:17,220 INFO L290 TraceCheckUtils]: 27: Hoare triple {2365#false} assume !false; {2365#false} is VALID [2022-04-08 03:35:17,220 INFO L290 TraceCheckUtils]: 26: Hoare triple {2365#false} assume 0 == ~cond; {2365#false} is VALID [2022-04-08 03:35:17,220 INFO L290 TraceCheckUtils]: 25: Hoare triple {2365#false} ~cond := #in~cond; {2365#false} is VALID [2022-04-08 03:35:17,220 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-08 03:35:17,221 INFO L290 TraceCheckUtils]: 23: Hoare triple {2478#(<= main_~j~0 main_~n~0)} assume !(~j~0 <= ~n~0); {2365#false} is VALID [2022-04-08 03:35:17,221 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-08 03:35:17,222 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-08 03:35:17,222 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-08 03:35:17,223 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-08 03:35:17,223 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-08 03:35:17,224 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-08 03:35:17,224 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-08 03:35:17,225 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-08 03:35:17,225 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-08 03:35:17,226 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-08 03:35:17,226 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-08 03:35:17,227 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-08 03:35:17,228 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-08 03:35:17,228 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-08 03:35:17,228 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-08 03:35:17,229 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-08 03:35:17,229 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-08 03:35:17,230 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-08 03:35:17,230 INFO L272 TraceCheckUtils]: 4: Hoare triple {2364#true} call #t~ret37 := main(); {2364#true} is VALID [2022-04-08 03:35:17,230 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2364#true} {2364#true} #214#return; {2364#true} is VALID [2022-04-08 03:35:17,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {2364#true} assume true; {2364#true} is VALID [2022-04-08 03:35:17,230 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-08 03:35:17,231 INFO L272 TraceCheckUtils]: 0: Hoare triple {2364#true} call ULTIMATE.init(); {2364#true} is VALID [2022-04-08 03:35:17,231 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-08 03:35:17,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053547328] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:35:17,231 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:35:17,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2022-04-08 03:35:17,232 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:17,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1305600557] [2022-04-08 03:35:17,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1305600557] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:17,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:17,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 03:35:17,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637314248] [2022-04-08 03:35:17,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:17,233 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-08 03:35:17,233 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:17,233 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-08 03:35:17,256 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-08 03:35:17,256 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 03:35:17,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:17,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 03:35:17,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=270, Unknown=0, NotChecked=0, Total=420 [2022-04-08 03:35:17,257 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-08 03:35:17,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:17,550 INFO L93 Difference]: Finished difference Result 92 states and 107 transitions. [2022-04-08 03:35:17,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 03:35:17,551 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-08 03:35:17,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:17,551 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-08 03:35:17,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 66 transitions. [2022-04-08 03:35:17,553 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-08 03:35:17,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 66 transitions. [2022-04-08 03:35:17,555 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 66 transitions. [2022-04-08 03:35:17,612 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-08 03:35:17,613 INFO L225 Difference]: With dead ends: 92 [2022-04-08 03:35:17,613 INFO L226 Difference]: Without dead ends: 65 [2022-04-08 03:35:17,613 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=178, Invalid=328, Unknown=0, NotChecked=0, Total=506 [2022-04-08 03:35:17,614 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-08 03:35:17,615 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-08 03:35:17,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-08 03:35:17,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2022-04-08 03:35:17,670 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:17,670 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-08 03:35:17,670 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-08 03:35:17,671 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-08 03:35:17,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:17,674 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2022-04-08 03:35:17,674 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2022-04-08 03:35:17,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:17,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:17,674 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-08 03:35:17,675 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-08 03:35:17,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:17,677 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2022-04-08 03:35:17,677 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2022-04-08 03:35:17,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:17,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:17,678 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:17,678 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:17,678 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-08 03:35:17,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2022-04-08 03:35:17,680 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 28 [2022-04-08 03:35:17,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:17,680 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2022-04-08 03:35:17,680 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-08 03:35:17,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 66 transitions. [2022-04-08 03:35:17,749 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-08 03:35:17,749 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2022-04-08 03:35:17,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 03:35:17,750 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:17,750 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:35:17,777 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-08 03:35:17,974 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-08 03:35:17,975 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:17,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:17,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1026934172, now seen corresponding path program 7 times [2022-04-08 03:35:17,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:17,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1135147240] [2022-04-08 03:35:17,982 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:35:17,982 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 03:35:17,982 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:35:17,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1026934172, now seen corresponding path program 8 times [2022-04-08 03:35:17,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:17,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777630436] [2022-04-08 03:35:17,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:17,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:18,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:18,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:18,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:18,115 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-08 03:35:18,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {2991#true} assume true; {2991#true} is VALID [2022-04-08 03:35:18,115 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2991#true} {2991#true} #214#return; {2991#true} is VALID [2022-04-08 03:35:18,117 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-08 03:35:18,117 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-08 03:35:18,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {2991#true} assume true; {2991#true} is VALID [2022-04-08 03:35:18,117 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2991#true} {2991#true} #214#return; {2991#true} is VALID [2022-04-08 03:35:18,117 INFO L272 TraceCheckUtils]: 4: Hoare triple {2991#true} call #t~ret37 := main(); {2991#true} is VALID [2022-04-08 03:35:18,120 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-08 03:35:18,121 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-08 03:35:18,123 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-08 03:35:18,124 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-08 03:35:18,125 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-08 03:35:18,125 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-08 03:35:18,126 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-08 03:35:18,127 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-08 03:35:18,127 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-08 03:35:18,128 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-08 03:35:18,129 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-08 03:35:18,129 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-08 03:35:18,130 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-08 03:35:18,130 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-08 03:35:18,131 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-08 03:35:18,132 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-08 03:35:18,132 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-08 03:35:18,133 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-08 03:35:18,134 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-08 03:35:18,134 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-08 03:35:18,135 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-08 03:35:18,135 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-08 03:35:18,136 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-08 03:35:18,136 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-08 03:35:18,136 INFO L290 TraceCheckUtils]: 29: Hoare triple {2992#false} ~cond := #in~cond; {2992#false} is VALID [2022-04-08 03:35:18,136 INFO L290 TraceCheckUtils]: 30: Hoare triple {2992#false} assume 0 == ~cond; {2992#false} is VALID [2022-04-08 03:35:18,136 INFO L290 TraceCheckUtils]: 31: Hoare triple {2992#false} assume !false; {2992#false} is VALID [2022-04-08 03:35:18,136 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-08 03:35:18,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:18,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777630436] [2022-04-08 03:35:18,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777630436] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:35:18,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244982454] [2022-04-08 03:35:18,137 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:35:18,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:35:18,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:35:18,138 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-08 03:35:18,166 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-08 03:35:18,227 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 03:35:18,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:35:18,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 03:35:18,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:18,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:35:18,623 INFO L272 TraceCheckUtils]: 0: Hoare triple {2991#true} call ULTIMATE.init(); {2991#true} is VALID [2022-04-08 03:35:18,623 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-08 03:35:18,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {2991#true} assume true; {2991#true} is VALID [2022-04-08 03:35:18,627 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2991#true} {2991#true} #214#return; {2991#true} is VALID [2022-04-08 03:35:18,631 INFO L272 TraceCheckUtils]: 4: Hoare triple {2991#true} call #t~ret37 := main(); {2991#true} is VALID [2022-04-08 03:35:18,632 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-08 03:35:18,632 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-08 03:35:18,633 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-08 03:35:18,633 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-08 03:35:18,634 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-08 03:35:18,634 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-08 03:35:18,635 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-08 03:35:18,635 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-08 03:35:18,636 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-08 03:35:18,636 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-08 03:35:18,637 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-08 03:35:18,637 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-08 03:35:18,638 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-08 03:35:18,638 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-08 03:35:18,639 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-08 03:35:18,639 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-08 03:35:18,640 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-08 03:35:18,640 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-08 03:35:18,641 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-08 03:35:18,641 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-08 03:35:18,642 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-08 03:35:18,642 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-08 03:35:18,643 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-08 03:35:18,643 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-08 03:35:18,643 INFO L290 TraceCheckUtils]: 29: Hoare triple {2992#false} ~cond := #in~cond; {2992#false} is VALID [2022-04-08 03:35:18,643 INFO L290 TraceCheckUtils]: 30: Hoare triple {2992#false} assume 0 == ~cond; {2992#false} is VALID [2022-04-08 03:35:18,643 INFO L290 TraceCheckUtils]: 31: Hoare triple {2992#false} assume !false; {2992#false} is VALID [2022-04-08 03:35:18,644 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-08 03:35:18,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:35:18,892 INFO L290 TraceCheckUtils]: 31: Hoare triple {2992#false} assume !false; {2992#false} is VALID [2022-04-08 03:35:18,893 INFO L290 TraceCheckUtils]: 30: Hoare triple {2992#false} assume 0 == ~cond; {2992#false} is VALID [2022-04-08 03:35:18,893 INFO L290 TraceCheckUtils]: 29: Hoare triple {2992#false} ~cond := #in~cond; {2992#false} is VALID [2022-04-08 03:35:18,893 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-08 03:35:18,893 INFO L290 TraceCheckUtils]: 27: Hoare triple {3119#(<= main_~j~0 main_~n~0)} assume !(~j~0 <= ~n~0); {2992#false} is VALID [2022-04-08 03:35:18,894 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-08 03:35:18,895 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-08 03:35:18,895 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-08 03:35:18,896 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-08 03:35:18,896 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-08 03:35:18,897 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-08 03:35:18,897 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-08 03:35:18,898 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-08 03:35:18,899 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-08 03:35:18,899 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-08 03:35:18,900 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-08 03:35:18,900 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-08 03:35:18,901 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-08 03:35:18,901 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-08 03:35:18,901 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-08 03:35:18,902 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-08 03:35:18,902 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-08 03:35:18,902 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-08 03:35:18,903 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-08 03:35:18,903 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-08 03:35:18,903 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-08 03:35:18,904 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-08 03:35:18,904 INFO L272 TraceCheckUtils]: 4: Hoare triple {2991#true} call #t~ret37 := main(); {2991#true} is VALID [2022-04-08 03:35:18,904 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2991#true} {2991#true} #214#return; {2991#true} is VALID [2022-04-08 03:35:18,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {2991#true} assume true; {2991#true} is VALID [2022-04-08 03:35:18,904 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-08 03:35:18,923 INFO L272 TraceCheckUtils]: 0: Hoare triple {2991#true} call ULTIMATE.init(); {2991#true} is VALID [2022-04-08 03:35:18,923 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-08 03:35:18,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244982454] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:35:18,923 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:35:18,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 23 [2022-04-08 03:35:18,923 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:18,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1135147240] [2022-04-08 03:35:18,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1135147240] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:18,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:18,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 03:35:18,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480471611] [2022-04-08 03:35:18,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:18,924 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-08 03:35:18,924 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:18,925 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-08 03:35:18,953 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-08 03:35:18,953 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 03:35:18,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:18,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 03:35:18,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=336, Unknown=0, NotChecked=0, Total=506 [2022-04-08 03:35:18,954 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-08 03:35:19,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:19,259 INFO L93 Difference]: Finished difference Result 98 states and 114 transitions. [2022-04-08 03:35:19,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 03:35:19,259 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-08 03:35:19,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:19,260 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-08 03:35:19,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 67 transitions. [2022-04-08 03:35:19,262 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-08 03:35:19,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 67 transitions. [2022-04-08 03:35:19,263 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 67 transitions. [2022-04-08 03:35:19,316 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-08 03:35:19,317 INFO L225 Difference]: With dead ends: 98 [2022-04-08 03:35:19,317 INFO L226 Difference]: Without dead ends: 67 [2022-04-08 03:35:19,317 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-08 03:35:19,318 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 61 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:35:19,318 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.1s Time] [2022-04-08 03:35:19,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-08 03:35:19,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-04-08 03:35:19,406 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:19,407 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-08 03:35:19,407 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-08 03:35:19,407 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-08 03:35:19,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:19,409 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2022-04-08 03:35:19,409 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2022-04-08 03:35:19,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:19,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:19,410 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-08 03:35:19,411 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-08 03:35:19,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:19,413 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2022-04-08 03:35:19,413 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2022-04-08 03:35:19,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:19,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:19,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:19,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:19,414 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-08 03:35:19,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2022-04-08 03:35:19,415 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 32 [2022-04-08 03:35:19,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:19,416 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2022-04-08 03:35:19,416 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-08 03:35:19,416 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 75 transitions. [2022-04-08 03:35:19,502 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-08 03:35:19,503 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2022-04-08 03:35:19,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-08 03:35:19,504 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:19,504 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:35:19,532 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-08 03:35:19,719 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-08 03:35:19,720 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:19,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:19,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1975029803, now seen corresponding path program 9 times [2022-04-08 03:35:19,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:19,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1749259292] [2022-04-08 03:35:19,728 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:35:19,729 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-08 03:35:19,729 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 03:35:19,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1975029803, now seen corresponding path program 10 times [2022-04-08 03:35:19,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:19,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52457203] [2022-04-08 03:35:19,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:19,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:19,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 03:35:19,775 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-08 03:35:19,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 03:35:19,834 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-08 03:35:19,834 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-08 03:35:19,834 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-08 03:35:19,838 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 03:35:19,839 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-08 03:35:19,842 INFO L719 BasicCegarLoop]: Path program histogram: [10, 4, 2, 2] [2022-04-08 03:35:19,845 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 03:35:19,864 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 03:35:19,864 WARN L170 areAnnotationChecker]: ludcmpENTRY has no Hoare annotation [2022-04-08 03:35:19,864 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-08 03:35:19,864 WARN L170 areAnnotationChecker]: fabsENTRY has no Hoare annotation [2022-04-08 03:35:19,864 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-08 03:35:19,864 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-08 03:35:19,864 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-08 03:35:19,864 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-08 03:35:19,864 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 03:35:19,864 WARN L170 areAnnotationChecker]: L117 has no Hoare annotation [2022-04-08 03:35:19,865 WARN L170 areAnnotationChecker]: L117 has no Hoare annotation [2022-04-08 03:35:19,865 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-08 03:35:19,865 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-04-08 03:35:19,865 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-04-08 03:35:19,865 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-08 03:35:19,865 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-08 03:35:19,865 WARN L170 areAnnotationChecker]: L93-3 has no Hoare annotation [2022-04-08 03:35:19,865 WARN L170 areAnnotationChecker]: L93-3 has no Hoare annotation [2022-04-08 03:35:19,865 WARN L170 areAnnotationChecker]: L93-3 has no Hoare annotation [2022-04-08 03:35:19,865 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-08 03:35:19,865 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-08 03:35:19,865 WARN L170 areAnnotationChecker]: ludcmpFINAL has no Hoare annotation [2022-04-08 03:35:19,865 WARN L170 areAnnotationChecker]: L118-3 has no Hoare annotation [2022-04-08 03:35:19,865 WARN L170 areAnnotationChecker]: L118-3 has no Hoare annotation [2022-04-08 03:35:19,865 WARN L170 areAnnotationChecker]: L118-3 has no Hoare annotation [2022-04-08 03:35:19,865 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-08 03:35:19,865 WARN L170 areAnnotationChecker]: L80-2 has no Hoare annotation [2022-04-08 03:35:19,865 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-08 03:35:19,866 WARN L170 areAnnotationChecker]: L93-4 has no Hoare annotation [2022-04-08 03:35:19,866 WARN L170 areAnnotationChecker]: L93-4 has no Hoare annotation [2022-04-08 03:35:19,866 WARN L170 areAnnotationChecker]: L96-3 has no Hoare annotation [2022-04-08 03:35:19,866 WARN L170 areAnnotationChecker]: L96-3 has no Hoare annotation [2022-04-08 03:35:19,866 WARN L170 areAnnotationChecker]: L96-3 has no Hoare annotation [2022-04-08 03:35:19,866 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-08 03:35:19,866 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-08 03:35:19,866 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-08 03:35:19,866 WARN L170 areAnnotationChecker]: ludcmpEXIT has no Hoare annotation [2022-04-08 03:35:19,866 WARN L170 areAnnotationChecker]: L118-4 has no Hoare annotation [2022-04-08 03:35:19,866 WARN L170 areAnnotationChecker]: L120 has no Hoare annotation [2022-04-08 03:35:19,866 WARN L170 areAnnotationChecker]: L120 has no Hoare annotation [2022-04-08 03:35:19,866 WARN L170 areAnnotationChecker]: fabsFINAL has no Hoare annotation [2022-04-08 03:35:19,866 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2022-04-08 03:35:19,866 WARN L170 areAnnotationChecker]: L96-4 has no Hoare annotation [2022-04-08 03:35:19,866 WARN L170 areAnnotationChecker]: L96-4 has no Hoare annotation [2022-04-08 03:35:19,866 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2022-04-08 03:35:19,866 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2022-04-08 03:35:19,867 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 03:35:19,867 WARN L170 areAnnotationChecker]: L138-3 has no Hoare annotation [2022-04-08 03:35:19,867 WARN L170 areAnnotationChecker]: L138-3 has no Hoare annotation [2022-04-08 03:35:19,867 WARN L170 areAnnotationChecker]: L138-3 has no Hoare annotation [2022-04-08 03:35:19,867 WARN L170 areAnnotationChecker]: L120-1 has no Hoare annotation [2022-04-08 03:35:19,867 WARN L170 areAnnotationChecker]: L120-1 has no Hoare annotation [2022-04-08 03:35:19,867 WARN L170 areAnnotationChecker]: fabsEXIT has no Hoare annotation [2022-04-08 03:35:19,867 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-08 03:35:19,867 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2022-04-08 03:35:19,867 WARN L170 areAnnotationChecker]: L99-2 has no Hoare annotation [2022-04-08 03:35:19,867 WARN L170 areAnnotationChecker]: L138-4 has no Hoare annotation [2022-04-08 03:35:19,867 WARN L170 areAnnotationChecker]: L141-3 has no Hoare annotation [2022-04-08 03:35:19,867 WARN L170 areAnnotationChecker]: L141-3 has no Hoare annotation [2022-04-08 03:35:19,867 WARN L170 areAnnotationChecker]: L141-3 has no Hoare annotation [2022-04-08 03:35:19,867 WARN L170 areAnnotationChecker]: L121-3 has no Hoare annotation [2022-04-08 03:35:19,867 WARN L170 areAnnotationChecker]: L121-3 has no Hoare annotation [2022-04-08 03:35:19,868 WARN L170 areAnnotationChecker]: L121-3 has no Hoare annotation [2022-04-08 03:35:19,868 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-08 03:35:19,868 WARN L170 areAnnotationChecker]: L93-2 has no Hoare annotation [2022-04-08 03:35:19,868 WARN L170 areAnnotationChecker]: L96-2 has no Hoare annotation [2022-04-08 03:35:19,868 WARN L170 areAnnotationChecker]: L146-3 has no Hoare annotation [2022-04-08 03:35:19,868 WARN L170 areAnnotationChecker]: L146-3 has no Hoare annotation [2022-04-08 03:35:19,868 WARN L170 areAnnotationChecker]: L146-3 has no Hoare annotation [2022-04-08 03:35:19,868 WARN L170 areAnnotationChecker]: L141-4 has no Hoare annotation [2022-04-08 03:35:19,868 WARN L170 areAnnotationChecker]: L141-2 has no Hoare annotation [2022-04-08 03:35:19,868 WARN L170 areAnnotationChecker]: L121-4 has no Hoare annotation [2022-04-08 03:35:19,868 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-04-08 03:35:19,868 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-04-08 03:35:19,868 WARN L170 areAnnotationChecker]: L146-4 has no Hoare annotation [2022-04-08 03:35:19,868 WARN L170 areAnnotationChecker]: L149-3 has no Hoare annotation [2022-04-08 03:35:19,868 WARN L170 areAnnotationChecker]: L149-3 has no Hoare annotation [2022-04-08 03:35:19,868 WARN L170 areAnnotationChecker]: L149-3 has no Hoare annotation [2022-04-08 03:35:19,868 WARN L170 areAnnotationChecker]: L138-2 has no Hoare annotation [2022-04-08 03:35:19,869 WARN L170 areAnnotationChecker]: L129-3 has no Hoare annotation [2022-04-08 03:35:19,869 WARN L170 areAnnotationChecker]: L129-3 has no Hoare annotation [2022-04-08 03:35:19,869 WARN L170 areAnnotationChecker]: L129-3 has no Hoare annotation [2022-04-08 03:35:19,869 WARN L170 areAnnotationChecker]: L125-3 has no Hoare annotation [2022-04-08 03:35:19,869 WARN L170 areAnnotationChecker]: L125-3 has no Hoare annotation [2022-04-08 03:35:19,869 WARN L170 areAnnotationChecker]: L125-3 has no Hoare annotation [2022-04-08 03:35:19,869 WARN L170 areAnnotationChecker]: L124-1 has no Hoare annotation [2022-04-08 03:35:19,869 WARN L170 areAnnotationChecker]: L149-4 has no Hoare annotation [2022-04-08 03:35:19,869 WARN L170 areAnnotationChecker]: L149-2 has no Hoare annotation [2022-04-08 03:35:19,869 WARN L170 areAnnotationChecker]: L118-2 has no Hoare annotation [2022-04-08 03:35:19,869 WARN L170 areAnnotationChecker]: L132-3 has no Hoare annotation [2022-04-08 03:35:19,869 WARN L170 areAnnotationChecker]: L132-3 has no Hoare annotation [2022-04-08 03:35:19,869 WARN L170 areAnnotationChecker]: L132-3 has no Hoare annotation [2022-04-08 03:35:19,869 WARN L170 areAnnotationChecker]: L125-2 has no Hoare annotation [2022-04-08 03:35:19,869 WARN L170 areAnnotationChecker]: L121-2 has no Hoare annotation [2022-04-08 03:35:19,869 WARN L170 areAnnotationChecker]: L146-2 has no Hoare annotation [2022-04-08 03:35:19,869 WARN L170 areAnnotationChecker]: L132-4 has no Hoare annotation [2022-04-08 03:35:19,869 WARN L170 areAnnotationChecker]: L132-2 has no Hoare annotation [2022-04-08 03:35:19,870 WARN L170 areAnnotationChecker]: L129-2 has no Hoare annotation [2022-04-08 03:35:19,870 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-08 03:35:19,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 03:35:19 BoogieIcfgContainer [2022-04-08 03:35:19,873 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 03:35:19,875 INFO L158 Benchmark]: Toolchain (without parser) took 11158.61ms. Allocated memory was 167.8MB in the beginning and 307.2MB in the end (delta: 139.5MB). Free memory was 113.7MB in the beginning and 203.6MB in the end (delta: -89.9MB). Peak memory consumption was 50.4MB. Max. memory is 8.0GB. [2022-04-08 03:35:19,875 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 167.8MB. Free memory is still 129.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 03:35:19,875 INFO L158 Benchmark]: CACSL2BoogieTranslator took 311.80ms. Allocated memory was 167.8MB in the beginning and 255.9MB in the end (delta: 88.1MB). Free memory was 113.5MB in the beginning and 225.8MB in the end (delta: -112.3MB). Peak memory consumption was 9.7MB. Max. memory is 8.0GB. [2022-04-08 03:35:19,875 INFO L158 Benchmark]: Boogie Preprocessor took 74.58ms. Allocated memory is still 255.9MB. Free memory was 225.8MB in the beginning and 223.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-04-08 03:35:19,875 INFO L158 Benchmark]: RCFGBuilder took 691.36ms. Allocated memory is still 255.9MB. Free memory was 223.2MB in the beginning and 203.3MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-04-08 03:35:19,876 INFO L158 Benchmark]: TraceAbstraction took 10071.96ms. Allocated memory was 255.9MB in the beginning and 307.2MB in the end (delta: 51.4MB). Free memory was 202.7MB in the beginning and 204.1MB in the end (delta: -1.4MB). Peak memory consumption was 51.0MB. Max. memory is 8.0GB. [2022-04-08 03:35:19,881 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.18ms. Allocated memory is still 167.8MB. Free memory is still 129.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 311.80ms. Allocated memory was 167.8MB in the beginning and 255.9MB in the end (delta: 88.1MB). Free memory was 113.5MB in the beginning and 225.8MB in the end (delta: -112.3MB). Peak memory consumption was 9.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 74.58ms. Allocated memory is still 255.9MB. Free memory was 225.8MB in the beginning and 223.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 691.36ms. Allocated memory is still 255.9MB. Free memory was 223.2MB in the beginning and 203.3MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 10071.96ms. Allocated memory was 255.9MB in the beginning and 307.2MB in the end (delta: 51.4MB). Free memory was 202.7MB in the beginning and 204.1MB in the end (delta: -1.4MB). Peak memory consumption was 51.0MB. 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: 10.0s, OverallIterations: 9, TraceHistogramMax: 6, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, 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.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 119 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 412 IncrementalHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 175 mSDtfsCounter, 412 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 351 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=8, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 35 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-04-08 03:35:19,921 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...