/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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 14:16:10,736 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 14:16:10,737 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 14:16:10,794 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 14:16:10,794 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 14:16:10,795 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 14:16:10,798 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 14:16:10,800 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 14:16:10,801 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 14:16:10,803 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 14:16:10,803 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 14:16:10,804 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 14:16:10,804 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 14:16:10,804 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 14:16:10,805 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 14:16:10,805 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 14:16:10,806 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 14:16:10,806 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 14:16:10,813 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 14:16:10,817 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 14:16:10,819 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 14:16:10,822 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 14:16:10,824 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 14:16:10,825 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 14:16:10,826 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 14:16:10,829 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 14:16:10,829 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 14:16:10,829 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 14:16:10,829 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 14:16:10,830 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 14:16:10,830 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 14:16:10,830 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 14:16:10,831 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 14:16:10,831 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 14:16:10,831 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 14:16:10,832 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 14:16:10,832 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 14:16:10,832 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 14:16:10,833 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 14:16:10,833 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 14:16:10,833 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 14:16:10,837 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 14:16:10,838 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 14:16:10,847 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 14:16:10,848 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 14:16:10,848 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 14:16:10,849 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 14:16:10,849 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 14:16:10,849 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 14:16:10,849 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 14:16:10,849 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 14:16:10,849 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 14:16:10,850 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 14:16:10,850 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 14:16:10,850 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 14:16:10,850 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 14:16:10,850 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 14:16:10,850 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 14:16:10,850 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:16:10,850 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 14:16:10,850 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 14:16:10,850 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 14:16:10,850 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 14:16:10,851 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 14:16:10,851 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 14:16:10,851 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 14:16:11,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 14:16:11,069 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 14:16:11,071 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 14:16:11,071 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 14:16:11,072 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 14:16:11,073 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound10.c [2022-04-08 14:16:11,134 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7898c60db/13b5f14a991e44399768186ba46d451b/FLAG3606b79f1 [2022-04-08 14:16:11,464 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 14:16:11,464 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound10.c [2022-04-08 14:16:11,467 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7898c60db/13b5f14a991e44399768186ba46d451b/FLAG3606b79f1 [2022-04-08 14:16:11,475 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7898c60db/13b5f14a991e44399768186ba46d451b [2022-04-08 14:16:11,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 14:16:11,477 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 14:16:11,478 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 14:16:11,478 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 14:16:11,480 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 14:16:11,481 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:16:11" (1/1) ... [2022-04-08 14:16:11,481 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1acab2be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:16:11, skipping insertion in model container [2022-04-08 14:16:11,481 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:16:11" (1/1) ... [2022-04-08 14:16:11,485 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 14:16:11,493 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 14:16:11,647 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound10.c[458,471] [2022-04-08 14:16:11,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:16:11,672 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 14:16:11,680 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound10.c[458,471] [2022-04-08 14:16:11,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:16:11,703 INFO L208 MainTranslator]: Completed translation [2022-04-08 14:16:11,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:16:11 WrapperNode [2022-04-08 14:16:11,703 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 14:16:11,704 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 14:16:11,704 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 14:16:11,704 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 14:16:11,711 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:16:11" (1/1) ... [2022-04-08 14:16:11,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:16:11" (1/1) ... [2022-04-08 14:16:11,715 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:16:11" (1/1) ... [2022-04-08 14:16:11,715 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:16:11" (1/1) ... [2022-04-08 14:16:11,724 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:16:11" (1/1) ... [2022-04-08 14:16:11,728 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:16:11" (1/1) ... [2022-04-08 14:16:11,730 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:16:11" (1/1) ... [2022-04-08 14:16:11,734 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 14:16:11,735 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 14:16:11,735 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 14:16:11,735 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 14:16:11,736 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:16:11" (1/1) ... [2022-04-08 14:16:11,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:16:11,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:16:11,754 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 14:16:11,772 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 14:16:11,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 14:16:11,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 14:16:11,781 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 14:16:11,781 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 14:16:11,781 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 14:16:11,781 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 14:16:11,781 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 14:16:11,781 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 14:16:11,781 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 14:16:11,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 14:16:11,781 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-08 14:16:11,782 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 14:16:11,782 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 14:16:11,782 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 14:16:11,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 14:16:11,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 14:16:11,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 14:16:11,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 14:16:11,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 14:16:11,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 14:16:11,826 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 14:16:11,827 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 14:16:11,912 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 14:16:11,916 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 14:16:11,916 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 14:16:11,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:16:11 BoogieIcfgContainer [2022-04-08 14:16:11,917 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 14:16:11,918 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 14:16:11,918 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 14:16:11,920 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 14:16:11,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 02:16:11" (1/3) ... [2022-04-08 14:16:11,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1373bf3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:16:11, skipping insertion in model container [2022-04-08 14:16:11,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:16:11" (2/3) ... [2022-04-08 14:16:11,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1373bf3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:16:11, skipping insertion in model container [2022-04-08 14:16:11,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:16:11" (3/3) ... [2022-04-08 14:16:11,922 INFO L111 eAbstractionObserver]: Analyzing ICFG ps4-ll_unwindbound10.c [2022-04-08 14:16:11,925 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 14:16:11,925 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 14:16:11,949 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 14:16:11,953 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 14:16:11,953 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 14:16:11,963 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:16:11,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 14:16:11,967 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:16:11,967 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:16:11,967 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:16:11,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:16:11,970 INFO L85 PathProgramCache]: Analyzing trace with hash -2133548928, now seen corresponding path program 1 times [2022-04-08 14:16:11,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:11,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [967335663] [2022-04-08 14:16:11,981 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:16:11,982 INFO L85 PathProgramCache]: Analyzing trace with hash -2133548928, now seen corresponding path program 2 times [2022-04-08 14:16:11,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:16:11,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680007696] [2022-04-08 14:16:11,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:16:11,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:16:12,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:16:12,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:16:12,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:16:12,093 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.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);~counter~0 := 0; {26#true} is VALID [2022-04-08 14:16:12,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-08 14:16:12,093 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #57#return; {26#true} is VALID [2022-04-08 14:16:12,095 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {31#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:16:12,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.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);~counter~0 := 0; {26#true} is VALID [2022-04-08 14:16:12,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-08 14:16:12,095 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #57#return; {26#true} is VALID [2022-04-08 14:16:12,095 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret6 := main(); {26#true} is VALID [2022-04-08 14:16:12,096 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {26#true} is VALID [2022-04-08 14:16:12,096 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} assume !true; {27#false} is VALID [2022-04-08 14:16:12,096 INFO L272 TraceCheckUtils]: 7: Hoare triple {27#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27#false} is VALID [2022-04-08 14:16:12,097 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2022-04-08 14:16:12,097 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2022-04-08 14:16:12,097 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-04-08 14:16:12,097 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 14:16:12,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:16:12,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680007696] [2022-04-08 14:16:12,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680007696] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:16:12,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:16:12,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 14:16:12,100 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:16:12,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [967335663] [2022-04-08 14:16:12,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [967335663] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:16:12,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:16:12,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 14:16:12,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147622756] [2022-04-08 14:16:12,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:16:12,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-08 14:16:12,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:16:12,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 14:16:12,125 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:12,126 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 14:16:12,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:12,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 14:16:12,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 14:16:12,145 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 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.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 14:16:12,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:12,265 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2022-04-08 14:16:12,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 14:16:12,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-08 14:16:12,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:16:12,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 14:16:12,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-08 14:16:12,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 14:16:12,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-08 14:16:12,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2022-04-08 14:16:12,352 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:12,358 INFO L225 Difference]: With dead ends: 41 [2022-04-08 14:16:12,358 INFO L226 Difference]: Without dead ends: 19 [2022-04-08 14:16:12,360 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 14:16:12,362 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:16:12,362 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 29 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:16:12,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-08 14:16:12,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-04-08 14:16:12,384 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:16:12,384 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 14:16:12,385 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 14:16:12,385 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 14:16:12,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:12,387 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-08 14:16:12,387 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-08 14:16:12,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:12,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:12,388 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 19 states. [2022-04-08 14:16:12,388 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 19 states. [2022-04-08 14:16:12,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:12,390 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-08 14:16:12,390 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-08 14:16:12,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:12,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:12,390 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:16:12,391 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:16:12,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 14:16:12,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-04-08 14:16:12,393 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 11 [2022-04-08 14:16:12,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:16:12,393 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-04-08 14:16:12,393 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 14:16:12,393 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 21 transitions. [2022-04-08 14:16:12,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:12,412 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-08 14:16:12,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 14:16:12,413 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:16:12,413 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:16:12,413 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 14:16:12,413 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:16:12,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:16:12,414 INFO L85 PathProgramCache]: Analyzing trace with hash -2118701623, now seen corresponding path program 1 times [2022-04-08 14:16:12,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:12,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [734873125] [2022-04-08 14:16:12,415 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:16:12,415 INFO L85 PathProgramCache]: Analyzing trace with hash -2118701623, now seen corresponding path program 2 times [2022-04-08 14:16:12,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:16:12,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211550767] [2022-04-08 14:16:12,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:16:12,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:16:12,429 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:16:12,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1903361242] [2022-04-08 14:16:12,429 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:16:12,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:12,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:16:12,452 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 14:16:12,453 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 14:16:12,488 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 14:16:12,489 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:16:12,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 14:16:12,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:16:12,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:16:12,585 INFO L272 TraceCheckUtils]: 0: Hoare triple {190#true} call ULTIMATE.init(); {190#true} is VALID [2022-04-08 14:16:12,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {190#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);~counter~0 := 0; {198#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:12,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {198#(<= ~counter~0 0)} assume true; {198#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:12,587 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {198#(<= ~counter~0 0)} {190#true} #57#return; {198#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:12,587 INFO L272 TraceCheckUtils]: 4: Hoare triple {198#(<= ~counter~0 0)} call #t~ret6 := main(); {198#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:12,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {198#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {198#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:12,588 INFO L290 TraceCheckUtils]: 6: Hoare triple {198#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {214#(<= |main_#t~post5| 0)} is VALID [2022-04-08 14:16:12,589 INFO L290 TraceCheckUtils]: 7: Hoare triple {214#(<= |main_#t~post5| 0)} assume !(#t~post5 < 10);havoc #t~post5; {191#false} is VALID [2022-04-08 14:16:12,589 INFO L272 TraceCheckUtils]: 8: Hoare triple {191#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {191#false} is VALID [2022-04-08 14:16:12,589 INFO L290 TraceCheckUtils]: 9: Hoare triple {191#false} ~cond := #in~cond; {191#false} is VALID [2022-04-08 14:16:12,589 INFO L290 TraceCheckUtils]: 10: Hoare triple {191#false} assume 0 == ~cond; {191#false} is VALID [2022-04-08 14:16:12,589 INFO L290 TraceCheckUtils]: 11: Hoare triple {191#false} assume !false; {191#false} is VALID [2022-04-08 14:16:12,589 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 14:16:12,590 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 14:16:12,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:16:12,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211550767] [2022-04-08 14:16:12,590 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:16:12,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903361242] [2022-04-08 14:16:12,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903361242] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:16:12,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:16:12,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:16:12,591 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:16:12,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [734873125] [2022-04-08 14:16:12,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [734873125] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:16:12,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:16:12,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:16:12,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463081126] [2022-04-08 14:16:12,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:16:12,593 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 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 14:16:12,593 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:16:12,593 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 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 14:16:12,602 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 14:16:12,602 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:16:12,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:12,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:16:12,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:16:12,603 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 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 14:16:12,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:12,675 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-08 14:16:12,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:16:12,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 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 14:16:12,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:16:12,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 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 14:16:12,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-04-08 14:16:12,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 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 14:16:12,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-04-08 14:16:12,678 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 32 transitions. [2022-04-08 14:16:12,707 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 14:16:12,708 INFO L225 Difference]: With dead ends: 28 [2022-04-08 14:16:12,709 INFO L226 Difference]: Without dead ends: 20 [2022-04-08 14:16:12,709 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:16:12,710 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:16:12,710 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:16:12,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-08 14:16:12,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-08 14:16:12,716 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:16:12,717 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 14:16:12,717 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 14:16:12,717 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 14:16:12,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:12,718 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-08 14:16:12,719 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-08 14:16:12,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:12,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:12,719 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 20 states. [2022-04-08 14:16:12,719 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 20 states. [2022-04-08 14:16:12,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:12,721 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-08 14:16:12,721 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-08 14:16:12,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:12,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:12,721 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:16:12,721 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:16:12,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 14:16:12,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-04-08 14:16:12,723 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 12 [2022-04-08 14:16:12,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:16:12,723 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-04-08 14:16:12,723 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 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 14:16:12,723 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 23 transitions. [2022-04-08 14:16:12,741 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 14:16:12,741 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-08 14:16:12,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 14:16:12,742 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:16:12,742 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:16:12,778 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 14:16:12,958 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:12,958 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:16:12,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:16:12,959 INFO L85 PathProgramCache]: Analyzing trace with hash -2116914163, now seen corresponding path program 1 times [2022-04-08 14:16:12,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:12,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1742923793] [2022-04-08 14:16:12,960 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:16:12,960 INFO L85 PathProgramCache]: Analyzing trace with hash -2116914163, now seen corresponding path program 2 times [2022-04-08 14:16:12,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:16:12,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783259887] [2022-04-08 14:16:12,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:16:12,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:16:12,971 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:16:12,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1451249789] [2022-04-08 14:16:12,971 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:16:12,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:12,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:16:12,980 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 14:16:13,011 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 14:16:13,027 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 14:16:13,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:16:13,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 14:16:13,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:16:13,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:16:13,101 INFO L272 TraceCheckUtils]: 0: Hoare triple {365#true} call ULTIMATE.init(); {365#true} is VALID [2022-04-08 14:16:13,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {365#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);~counter~0 := 0; {365#true} is VALID [2022-04-08 14:16:13,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {365#true} assume true; {365#true} is VALID [2022-04-08 14:16:13,101 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {365#true} {365#true} #57#return; {365#true} is VALID [2022-04-08 14:16:13,101 INFO L272 TraceCheckUtils]: 4: Hoare triple {365#true} call #t~ret6 := main(); {365#true} is VALID [2022-04-08 14:16:13,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {365#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {385#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:16:13,102 INFO L290 TraceCheckUtils]: 6: Hoare triple {385#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {385#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:16:13,103 INFO L290 TraceCheckUtils]: 7: Hoare triple {385#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {385#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:16:13,104 INFO L272 TraceCheckUtils]: 8: Hoare triple {385#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {395#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:16:13,104 INFO L290 TraceCheckUtils]: 9: Hoare triple {395#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {399#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:16:13,104 INFO L290 TraceCheckUtils]: 10: Hoare triple {399#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {366#false} is VALID [2022-04-08 14:16:13,105 INFO L290 TraceCheckUtils]: 11: Hoare triple {366#false} assume !false; {366#false} is VALID [2022-04-08 14:16:13,105 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 14:16:13,105 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 14:16:13,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:16:13,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783259887] [2022-04-08 14:16:13,105 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:16:13,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451249789] [2022-04-08 14:16:13,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451249789] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:16:13,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:16:13,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:16:13,106 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:16:13,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1742923793] [2022-04-08 14:16:13,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1742923793] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:16:13,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:16:13,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:16:13,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072238896] [2022-04-08 14:16:13,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:16:13,107 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), 2 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 14:16:13,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:16:13,107 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), 2 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 14:16:13,116 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 14:16:13,116 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 14:16:13,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:13,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 14:16:13,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:16:13,117 INFO L87 Difference]: Start difference. First operand 20 states and 23 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), 2 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 14:16:13,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:13,206 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-08 14:16:13,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 14:16:13,207 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), 2 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 14:16:13,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:16:13,207 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), 2 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 14:16:13,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-08 14:16:13,209 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), 2 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 14:16:13,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-08 14:16:13,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 35 transitions. [2022-04-08 14:16:13,235 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:13,237 INFO L225 Difference]: With dead ends: 30 [2022-04-08 14:16:13,237 INFO L226 Difference]: Without dead ends: 26 [2022-04-08 14:16:13,238 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 14:16:13,241 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 6 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:16:13,241 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 64 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:16:13,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-08 14:16:13,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-08 14:16:13,251 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:16:13,251 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:16:13,251 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:16:13,252 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:16:13,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:13,253 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-08 14:16:13,253 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-08 14:16:13,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:13,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:13,254 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-08 14:16:13,254 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-08 14:16:13,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:13,255 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-08 14:16:13,256 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-08 14:16:13,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:13,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:13,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:16:13,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:16:13,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:16:13,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-04-08 14:16:13,257 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 12 [2022-04-08 14:16:13,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:16:13,258 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-04-08 14:16:13,258 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), 2 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 14:16:13,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 29 transitions. [2022-04-08 14:16:13,281 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:13,281 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-08 14:16:13,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 14:16:13,281 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:16:13,281 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:16:13,312 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 14:16:13,498 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,SelfDestructingSolverStorable2 [2022-04-08 14:16:13,498 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:16:13,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:16:13,498 INFO L85 PathProgramCache]: Analyzing trace with hash -263585780, now seen corresponding path program 1 times [2022-04-08 14:16:13,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:13,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1881172922] [2022-04-08 14:16:13,673 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:16:13,673 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:16:13,673 INFO L85 PathProgramCache]: Analyzing trace with hash -263585780, now seen corresponding path program 2 times [2022-04-08 14:16:13,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:16:13,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621898773] [2022-04-08 14:16:13,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:16:13,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:16:13,682 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:16:13,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1395660972] [2022-04-08 14:16:13,682 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:16:13,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:13,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:16:13,683 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 14:16:13,684 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 14:16:13,715 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:16:13,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:16:13,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 14:16:13,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:16:13,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:16:13,814 INFO L272 TraceCheckUtils]: 0: Hoare triple {571#true} call ULTIMATE.init(); {571#true} is VALID [2022-04-08 14:16:13,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {571#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);~counter~0 := 0; {579#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:13,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {579#(<= ~counter~0 0)} assume true; {579#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:13,815 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {579#(<= ~counter~0 0)} {571#true} #57#return; {579#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:13,816 INFO L272 TraceCheckUtils]: 4: Hoare triple {579#(<= ~counter~0 0)} call #t~ret6 := main(); {579#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:13,816 INFO L290 TraceCheckUtils]: 5: Hoare triple {579#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {579#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:13,817 INFO L290 TraceCheckUtils]: 6: Hoare triple {579#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {595#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:13,817 INFO L290 TraceCheckUtils]: 7: Hoare triple {595#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {595#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:13,818 INFO L272 TraceCheckUtils]: 8: Hoare triple {595#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {595#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:13,818 INFO L290 TraceCheckUtils]: 9: Hoare triple {595#(<= ~counter~0 1)} ~cond := #in~cond; {595#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:13,818 INFO L290 TraceCheckUtils]: 10: Hoare triple {595#(<= ~counter~0 1)} assume !(0 == ~cond); {595#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:13,819 INFO L290 TraceCheckUtils]: 11: Hoare triple {595#(<= ~counter~0 1)} assume true; {595#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:13,823 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {595#(<= ~counter~0 1)} {595#(<= ~counter~0 1)} #51#return; {595#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:13,823 INFO L290 TraceCheckUtils]: 13: Hoare triple {595#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {595#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:13,824 INFO L290 TraceCheckUtils]: 14: Hoare triple {595#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {620#(<= |main_#t~post5| 1)} is VALID [2022-04-08 14:16:13,824 INFO L290 TraceCheckUtils]: 15: Hoare triple {620#(<= |main_#t~post5| 1)} assume !(#t~post5 < 10);havoc #t~post5; {572#false} is VALID [2022-04-08 14:16:13,824 INFO L272 TraceCheckUtils]: 16: Hoare triple {572#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {572#false} is VALID [2022-04-08 14:16:13,825 INFO L290 TraceCheckUtils]: 17: Hoare triple {572#false} ~cond := #in~cond; {572#false} is VALID [2022-04-08 14:16:13,825 INFO L290 TraceCheckUtils]: 18: Hoare triple {572#false} assume 0 == ~cond; {572#false} is VALID [2022-04-08 14:16:13,825 INFO L290 TraceCheckUtils]: 19: Hoare triple {572#false} assume !false; {572#false} is VALID [2022-04-08 14:16:13,825 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:16:13,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:16:13,931 INFO L290 TraceCheckUtils]: 19: Hoare triple {572#false} assume !false; {572#false} is VALID [2022-04-08 14:16:13,931 INFO L290 TraceCheckUtils]: 18: Hoare triple {572#false} assume 0 == ~cond; {572#false} is VALID [2022-04-08 14:16:13,931 INFO L290 TraceCheckUtils]: 17: Hoare triple {572#false} ~cond := #in~cond; {572#false} is VALID [2022-04-08 14:16:13,931 INFO L272 TraceCheckUtils]: 16: Hoare triple {572#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {572#false} is VALID [2022-04-08 14:16:13,932 INFO L290 TraceCheckUtils]: 15: Hoare triple {648#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {572#false} is VALID [2022-04-08 14:16:13,932 INFO L290 TraceCheckUtils]: 14: Hoare triple {652#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {648#(< |main_#t~post5| 10)} is VALID [2022-04-08 14:16:13,933 INFO L290 TraceCheckUtils]: 13: Hoare triple {652#(< ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {652#(< ~counter~0 10)} is VALID [2022-04-08 14:16:13,933 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {571#true} {652#(< ~counter~0 10)} #51#return; {652#(< ~counter~0 10)} is VALID [2022-04-08 14:16:13,933 INFO L290 TraceCheckUtils]: 11: Hoare triple {571#true} assume true; {571#true} is VALID [2022-04-08 14:16:13,933 INFO L290 TraceCheckUtils]: 10: Hoare triple {571#true} assume !(0 == ~cond); {571#true} is VALID [2022-04-08 14:16:13,934 INFO L290 TraceCheckUtils]: 9: Hoare triple {571#true} ~cond := #in~cond; {571#true} is VALID [2022-04-08 14:16:13,934 INFO L272 TraceCheckUtils]: 8: Hoare triple {652#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {571#true} is VALID [2022-04-08 14:16:13,934 INFO L290 TraceCheckUtils]: 7: Hoare triple {652#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {652#(< ~counter~0 10)} is VALID [2022-04-08 14:16:13,934 INFO L290 TraceCheckUtils]: 6: Hoare triple {677#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {652#(< ~counter~0 10)} is VALID [2022-04-08 14:16:13,935 INFO L290 TraceCheckUtils]: 5: Hoare triple {677#(< ~counter~0 9)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {677#(< ~counter~0 9)} is VALID [2022-04-08 14:16:13,935 INFO L272 TraceCheckUtils]: 4: Hoare triple {677#(< ~counter~0 9)} call #t~ret6 := main(); {677#(< ~counter~0 9)} is VALID [2022-04-08 14:16:13,936 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {677#(< ~counter~0 9)} {571#true} #57#return; {677#(< ~counter~0 9)} is VALID [2022-04-08 14:16:13,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {677#(< ~counter~0 9)} assume true; {677#(< ~counter~0 9)} is VALID [2022-04-08 14:16:13,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {571#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);~counter~0 := 0; {677#(< ~counter~0 9)} is VALID [2022-04-08 14:16:13,937 INFO L272 TraceCheckUtils]: 0: Hoare triple {571#true} call ULTIMATE.init(); {571#true} is VALID [2022-04-08 14:16:13,937 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:16:13,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:16:13,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621898773] [2022-04-08 14:16:13,937 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:16:13,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395660972] [2022-04-08 14:16:13,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395660972] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:16:13,937 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:16:13,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-08 14:16:13,938 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:16:13,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1881172922] [2022-04-08 14:16:13,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1881172922] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:16:13,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:16:13,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:16:13,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998240346] [2022-04-08 14:16:13,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:16:13,939 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-08 14:16:13,939 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:16:13,939 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 14:16:13,952 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 14:16:13,952 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 14:16:13,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:13,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 14:16:13,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-08 14:16:13,952 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 14:16:14,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:14,013 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-04-08 14:16:14,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 14:16:14,014 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-08 14:16:14,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:16:14,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 14:16:14,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-08 14:16:14,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 14:16:14,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-08 14:16:14,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-04-08 14:16:14,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:14,041 INFO L225 Difference]: With dead ends: 36 [2022-04-08 14:16:14,041 INFO L226 Difference]: Without dead ends: 28 [2022-04-08 14:16:14,041 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-08 14:16:14,042 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 2 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:16:14,042 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 66 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:16:14,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-08 14:16:14,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-08 14:16:14,057 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:16:14,058 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:16:14,059 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:16:14,059 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:16:14,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:14,066 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-04-08 14:16:14,066 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-04-08 14:16:14,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:14,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:14,067 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 28 states. [2022-04-08 14:16:14,067 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 28 states. [2022-04-08 14:16:14,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:14,071 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-04-08 14:16:14,071 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-04-08 14:16:14,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:14,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:14,073 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:16:14,073 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:16:14,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:16:14,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-04-08 14:16:14,077 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 20 [2022-04-08 14:16:14,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:16:14,077 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-04-08 14:16:14,078 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 14:16:14,078 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 31 transitions. [2022-04-08 14:16:14,127 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:14,127 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-04-08 14:16:14,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 14:16:14,128 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:16:14,128 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:16:14,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-08 14:16:14,343 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:14,344 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:16:14,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:16:14,344 INFO L85 PathProgramCache]: Analyzing trace with hash -261798320, now seen corresponding path program 1 times [2022-04-08 14:16:14,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:14,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1074733831] [2022-04-08 14:16:14,489 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:16:14,489 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:16:14,489 INFO L85 PathProgramCache]: Analyzing trace with hash -261798320, now seen corresponding path program 2 times [2022-04-08 14:16:14,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:16:14,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635979411] [2022-04-08 14:16:14,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:16:14,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:16:14,498 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:16:14,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [29426568] [2022-04-08 14:16:14,498 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:16:14,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:14,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:16:14,499 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 14:16:14,518 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 14:16:14,537 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:16:14,537 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:16:14,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 14:16:14,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:16:14,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:16:14,643 INFO L272 TraceCheckUtils]: 0: Hoare triple {884#true} call ULTIMATE.init(); {884#true} is VALID [2022-04-08 14:16:14,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {884#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);~counter~0 := 0; {884#true} is VALID [2022-04-08 14:16:14,644 INFO L290 TraceCheckUtils]: 2: Hoare triple {884#true} assume true; {884#true} is VALID [2022-04-08 14:16:14,644 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {884#true} {884#true} #57#return; {884#true} is VALID [2022-04-08 14:16:14,644 INFO L272 TraceCheckUtils]: 4: Hoare triple {884#true} call #t~ret6 := main(); {884#true} is VALID [2022-04-08 14:16:14,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {884#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {904#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:16:14,645 INFO L290 TraceCheckUtils]: 6: Hoare triple {904#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {904#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:16:14,645 INFO L290 TraceCheckUtils]: 7: Hoare triple {904#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {904#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:16:14,645 INFO L272 TraceCheckUtils]: 8: Hoare triple {904#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {884#true} is VALID [2022-04-08 14:16:14,645 INFO L290 TraceCheckUtils]: 9: Hoare triple {884#true} ~cond := #in~cond; {884#true} is VALID [2022-04-08 14:16:14,646 INFO L290 TraceCheckUtils]: 10: Hoare triple {884#true} assume !(0 == ~cond); {884#true} is VALID [2022-04-08 14:16:14,646 INFO L290 TraceCheckUtils]: 11: Hoare triple {884#true} assume true; {884#true} is VALID [2022-04-08 14:16:14,646 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {884#true} {904#(and (= main_~x~0 0) (= main_~y~0 0))} #51#return; {904#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:16:14,647 INFO L290 TraceCheckUtils]: 13: Hoare triple {904#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {929#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} is VALID [2022-04-08 14:16:14,647 INFO L290 TraceCheckUtils]: 14: Hoare triple {929#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {929#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} is VALID [2022-04-08 14:16:14,648 INFO L290 TraceCheckUtils]: 15: Hoare triple {929#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} assume !!(#t~post5 < 10);havoc #t~post5; {929#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} is VALID [2022-04-08 14:16:14,648 INFO L272 TraceCheckUtils]: 16: Hoare triple {929#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {939#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:16:14,649 INFO L290 TraceCheckUtils]: 17: Hoare triple {939#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {943#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:16:14,651 INFO L290 TraceCheckUtils]: 18: Hoare triple {943#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {885#false} is VALID [2022-04-08 14:16:14,651 INFO L290 TraceCheckUtils]: 19: Hoare triple {885#false} assume !false; {885#false} is VALID [2022-04-08 14:16:14,652 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:16:14,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:16:14,834 INFO L290 TraceCheckUtils]: 19: Hoare triple {885#false} assume !false; {885#false} is VALID [2022-04-08 14:16:14,837 INFO L290 TraceCheckUtils]: 18: Hoare triple {943#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {885#false} is VALID [2022-04-08 14:16:14,837 INFO L290 TraceCheckUtils]: 17: Hoare triple {939#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {943#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:16:14,838 INFO L272 TraceCheckUtils]: 16: Hoare triple {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {939#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:16:14,838 INFO L290 TraceCheckUtils]: 15: Hoare triple {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !!(#t~post5 < 10);havoc #t~post5; {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-08 14:16:14,841 INFO L290 TraceCheckUtils]: 14: Hoare triple {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-08 14:16:14,857 INFO L290 TraceCheckUtils]: 13: Hoare triple {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-08 14:16:14,857 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {884#true} {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} #51#return; {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-08 14:16:14,857 INFO L290 TraceCheckUtils]: 11: Hoare triple {884#true} assume true; {884#true} is VALID [2022-04-08 14:16:14,858 INFO L290 TraceCheckUtils]: 10: Hoare triple {884#true} assume !(0 == ~cond); {884#true} is VALID [2022-04-08 14:16:14,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {884#true} ~cond := #in~cond; {884#true} is VALID [2022-04-08 14:16:14,858 INFO L272 TraceCheckUtils]: 8: Hoare triple {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {884#true} is VALID [2022-04-08 14:16:14,858 INFO L290 TraceCheckUtils]: 7: Hoare triple {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !!(#t~post5 < 10);havoc #t~post5; {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-08 14:16:14,865 INFO L290 TraceCheckUtils]: 6: Hoare triple {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-08 14:16:14,865 INFO L290 TraceCheckUtils]: 5: Hoare triple {884#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-08 14:16:14,865 INFO L272 TraceCheckUtils]: 4: Hoare triple {884#true} call #t~ret6 := main(); {884#true} is VALID [2022-04-08 14:16:14,866 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {884#true} {884#true} #57#return; {884#true} is VALID [2022-04-08 14:16:14,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {884#true} assume true; {884#true} is VALID [2022-04-08 14:16:14,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {884#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);~counter~0 := 0; {884#true} is VALID [2022-04-08 14:16:14,868 INFO L272 TraceCheckUtils]: 0: Hoare triple {884#true} call ULTIMATE.init(); {884#true} is VALID [2022-04-08 14:16:14,869 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 14:16:14,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:16:14,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635979411] [2022-04-08 14:16:14,870 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:16:14,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29426568] [2022-04-08 14:16:14,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [29426568] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 14:16:14,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:16:14,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-08 14:16:14,871 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:16:14,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1074733831] [2022-04-08 14:16:14,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1074733831] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:16:14,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:16:14,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:16:14,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404286236] [2022-04-08 14:16:14,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:16:14,872 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-08 14:16:14,873 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:16:14,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 14:16:14,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:14,906 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 14:16:14,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:14,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 14:16:14,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 14:16:14,907 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 14:16:15,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:15,022 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-08 14:16:15,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 14:16:15,022 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-08 14:16:15,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:16:15,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 14:16:15,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-04-08 14:16:15,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 14:16:15,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-04-08 14:16:15,029 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 26 transitions. [2022-04-08 14:16:15,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:15,061 INFO L225 Difference]: With dead ends: 34 [2022-04-08 14:16:15,061 INFO L226 Difference]: Without dead ends: 29 [2022-04-08 14:16:15,061 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-08 14:16:15,062 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 7 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:16:15,062 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 53 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:16:15,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-08 14:16:15,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-08 14:16:15,086 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:16:15,087 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 14:16:15,087 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 14:16:15,087 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 14:16:15,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:15,089 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-08 14:16:15,089 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-08 14:16:15,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:15,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:15,091 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 29 states. [2022-04-08 14:16:15,091 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 29 states. [2022-04-08 14:16:15,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:15,092 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-08 14:16:15,092 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-08 14:16:15,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:15,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:15,093 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:16:15,093 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:16:15,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 14:16:15,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2022-04-08 14:16:15,094 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 20 [2022-04-08 14:16:15,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:16:15,094 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2022-04-08 14:16:15,094 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 14:16:15,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 30 transitions. [2022-04-08 14:16:15,123 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:15,123 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-08 14:16:15,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 14:16:15,124 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:16:15,124 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:16:15,142 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 14:16:15,324 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:15,324 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:16:15,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:16:15,325 INFO L85 PathProgramCache]: Analyzing trace with hash 891414954, now seen corresponding path program 1 times [2022-04-08 14:16:15,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:15,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [959235645] [2022-04-08 14:16:15,420 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:16:15,420 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:16:15,420 INFO L85 PathProgramCache]: Analyzing trace with hash 891414954, now seen corresponding path program 2 times [2022-04-08 14:16:15,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:16:15,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468333958] [2022-04-08 14:16:15,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:16:15,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:16:15,443 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:16:15,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [226754565] [2022-04-08 14:16:15,443 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:16:15,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:15,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:16:15,448 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 14:16:15,448 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 14:16:15,488 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:16:15,488 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:16:15,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 14:16:15,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:16:15,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:16:15,707 INFO L272 TraceCheckUtils]: 0: Hoare triple {1196#true} call ULTIMATE.init(); {1196#true} is VALID [2022-04-08 14:16:15,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {1196#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);~counter~0 := 0; {1196#true} is VALID [2022-04-08 14:16:15,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {1196#true} assume true; {1196#true} is VALID [2022-04-08 14:16:15,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1196#true} {1196#true} #57#return; {1196#true} is VALID [2022-04-08 14:16:15,707 INFO L272 TraceCheckUtils]: 4: Hoare triple {1196#true} call #t~ret6 := main(); {1196#true} is VALID [2022-04-08 14:16:15,723 INFO L290 TraceCheckUtils]: 5: Hoare triple {1196#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {1216#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:16:15,724 INFO L290 TraceCheckUtils]: 6: Hoare triple {1216#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1216#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:16:15,724 INFO L290 TraceCheckUtils]: 7: Hoare triple {1216#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {1216#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:16:15,724 INFO L272 TraceCheckUtils]: 8: Hoare triple {1216#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1196#true} is VALID [2022-04-08 14:16:15,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {1196#true} ~cond := #in~cond; {1196#true} is VALID [2022-04-08 14:16:15,725 INFO L290 TraceCheckUtils]: 10: Hoare triple {1196#true} assume !(0 == ~cond); {1196#true} is VALID [2022-04-08 14:16:15,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {1196#true} assume true; {1196#true} is VALID [2022-04-08 14:16:15,725 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1196#true} {1216#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {1216#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:16:15,726 INFO L290 TraceCheckUtils]: 13: Hoare triple {1216#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1241#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 14:16:15,726 INFO L290 TraceCheckUtils]: 14: Hoare triple {1241#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1241#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 14:16:15,727 INFO L290 TraceCheckUtils]: 15: Hoare triple {1241#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {1241#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 14:16:15,727 INFO L272 TraceCheckUtils]: 16: Hoare triple {1241#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1196#true} is VALID [2022-04-08 14:16:15,727 INFO L290 TraceCheckUtils]: 17: Hoare triple {1196#true} ~cond := #in~cond; {1196#true} is VALID [2022-04-08 14:16:15,727 INFO L290 TraceCheckUtils]: 18: Hoare triple {1196#true} assume !(0 == ~cond); {1196#true} is VALID [2022-04-08 14:16:15,727 INFO L290 TraceCheckUtils]: 19: Hoare triple {1196#true} assume true; {1196#true} is VALID [2022-04-08 14:16:15,728 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1196#true} {1241#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #51#return; {1241#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 14:16:15,728 INFO L290 TraceCheckUtils]: 21: Hoare triple {1241#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {1266#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-08 14:16:15,729 INFO L272 TraceCheckUtils]: 22: Hoare triple {1266#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1270#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:16:15,729 INFO L290 TraceCheckUtils]: 23: Hoare triple {1270#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1274#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:16:15,729 INFO L290 TraceCheckUtils]: 24: Hoare triple {1274#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1197#false} is VALID [2022-04-08 14:16:15,730 INFO L290 TraceCheckUtils]: 25: Hoare triple {1197#false} assume !false; {1197#false} is VALID [2022-04-08 14:16:15,730 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 14:16:15,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:16:15,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:16:15,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468333958] [2022-04-08 14:16:15,993 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:16:15,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226754565] [2022-04-08 14:16:15,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226754565] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:16:15,993 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:16:15,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-08 14:16:15,993 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:16:15,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [959235645] [2022-04-08 14:16:15,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [959235645] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:16:15,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:16:15,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 14:16:15,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211714016] [2022-04-08 14:16:15,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:16:15,994 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2022-04-08 14:16:15,994 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:16:15,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 14:16:16,009 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 14:16:16,009 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 14:16:16,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:16,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 14:16:16,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-08 14:16:16,010 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 14:16:16,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:16,163 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-08 14:16:16,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 14:16:16,164 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2022-04-08 14:16:16,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:16:16,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 14:16:16,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-04-08 14:16:16,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 14:16:16,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-04-08 14:16:16,166 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 34 transitions. [2022-04-08 14:16:16,192 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:16,192 INFO L225 Difference]: With dead ends: 36 [2022-04-08 14:16:16,192 INFO L226 Difference]: Without dead ends: 31 [2022-04-08 14:16:16,193 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-08 14:16:16,193 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:16:16,193 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 100 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:16:16,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-08 14:16:16,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-08 14:16:16,215 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:16:16,215 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:16:16,215 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:16:16,215 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:16:16,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:16,216 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-04-08 14:16:16,216 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-08 14:16:16,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:16,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:16,217 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 31 states. [2022-04-08 14:16:16,217 INFO L87 Difference]: Start difference. First operand has 31 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 31 states. [2022-04-08 14:16:16,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:16,218 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-04-08 14:16:16,218 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-08 14:16:16,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:16,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:16,218 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:16:16,218 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:16:16,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:16:16,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2022-04-08 14:16:16,219 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 26 [2022-04-08 14:16:16,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:16:16,219 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2022-04-08 14:16:16,219 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 14:16:16,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 33 transitions. [2022-04-08 14:16:16,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:16,257 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-08 14:16:16,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 14:16:16,257 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:16:16,257 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:16:16,276 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 14:16:16,472 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:16,473 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:16:16,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:16:16,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1647059121, now seen corresponding path program 3 times [2022-04-08 14:16:16,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:16,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2044101706] [2022-04-08 14:16:16,556 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:16:16,556 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:16:16,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1647059121, now seen corresponding path program 4 times [2022-04-08 14:16:16,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:16:16,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476859867] [2022-04-08 14:16:16,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:16:16,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:16:16,564 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:16:16,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1260229093] [2022-04-08 14:16:16,564 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:16:16,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:16,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:16:16,566 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 14:16:16,566 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 14:16:16,600 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:16:16,600 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:16:16,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 14:16:16,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:16:16,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:16:16,724 INFO L272 TraceCheckUtils]: 0: Hoare triple {1525#true} call ULTIMATE.init(); {1525#true} is VALID [2022-04-08 14:16:16,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {1525#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);~counter~0 := 0; {1533#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:16,725 INFO L290 TraceCheckUtils]: 2: Hoare triple {1533#(<= ~counter~0 0)} assume true; {1533#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:16,725 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1533#(<= ~counter~0 0)} {1525#true} #57#return; {1533#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:16,726 INFO L272 TraceCheckUtils]: 4: Hoare triple {1533#(<= ~counter~0 0)} call #t~ret6 := main(); {1533#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:16,726 INFO L290 TraceCheckUtils]: 5: Hoare triple {1533#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {1533#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:16,727 INFO L290 TraceCheckUtils]: 6: Hoare triple {1533#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1549#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:16,728 INFO L290 TraceCheckUtils]: 7: Hoare triple {1549#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {1549#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:16,728 INFO L272 TraceCheckUtils]: 8: Hoare triple {1549#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1549#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:16,728 INFO L290 TraceCheckUtils]: 9: Hoare triple {1549#(<= ~counter~0 1)} ~cond := #in~cond; {1549#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:16,729 INFO L290 TraceCheckUtils]: 10: Hoare triple {1549#(<= ~counter~0 1)} assume !(0 == ~cond); {1549#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:16,729 INFO L290 TraceCheckUtils]: 11: Hoare triple {1549#(<= ~counter~0 1)} assume true; {1549#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:16,730 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1549#(<= ~counter~0 1)} {1549#(<= ~counter~0 1)} #51#return; {1549#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:16,730 INFO L290 TraceCheckUtils]: 13: Hoare triple {1549#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1549#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:16,730 INFO L290 TraceCheckUtils]: 14: Hoare triple {1549#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1574#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:16,731 INFO L290 TraceCheckUtils]: 15: Hoare triple {1574#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {1574#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:16,731 INFO L272 TraceCheckUtils]: 16: Hoare triple {1574#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1574#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:16,731 INFO L290 TraceCheckUtils]: 17: Hoare triple {1574#(<= ~counter~0 2)} ~cond := #in~cond; {1574#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:16,732 INFO L290 TraceCheckUtils]: 18: Hoare triple {1574#(<= ~counter~0 2)} assume !(0 == ~cond); {1574#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:16,732 INFO L290 TraceCheckUtils]: 19: Hoare triple {1574#(<= ~counter~0 2)} assume true; {1574#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:16,732 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1574#(<= ~counter~0 2)} {1574#(<= ~counter~0 2)} #51#return; {1574#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:16,733 INFO L290 TraceCheckUtils]: 21: Hoare triple {1574#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1574#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:16,733 INFO L290 TraceCheckUtils]: 22: Hoare triple {1574#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1599#(<= |main_#t~post5| 2)} is VALID [2022-04-08 14:16:16,733 INFO L290 TraceCheckUtils]: 23: Hoare triple {1599#(<= |main_#t~post5| 2)} assume !(#t~post5 < 10);havoc #t~post5; {1526#false} is VALID [2022-04-08 14:16:16,733 INFO L272 TraceCheckUtils]: 24: Hoare triple {1526#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1526#false} is VALID [2022-04-08 14:16:16,734 INFO L290 TraceCheckUtils]: 25: Hoare triple {1526#false} ~cond := #in~cond; {1526#false} is VALID [2022-04-08 14:16:16,734 INFO L290 TraceCheckUtils]: 26: Hoare triple {1526#false} assume 0 == ~cond; {1526#false} is VALID [2022-04-08 14:16:16,734 INFO L290 TraceCheckUtils]: 27: Hoare triple {1526#false} assume !false; {1526#false} is VALID [2022-04-08 14:16:16,735 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:16:16,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:16:16,883 INFO L290 TraceCheckUtils]: 27: Hoare triple {1526#false} assume !false; {1526#false} is VALID [2022-04-08 14:16:16,883 INFO L290 TraceCheckUtils]: 26: Hoare triple {1526#false} assume 0 == ~cond; {1526#false} is VALID [2022-04-08 14:16:16,883 INFO L290 TraceCheckUtils]: 25: Hoare triple {1526#false} ~cond := #in~cond; {1526#false} is VALID [2022-04-08 14:16:16,883 INFO L272 TraceCheckUtils]: 24: Hoare triple {1526#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1526#false} is VALID [2022-04-08 14:16:16,883 INFO L290 TraceCheckUtils]: 23: Hoare triple {1627#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {1526#false} is VALID [2022-04-08 14:16:16,884 INFO L290 TraceCheckUtils]: 22: Hoare triple {1631#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1627#(< |main_#t~post5| 10)} is VALID [2022-04-08 14:16:16,884 INFO L290 TraceCheckUtils]: 21: Hoare triple {1631#(< ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1631#(< ~counter~0 10)} is VALID [2022-04-08 14:16:16,895 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1525#true} {1631#(< ~counter~0 10)} #51#return; {1631#(< ~counter~0 10)} is VALID [2022-04-08 14:16:16,896 INFO L290 TraceCheckUtils]: 19: Hoare triple {1525#true} assume true; {1525#true} is VALID [2022-04-08 14:16:16,896 INFO L290 TraceCheckUtils]: 18: Hoare triple {1525#true} assume !(0 == ~cond); {1525#true} is VALID [2022-04-08 14:16:16,896 INFO L290 TraceCheckUtils]: 17: Hoare triple {1525#true} ~cond := #in~cond; {1525#true} is VALID [2022-04-08 14:16:16,896 INFO L272 TraceCheckUtils]: 16: Hoare triple {1631#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1525#true} is VALID [2022-04-08 14:16:16,896 INFO L290 TraceCheckUtils]: 15: Hoare triple {1631#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {1631#(< ~counter~0 10)} is VALID [2022-04-08 14:16:16,897 INFO L290 TraceCheckUtils]: 14: Hoare triple {1656#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1631#(< ~counter~0 10)} is VALID [2022-04-08 14:16:16,897 INFO L290 TraceCheckUtils]: 13: Hoare triple {1656#(< ~counter~0 9)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1656#(< ~counter~0 9)} is VALID [2022-04-08 14:16:16,898 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1525#true} {1656#(< ~counter~0 9)} #51#return; {1656#(< ~counter~0 9)} is VALID [2022-04-08 14:16:16,898 INFO L290 TraceCheckUtils]: 11: Hoare triple {1525#true} assume true; {1525#true} is VALID [2022-04-08 14:16:16,898 INFO L290 TraceCheckUtils]: 10: Hoare triple {1525#true} assume !(0 == ~cond); {1525#true} is VALID [2022-04-08 14:16:16,898 INFO L290 TraceCheckUtils]: 9: Hoare triple {1525#true} ~cond := #in~cond; {1525#true} is VALID [2022-04-08 14:16:16,898 INFO L272 TraceCheckUtils]: 8: Hoare triple {1656#(< ~counter~0 9)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1525#true} is VALID [2022-04-08 14:16:16,898 INFO L290 TraceCheckUtils]: 7: Hoare triple {1656#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {1656#(< ~counter~0 9)} is VALID [2022-04-08 14:16:16,899 INFO L290 TraceCheckUtils]: 6: Hoare triple {1681#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1656#(< ~counter~0 9)} is VALID [2022-04-08 14:16:16,899 INFO L290 TraceCheckUtils]: 5: Hoare triple {1681#(< ~counter~0 8)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {1681#(< ~counter~0 8)} is VALID [2022-04-08 14:16:16,899 INFO L272 TraceCheckUtils]: 4: Hoare triple {1681#(< ~counter~0 8)} call #t~ret6 := main(); {1681#(< ~counter~0 8)} is VALID [2022-04-08 14:16:16,900 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1681#(< ~counter~0 8)} {1525#true} #57#return; {1681#(< ~counter~0 8)} is VALID [2022-04-08 14:16:16,900 INFO L290 TraceCheckUtils]: 2: Hoare triple {1681#(< ~counter~0 8)} assume true; {1681#(< ~counter~0 8)} is VALID [2022-04-08 14:16:16,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {1525#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);~counter~0 := 0; {1681#(< ~counter~0 8)} is VALID [2022-04-08 14:16:16,901 INFO L272 TraceCheckUtils]: 0: Hoare triple {1525#true} call ULTIMATE.init(); {1525#true} is VALID [2022-04-08 14:16:16,901 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 14:16:16,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:16:16,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476859867] [2022-04-08 14:16:16,901 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:16:16,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260229093] [2022-04-08 14:16:16,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260229093] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:16:16,901 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:16:16,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-08 14:16:16,902 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:16:16,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2044101706] [2022-04-08 14:16:16,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2044101706] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:16:16,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:16:16,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 14:16:16,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031150137] [2022-04-08 14:16:16,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:16:16,902 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 28 [2022-04-08 14:16:16,902 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:16:16,903 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 14:16:16,926 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 14:16:16,926 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 14:16:16,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:16,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 14:16:16,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-08 14:16:16,927 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 14:16:17,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:17,068 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2022-04-08 14:16:17,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 14:16:17,068 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 28 [2022-04-08 14:16:17,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:16:17,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 14:16:17,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-08 14:16:17,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 14:16:17,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-08 14:16:17,071 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 42 transitions. [2022-04-08 14:16:17,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:17,107 INFO L225 Difference]: With dead ends: 42 [2022-04-08 14:16:17,107 INFO L226 Difference]: Without dead ends: 37 [2022-04-08 14:16:17,107 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-04-08 14:16:17,117 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:16:17,117 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 64 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:16:17,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-08 14:16:17,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-08 14:16:17,165 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:16:17,165 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:16:17,166 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:16:17,166 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:16:17,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:17,167 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2022-04-08 14:16:17,167 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-04-08 14:16:17,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:17,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:17,167 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 37 states. [2022-04-08 14:16:17,167 INFO L87 Difference]: Start difference. First operand has 37 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 37 states. [2022-04-08 14:16:17,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:17,168 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2022-04-08 14:16:17,168 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-04-08 14:16:17,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:17,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:17,168 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:16:17,168 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:16:17,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:16:17,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2022-04-08 14:16:17,169 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 28 [2022-04-08 14:16:17,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:16:17,170 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2022-04-08 14:16:17,170 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 14:16:17,170 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 38 transitions. [2022-04-08 14:16:17,209 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:17,210 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-04-08 14:16:17,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 14:16:17,210 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:16:17,210 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:16:17,230 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 14:16:17,411 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:17,411 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:16:17,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:16:17,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1036651181, now seen corresponding path program 3 times [2022-04-08 14:16:17,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:17,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1988011351] [2022-04-08 14:16:17,549 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:16:17,550 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:16:17,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1036651181, now seen corresponding path program 4 times [2022-04-08 14:16:17,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:16:17,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066613200] [2022-04-08 14:16:17,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:16:17,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:16:17,561 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:16:17,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [584623953] [2022-04-08 14:16:17,561 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:16:17,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:17,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:16:17,562 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:16:17,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-08 14:16:17,610 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:16:17,610 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:16:17,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 14:16:17,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:16:17,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:16:17,909 INFO L272 TraceCheckUtils]: 0: Hoare triple {1938#true} call ULTIMATE.init(); {1938#true} is VALID [2022-04-08 14:16:17,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {1938#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);~counter~0 := 0; {1938#true} is VALID [2022-04-08 14:16:17,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {1938#true} assume true; {1938#true} is VALID [2022-04-08 14:16:17,909 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1938#true} {1938#true} #57#return; {1938#true} is VALID [2022-04-08 14:16:17,909 INFO L272 TraceCheckUtils]: 4: Hoare triple {1938#true} call #t~ret6 := main(); {1938#true} is VALID [2022-04-08 14:16:17,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {1938#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {1958#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:16:17,910 INFO L290 TraceCheckUtils]: 6: Hoare triple {1958#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1958#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:16:17,911 INFO L290 TraceCheckUtils]: 7: Hoare triple {1958#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {1958#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:16:17,911 INFO L272 TraceCheckUtils]: 8: Hoare triple {1958#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1938#true} is VALID [2022-04-08 14:16:17,911 INFO L290 TraceCheckUtils]: 9: Hoare triple {1938#true} ~cond := #in~cond; {1938#true} is VALID [2022-04-08 14:16:17,911 INFO L290 TraceCheckUtils]: 10: Hoare triple {1938#true} assume !(0 == ~cond); {1938#true} is VALID [2022-04-08 14:16:17,911 INFO L290 TraceCheckUtils]: 11: Hoare triple {1938#true} assume true; {1938#true} is VALID [2022-04-08 14:16:17,911 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1938#true} {1958#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {1958#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:16:17,912 INFO L290 TraceCheckUtils]: 13: Hoare triple {1958#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1983#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-08 14:16:17,912 INFO L290 TraceCheckUtils]: 14: Hoare triple {1983#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1983#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-08 14:16:17,913 INFO L290 TraceCheckUtils]: 15: Hoare triple {1983#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {1983#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-08 14:16:17,913 INFO L272 TraceCheckUtils]: 16: Hoare triple {1983#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1938#true} is VALID [2022-04-08 14:16:17,913 INFO L290 TraceCheckUtils]: 17: Hoare triple {1938#true} ~cond := #in~cond; {1938#true} is VALID [2022-04-08 14:16:17,913 INFO L290 TraceCheckUtils]: 18: Hoare triple {1938#true} assume !(0 == ~cond); {1938#true} is VALID [2022-04-08 14:16:17,913 INFO L290 TraceCheckUtils]: 19: Hoare triple {1938#true} assume true; {1938#true} is VALID [2022-04-08 14:16:17,913 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1938#true} {1983#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} #51#return; {1983#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-08 14:16:17,914 INFO L290 TraceCheckUtils]: 21: Hoare triple {1983#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2008#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-08 14:16:17,914 INFO L290 TraceCheckUtils]: 22: Hoare triple {2008#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2008#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-08 14:16:17,915 INFO L290 TraceCheckUtils]: 23: Hoare triple {2008#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !!(#t~post5 < 10);havoc #t~post5; {2008#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-08 14:16:17,915 INFO L272 TraceCheckUtils]: 24: Hoare triple {2008#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1938#true} is VALID [2022-04-08 14:16:17,915 INFO L290 TraceCheckUtils]: 25: Hoare triple {1938#true} ~cond := #in~cond; {1938#true} is VALID [2022-04-08 14:16:17,915 INFO L290 TraceCheckUtils]: 26: Hoare triple {1938#true} assume !(0 == ~cond); {1938#true} is VALID [2022-04-08 14:16:17,915 INFO L290 TraceCheckUtils]: 27: Hoare triple {1938#true} assume true; {1938#true} is VALID [2022-04-08 14:16:17,916 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1938#true} {2008#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} #51#return; {2008#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-08 14:16:17,916 INFO L290 TraceCheckUtils]: 29: Hoare triple {2008#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {2033#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-08 14:16:17,917 INFO L272 TraceCheckUtils]: 30: Hoare triple {2033#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2037#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:16:17,917 INFO L290 TraceCheckUtils]: 31: Hoare triple {2037#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2041#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:16:17,917 INFO L290 TraceCheckUtils]: 32: Hoare triple {2041#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1939#false} is VALID [2022-04-08 14:16:17,917 INFO L290 TraceCheckUtils]: 33: Hoare triple {1939#false} assume !false; {1939#false} is VALID [2022-04-08 14:16:17,918 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 14:16:17,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:16:18,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:16:18,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066613200] [2022-04-08 14:16:18,260 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:16:18,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584623953] [2022-04-08 14:16:18,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584623953] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:16:18,261 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:16:18,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-08 14:16:18,261 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:16:18,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1988011351] [2022-04-08 14:16:18,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1988011351] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:16:18,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:16:18,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 14:16:18,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884487131] [2022-04-08 14:16:18,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:16:18,262 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 34 [2022-04-08 14:16:18,262 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:16:18,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:16:18,281 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 14:16:18,282 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 14:16:18,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:18,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 14:16:18,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-08 14:16:18,282 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:16:18,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:18,558 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-08 14:16:18,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 14:16:18,558 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 34 [2022-04-08 14:16:18,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:16:18,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:16:18,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-08 14:16:18,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:16:18,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-08 14:16:18,560 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 39 transitions. [2022-04-08 14:16:18,596 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 14:16:18,596 INFO L225 Difference]: With dead ends: 44 [2022-04-08 14:16:18,596 INFO L226 Difference]: Without dead ends: 39 [2022-04-08 14:16:18,597 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-08 14:16:18,597 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:16:18,597 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 132 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:16:18,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-08 14:16:18,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-08 14:16:18,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:16:18,652 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:16:18,652 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:16:18,653 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:16:18,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:18,654 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2022-04-08 14:16:18,654 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-04-08 14:16:18,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:18,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:18,654 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 39 states. [2022-04-08 14:16:18,654 INFO L87 Difference]: Start difference. First operand has 39 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 39 states. [2022-04-08 14:16:18,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:18,655 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2022-04-08 14:16:18,656 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-04-08 14:16:18,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:18,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:18,656 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:16:18,656 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:16:18,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:16:18,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2022-04-08 14:16:18,658 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 34 [2022-04-08 14:16:18,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:16:18,658 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2022-04-08 14:16:18,658 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:16:18,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 41 transitions. [2022-04-08 14:16:18,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:18,711 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-04-08 14:16:18,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-08 14:16:18,712 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:16:18,712 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:16:18,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-08 14:16:18,916 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:18,916 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:16:18,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:16:18,917 INFO L85 PathProgramCache]: Analyzing trace with hash 486001554, now seen corresponding path program 5 times [2022-04-08 14:16:18,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:18,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1989950151] [2022-04-08 14:16:19,002 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:16:19,002 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:16:19,002 INFO L85 PathProgramCache]: Analyzing trace with hash 486001554, now seen corresponding path program 6 times [2022-04-08 14:16:19,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:16:19,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403399820] [2022-04-08 14:16:19,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:16:19,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:16:19,019 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:16:19,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [612134454] [2022-04-08 14:16:19,020 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:16:19,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:19,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:16:19,035 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:16:19,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-08 14:16:19,146 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 14:16:19,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:16:19,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 14:16:19,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:16:19,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:16:19,324 INFO L272 TraceCheckUtils]: 0: Hoare triple {2365#true} call ULTIMATE.init(); {2365#true} is VALID [2022-04-08 14:16:19,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {2365#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);~counter~0 := 0; {2373#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:19,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {2373#(<= ~counter~0 0)} assume true; {2373#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:19,325 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2373#(<= ~counter~0 0)} {2365#true} #57#return; {2373#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:19,326 INFO L272 TraceCheckUtils]: 4: Hoare triple {2373#(<= ~counter~0 0)} call #t~ret6 := main(); {2373#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:19,326 INFO L290 TraceCheckUtils]: 5: Hoare triple {2373#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {2373#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:19,327 INFO L290 TraceCheckUtils]: 6: Hoare triple {2373#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2389#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:19,327 INFO L290 TraceCheckUtils]: 7: Hoare triple {2389#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {2389#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:19,331 INFO L272 TraceCheckUtils]: 8: Hoare triple {2389#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2389#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:19,332 INFO L290 TraceCheckUtils]: 9: Hoare triple {2389#(<= ~counter~0 1)} ~cond := #in~cond; {2389#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:19,332 INFO L290 TraceCheckUtils]: 10: Hoare triple {2389#(<= ~counter~0 1)} assume !(0 == ~cond); {2389#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:19,333 INFO L290 TraceCheckUtils]: 11: Hoare triple {2389#(<= ~counter~0 1)} assume true; {2389#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:19,335 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2389#(<= ~counter~0 1)} {2389#(<= ~counter~0 1)} #51#return; {2389#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:19,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {2389#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2389#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:19,337 INFO L290 TraceCheckUtils]: 14: Hoare triple {2389#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2414#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:19,337 INFO L290 TraceCheckUtils]: 15: Hoare triple {2414#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {2414#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:19,339 INFO L272 TraceCheckUtils]: 16: Hoare triple {2414#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2414#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:19,339 INFO L290 TraceCheckUtils]: 17: Hoare triple {2414#(<= ~counter~0 2)} ~cond := #in~cond; {2414#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:19,340 INFO L290 TraceCheckUtils]: 18: Hoare triple {2414#(<= ~counter~0 2)} assume !(0 == ~cond); {2414#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:19,341 INFO L290 TraceCheckUtils]: 19: Hoare triple {2414#(<= ~counter~0 2)} assume true; {2414#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:19,341 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2414#(<= ~counter~0 2)} {2414#(<= ~counter~0 2)} #51#return; {2414#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:19,343 INFO L290 TraceCheckUtils]: 21: Hoare triple {2414#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2414#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:19,344 INFO L290 TraceCheckUtils]: 22: Hoare triple {2414#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2439#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:19,344 INFO L290 TraceCheckUtils]: 23: Hoare triple {2439#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {2439#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:19,345 INFO L272 TraceCheckUtils]: 24: Hoare triple {2439#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2439#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:19,345 INFO L290 TraceCheckUtils]: 25: Hoare triple {2439#(<= ~counter~0 3)} ~cond := #in~cond; {2439#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:19,346 INFO L290 TraceCheckUtils]: 26: Hoare triple {2439#(<= ~counter~0 3)} assume !(0 == ~cond); {2439#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:19,346 INFO L290 TraceCheckUtils]: 27: Hoare triple {2439#(<= ~counter~0 3)} assume true; {2439#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:19,347 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2439#(<= ~counter~0 3)} {2439#(<= ~counter~0 3)} #51#return; {2439#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:19,347 INFO L290 TraceCheckUtils]: 29: Hoare triple {2439#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2439#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:19,348 INFO L290 TraceCheckUtils]: 30: Hoare triple {2439#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2464#(<= |main_#t~post5| 3)} is VALID [2022-04-08 14:16:19,348 INFO L290 TraceCheckUtils]: 31: Hoare triple {2464#(<= |main_#t~post5| 3)} assume !(#t~post5 < 10);havoc #t~post5; {2366#false} is VALID [2022-04-08 14:16:19,348 INFO L272 TraceCheckUtils]: 32: Hoare triple {2366#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2366#false} is VALID [2022-04-08 14:16:19,348 INFO L290 TraceCheckUtils]: 33: Hoare triple {2366#false} ~cond := #in~cond; {2366#false} is VALID [2022-04-08 14:16:19,348 INFO L290 TraceCheckUtils]: 34: Hoare triple {2366#false} assume 0 == ~cond; {2366#false} is VALID [2022-04-08 14:16:19,348 INFO L290 TraceCheckUtils]: 35: Hoare triple {2366#false} assume !false; {2366#false} is VALID [2022-04-08 14:16:19,350 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:16:19,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:16:19,527 INFO L290 TraceCheckUtils]: 35: Hoare triple {2366#false} assume !false; {2366#false} is VALID [2022-04-08 14:16:19,527 INFO L290 TraceCheckUtils]: 34: Hoare triple {2366#false} assume 0 == ~cond; {2366#false} is VALID [2022-04-08 14:16:19,528 INFO L290 TraceCheckUtils]: 33: Hoare triple {2366#false} ~cond := #in~cond; {2366#false} is VALID [2022-04-08 14:16:19,528 INFO L272 TraceCheckUtils]: 32: Hoare triple {2366#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2366#false} is VALID [2022-04-08 14:16:19,528 INFO L290 TraceCheckUtils]: 31: Hoare triple {2492#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {2366#false} is VALID [2022-04-08 14:16:19,528 INFO L290 TraceCheckUtils]: 30: Hoare triple {2496#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2492#(< |main_#t~post5| 10)} is VALID [2022-04-08 14:16:19,529 INFO L290 TraceCheckUtils]: 29: Hoare triple {2496#(< ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2496#(< ~counter~0 10)} is VALID [2022-04-08 14:16:19,529 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2365#true} {2496#(< ~counter~0 10)} #51#return; {2496#(< ~counter~0 10)} is VALID [2022-04-08 14:16:19,529 INFO L290 TraceCheckUtils]: 27: Hoare triple {2365#true} assume true; {2365#true} is VALID [2022-04-08 14:16:19,529 INFO L290 TraceCheckUtils]: 26: Hoare triple {2365#true} assume !(0 == ~cond); {2365#true} is VALID [2022-04-08 14:16:19,529 INFO L290 TraceCheckUtils]: 25: Hoare triple {2365#true} ~cond := #in~cond; {2365#true} is VALID [2022-04-08 14:16:19,529 INFO L272 TraceCheckUtils]: 24: Hoare triple {2496#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2365#true} is VALID [2022-04-08 14:16:19,530 INFO L290 TraceCheckUtils]: 23: Hoare triple {2496#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {2496#(< ~counter~0 10)} is VALID [2022-04-08 14:16:19,530 INFO L290 TraceCheckUtils]: 22: Hoare triple {2521#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2496#(< ~counter~0 10)} is VALID [2022-04-08 14:16:19,530 INFO L290 TraceCheckUtils]: 21: Hoare triple {2521#(< ~counter~0 9)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2521#(< ~counter~0 9)} is VALID [2022-04-08 14:16:19,531 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2365#true} {2521#(< ~counter~0 9)} #51#return; {2521#(< ~counter~0 9)} is VALID [2022-04-08 14:16:19,531 INFO L290 TraceCheckUtils]: 19: Hoare triple {2365#true} assume true; {2365#true} is VALID [2022-04-08 14:16:19,531 INFO L290 TraceCheckUtils]: 18: Hoare triple {2365#true} assume !(0 == ~cond); {2365#true} is VALID [2022-04-08 14:16:19,531 INFO L290 TraceCheckUtils]: 17: Hoare triple {2365#true} ~cond := #in~cond; {2365#true} is VALID [2022-04-08 14:16:19,531 INFO L272 TraceCheckUtils]: 16: Hoare triple {2521#(< ~counter~0 9)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2365#true} is VALID [2022-04-08 14:16:19,531 INFO L290 TraceCheckUtils]: 15: Hoare triple {2521#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {2521#(< ~counter~0 9)} is VALID [2022-04-08 14:16:19,532 INFO L290 TraceCheckUtils]: 14: Hoare triple {2546#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2521#(< ~counter~0 9)} is VALID [2022-04-08 14:16:19,532 INFO L290 TraceCheckUtils]: 13: Hoare triple {2546#(< ~counter~0 8)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2546#(< ~counter~0 8)} is VALID [2022-04-08 14:16:19,533 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2365#true} {2546#(< ~counter~0 8)} #51#return; {2546#(< ~counter~0 8)} is VALID [2022-04-08 14:16:19,533 INFO L290 TraceCheckUtils]: 11: Hoare triple {2365#true} assume true; {2365#true} is VALID [2022-04-08 14:16:19,533 INFO L290 TraceCheckUtils]: 10: Hoare triple {2365#true} assume !(0 == ~cond); {2365#true} is VALID [2022-04-08 14:16:19,533 INFO L290 TraceCheckUtils]: 9: Hoare triple {2365#true} ~cond := #in~cond; {2365#true} is VALID [2022-04-08 14:16:19,533 INFO L272 TraceCheckUtils]: 8: Hoare triple {2546#(< ~counter~0 8)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2365#true} is VALID [2022-04-08 14:16:19,534 INFO L290 TraceCheckUtils]: 7: Hoare triple {2546#(< ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {2546#(< ~counter~0 8)} is VALID [2022-04-08 14:16:19,534 INFO L290 TraceCheckUtils]: 6: Hoare triple {2571#(< ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2546#(< ~counter~0 8)} is VALID [2022-04-08 14:16:19,534 INFO L290 TraceCheckUtils]: 5: Hoare triple {2571#(< ~counter~0 7)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {2571#(< ~counter~0 7)} is VALID [2022-04-08 14:16:19,535 INFO L272 TraceCheckUtils]: 4: Hoare triple {2571#(< ~counter~0 7)} call #t~ret6 := main(); {2571#(< ~counter~0 7)} is VALID [2022-04-08 14:16:19,535 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2571#(< ~counter~0 7)} {2365#true} #57#return; {2571#(< ~counter~0 7)} is VALID [2022-04-08 14:16:19,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {2571#(< ~counter~0 7)} assume true; {2571#(< ~counter~0 7)} is VALID [2022-04-08 14:16:19,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {2365#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);~counter~0 := 0; {2571#(< ~counter~0 7)} is VALID [2022-04-08 14:16:19,536 INFO L272 TraceCheckUtils]: 0: Hoare triple {2365#true} call ULTIMATE.init(); {2365#true} is VALID [2022-04-08 14:16:19,536 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 14:16:19,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:16:19,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403399820] [2022-04-08 14:16:19,536 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:16:19,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612134454] [2022-04-08 14:16:19,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612134454] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:16:19,536 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:16:19,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-08 14:16:19,538 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:16:19,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1989950151] [2022-04-08 14:16:19,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1989950151] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:16:19,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:16:19,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 14:16:19,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748381596] [2022-04-08 14:16:19,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:16:19,540 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 36 [2022-04-08 14:16:19,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:16:19,540 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:16:19,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:19,561 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 14:16:19,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:19,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 14:16:19,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-08 14:16:19,562 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:16:19,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:19,675 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2022-04-08 14:16:19,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 14:16:19,675 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 36 [2022-04-08 14:16:19,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:16:19,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:16:19,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2022-04-08 14:16:19,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:16:19,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2022-04-08 14:16:19,682 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 50 transitions. [2022-04-08 14:16:19,710 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:19,711 INFO L225 Difference]: With dead ends: 50 [2022-04-08 14:16:19,711 INFO L226 Difference]: Without dead ends: 45 [2022-04-08 14:16:19,711 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2022-04-08 14:16:19,713 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:16:19,713 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 77 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:16:19,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-08 14:16:19,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-08 14:16:19,758 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:16:19,758 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:16:19,759 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:16:19,759 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:16:19,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:19,760 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2022-04-08 14:16:19,760 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-04-08 14:16:19,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:19,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:19,761 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 45 states. [2022-04-08 14:16:19,761 INFO L87 Difference]: Start difference. First operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 45 states. [2022-04-08 14:16:19,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:19,762 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2022-04-08 14:16:19,762 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-04-08 14:16:19,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:19,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:19,762 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:16:19,762 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:16:19,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:16:19,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2022-04-08 14:16:19,763 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 36 [2022-04-08 14:16:19,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:16:19,763 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2022-04-08 14:16:19,763 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:16:19,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 46 transitions. [2022-04-08 14:16:19,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:19,810 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-04-08 14:16:19,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-08 14:16:19,810 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:16:19,811 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:16:19,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-08 14:16:20,023 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-08 14:16:20,023 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:16:20,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:16:20,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1383171920, now seen corresponding path program 5 times [2022-04-08 14:16:20,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:20,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [434262973] [2022-04-08 14:16:20,105 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:16:20,105 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:16:20,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1383171920, now seen corresponding path program 6 times [2022-04-08 14:16:20,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:16:20,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534089534] [2022-04-08 14:16:20,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:16:20,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:16:20,126 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:16:20,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1818080973] [2022-04-08 14:16:20,126 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:16:20,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:20,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:16:20,135 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:16:20,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-08 14:16:20,235 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 14:16:20,236 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:16:20,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-08 14:16:20,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:16:20,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:16:20,496 INFO L272 TraceCheckUtils]: 0: Hoare triple {2878#true} call ULTIMATE.init(); {2878#true} is VALID [2022-04-08 14:16:20,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {2878#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);~counter~0 := 0; {2878#true} is VALID [2022-04-08 14:16:20,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-08 14:16:20,496 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2878#true} {2878#true} #57#return; {2878#true} is VALID [2022-04-08 14:16:20,496 INFO L272 TraceCheckUtils]: 4: Hoare triple {2878#true} call #t~ret6 := main(); {2878#true} is VALID [2022-04-08 14:16:20,496 INFO L290 TraceCheckUtils]: 5: Hoare triple {2878#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {2898#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:16:20,497 INFO L290 TraceCheckUtils]: 6: Hoare triple {2898#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2898#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:16:20,497 INFO L290 TraceCheckUtils]: 7: Hoare triple {2898#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {2898#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:16:20,497 INFO L272 TraceCheckUtils]: 8: Hoare triple {2898#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2878#true} is VALID [2022-04-08 14:16:20,497 INFO L290 TraceCheckUtils]: 9: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-08 14:16:20,497 INFO L290 TraceCheckUtils]: 10: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-08 14:16:20,497 INFO L290 TraceCheckUtils]: 11: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-08 14:16:20,498 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2878#true} {2898#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {2898#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:16:20,498 INFO L290 TraceCheckUtils]: 13: Hoare triple {2898#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2923#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:16:20,499 INFO L290 TraceCheckUtils]: 14: Hoare triple {2923#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2923#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:16:20,499 INFO L290 TraceCheckUtils]: 15: Hoare triple {2923#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {2923#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:16:20,500 INFO L272 TraceCheckUtils]: 16: Hoare triple {2923#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2878#true} is VALID [2022-04-08 14:16:20,521 INFO L290 TraceCheckUtils]: 17: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-08 14:16:20,521 INFO L290 TraceCheckUtils]: 18: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-08 14:16:20,521 INFO L290 TraceCheckUtils]: 19: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-08 14:16:20,524 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2878#true} {2923#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #51#return; {2923#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:16:20,525 INFO L290 TraceCheckUtils]: 21: Hoare triple {2923#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2948#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 14:16:20,525 INFO L290 TraceCheckUtils]: 22: Hoare triple {2948#(and (= main_~y~0 2) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2948#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 14:16:20,525 INFO L290 TraceCheckUtils]: 23: Hoare triple {2948#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(#t~post5 < 10);havoc #t~post5; {2948#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 14:16:20,526 INFO L272 TraceCheckUtils]: 24: Hoare triple {2948#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2878#true} is VALID [2022-04-08 14:16:20,526 INFO L290 TraceCheckUtils]: 25: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-08 14:16:20,526 INFO L290 TraceCheckUtils]: 26: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-08 14:16:20,526 INFO L290 TraceCheckUtils]: 27: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-08 14:16:20,527 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2878#true} {2948#(and (= main_~y~0 2) (= main_~c~0 2))} #51#return; {2948#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 14:16:20,527 INFO L290 TraceCheckUtils]: 29: Hoare triple {2948#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2973#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} is VALID [2022-04-08 14:16:20,528 INFO L290 TraceCheckUtils]: 30: Hoare triple {2973#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2973#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} is VALID [2022-04-08 14:16:20,528 INFO L290 TraceCheckUtils]: 31: Hoare triple {2973#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} assume !!(#t~post5 < 10);havoc #t~post5; {2973#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} is VALID [2022-04-08 14:16:20,528 INFO L272 TraceCheckUtils]: 32: Hoare triple {2973#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2878#true} is VALID [2022-04-08 14:16:20,528 INFO L290 TraceCheckUtils]: 33: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-08 14:16:20,528 INFO L290 TraceCheckUtils]: 34: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-08 14:16:20,528 INFO L290 TraceCheckUtils]: 35: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-08 14:16:20,529 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2878#true} {2973#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} #51#return; {2973#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} is VALID [2022-04-08 14:16:20,529 INFO L290 TraceCheckUtils]: 37: Hoare triple {2973#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {2998#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-08 14:16:20,530 INFO L272 TraceCheckUtils]: 38: Hoare triple {2998#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~k~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3002#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:16:20,530 INFO L290 TraceCheckUtils]: 39: Hoare triple {3002#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3006#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:16:20,531 INFO L290 TraceCheckUtils]: 40: Hoare triple {3006#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2879#false} is VALID [2022-04-08 14:16:20,531 INFO L290 TraceCheckUtils]: 41: Hoare triple {2879#false} assume !false; {2879#false} is VALID [2022-04-08 14:16:20,531 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 14:16:20,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:16:20,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:16:20,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534089534] [2022-04-08 14:16:20,783 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:16:20,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818080973] [2022-04-08 14:16:20,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818080973] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:16:20,783 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:16:20,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-08 14:16:20,784 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:16:20,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [434262973] [2022-04-08 14:16:20,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [434262973] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:16:20,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:16:20,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 14:16:20,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280370797] [2022-04-08 14:16:20,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:16:20,784 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 42 [2022-04-08 14:16:20,784 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:16:20,785 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:16:20,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:20,821 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 14:16:20,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:20,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 14:16:20,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-08 14:16:20,822 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:16:21,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:21,231 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-08 14:16:21,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 14:16:21,231 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 42 [2022-04-08 14:16:21,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:16:21,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:16:21,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-08 14:16:21,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:16:21,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-08 14:16:21,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 44 transitions. [2022-04-08 14:16:21,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:21,281 INFO L225 Difference]: With dead ends: 52 [2022-04-08 14:16:21,281 INFO L226 Difference]: Without dead ends: 47 [2022-04-08 14:16:21,282 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-08 14:16:21,282 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:16:21,282 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 168 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:16:21,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-08 14:16:21,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-08 14:16:21,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:16:21,325 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:16:21,325 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:16:21,325 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:16:21,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:21,326 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-04-08 14:16:21,326 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-08 14:16:21,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:21,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:21,326 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 47 states. [2022-04-08 14:16:21,326 INFO L87 Difference]: Start difference. First operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 47 states. [2022-04-08 14:16:21,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:21,327 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-04-08 14:16:21,327 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-08 14:16:21,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:21,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:21,327 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:16:21,327 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:16:21,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:16:21,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2022-04-08 14:16:21,328 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 42 [2022-04-08 14:16:21,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:16:21,329 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2022-04-08 14:16:21,329 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:16:21,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 49 transitions. [2022-04-08 14:16:21,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:21,399 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-08 14:16:21,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-08 14:16:21,401 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:16:21,401 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:16:21,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-08 14:16:21,628 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-08 14:16:21,629 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:16:21,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:16:21,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1386691371, now seen corresponding path program 7 times [2022-04-08 14:16:21,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:21,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1081338717] [2022-04-08 14:16:21,705 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:16:21,706 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:16:21,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1386691371, now seen corresponding path program 8 times [2022-04-08 14:16:21,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:16:21,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112982154] [2022-04-08 14:16:21,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:16:21,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:16:21,725 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:16:21,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [932200188] [2022-04-08 14:16:21,726 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:16:21,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:21,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:16:21,727 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:16:21,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-08 14:16:21,775 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:16:21,775 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:16:21,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 14:16:21,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:16:21,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:16:22,027 INFO L272 TraceCheckUtils]: 0: Hoare triple {3353#true} call ULTIMATE.init(); {3353#true} is VALID [2022-04-08 14:16:22,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {3353#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);~counter~0 := 0; {3361#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:22,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {3361#(<= ~counter~0 0)} assume true; {3361#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:22,029 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3361#(<= ~counter~0 0)} {3353#true} #57#return; {3361#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:22,029 INFO L272 TraceCheckUtils]: 4: Hoare triple {3361#(<= ~counter~0 0)} call #t~ret6 := main(); {3361#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:22,029 INFO L290 TraceCheckUtils]: 5: Hoare triple {3361#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {3361#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:22,030 INFO L290 TraceCheckUtils]: 6: Hoare triple {3361#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3377#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:22,030 INFO L290 TraceCheckUtils]: 7: Hoare triple {3377#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {3377#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:22,030 INFO L272 TraceCheckUtils]: 8: Hoare triple {3377#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3377#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:22,031 INFO L290 TraceCheckUtils]: 9: Hoare triple {3377#(<= ~counter~0 1)} ~cond := #in~cond; {3377#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:22,031 INFO L290 TraceCheckUtils]: 10: Hoare triple {3377#(<= ~counter~0 1)} assume !(0 == ~cond); {3377#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:22,031 INFO L290 TraceCheckUtils]: 11: Hoare triple {3377#(<= ~counter~0 1)} assume true; {3377#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:22,032 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3377#(<= ~counter~0 1)} {3377#(<= ~counter~0 1)} #51#return; {3377#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:22,032 INFO L290 TraceCheckUtils]: 13: Hoare triple {3377#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3377#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:22,032 INFO L290 TraceCheckUtils]: 14: Hoare triple {3377#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3402#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:22,033 INFO L290 TraceCheckUtils]: 15: Hoare triple {3402#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {3402#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:22,034 INFO L272 TraceCheckUtils]: 16: Hoare triple {3402#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3402#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:22,034 INFO L290 TraceCheckUtils]: 17: Hoare triple {3402#(<= ~counter~0 2)} ~cond := #in~cond; {3402#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:22,034 INFO L290 TraceCheckUtils]: 18: Hoare triple {3402#(<= ~counter~0 2)} assume !(0 == ~cond); {3402#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:22,035 INFO L290 TraceCheckUtils]: 19: Hoare triple {3402#(<= ~counter~0 2)} assume true; {3402#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:22,035 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3402#(<= ~counter~0 2)} {3402#(<= ~counter~0 2)} #51#return; {3402#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:22,035 INFO L290 TraceCheckUtils]: 21: Hoare triple {3402#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3402#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:22,036 INFO L290 TraceCheckUtils]: 22: Hoare triple {3402#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3427#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:22,037 INFO L290 TraceCheckUtils]: 23: Hoare triple {3427#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {3427#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:22,038 INFO L272 TraceCheckUtils]: 24: Hoare triple {3427#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3427#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:22,038 INFO L290 TraceCheckUtils]: 25: Hoare triple {3427#(<= ~counter~0 3)} ~cond := #in~cond; {3427#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:22,040 INFO L290 TraceCheckUtils]: 26: Hoare triple {3427#(<= ~counter~0 3)} assume !(0 == ~cond); {3427#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:22,041 INFO L290 TraceCheckUtils]: 27: Hoare triple {3427#(<= ~counter~0 3)} assume true; {3427#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:22,041 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3427#(<= ~counter~0 3)} {3427#(<= ~counter~0 3)} #51#return; {3427#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:22,042 INFO L290 TraceCheckUtils]: 29: Hoare triple {3427#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3427#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:22,042 INFO L290 TraceCheckUtils]: 30: Hoare triple {3427#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3452#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:22,042 INFO L290 TraceCheckUtils]: 31: Hoare triple {3452#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {3452#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:22,043 INFO L272 TraceCheckUtils]: 32: Hoare triple {3452#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3452#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:22,043 INFO L290 TraceCheckUtils]: 33: Hoare triple {3452#(<= ~counter~0 4)} ~cond := #in~cond; {3452#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:22,043 INFO L290 TraceCheckUtils]: 34: Hoare triple {3452#(<= ~counter~0 4)} assume !(0 == ~cond); {3452#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:22,044 INFO L290 TraceCheckUtils]: 35: Hoare triple {3452#(<= ~counter~0 4)} assume true; {3452#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:22,044 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3452#(<= ~counter~0 4)} {3452#(<= ~counter~0 4)} #51#return; {3452#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:22,044 INFO L290 TraceCheckUtils]: 37: Hoare triple {3452#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3452#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:22,045 INFO L290 TraceCheckUtils]: 38: Hoare triple {3452#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3477#(<= |main_#t~post5| 4)} is VALID [2022-04-08 14:16:22,045 INFO L290 TraceCheckUtils]: 39: Hoare triple {3477#(<= |main_#t~post5| 4)} assume !(#t~post5 < 10);havoc #t~post5; {3354#false} is VALID [2022-04-08 14:16:22,045 INFO L272 TraceCheckUtils]: 40: Hoare triple {3354#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3354#false} is VALID [2022-04-08 14:16:22,045 INFO L290 TraceCheckUtils]: 41: Hoare triple {3354#false} ~cond := #in~cond; {3354#false} is VALID [2022-04-08 14:16:22,045 INFO L290 TraceCheckUtils]: 42: Hoare triple {3354#false} assume 0 == ~cond; {3354#false} is VALID [2022-04-08 14:16:22,046 INFO L290 TraceCheckUtils]: 43: Hoare triple {3354#false} assume !false; {3354#false} is VALID [2022-04-08 14:16:22,046 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:16:22,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:16:22,289 INFO L290 TraceCheckUtils]: 43: Hoare triple {3354#false} assume !false; {3354#false} is VALID [2022-04-08 14:16:22,289 INFO L290 TraceCheckUtils]: 42: Hoare triple {3354#false} assume 0 == ~cond; {3354#false} is VALID [2022-04-08 14:16:22,289 INFO L290 TraceCheckUtils]: 41: Hoare triple {3354#false} ~cond := #in~cond; {3354#false} is VALID [2022-04-08 14:16:22,289 INFO L272 TraceCheckUtils]: 40: Hoare triple {3354#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3354#false} is VALID [2022-04-08 14:16:22,289 INFO L290 TraceCheckUtils]: 39: Hoare triple {3505#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {3354#false} is VALID [2022-04-08 14:16:22,290 INFO L290 TraceCheckUtils]: 38: Hoare triple {3509#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3505#(< |main_#t~post5| 10)} is VALID [2022-04-08 14:16:22,290 INFO L290 TraceCheckUtils]: 37: Hoare triple {3509#(< ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3509#(< ~counter~0 10)} is VALID [2022-04-08 14:16:22,291 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3353#true} {3509#(< ~counter~0 10)} #51#return; {3509#(< ~counter~0 10)} is VALID [2022-04-08 14:16:22,291 INFO L290 TraceCheckUtils]: 35: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-08 14:16:22,291 INFO L290 TraceCheckUtils]: 34: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-08 14:16:22,291 INFO L290 TraceCheckUtils]: 33: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-08 14:16:22,291 INFO L272 TraceCheckUtils]: 32: Hoare triple {3509#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3353#true} is VALID [2022-04-08 14:16:22,291 INFO L290 TraceCheckUtils]: 31: Hoare triple {3509#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {3509#(< ~counter~0 10)} is VALID [2022-04-08 14:16:22,292 INFO L290 TraceCheckUtils]: 30: Hoare triple {3534#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3509#(< ~counter~0 10)} is VALID [2022-04-08 14:16:22,292 INFO L290 TraceCheckUtils]: 29: Hoare triple {3534#(< ~counter~0 9)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3534#(< ~counter~0 9)} is VALID [2022-04-08 14:16:22,292 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3353#true} {3534#(< ~counter~0 9)} #51#return; {3534#(< ~counter~0 9)} is VALID [2022-04-08 14:16:22,293 INFO L290 TraceCheckUtils]: 27: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-08 14:16:22,293 INFO L290 TraceCheckUtils]: 26: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-08 14:16:22,293 INFO L290 TraceCheckUtils]: 25: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-08 14:16:22,293 INFO L272 TraceCheckUtils]: 24: Hoare triple {3534#(< ~counter~0 9)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3353#true} is VALID [2022-04-08 14:16:22,293 INFO L290 TraceCheckUtils]: 23: Hoare triple {3534#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {3534#(< ~counter~0 9)} is VALID [2022-04-08 14:16:22,293 INFO L290 TraceCheckUtils]: 22: Hoare triple {3559#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3534#(< ~counter~0 9)} is VALID [2022-04-08 14:16:22,294 INFO L290 TraceCheckUtils]: 21: Hoare triple {3559#(< ~counter~0 8)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3559#(< ~counter~0 8)} is VALID [2022-04-08 14:16:22,294 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3353#true} {3559#(< ~counter~0 8)} #51#return; {3559#(< ~counter~0 8)} is VALID [2022-04-08 14:16:22,294 INFO L290 TraceCheckUtils]: 19: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-08 14:16:22,294 INFO L290 TraceCheckUtils]: 18: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-08 14:16:22,294 INFO L290 TraceCheckUtils]: 17: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-08 14:16:22,294 INFO L272 TraceCheckUtils]: 16: Hoare triple {3559#(< ~counter~0 8)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3353#true} is VALID [2022-04-08 14:16:22,295 INFO L290 TraceCheckUtils]: 15: Hoare triple {3559#(< ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {3559#(< ~counter~0 8)} is VALID [2022-04-08 14:16:22,295 INFO L290 TraceCheckUtils]: 14: Hoare triple {3584#(< ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3559#(< ~counter~0 8)} is VALID [2022-04-08 14:16:22,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {3584#(< ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3584#(< ~counter~0 7)} is VALID [2022-04-08 14:16:22,296 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3353#true} {3584#(< ~counter~0 7)} #51#return; {3584#(< ~counter~0 7)} is VALID [2022-04-08 14:16:22,296 INFO L290 TraceCheckUtils]: 11: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-08 14:16:22,296 INFO L290 TraceCheckUtils]: 10: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-08 14:16:22,296 INFO L290 TraceCheckUtils]: 9: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-08 14:16:22,296 INFO L272 TraceCheckUtils]: 8: Hoare triple {3584#(< ~counter~0 7)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3353#true} is VALID [2022-04-08 14:16:22,296 INFO L290 TraceCheckUtils]: 7: Hoare triple {3584#(< ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {3584#(< ~counter~0 7)} is VALID [2022-04-08 14:16:22,297 INFO L290 TraceCheckUtils]: 6: Hoare triple {3609#(< ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3584#(< ~counter~0 7)} is VALID [2022-04-08 14:16:22,297 INFO L290 TraceCheckUtils]: 5: Hoare triple {3609#(< ~counter~0 6)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {3609#(< ~counter~0 6)} is VALID [2022-04-08 14:16:22,298 INFO L272 TraceCheckUtils]: 4: Hoare triple {3609#(< ~counter~0 6)} call #t~ret6 := main(); {3609#(< ~counter~0 6)} is VALID [2022-04-08 14:16:22,298 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3609#(< ~counter~0 6)} {3353#true} #57#return; {3609#(< ~counter~0 6)} is VALID [2022-04-08 14:16:22,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {3609#(< ~counter~0 6)} assume true; {3609#(< ~counter~0 6)} is VALID [2022-04-08 14:16:22,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {3353#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);~counter~0 := 0; {3609#(< ~counter~0 6)} is VALID [2022-04-08 14:16:22,299 INFO L272 TraceCheckUtils]: 0: Hoare triple {3353#true} call ULTIMATE.init(); {3353#true} is VALID [2022-04-08 14:16:22,299 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 14:16:22,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:16:22,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112982154] [2022-04-08 14:16:22,299 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:16:22,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932200188] [2022-04-08 14:16:22,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932200188] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:16:22,299 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:16:22,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-08 14:16:22,300 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:16:22,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1081338717] [2022-04-08 14:16:22,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1081338717] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:16:22,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:16:22,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 14:16:22,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385105524] [2022-04-08 14:16:22,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:16:22,300 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 44 [2022-04-08 14:16:22,301 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:16:22,301 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:16:22,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:22,330 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 14:16:22,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:22,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 14:16:22,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 14:16:22,330 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:16:22,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:22,501 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2022-04-08 14:16:22,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 14:16:22,501 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 44 [2022-04-08 14:16:22,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:16:22,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:16:22,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 58 transitions. [2022-04-08 14:16:22,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:16:22,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 58 transitions. [2022-04-08 14:16:22,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 58 transitions. [2022-04-08 14:16:22,543 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:22,544 INFO L225 Difference]: With dead ends: 58 [2022-04-08 14:16:22,544 INFO L226 Difference]: Without dead ends: 53 [2022-04-08 14:16:22,544 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=183, Unknown=0, NotChecked=0, Total=306 [2022-04-08 14:16:22,545 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:16:22,545 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 76 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:16:22,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-08 14:16:22,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-04-08 14:16:22,595 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:16:22,596 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 53 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:16:22,596 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 53 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:16:22,596 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 53 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:16:22,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:22,597 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2022-04-08 14:16:22,597 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2022-04-08 14:16:22,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:22,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:22,598 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 53 states. [2022-04-08 14:16:22,598 INFO L87 Difference]: Start difference. First operand has 53 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 53 states. [2022-04-08 14:16:22,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:22,599 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2022-04-08 14:16:22,599 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2022-04-08 14:16:22,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:22,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:22,599 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:16:22,599 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:16:22,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:16:22,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2022-04-08 14:16:22,600 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 44 [2022-04-08 14:16:22,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:16:22,600 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2022-04-08 14:16:22,600 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:16:22,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 54 transitions. [2022-04-08 14:16:22,657 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 14:16:22,657 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2022-04-08 14:16:22,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-08 14:16:22,658 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:16:22,658 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:16:22,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-08 14:16:22,858 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-08 14:16:22,858 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:16:22,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:16:22,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1037185971, now seen corresponding path program 7 times [2022-04-08 14:16:22,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:22,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [428194936] [2022-04-08 14:16:22,932 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:16:22,932 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:16:22,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1037185971, now seen corresponding path program 8 times [2022-04-08 14:16:22,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:16:22,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512012231] [2022-04-08 14:16:22,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:16:22,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:16:22,941 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:16:22,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1737387877] [2022-04-08 14:16:22,941 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:16:22,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:22,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:16:22,955 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:16:22,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-08 14:16:23,067 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:16:23,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:16:23,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 14:16:23,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:16:23,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:16:23,419 INFO L272 TraceCheckUtils]: 0: Hoare triple {3966#true} call ULTIMATE.init(); {3966#true} is VALID [2022-04-08 14:16:23,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {3966#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);~counter~0 := 0; {3966#true} is VALID [2022-04-08 14:16:23,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {3966#true} assume true; {3966#true} is VALID [2022-04-08 14:16:23,419 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3966#true} {3966#true} #57#return; {3966#true} is VALID [2022-04-08 14:16:23,419 INFO L272 TraceCheckUtils]: 4: Hoare triple {3966#true} call #t~ret6 := main(); {3966#true} is VALID [2022-04-08 14:16:23,420 INFO L290 TraceCheckUtils]: 5: Hoare triple {3966#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {3986#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:16:23,420 INFO L290 TraceCheckUtils]: 6: Hoare triple {3986#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3986#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:16:23,420 INFO L290 TraceCheckUtils]: 7: Hoare triple {3986#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {3986#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:16:23,421 INFO L272 TraceCheckUtils]: 8: Hoare triple {3986#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3966#true} is VALID [2022-04-08 14:16:23,421 INFO L290 TraceCheckUtils]: 9: Hoare triple {3966#true} ~cond := #in~cond; {3966#true} is VALID [2022-04-08 14:16:23,421 INFO L290 TraceCheckUtils]: 10: Hoare triple {3966#true} assume !(0 == ~cond); {3966#true} is VALID [2022-04-08 14:16:23,421 INFO L290 TraceCheckUtils]: 11: Hoare triple {3966#true} assume true; {3966#true} is VALID [2022-04-08 14:16:23,421 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3966#true} {3986#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {3986#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:16:23,422 INFO L290 TraceCheckUtils]: 13: Hoare triple {3986#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4011#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:16:23,422 INFO L290 TraceCheckUtils]: 14: Hoare triple {4011#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4011#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:16:23,423 INFO L290 TraceCheckUtils]: 15: Hoare triple {4011#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {4011#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:16:23,423 INFO L272 TraceCheckUtils]: 16: Hoare triple {4011#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3966#true} is VALID [2022-04-08 14:16:23,423 INFO L290 TraceCheckUtils]: 17: Hoare triple {3966#true} ~cond := #in~cond; {3966#true} is VALID [2022-04-08 14:16:23,423 INFO L290 TraceCheckUtils]: 18: Hoare triple {3966#true} assume !(0 == ~cond); {3966#true} is VALID [2022-04-08 14:16:23,423 INFO L290 TraceCheckUtils]: 19: Hoare triple {3966#true} assume true; {3966#true} is VALID [2022-04-08 14:16:23,423 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3966#true} {4011#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #51#return; {4011#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:16:23,424 INFO L290 TraceCheckUtils]: 21: Hoare triple {4011#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4036#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 14:16:23,424 INFO L290 TraceCheckUtils]: 22: Hoare triple {4036#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4036#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 14:16:23,424 INFO L290 TraceCheckUtils]: 23: Hoare triple {4036#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(#t~post5 < 10);havoc #t~post5; {4036#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 14:16:23,425 INFO L272 TraceCheckUtils]: 24: Hoare triple {4036#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3966#true} is VALID [2022-04-08 14:16:23,425 INFO L290 TraceCheckUtils]: 25: Hoare triple {3966#true} ~cond := #in~cond; {3966#true} is VALID [2022-04-08 14:16:23,425 INFO L290 TraceCheckUtils]: 26: Hoare triple {3966#true} assume !(0 == ~cond); {3966#true} is VALID [2022-04-08 14:16:23,425 INFO L290 TraceCheckUtils]: 27: Hoare triple {3966#true} assume true; {3966#true} is VALID [2022-04-08 14:16:23,425 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3966#true} {4036#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #51#return; {4036#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 14:16:23,426 INFO L290 TraceCheckUtils]: 29: Hoare triple {4036#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4061#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-08 14:16:23,426 INFO L290 TraceCheckUtils]: 30: Hoare triple {4061#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4061#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-08 14:16:23,426 INFO L290 TraceCheckUtils]: 31: Hoare triple {4061#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} assume !!(#t~post5 < 10);havoc #t~post5; {4061#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-08 14:16:23,427 INFO L272 TraceCheckUtils]: 32: Hoare triple {4061#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3966#true} is VALID [2022-04-08 14:16:23,427 INFO L290 TraceCheckUtils]: 33: Hoare triple {3966#true} ~cond := #in~cond; {3966#true} is VALID [2022-04-08 14:16:23,427 INFO L290 TraceCheckUtils]: 34: Hoare triple {3966#true} assume !(0 == ~cond); {3966#true} is VALID [2022-04-08 14:16:23,427 INFO L290 TraceCheckUtils]: 35: Hoare triple {3966#true} assume true; {3966#true} is VALID [2022-04-08 14:16:23,427 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3966#true} {4061#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} #51#return; {4061#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-08 14:16:23,428 INFO L290 TraceCheckUtils]: 37: Hoare triple {4061#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4086#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} is VALID [2022-04-08 14:16:23,428 INFO L290 TraceCheckUtils]: 38: Hoare triple {4086#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4086#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} is VALID [2022-04-08 14:16:23,428 INFO L290 TraceCheckUtils]: 39: Hoare triple {4086#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} assume !!(#t~post5 < 10);havoc #t~post5; {4086#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} is VALID [2022-04-08 14:16:23,428 INFO L272 TraceCheckUtils]: 40: Hoare triple {4086#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3966#true} is VALID [2022-04-08 14:16:23,429 INFO L290 TraceCheckUtils]: 41: Hoare triple {3966#true} ~cond := #in~cond; {3966#true} is VALID [2022-04-08 14:16:23,429 INFO L290 TraceCheckUtils]: 42: Hoare triple {3966#true} assume !(0 == ~cond); {3966#true} is VALID [2022-04-08 14:16:23,429 INFO L290 TraceCheckUtils]: 43: Hoare triple {3966#true} assume true; {3966#true} is VALID [2022-04-08 14:16:23,429 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {3966#true} {4086#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} #51#return; {4086#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} is VALID [2022-04-08 14:16:23,430 INFO L290 TraceCheckUtils]: 45: Hoare triple {4086#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {4111#(and (< 3 main_~k~0) (<= main_~k~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 14:16:23,430 INFO L272 TraceCheckUtils]: 46: Hoare triple {4111#(and (< 3 main_~k~0) (<= main_~k~0 4) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4115#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:16:23,431 INFO L290 TraceCheckUtils]: 47: Hoare triple {4115#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4119#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:16:23,431 INFO L290 TraceCheckUtils]: 48: Hoare triple {4119#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3967#false} is VALID [2022-04-08 14:16:23,431 INFO L290 TraceCheckUtils]: 49: Hoare triple {3967#false} assume !false; {3967#false} is VALID [2022-04-08 14:16:23,431 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-08 14:16:23,431 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:16:23,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:16:23,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512012231] [2022-04-08 14:16:23,686 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:16:23,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737387877] [2022-04-08 14:16:23,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737387877] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:16:23,686 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:16:23,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-08 14:16:23,686 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:16:23,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [428194936] [2022-04-08 14:16:23,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [428194936] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:16:23,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:16:23,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 14:16:23,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087008975] [2022-04-08 14:16:23,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:16:23,687 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 50 [2022-04-08 14:16:23,687 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:16:23,687 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:16:23,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:23,714 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 14:16:23,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:23,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 14:16:23,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-08 14:16:23,715 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:16:24,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:24,107 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-04-08 14:16:24,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 14:16:24,108 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 50 [2022-04-08 14:16:24,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:16:24,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:16:24,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 49 transitions. [2022-04-08 14:16:24,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:16:24,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 49 transitions. [2022-04-08 14:16:24,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 49 transitions. [2022-04-08 14:16:24,142 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:24,143 INFO L225 Difference]: With dead ends: 60 [2022-04-08 14:16:24,143 INFO L226 Difference]: Without dead ends: 55 [2022-04-08 14:16:24,144 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-04-08 14:16:24,144 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:16:24,144 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 208 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:16:24,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-08 14:16:24,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-08 14:16:24,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:16:24,201 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 39 states have internal predecessors, (41), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:16:24,201 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 39 states have internal predecessors, (41), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:16:24,201 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 39 states have internal predecessors, (41), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:16:24,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:24,203 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2022-04-08 14:16:24,203 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-04-08 14:16:24,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:24,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:24,203 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 39 states have internal predecessors, (41), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 55 states. [2022-04-08 14:16:24,203 INFO L87 Difference]: Start difference. First operand has 55 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 39 states have internal predecessors, (41), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 55 states. [2022-04-08 14:16:24,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:24,204 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2022-04-08 14:16:24,204 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-04-08 14:16:24,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:24,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:24,205 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:16:24,205 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:16:24,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 39 states have internal predecessors, (41), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:16:24,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2022-04-08 14:16:24,206 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 50 [2022-04-08 14:16:24,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:16:24,206 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2022-04-08 14:16:24,207 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:16:24,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 57 transitions. [2022-04-08 14:16:24,267 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 14:16:24,268 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-04-08 14:16:24,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-08 14:16:24,268 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:16:24,268 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:16:24,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-08 14:16:24,468 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-08 14:16:24,469 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:16:24,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:16:24,469 INFO L85 PathProgramCache]: Analyzing trace with hash 999934744, now seen corresponding path program 9 times [2022-04-08 14:16:24,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:24,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [426061544] [2022-04-08 14:16:24,572 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:16:24,572 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:16:24,573 INFO L85 PathProgramCache]: Analyzing trace with hash 999934744, now seen corresponding path program 10 times [2022-04-08 14:16:24,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:16:24,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113248239] [2022-04-08 14:16:24,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:16:24,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:16:24,594 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:16:24,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1589576464] [2022-04-08 14:16:24,594 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:16:24,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:24,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:16:24,596 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:16:24,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-08 14:16:24,719 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:16:24,719 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:16:24,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 14:16:24,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:16:24,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:16:25,030 INFO L272 TraceCheckUtils]: 0: Hoare triple {4514#true} call ULTIMATE.init(); {4514#true} is VALID [2022-04-08 14:16:25,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {4514#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);~counter~0 := 0; {4522#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:25,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {4522#(<= ~counter~0 0)} assume true; {4522#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:25,031 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4522#(<= ~counter~0 0)} {4514#true} #57#return; {4522#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:25,032 INFO L272 TraceCheckUtils]: 4: Hoare triple {4522#(<= ~counter~0 0)} call #t~ret6 := main(); {4522#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:25,032 INFO L290 TraceCheckUtils]: 5: Hoare triple {4522#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {4522#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:25,032 INFO L290 TraceCheckUtils]: 6: Hoare triple {4522#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4538#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:25,033 INFO L290 TraceCheckUtils]: 7: Hoare triple {4538#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {4538#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:25,033 INFO L272 TraceCheckUtils]: 8: Hoare triple {4538#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4538#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:25,034 INFO L290 TraceCheckUtils]: 9: Hoare triple {4538#(<= ~counter~0 1)} ~cond := #in~cond; {4538#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:25,034 INFO L290 TraceCheckUtils]: 10: Hoare triple {4538#(<= ~counter~0 1)} assume !(0 == ~cond); {4538#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:25,034 INFO L290 TraceCheckUtils]: 11: Hoare triple {4538#(<= ~counter~0 1)} assume true; {4538#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:25,035 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4538#(<= ~counter~0 1)} {4538#(<= ~counter~0 1)} #51#return; {4538#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:25,035 INFO L290 TraceCheckUtils]: 13: Hoare triple {4538#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4538#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:25,035 INFO L290 TraceCheckUtils]: 14: Hoare triple {4538#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4563#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:25,036 INFO L290 TraceCheckUtils]: 15: Hoare triple {4563#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {4563#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:25,036 INFO L272 TraceCheckUtils]: 16: Hoare triple {4563#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4563#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:25,036 INFO L290 TraceCheckUtils]: 17: Hoare triple {4563#(<= ~counter~0 2)} ~cond := #in~cond; {4563#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:25,037 INFO L290 TraceCheckUtils]: 18: Hoare triple {4563#(<= ~counter~0 2)} assume !(0 == ~cond); {4563#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:25,037 INFO L290 TraceCheckUtils]: 19: Hoare triple {4563#(<= ~counter~0 2)} assume true; {4563#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:25,038 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {4563#(<= ~counter~0 2)} {4563#(<= ~counter~0 2)} #51#return; {4563#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:25,038 INFO L290 TraceCheckUtils]: 21: Hoare triple {4563#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4563#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:25,038 INFO L290 TraceCheckUtils]: 22: Hoare triple {4563#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4588#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:25,039 INFO L290 TraceCheckUtils]: 23: Hoare triple {4588#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {4588#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:25,039 INFO L272 TraceCheckUtils]: 24: Hoare triple {4588#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4588#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:25,039 INFO L290 TraceCheckUtils]: 25: Hoare triple {4588#(<= ~counter~0 3)} ~cond := #in~cond; {4588#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:25,040 INFO L290 TraceCheckUtils]: 26: Hoare triple {4588#(<= ~counter~0 3)} assume !(0 == ~cond); {4588#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:25,040 INFO L290 TraceCheckUtils]: 27: Hoare triple {4588#(<= ~counter~0 3)} assume true; {4588#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:25,040 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4588#(<= ~counter~0 3)} {4588#(<= ~counter~0 3)} #51#return; {4588#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:25,041 INFO L290 TraceCheckUtils]: 29: Hoare triple {4588#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4588#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:25,041 INFO L290 TraceCheckUtils]: 30: Hoare triple {4588#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4613#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:25,041 INFO L290 TraceCheckUtils]: 31: Hoare triple {4613#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {4613#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:25,042 INFO L272 TraceCheckUtils]: 32: Hoare triple {4613#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4613#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:25,042 INFO L290 TraceCheckUtils]: 33: Hoare triple {4613#(<= ~counter~0 4)} ~cond := #in~cond; {4613#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:25,042 INFO L290 TraceCheckUtils]: 34: Hoare triple {4613#(<= ~counter~0 4)} assume !(0 == ~cond); {4613#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:25,043 INFO L290 TraceCheckUtils]: 35: Hoare triple {4613#(<= ~counter~0 4)} assume true; {4613#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:25,043 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4613#(<= ~counter~0 4)} {4613#(<= ~counter~0 4)} #51#return; {4613#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:25,044 INFO L290 TraceCheckUtils]: 37: Hoare triple {4613#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4613#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:25,044 INFO L290 TraceCheckUtils]: 38: Hoare triple {4613#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4638#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:25,044 INFO L290 TraceCheckUtils]: 39: Hoare triple {4638#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {4638#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:25,045 INFO L272 TraceCheckUtils]: 40: Hoare triple {4638#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4638#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:25,045 INFO L290 TraceCheckUtils]: 41: Hoare triple {4638#(<= ~counter~0 5)} ~cond := #in~cond; {4638#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:25,045 INFO L290 TraceCheckUtils]: 42: Hoare triple {4638#(<= ~counter~0 5)} assume !(0 == ~cond); {4638#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:25,046 INFO L290 TraceCheckUtils]: 43: Hoare triple {4638#(<= ~counter~0 5)} assume true; {4638#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:25,046 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {4638#(<= ~counter~0 5)} {4638#(<= ~counter~0 5)} #51#return; {4638#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:25,046 INFO L290 TraceCheckUtils]: 45: Hoare triple {4638#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4638#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:25,047 INFO L290 TraceCheckUtils]: 46: Hoare triple {4638#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4663#(<= |main_#t~post5| 5)} is VALID [2022-04-08 14:16:25,047 INFO L290 TraceCheckUtils]: 47: Hoare triple {4663#(<= |main_#t~post5| 5)} assume !(#t~post5 < 10);havoc #t~post5; {4515#false} is VALID [2022-04-08 14:16:25,047 INFO L272 TraceCheckUtils]: 48: Hoare triple {4515#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4515#false} is VALID [2022-04-08 14:16:25,047 INFO L290 TraceCheckUtils]: 49: Hoare triple {4515#false} ~cond := #in~cond; {4515#false} is VALID [2022-04-08 14:16:25,047 INFO L290 TraceCheckUtils]: 50: Hoare triple {4515#false} assume 0 == ~cond; {4515#false} is VALID [2022-04-08 14:16:25,047 INFO L290 TraceCheckUtils]: 51: Hoare triple {4515#false} assume !false; {4515#false} is VALID [2022-04-08 14:16:25,048 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 10 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:16:25,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:16:25,370 INFO L290 TraceCheckUtils]: 51: Hoare triple {4515#false} assume !false; {4515#false} is VALID [2022-04-08 14:16:25,370 INFO L290 TraceCheckUtils]: 50: Hoare triple {4515#false} assume 0 == ~cond; {4515#false} is VALID [2022-04-08 14:16:25,370 INFO L290 TraceCheckUtils]: 49: Hoare triple {4515#false} ~cond := #in~cond; {4515#false} is VALID [2022-04-08 14:16:25,370 INFO L272 TraceCheckUtils]: 48: Hoare triple {4515#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4515#false} is VALID [2022-04-08 14:16:25,371 INFO L290 TraceCheckUtils]: 47: Hoare triple {4691#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {4515#false} is VALID [2022-04-08 14:16:25,371 INFO L290 TraceCheckUtils]: 46: Hoare triple {4695#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4691#(< |main_#t~post5| 10)} is VALID [2022-04-08 14:16:25,371 INFO L290 TraceCheckUtils]: 45: Hoare triple {4695#(< ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4695#(< ~counter~0 10)} is VALID [2022-04-08 14:16:25,372 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {4514#true} {4695#(< ~counter~0 10)} #51#return; {4695#(< ~counter~0 10)} is VALID [2022-04-08 14:16:25,372 INFO L290 TraceCheckUtils]: 43: Hoare triple {4514#true} assume true; {4514#true} is VALID [2022-04-08 14:16:25,372 INFO L290 TraceCheckUtils]: 42: Hoare triple {4514#true} assume !(0 == ~cond); {4514#true} is VALID [2022-04-08 14:16:25,372 INFO L290 TraceCheckUtils]: 41: Hoare triple {4514#true} ~cond := #in~cond; {4514#true} is VALID [2022-04-08 14:16:25,372 INFO L272 TraceCheckUtils]: 40: Hoare triple {4695#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4514#true} is VALID [2022-04-08 14:16:25,373 INFO L290 TraceCheckUtils]: 39: Hoare triple {4695#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {4695#(< ~counter~0 10)} is VALID [2022-04-08 14:16:25,373 INFO L290 TraceCheckUtils]: 38: Hoare triple {4720#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4695#(< ~counter~0 10)} is VALID [2022-04-08 14:16:25,373 INFO L290 TraceCheckUtils]: 37: Hoare triple {4720#(< ~counter~0 9)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4720#(< ~counter~0 9)} is VALID [2022-04-08 14:16:25,374 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4514#true} {4720#(< ~counter~0 9)} #51#return; {4720#(< ~counter~0 9)} is VALID [2022-04-08 14:16:25,374 INFO L290 TraceCheckUtils]: 35: Hoare triple {4514#true} assume true; {4514#true} is VALID [2022-04-08 14:16:25,374 INFO L290 TraceCheckUtils]: 34: Hoare triple {4514#true} assume !(0 == ~cond); {4514#true} is VALID [2022-04-08 14:16:25,374 INFO L290 TraceCheckUtils]: 33: Hoare triple {4514#true} ~cond := #in~cond; {4514#true} is VALID [2022-04-08 14:16:25,374 INFO L272 TraceCheckUtils]: 32: Hoare triple {4720#(< ~counter~0 9)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4514#true} is VALID [2022-04-08 14:16:25,375 INFO L290 TraceCheckUtils]: 31: Hoare triple {4720#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {4720#(< ~counter~0 9)} is VALID [2022-04-08 14:16:25,375 INFO L290 TraceCheckUtils]: 30: Hoare triple {4745#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4720#(< ~counter~0 9)} is VALID [2022-04-08 14:16:25,375 INFO L290 TraceCheckUtils]: 29: Hoare triple {4745#(< ~counter~0 8)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4745#(< ~counter~0 8)} is VALID [2022-04-08 14:16:25,376 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4514#true} {4745#(< ~counter~0 8)} #51#return; {4745#(< ~counter~0 8)} is VALID [2022-04-08 14:16:25,376 INFO L290 TraceCheckUtils]: 27: Hoare triple {4514#true} assume true; {4514#true} is VALID [2022-04-08 14:16:25,376 INFO L290 TraceCheckUtils]: 26: Hoare triple {4514#true} assume !(0 == ~cond); {4514#true} is VALID [2022-04-08 14:16:25,376 INFO L290 TraceCheckUtils]: 25: Hoare triple {4514#true} ~cond := #in~cond; {4514#true} is VALID [2022-04-08 14:16:25,376 INFO L272 TraceCheckUtils]: 24: Hoare triple {4745#(< ~counter~0 8)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4514#true} is VALID [2022-04-08 14:16:25,376 INFO L290 TraceCheckUtils]: 23: Hoare triple {4745#(< ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {4745#(< ~counter~0 8)} is VALID [2022-04-08 14:16:25,377 INFO L290 TraceCheckUtils]: 22: Hoare triple {4770#(< ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4745#(< ~counter~0 8)} is VALID [2022-04-08 14:16:25,377 INFO L290 TraceCheckUtils]: 21: Hoare triple {4770#(< ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4770#(< ~counter~0 7)} is VALID [2022-04-08 14:16:25,378 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {4514#true} {4770#(< ~counter~0 7)} #51#return; {4770#(< ~counter~0 7)} is VALID [2022-04-08 14:16:25,378 INFO L290 TraceCheckUtils]: 19: Hoare triple {4514#true} assume true; {4514#true} is VALID [2022-04-08 14:16:25,378 INFO L290 TraceCheckUtils]: 18: Hoare triple {4514#true} assume !(0 == ~cond); {4514#true} is VALID [2022-04-08 14:16:25,378 INFO L290 TraceCheckUtils]: 17: Hoare triple {4514#true} ~cond := #in~cond; {4514#true} is VALID [2022-04-08 14:16:25,378 INFO L272 TraceCheckUtils]: 16: Hoare triple {4770#(< ~counter~0 7)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4514#true} is VALID [2022-04-08 14:16:25,378 INFO L290 TraceCheckUtils]: 15: Hoare triple {4770#(< ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {4770#(< ~counter~0 7)} is VALID [2022-04-08 14:16:25,379 INFO L290 TraceCheckUtils]: 14: Hoare triple {4638#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4770#(< ~counter~0 7)} is VALID [2022-04-08 14:16:25,379 INFO L290 TraceCheckUtils]: 13: Hoare triple {4638#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4638#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:25,379 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4514#true} {4638#(<= ~counter~0 5)} #51#return; {4638#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:25,380 INFO L290 TraceCheckUtils]: 11: Hoare triple {4514#true} assume true; {4514#true} is VALID [2022-04-08 14:16:25,380 INFO L290 TraceCheckUtils]: 10: Hoare triple {4514#true} assume !(0 == ~cond); {4514#true} is VALID [2022-04-08 14:16:25,380 INFO L290 TraceCheckUtils]: 9: Hoare triple {4514#true} ~cond := #in~cond; {4514#true} is VALID [2022-04-08 14:16:25,380 INFO L272 TraceCheckUtils]: 8: Hoare triple {4638#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4514#true} is VALID [2022-04-08 14:16:25,380 INFO L290 TraceCheckUtils]: 7: Hoare triple {4638#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {4638#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:25,381 INFO L290 TraceCheckUtils]: 6: Hoare triple {4613#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4638#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:25,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {4613#(<= ~counter~0 4)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {4613#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:25,381 INFO L272 TraceCheckUtils]: 4: Hoare triple {4613#(<= ~counter~0 4)} call #t~ret6 := main(); {4613#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:25,382 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4613#(<= ~counter~0 4)} {4514#true} #57#return; {4613#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:25,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {4613#(<= ~counter~0 4)} assume true; {4613#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:25,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {4514#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);~counter~0 := 0; {4613#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:25,382 INFO L272 TraceCheckUtils]: 0: Hoare triple {4514#true} call ULTIMATE.init(); {4514#true} is VALID [2022-04-08 14:16:25,383 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 10 proven. 50 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-08 14:16:25,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:16:25,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113248239] [2022-04-08 14:16:25,383 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:16:25,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589576464] [2022-04-08 14:16:25,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589576464] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:16:25,383 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:16:25,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-08 14:16:25,383 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:16:25,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [426061544] [2022-04-08 14:16:25,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [426061544] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:16:25,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:16:25,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 14:16:25,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524578966] [2022-04-08 14:16:25,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:16:25,384 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 52 [2022-04-08 14:16:25,384 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:16:25,384 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:16:25,422 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:25,422 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 14:16:25,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:25,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 14:16:25,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 14:16:25,422 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:16:25,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:25,610 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2022-04-08 14:16:25,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 14:16:25,610 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 52 [2022-04-08 14:16:25,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:16:25,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:16:25,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 66 transitions. [2022-04-08 14:16:25,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:16:25,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 66 transitions. [2022-04-08 14:16:25,613 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 66 transitions. [2022-04-08 14:16:25,656 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 14:16:25,657 INFO L225 Difference]: With dead ends: 66 [2022-04-08 14:16:25,657 INFO L226 Difference]: Without dead ends: 61 [2022-04-08 14:16:25,657 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=206, Unknown=0, NotChecked=0, Total=342 [2022-04-08 14:16:25,658 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:16:25,658 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 82 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:16:25,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-08 14:16:25,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-08 14:16:25,715 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:16:25,715 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 61 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 states have internal predecessors, (46), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:16:25,717 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 61 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 states have internal predecessors, (46), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:16:25,717 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 61 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 states have internal predecessors, (46), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:16:25,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:25,718 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2022-04-08 14:16:25,718 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2022-04-08 14:16:25,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:25,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:25,722 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 states have internal predecessors, (46), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 61 states. [2022-04-08 14:16:25,722 INFO L87 Difference]: Start difference. First operand has 61 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 states have internal predecessors, (46), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 61 states. [2022-04-08 14:16:25,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:25,723 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2022-04-08 14:16:25,723 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2022-04-08 14:16:25,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:25,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:25,723 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:16:25,723 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:16:25,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 states have internal predecessors, (46), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:16:25,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2022-04-08 14:16:25,725 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 52 [2022-04-08 14:16:25,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:16:25,725 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2022-04-08 14:16:25,725 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:16:25,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 62 transitions. [2022-04-08 14:16:25,805 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:25,805 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2022-04-08 14:16:25,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-08 14:16:25,805 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:16:25,806 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:16:25,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-08 14:16:26,009 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-08 14:16:26,010 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:16:26,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:16:26,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1795671114, now seen corresponding path program 9 times [2022-04-08 14:16:26,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:26,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2061166677] [2022-04-08 14:16:26,090 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:16:26,090 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:16:26,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1795671114, now seen corresponding path program 10 times [2022-04-08 14:16:26,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:16:26,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94421924] [2022-04-08 14:16:26,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:16:26,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:16:26,104 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:16:26,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [950774627] [2022-04-08 14:16:26,105 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:16:26,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:26,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:16:26,119 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:16:26,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-08 14:16:26,372 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:16:26,373 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:16:26,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-08 14:16:26,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:16:26,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:16:26,681 INFO L272 TraceCheckUtils]: 0: Hoare triple {5225#true} call ULTIMATE.init(); {5225#true} is VALID [2022-04-08 14:16:26,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {5225#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);~counter~0 := 0; {5225#true} is VALID [2022-04-08 14:16:26,682 INFO L290 TraceCheckUtils]: 2: Hoare triple {5225#true} assume true; {5225#true} is VALID [2022-04-08 14:16:26,682 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5225#true} {5225#true} #57#return; {5225#true} is VALID [2022-04-08 14:16:26,682 INFO L272 TraceCheckUtils]: 4: Hoare triple {5225#true} call #t~ret6 := main(); {5225#true} is VALID [2022-04-08 14:16:26,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {5225#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {5245#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:16:26,683 INFO L290 TraceCheckUtils]: 6: Hoare triple {5245#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5245#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:16:26,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {5245#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {5245#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:16:26,683 INFO L272 TraceCheckUtils]: 8: Hoare triple {5245#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5225#true} is VALID [2022-04-08 14:16:26,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {5225#true} ~cond := #in~cond; {5225#true} is VALID [2022-04-08 14:16:26,683 INFO L290 TraceCheckUtils]: 10: Hoare triple {5225#true} assume !(0 == ~cond); {5225#true} is VALID [2022-04-08 14:16:26,683 INFO L290 TraceCheckUtils]: 11: Hoare triple {5225#true} assume true; {5225#true} is VALID [2022-04-08 14:16:26,684 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5225#true} {5245#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {5245#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:16:26,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {5245#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5270#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:16:26,684 INFO L290 TraceCheckUtils]: 14: Hoare triple {5270#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5270#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:16:26,685 INFO L290 TraceCheckUtils]: 15: Hoare triple {5270#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 10);havoc #t~post5; {5270#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:16:26,685 INFO L272 TraceCheckUtils]: 16: Hoare triple {5270#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5225#true} is VALID [2022-04-08 14:16:26,685 INFO L290 TraceCheckUtils]: 17: Hoare triple {5225#true} ~cond := #in~cond; {5225#true} is VALID [2022-04-08 14:16:26,685 INFO L290 TraceCheckUtils]: 18: Hoare triple {5225#true} assume !(0 == ~cond); {5225#true} is VALID [2022-04-08 14:16:26,685 INFO L290 TraceCheckUtils]: 19: Hoare triple {5225#true} assume true; {5225#true} is VALID [2022-04-08 14:16:26,685 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {5225#true} {5270#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #51#return; {5270#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:16:26,686 INFO L290 TraceCheckUtils]: 21: Hoare triple {5270#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5295#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:16:26,686 INFO L290 TraceCheckUtils]: 22: Hoare triple {5295#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5295#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:16:26,686 INFO L290 TraceCheckUtils]: 23: Hoare triple {5295#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 10);havoc #t~post5; {5295#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:16:26,687 INFO L272 TraceCheckUtils]: 24: Hoare triple {5295#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5225#true} is VALID [2022-04-08 14:16:26,687 INFO L290 TraceCheckUtils]: 25: Hoare triple {5225#true} ~cond := #in~cond; {5225#true} is VALID [2022-04-08 14:16:26,687 INFO L290 TraceCheckUtils]: 26: Hoare triple {5225#true} assume !(0 == ~cond); {5225#true} is VALID [2022-04-08 14:16:26,687 INFO L290 TraceCheckUtils]: 27: Hoare triple {5225#true} assume true; {5225#true} is VALID [2022-04-08 14:16:26,687 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5225#true} {5295#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #51#return; {5295#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:16:26,688 INFO L290 TraceCheckUtils]: 29: Hoare triple {5295#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5320#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 14:16:26,688 INFO L290 TraceCheckUtils]: 30: Hoare triple {5320#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5320#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 14:16:26,688 INFO L290 TraceCheckUtils]: 31: Hoare triple {5320#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !!(#t~post5 < 10);havoc #t~post5; {5320#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 14:16:26,688 INFO L272 TraceCheckUtils]: 32: Hoare triple {5320#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5225#true} is VALID [2022-04-08 14:16:26,688 INFO L290 TraceCheckUtils]: 33: Hoare triple {5225#true} ~cond := #in~cond; {5225#true} is VALID [2022-04-08 14:16:26,688 INFO L290 TraceCheckUtils]: 34: Hoare triple {5225#true} assume !(0 == ~cond); {5225#true} is VALID [2022-04-08 14:16:26,689 INFO L290 TraceCheckUtils]: 35: Hoare triple {5225#true} assume true; {5225#true} is VALID [2022-04-08 14:16:26,689 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5225#true} {5320#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} #51#return; {5320#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 14:16:26,689 INFO L290 TraceCheckUtils]: 37: Hoare triple {5320#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5345#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-08 14:16:26,690 INFO L290 TraceCheckUtils]: 38: Hoare triple {5345#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5345#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-08 14:16:26,690 INFO L290 TraceCheckUtils]: 39: Hoare triple {5345#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} assume !!(#t~post5 < 10);havoc #t~post5; {5345#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-08 14:16:26,690 INFO L272 TraceCheckUtils]: 40: Hoare triple {5345#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5225#true} is VALID [2022-04-08 14:16:26,690 INFO L290 TraceCheckUtils]: 41: Hoare triple {5225#true} ~cond := #in~cond; {5225#true} is VALID [2022-04-08 14:16:26,690 INFO L290 TraceCheckUtils]: 42: Hoare triple {5225#true} assume !(0 == ~cond); {5225#true} is VALID [2022-04-08 14:16:26,690 INFO L290 TraceCheckUtils]: 43: Hoare triple {5225#true} assume true; {5225#true} is VALID [2022-04-08 14:16:26,691 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5225#true} {5345#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} #51#return; {5345#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-08 14:16:26,691 INFO L290 TraceCheckUtils]: 45: Hoare triple {5345#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5370#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-08 14:16:26,691 INFO L290 TraceCheckUtils]: 46: Hoare triple {5370#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5370#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-08 14:16:26,692 INFO L290 TraceCheckUtils]: 47: Hoare triple {5370#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} assume !!(#t~post5 < 10);havoc #t~post5; {5370#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-08 14:16:26,692 INFO L272 TraceCheckUtils]: 48: Hoare triple {5370#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5225#true} is VALID [2022-04-08 14:16:26,692 INFO L290 TraceCheckUtils]: 49: Hoare triple {5225#true} ~cond := #in~cond; {5225#true} is VALID [2022-04-08 14:16:26,692 INFO L290 TraceCheckUtils]: 50: Hoare triple {5225#true} assume !(0 == ~cond); {5225#true} is VALID [2022-04-08 14:16:26,692 INFO L290 TraceCheckUtils]: 51: Hoare triple {5225#true} assume true; {5225#true} is VALID [2022-04-08 14:16:26,692 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5225#true} {5370#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} #51#return; {5370#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-08 14:16:26,693 INFO L290 TraceCheckUtils]: 53: Hoare triple {5370#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {5395#(and (<= main_~k~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-08 14:16:26,693 INFO L272 TraceCheckUtils]: 54: Hoare triple {5395#(and (<= main_~k~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5399#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:16:26,694 INFO L290 TraceCheckUtils]: 55: Hoare triple {5399#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5403#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:16:26,694 INFO L290 TraceCheckUtils]: 56: Hoare triple {5403#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5226#false} is VALID [2022-04-08 14:16:26,694 INFO L290 TraceCheckUtils]: 57: Hoare triple {5226#false} assume !false; {5226#false} is VALID [2022-04-08 14:16:26,694 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 12 proven. 60 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-08 14:16:26,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:16:26,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:16:26,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94421924] [2022-04-08 14:16:26,878 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:16:26,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950774627] [2022-04-08 14:16:26,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950774627] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:16:26,878 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:16:26,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-08 14:16:26,879 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:16:26,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2061166677] [2022-04-08 14:16:26,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2061166677] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:16:26,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:16:26,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 14:16:26,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837264570] [2022-04-08 14:16:26,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:16:26,880 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 58 [2022-04-08 14:16:26,880 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:16:26,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:16:26,900 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:26,901 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 14:16:26,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:26,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 14:16:26,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-08 14:16:26,901 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:16:27,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:27,317 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2022-04-08 14:16:27,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 14:16:27,317 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 58 [2022-04-08 14:16:27,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:16:27,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:16:27,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 54 transitions. [2022-04-08 14:16:27,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:16:27,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 54 transitions. [2022-04-08 14:16:27,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 54 transitions. [2022-04-08 14:16:27,371 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 14:16:27,378 INFO L225 Difference]: With dead ends: 68 [2022-04-08 14:16:27,378 INFO L226 Difference]: Without dead ends: 63 [2022-04-08 14:16:27,379 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-08 14:16:27,380 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 2 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:16:27,380 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 252 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:16:27,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-08 14:16:27,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-04-08 14:16:27,430 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:16:27,441 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 63 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 45 states have internal predecessors, (47), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:16:27,441 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 63 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 45 states have internal predecessors, (47), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:16:27,442 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 63 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 45 states have internal predecessors, (47), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:16:27,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:27,453 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2022-04-08 14:16:27,453 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2022-04-08 14:16:27,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:27,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:27,453 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 45 states have internal predecessors, (47), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 63 states. [2022-04-08 14:16:27,454 INFO L87 Difference]: Start difference. First operand has 63 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 45 states have internal predecessors, (47), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 63 states. [2022-04-08 14:16:27,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:27,460 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2022-04-08 14:16:27,460 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2022-04-08 14:16:27,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:27,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:27,460 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:16:27,460 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:16:27,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 45 states have internal predecessors, (47), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:16:27,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2022-04-08 14:16:27,461 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 58 [2022-04-08 14:16:27,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:16:27,461 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2022-04-08 14:16:27,462 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:16:27,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 65 transitions. [2022-04-08 14:16:27,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:27,529 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2022-04-08 14:16:27,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-08 14:16:27,529 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:16:27,529 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:16:27,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-04-08 14:16:27,729 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-08 14:16:27,730 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:16:27,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:16:27,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1633541723, now seen corresponding path program 11 times [2022-04-08 14:16:27,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:27,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1658312777] [2022-04-08 14:16:27,806 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:16:27,806 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:16:27,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1633541723, now seen corresponding path program 12 times [2022-04-08 14:16:27,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:16:27,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998192130] [2022-04-08 14:16:27,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:16:27,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:16:27,815 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:16:27,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1717394139] [2022-04-08 14:16:27,815 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:16:27,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:27,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:16:27,816 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:16:27,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-08 14:16:27,984 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 14:16:27,984 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:16:27,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 14:16:27,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:16:28,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:16:28,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {5846#true} call ULTIMATE.init(); {5846#true} is VALID [2022-04-08 14:16:28,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {5846#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);~counter~0 := 0; {5854#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:28,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {5854#(<= ~counter~0 0)} assume true; {5854#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:28,383 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5854#(<= ~counter~0 0)} {5846#true} #57#return; {5854#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:28,383 INFO L272 TraceCheckUtils]: 4: Hoare triple {5854#(<= ~counter~0 0)} call #t~ret6 := main(); {5854#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:28,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {5854#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {5854#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:28,384 INFO L290 TraceCheckUtils]: 6: Hoare triple {5854#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5870#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:28,384 INFO L290 TraceCheckUtils]: 7: Hoare triple {5870#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {5870#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:28,385 INFO L272 TraceCheckUtils]: 8: Hoare triple {5870#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5870#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:28,385 INFO L290 TraceCheckUtils]: 9: Hoare triple {5870#(<= ~counter~0 1)} ~cond := #in~cond; {5870#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:28,386 INFO L290 TraceCheckUtils]: 10: Hoare triple {5870#(<= ~counter~0 1)} assume !(0 == ~cond); {5870#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:28,386 INFO L290 TraceCheckUtils]: 11: Hoare triple {5870#(<= ~counter~0 1)} assume true; {5870#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:28,387 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5870#(<= ~counter~0 1)} {5870#(<= ~counter~0 1)} #51#return; {5870#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:28,387 INFO L290 TraceCheckUtils]: 13: Hoare triple {5870#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5870#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:28,387 INFO L290 TraceCheckUtils]: 14: Hoare triple {5870#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5895#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:28,388 INFO L290 TraceCheckUtils]: 15: Hoare triple {5895#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {5895#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:28,388 INFO L272 TraceCheckUtils]: 16: Hoare triple {5895#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5895#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:28,389 INFO L290 TraceCheckUtils]: 17: Hoare triple {5895#(<= ~counter~0 2)} ~cond := #in~cond; {5895#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:28,389 INFO L290 TraceCheckUtils]: 18: Hoare triple {5895#(<= ~counter~0 2)} assume !(0 == ~cond); {5895#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:28,389 INFO L290 TraceCheckUtils]: 19: Hoare triple {5895#(<= ~counter~0 2)} assume true; {5895#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:28,390 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {5895#(<= ~counter~0 2)} {5895#(<= ~counter~0 2)} #51#return; {5895#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:28,390 INFO L290 TraceCheckUtils]: 21: Hoare triple {5895#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5895#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:28,391 INFO L290 TraceCheckUtils]: 22: Hoare triple {5895#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5920#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:28,391 INFO L290 TraceCheckUtils]: 23: Hoare triple {5920#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {5920#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:28,392 INFO L272 TraceCheckUtils]: 24: Hoare triple {5920#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5920#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:28,392 INFO L290 TraceCheckUtils]: 25: Hoare triple {5920#(<= ~counter~0 3)} ~cond := #in~cond; {5920#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:28,392 INFO L290 TraceCheckUtils]: 26: Hoare triple {5920#(<= ~counter~0 3)} assume !(0 == ~cond); {5920#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:28,392 INFO L290 TraceCheckUtils]: 27: Hoare triple {5920#(<= ~counter~0 3)} assume true; {5920#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:28,393 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5920#(<= ~counter~0 3)} {5920#(<= ~counter~0 3)} #51#return; {5920#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:28,393 INFO L290 TraceCheckUtils]: 29: Hoare triple {5920#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5920#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:28,394 INFO L290 TraceCheckUtils]: 30: Hoare triple {5920#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5945#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:28,394 INFO L290 TraceCheckUtils]: 31: Hoare triple {5945#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {5945#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:28,395 INFO L272 TraceCheckUtils]: 32: Hoare triple {5945#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5945#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:28,395 INFO L290 TraceCheckUtils]: 33: Hoare triple {5945#(<= ~counter~0 4)} ~cond := #in~cond; {5945#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:28,395 INFO L290 TraceCheckUtils]: 34: Hoare triple {5945#(<= ~counter~0 4)} assume !(0 == ~cond); {5945#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:28,395 INFO L290 TraceCheckUtils]: 35: Hoare triple {5945#(<= ~counter~0 4)} assume true; {5945#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:28,398 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5945#(<= ~counter~0 4)} {5945#(<= ~counter~0 4)} #51#return; {5945#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:28,399 INFO L290 TraceCheckUtils]: 37: Hoare triple {5945#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5945#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:28,399 INFO L290 TraceCheckUtils]: 38: Hoare triple {5945#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5970#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:28,399 INFO L290 TraceCheckUtils]: 39: Hoare triple {5970#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {5970#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:28,400 INFO L272 TraceCheckUtils]: 40: Hoare triple {5970#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5970#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:28,400 INFO L290 TraceCheckUtils]: 41: Hoare triple {5970#(<= ~counter~0 5)} ~cond := #in~cond; {5970#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:28,400 INFO L290 TraceCheckUtils]: 42: Hoare triple {5970#(<= ~counter~0 5)} assume !(0 == ~cond); {5970#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:28,401 INFO L290 TraceCheckUtils]: 43: Hoare triple {5970#(<= ~counter~0 5)} assume true; {5970#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:28,401 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5970#(<= ~counter~0 5)} {5970#(<= ~counter~0 5)} #51#return; {5970#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:28,402 INFO L290 TraceCheckUtils]: 45: Hoare triple {5970#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5970#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:28,402 INFO L290 TraceCheckUtils]: 46: Hoare triple {5970#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5995#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:28,402 INFO L290 TraceCheckUtils]: 47: Hoare triple {5995#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {5995#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:28,403 INFO L272 TraceCheckUtils]: 48: Hoare triple {5995#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5995#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:28,403 INFO L290 TraceCheckUtils]: 49: Hoare triple {5995#(<= ~counter~0 6)} ~cond := #in~cond; {5995#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:28,403 INFO L290 TraceCheckUtils]: 50: Hoare triple {5995#(<= ~counter~0 6)} assume !(0 == ~cond); {5995#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:28,404 INFO L290 TraceCheckUtils]: 51: Hoare triple {5995#(<= ~counter~0 6)} assume true; {5995#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:28,404 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5995#(<= ~counter~0 6)} {5995#(<= ~counter~0 6)} #51#return; {5995#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:28,405 INFO L290 TraceCheckUtils]: 53: Hoare triple {5995#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5995#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:28,405 INFO L290 TraceCheckUtils]: 54: Hoare triple {5995#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6020#(<= |main_#t~post5| 6)} is VALID [2022-04-08 14:16:28,405 INFO L290 TraceCheckUtils]: 55: Hoare triple {6020#(<= |main_#t~post5| 6)} assume !(#t~post5 < 10);havoc #t~post5; {5847#false} is VALID [2022-04-08 14:16:28,405 INFO L272 TraceCheckUtils]: 56: Hoare triple {5847#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5847#false} is VALID [2022-04-08 14:16:28,405 INFO L290 TraceCheckUtils]: 57: Hoare triple {5847#false} ~cond := #in~cond; {5847#false} is VALID [2022-04-08 14:16:28,406 INFO L290 TraceCheckUtils]: 58: Hoare triple {5847#false} assume 0 == ~cond; {5847#false} is VALID [2022-04-08 14:16:28,406 INFO L290 TraceCheckUtils]: 59: Hoare triple {5847#false} assume !false; {5847#false} is VALID [2022-04-08 14:16:28,406 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 12 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:16:28,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:16:28,766 INFO L290 TraceCheckUtils]: 59: Hoare triple {5847#false} assume !false; {5847#false} is VALID [2022-04-08 14:16:28,766 INFO L290 TraceCheckUtils]: 58: Hoare triple {5847#false} assume 0 == ~cond; {5847#false} is VALID [2022-04-08 14:16:28,766 INFO L290 TraceCheckUtils]: 57: Hoare triple {5847#false} ~cond := #in~cond; {5847#false} is VALID [2022-04-08 14:16:28,766 INFO L272 TraceCheckUtils]: 56: Hoare triple {5847#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5847#false} is VALID [2022-04-08 14:16:28,766 INFO L290 TraceCheckUtils]: 55: Hoare triple {6048#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {5847#false} is VALID [2022-04-08 14:16:28,767 INFO L290 TraceCheckUtils]: 54: Hoare triple {6052#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6048#(< |main_#t~post5| 10)} is VALID [2022-04-08 14:16:28,767 INFO L290 TraceCheckUtils]: 53: Hoare triple {6052#(< ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6052#(< ~counter~0 10)} is VALID [2022-04-08 14:16:28,768 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5846#true} {6052#(< ~counter~0 10)} #51#return; {6052#(< ~counter~0 10)} is VALID [2022-04-08 14:16:28,768 INFO L290 TraceCheckUtils]: 51: Hoare triple {5846#true} assume true; {5846#true} is VALID [2022-04-08 14:16:28,768 INFO L290 TraceCheckUtils]: 50: Hoare triple {5846#true} assume !(0 == ~cond); {5846#true} is VALID [2022-04-08 14:16:28,768 INFO L290 TraceCheckUtils]: 49: Hoare triple {5846#true} ~cond := #in~cond; {5846#true} is VALID [2022-04-08 14:16:28,768 INFO L272 TraceCheckUtils]: 48: Hoare triple {6052#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5846#true} is VALID [2022-04-08 14:16:28,768 INFO L290 TraceCheckUtils]: 47: Hoare triple {6052#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {6052#(< ~counter~0 10)} is VALID [2022-04-08 14:16:28,769 INFO L290 TraceCheckUtils]: 46: Hoare triple {6077#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6052#(< ~counter~0 10)} is VALID [2022-04-08 14:16:28,769 INFO L290 TraceCheckUtils]: 45: Hoare triple {6077#(< ~counter~0 9)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6077#(< ~counter~0 9)} is VALID [2022-04-08 14:16:28,770 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5846#true} {6077#(< ~counter~0 9)} #51#return; {6077#(< ~counter~0 9)} is VALID [2022-04-08 14:16:28,770 INFO L290 TraceCheckUtils]: 43: Hoare triple {5846#true} assume true; {5846#true} is VALID [2022-04-08 14:16:28,770 INFO L290 TraceCheckUtils]: 42: Hoare triple {5846#true} assume !(0 == ~cond); {5846#true} is VALID [2022-04-08 14:16:28,770 INFO L290 TraceCheckUtils]: 41: Hoare triple {5846#true} ~cond := #in~cond; {5846#true} is VALID [2022-04-08 14:16:28,770 INFO L272 TraceCheckUtils]: 40: Hoare triple {6077#(< ~counter~0 9)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5846#true} is VALID [2022-04-08 14:16:28,770 INFO L290 TraceCheckUtils]: 39: Hoare triple {6077#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {6077#(< ~counter~0 9)} is VALID [2022-04-08 14:16:28,771 INFO L290 TraceCheckUtils]: 38: Hoare triple {6102#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6077#(< ~counter~0 9)} is VALID [2022-04-08 14:16:28,771 INFO L290 TraceCheckUtils]: 37: Hoare triple {6102#(< ~counter~0 8)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6102#(< ~counter~0 8)} is VALID [2022-04-08 14:16:28,771 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5846#true} {6102#(< ~counter~0 8)} #51#return; {6102#(< ~counter~0 8)} is VALID [2022-04-08 14:16:28,772 INFO L290 TraceCheckUtils]: 35: Hoare triple {5846#true} assume true; {5846#true} is VALID [2022-04-08 14:16:28,772 INFO L290 TraceCheckUtils]: 34: Hoare triple {5846#true} assume !(0 == ~cond); {5846#true} is VALID [2022-04-08 14:16:28,772 INFO L290 TraceCheckUtils]: 33: Hoare triple {5846#true} ~cond := #in~cond; {5846#true} is VALID [2022-04-08 14:16:28,772 INFO L272 TraceCheckUtils]: 32: Hoare triple {6102#(< ~counter~0 8)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5846#true} is VALID [2022-04-08 14:16:28,772 INFO L290 TraceCheckUtils]: 31: Hoare triple {6102#(< ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {6102#(< ~counter~0 8)} is VALID [2022-04-08 14:16:28,773 INFO L290 TraceCheckUtils]: 30: Hoare triple {5995#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6102#(< ~counter~0 8)} is VALID [2022-04-08 14:16:28,773 INFO L290 TraceCheckUtils]: 29: Hoare triple {5995#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5995#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:28,773 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5846#true} {5995#(<= ~counter~0 6)} #51#return; {5995#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:28,773 INFO L290 TraceCheckUtils]: 27: Hoare triple {5846#true} assume true; {5846#true} is VALID [2022-04-08 14:16:28,773 INFO L290 TraceCheckUtils]: 26: Hoare triple {5846#true} assume !(0 == ~cond); {5846#true} is VALID [2022-04-08 14:16:28,774 INFO L290 TraceCheckUtils]: 25: Hoare triple {5846#true} ~cond := #in~cond; {5846#true} is VALID [2022-04-08 14:16:28,774 INFO L272 TraceCheckUtils]: 24: Hoare triple {5995#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5846#true} is VALID [2022-04-08 14:16:28,774 INFO L290 TraceCheckUtils]: 23: Hoare triple {5995#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {5995#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:28,774 INFO L290 TraceCheckUtils]: 22: Hoare triple {5970#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5995#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:28,775 INFO L290 TraceCheckUtils]: 21: Hoare triple {5970#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5970#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:28,775 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {5846#true} {5970#(<= ~counter~0 5)} #51#return; {5970#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:28,775 INFO L290 TraceCheckUtils]: 19: Hoare triple {5846#true} assume true; {5846#true} is VALID [2022-04-08 14:16:28,775 INFO L290 TraceCheckUtils]: 18: Hoare triple {5846#true} assume !(0 == ~cond); {5846#true} is VALID [2022-04-08 14:16:28,775 INFO L290 TraceCheckUtils]: 17: Hoare triple {5846#true} ~cond := #in~cond; {5846#true} is VALID [2022-04-08 14:16:28,775 INFO L272 TraceCheckUtils]: 16: Hoare triple {5970#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5846#true} is VALID [2022-04-08 14:16:28,776 INFO L290 TraceCheckUtils]: 15: Hoare triple {5970#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {5970#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:28,776 INFO L290 TraceCheckUtils]: 14: Hoare triple {5945#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5970#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:28,777 INFO L290 TraceCheckUtils]: 13: Hoare triple {5945#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5945#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:28,777 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5846#true} {5945#(<= ~counter~0 4)} #51#return; {5945#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:28,777 INFO L290 TraceCheckUtils]: 11: Hoare triple {5846#true} assume true; {5846#true} is VALID [2022-04-08 14:16:28,777 INFO L290 TraceCheckUtils]: 10: Hoare triple {5846#true} assume !(0 == ~cond); {5846#true} is VALID [2022-04-08 14:16:28,777 INFO L290 TraceCheckUtils]: 9: Hoare triple {5846#true} ~cond := #in~cond; {5846#true} is VALID [2022-04-08 14:16:28,777 INFO L272 TraceCheckUtils]: 8: Hoare triple {5945#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5846#true} is VALID [2022-04-08 14:16:28,778 INFO L290 TraceCheckUtils]: 7: Hoare triple {5945#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {5945#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:28,778 INFO L290 TraceCheckUtils]: 6: Hoare triple {5920#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5945#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:28,778 INFO L290 TraceCheckUtils]: 5: Hoare triple {5920#(<= ~counter~0 3)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {5920#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:28,779 INFO L272 TraceCheckUtils]: 4: Hoare triple {5920#(<= ~counter~0 3)} call #t~ret6 := main(); {5920#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:28,779 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5920#(<= ~counter~0 3)} {5846#true} #57#return; {5920#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:28,779 INFO L290 TraceCheckUtils]: 2: Hoare triple {5920#(<= ~counter~0 3)} assume true; {5920#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:28,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {5846#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);~counter~0 := 0; {5920#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:28,780 INFO L272 TraceCheckUtils]: 0: Hoare triple {5846#true} call ULTIMATE.init(); {5846#true} is VALID [2022-04-08 14:16:28,780 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 12 proven. 72 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-08 14:16:28,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:16:28,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998192130] [2022-04-08 14:16:28,780 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:16:28,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717394139] [2022-04-08 14:16:28,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717394139] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:16:28,781 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:16:28,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-04-08 14:16:28,781 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:16:28,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1658312777] [2022-04-08 14:16:28,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1658312777] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:16:28,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:16:28,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 14:16:28,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975275112] [2022-04-08 14:16:28,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:16:28,782 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 60 [2022-04-08 14:16:28,782 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:16:28,782 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:16:28,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:28,827 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 14:16:28,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:28,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 14:16:28,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 14:16:28,828 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:16:29,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:29,042 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2022-04-08 14:16:29,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 14:16:29,043 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 60 [2022-04-08 14:16:29,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:16:29,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:16:29,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 74 transitions. [2022-04-08 14:16:29,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:16:29,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 74 transitions. [2022-04-08 14:16:29,045 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 74 transitions. [2022-04-08 14:16:29,086 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:29,087 INFO L225 Difference]: With dead ends: 74 [2022-04-08 14:16:29,087 INFO L226 Difference]: Without dead ends: 69 [2022-04-08 14:16:29,088 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=149, Invalid=231, Unknown=0, NotChecked=0, Total=380 [2022-04-08 14:16:29,089 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 4 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:16:29,090 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 102 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:16:29,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-08 14:16:29,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-04-08 14:16:29,191 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:16:29,191 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 69 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 10 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:16:29,191 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 69 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 10 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:16:29,191 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 69 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 10 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:16:29,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:29,192 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2022-04-08 14:16:29,192 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2022-04-08 14:16:29,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:29,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:29,192 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 10 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 69 states. [2022-04-08 14:16:29,193 INFO L87 Difference]: Start difference. First operand has 69 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 10 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 69 states. [2022-04-08 14:16:29,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:29,193 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2022-04-08 14:16:29,194 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2022-04-08 14:16:29,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:29,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:29,194 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:16:29,194 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:16:29,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 10 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:16:29,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2022-04-08 14:16:29,195 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 60 [2022-04-08 14:16:29,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:16:29,195 INFO L478 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2022-04-08 14:16:29,195 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:16:29,195 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 70 transitions. [2022-04-08 14:16:29,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:29,264 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2022-04-08 14:16:29,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-08 14:16:29,268 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:16:29,268 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:16:29,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-04-08 14:16:29,473 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:29,473 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:16:29,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:16:29,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1180930233, now seen corresponding path program 11 times [2022-04-08 14:16:29,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:29,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1414640405] [2022-04-08 14:16:29,547 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:16:29,548 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:16:29,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1180930233, now seen corresponding path program 12 times [2022-04-08 14:16:29,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:16:29,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686381470] [2022-04-08 14:16:29,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:16:29,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:16:29,556 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:16:29,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [233892570] [2022-04-08 14:16:29,556 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:16:29,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:29,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:16:29,557 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:16:29,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-08 14:16:29,879 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 14:16:29,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:16:29,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-08 14:16:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:16:29,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:16:30,328 INFO L272 TraceCheckUtils]: 0: Hoare triple {6655#true} call ULTIMATE.init(); {6655#true} is VALID [2022-04-08 14:16:30,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {6655#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);~counter~0 := 0; {6655#true} is VALID [2022-04-08 14:16:30,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {6655#true} assume true; {6655#true} is VALID [2022-04-08 14:16:30,329 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6655#true} {6655#true} #57#return; {6655#true} is VALID [2022-04-08 14:16:30,329 INFO L272 TraceCheckUtils]: 4: Hoare triple {6655#true} call #t~ret6 := main(); {6655#true} is VALID [2022-04-08 14:16:30,329 INFO L290 TraceCheckUtils]: 5: Hoare triple {6655#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {6675#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:16:30,330 INFO L290 TraceCheckUtils]: 6: Hoare triple {6675#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6675#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:16:30,330 INFO L290 TraceCheckUtils]: 7: Hoare triple {6675#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {6675#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:16:30,330 INFO L272 TraceCheckUtils]: 8: Hoare triple {6675#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6655#true} is VALID [2022-04-08 14:16:30,330 INFO L290 TraceCheckUtils]: 9: Hoare triple {6655#true} ~cond := #in~cond; {6655#true} is VALID [2022-04-08 14:16:30,330 INFO L290 TraceCheckUtils]: 10: Hoare triple {6655#true} assume !(0 == ~cond); {6655#true} is VALID [2022-04-08 14:16:30,330 INFO L290 TraceCheckUtils]: 11: Hoare triple {6655#true} assume true; {6655#true} is VALID [2022-04-08 14:16:30,331 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6655#true} {6675#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {6675#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:16:30,332 INFO L290 TraceCheckUtils]: 13: Hoare triple {6675#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6700#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:16:30,332 INFO L290 TraceCheckUtils]: 14: Hoare triple {6700#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6700#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:16:30,332 INFO L290 TraceCheckUtils]: 15: Hoare triple {6700#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {6700#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:16:30,332 INFO L272 TraceCheckUtils]: 16: Hoare triple {6700#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6655#true} is VALID [2022-04-08 14:16:30,333 INFO L290 TraceCheckUtils]: 17: Hoare triple {6655#true} ~cond := #in~cond; {6655#true} is VALID [2022-04-08 14:16:30,333 INFO L290 TraceCheckUtils]: 18: Hoare triple {6655#true} assume !(0 == ~cond); {6655#true} is VALID [2022-04-08 14:16:30,333 INFO L290 TraceCheckUtils]: 19: Hoare triple {6655#true} assume true; {6655#true} is VALID [2022-04-08 14:16:30,333 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {6655#true} {6700#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #51#return; {6700#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:16:30,334 INFO L290 TraceCheckUtils]: 21: Hoare triple {6700#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6725#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 14:16:30,355 INFO L290 TraceCheckUtils]: 22: Hoare triple {6725#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6725#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 14:16:30,355 INFO L290 TraceCheckUtils]: 23: Hoare triple {6725#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(#t~post5 < 10);havoc #t~post5; {6725#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 14:16:30,355 INFO L272 TraceCheckUtils]: 24: Hoare triple {6725#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6655#true} is VALID [2022-04-08 14:16:30,356 INFO L290 TraceCheckUtils]: 25: Hoare triple {6655#true} ~cond := #in~cond; {6655#true} is VALID [2022-04-08 14:16:30,356 INFO L290 TraceCheckUtils]: 26: Hoare triple {6655#true} assume !(0 == ~cond); {6655#true} is VALID [2022-04-08 14:16:30,356 INFO L290 TraceCheckUtils]: 27: Hoare triple {6655#true} assume true; {6655#true} is VALID [2022-04-08 14:16:30,356 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6655#true} {6725#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #51#return; {6725#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 14:16:30,357 INFO L290 TraceCheckUtils]: 29: Hoare triple {6725#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6750#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 14:16:30,357 INFO L290 TraceCheckUtils]: 30: Hoare triple {6750#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6750#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 14:16:30,357 INFO L290 TraceCheckUtils]: 31: Hoare triple {6750#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(#t~post5 < 10);havoc #t~post5; {6750#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 14:16:30,357 INFO L272 TraceCheckUtils]: 32: Hoare triple {6750#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6655#true} is VALID [2022-04-08 14:16:30,357 INFO L290 TraceCheckUtils]: 33: Hoare triple {6655#true} ~cond := #in~cond; {6655#true} is VALID [2022-04-08 14:16:30,358 INFO L290 TraceCheckUtils]: 34: Hoare triple {6655#true} assume !(0 == ~cond); {6655#true} is VALID [2022-04-08 14:16:30,358 INFO L290 TraceCheckUtils]: 35: Hoare triple {6655#true} assume true; {6655#true} is VALID [2022-04-08 14:16:30,358 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6655#true} {6750#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #51#return; {6750#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 14:16:30,359 INFO L290 TraceCheckUtils]: 37: Hoare triple {6750#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6775#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 14:16:30,359 INFO L290 TraceCheckUtils]: 38: Hoare triple {6775#(and (= main_~y~0 4) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6775#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 14:16:30,359 INFO L290 TraceCheckUtils]: 39: Hoare triple {6775#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(#t~post5 < 10);havoc #t~post5; {6775#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 14:16:30,359 INFO L272 TraceCheckUtils]: 40: Hoare triple {6775#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6655#true} is VALID [2022-04-08 14:16:30,359 INFO L290 TraceCheckUtils]: 41: Hoare triple {6655#true} ~cond := #in~cond; {6655#true} is VALID [2022-04-08 14:16:30,359 INFO L290 TraceCheckUtils]: 42: Hoare triple {6655#true} assume !(0 == ~cond); {6655#true} is VALID [2022-04-08 14:16:30,360 INFO L290 TraceCheckUtils]: 43: Hoare triple {6655#true} assume true; {6655#true} is VALID [2022-04-08 14:16:30,360 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {6655#true} {6775#(and (= main_~y~0 4) (= main_~c~0 4))} #51#return; {6775#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 14:16:30,360 INFO L290 TraceCheckUtils]: 45: Hoare triple {6775#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6800#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 14:16:30,361 INFO L290 TraceCheckUtils]: 46: Hoare triple {6800#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6800#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 14:16:30,361 INFO L290 TraceCheckUtils]: 47: Hoare triple {6800#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} assume !!(#t~post5 < 10);havoc #t~post5; {6800#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 14:16:30,361 INFO L272 TraceCheckUtils]: 48: Hoare triple {6800#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6655#true} is VALID [2022-04-08 14:16:30,361 INFO L290 TraceCheckUtils]: 49: Hoare triple {6655#true} ~cond := #in~cond; {6655#true} is VALID [2022-04-08 14:16:30,361 INFO L290 TraceCheckUtils]: 50: Hoare triple {6655#true} assume !(0 == ~cond); {6655#true} is VALID [2022-04-08 14:16:30,361 INFO L290 TraceCheckUtils]: 51: Hoare triple {6655#true} assume true; {6655#true} is VALID [2022-04-08 14:16:30,362 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6655#true} {6800#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} #51#return; {6800#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 14:16:30,362 INFO L290 TraceCheckUtils]: 53: Hoare triple {6800#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6825#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 14:16:30,363 INFO L290 TraceCheckUtils]: 54: Hoare triple {6825#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6825#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 14:16:30,363 INFO L290 TraceCheckUtils]: 55: Hoare triple {6825#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !!(#t~post5 < 10);havoc #t~post5; {6825#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 14:16:30,363 INFO L272 TraceCheckUtils]: 56: Hoare triple {6825#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6655#true} is VALID [2022-04-08 14:16:30,363 INFO L290 TraceCheckUtils]: 57: Hoare triple {6655#true} ~cond := #in~cond; {6655#true} is VALID [2022-04-08 14:16:30,363 INFO L290 TraceCheckUtils]: 58: Hoare triple {6655#true} assume !(0 == ~cond); {6655#true} is VALID [2022-04-08 14:16:30,363 INFO L290 TraceCheckUtils]: 59: Hoare triple {6655#true} assume true; {6655#true} is VALID [2022-04-08 14:16:30,364 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {6655#true} {6825#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #51#return; {6825#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 14:16:30,364 INFO L290 TraceCheckUtils]: 61: Hoare triple {6825#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !(~c~0 < ~k~0); {6850#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-08 14:16:30,365 INFO L272 TraceCheckUtils]: 62: Hoare triple {6850#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6854#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:16:30,365 INFO L290 TraceCheckUtils]: 63: Hoare triple {6854#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6858#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:16:30,366 INFO L290 TraceCheckUtils]: 64: Hoare triple {6858#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6656#false} is VALID [2022-04-08 14:16:30,366 INFO L290 TraceCheckUtils]: 65: Hoare triple {6656#false} assume !false; {6656#false} is VALID [2022-04-08 14:16:30,366 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 14 proven. 84 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-08 14:16:30,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:16:30,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:16:30,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686381470] [2022-04-08 14:16:30,605 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:16:30,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233892570] [2022-04-08 14:16:30,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233892570] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:16:30,605 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:16:30,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-08 14:16:30,605 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:16:30,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1414640405] [2022-04-08 14:16:30,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1414640405] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:16:30,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:16:30,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 14:16:30,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528569580] [2022-04-08 14:16:30,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:16:30,606 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 66 [2022-04-08 14:16:30,606 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:16:30,606 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:16:30,639 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 14:16:30,639 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 14:16:30,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:30,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 14:16:30,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-08 14:16:30,640 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:16:31,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:31,215 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2022-04-08 14:16:31,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 14:16:31,216 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 66 [2022-04-08 14:16:31,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:16:31,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:16:31,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 59 transitions. [2022-04-08 14:16:31,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:16:31,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 59 transitions. [2022-04-08 14:16:31,218 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 59 transitions. [2022-04-08 14:16:31,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:31,261 INFO L225 Difference]: With dead ends: 76 [2022-04-08 14:16:31,261 INFO L226 Difference]: Without dead ends: 71 [2022-04-08 14:16:31,262 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-04-08 14:16:31,262 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 2 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 14:16:31,262 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 300 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 14:16:31,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-08 14:16:31,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-04-08 14:16:31,321 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:16:31,321 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 71 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 51 states have internal predecessors, (53), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:16:31,321 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 71 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 51 states have internal predecessors, (53), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:16:31,321 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 71 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 51 states have internal predecessors, (53), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:16:31,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:31,324 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2022-04-08 14:16:31,324 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2022-04-08 14:16:31,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:31,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:31,335 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 51 states have internal predecessors, (53), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 71 states. [2022-04-08 14:16:31,335 INFO L87 Difference]: Start difference. First operand has 71 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 51 states have internal predecessors, (53), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 71 states. [2022-04-08 14:16:31,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:31,342 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2022-04-08 14:16:31,342 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2022-04-08 14:16:31,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:31,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:31,342 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:16:31,342 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:16:31,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 51 states have internal predecessors, (53), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:16:31,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2022-04-08 14:16:31,352 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 66 [2022-04-08 14:16:31,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:16:31,352 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2022-04-08 14:16:31,352 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:16:31,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 73 transitions. [2022-04-08 14:16:31,436 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:31,437 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2022-04-08 14:16:31,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-08 14:16:31,437 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:16:31,437 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:16:31,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-08 14:16:31,642 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-08 14:16:31,642 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:16:31,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:16:31,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1699217054, now seen corresponding path program 13 times [2022-04-08 14:16:31,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:31,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [558498580] [2022-04-08 14:16:31,711 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:16:31,712 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:16:31,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1699217054, now seen corresponding path program 14 times [2022-04-08 14:16:31,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:16:31,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356582097] [2022-04-08 14:16:31,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:16:31,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:16:31,722 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:16:31,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1259018584] [2022-04-08 14:16:31,723 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:16:31,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:31,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:16:31,723 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:16:31,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-08 14:16:31,766 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:16:31,766 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:16:31,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 14:16:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:16:31,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:16:32,002 INFO L272 TraceCheckUtils]: 0: Hoare triple {7349#true} call ULTIMATE.init(); {7349#true} is VALID [2022-04-08 14:16:32,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {7349#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);~counter~0 := 0; {7357#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:32,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {7357#(<= ~counter~0 0)} assume true; {7357#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:32,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7357#(<= ~counter~0 0)} {7349#true} #57#return; {7357#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:32,003 INFO L272 TraceCheckUtils]: 4: Hoare triple {7357#(<= ~counter~0 0)} call #t~ret6 := main(); {7357#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:32,003 INFO L290 TraceCheckUtils]: 5: Hoare triple {7357#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {7357#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:32,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {7357#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7373#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:32,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {7373#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {7373#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:32,004 INFO L272 TraceCheckUtils]: 8: Hoare triple {7373#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7373#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:32,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {7373#(<= ~counter~0 1)} ~cond := #in~cond; {7373#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:32,005 INFO L290 TraceCheckUtils]: 10: Hoare triple {7373#(<= ~counter~0 1)} assume !(0 == ~cond); {7373#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:32,005 INFO L290 TraceCheckUtils]: 11: Hoare triple {7373#(<= ~counter~0 1)} assume true; {7373#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:32,005 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7373#(<= ~counter~0 1)} {7373#(<= ~counter~0 1)} #51#return; {7373#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:32,005 INFO L290 TraceCheckUtils]: 13: Hoare triple {7373#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7373#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:32,006 INFO L290 TraceCheckUtils]: 14: Hoare triple {7373#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7398#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:32,006 INFO L290 TraceCheckUtils]: 15: Hoare triple {7398#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {7398#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:32,006 INFO L272 TraceCheckUtils]: 16: Hoare triple {7398#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7398#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:32,006 INFO L290 TraceCheckUtils]: 17: Hoare triple {7398#(<= ~counter~0 2)} ~cond := #in~cond; {7398#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:32,007 INFO L290 TraceCheckUtils]: 18: Hoare triple {7398#(<= ~counter~0 2)} assume !(0 == ~cond); {7398#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:32,007 INFO L290 TraceCheckUtils]: 19: Hoare triple {7398#(<= ~counter~0 2)} assume true; {7398#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:32,007 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7398#(<= ~counter~0 2)} {7398#(<= ~counter~0 2)} #51#return; {7398#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:32,007 INFO L290 TraceCheckUtils]: 21: Hoare triple {7398#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7398#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:32,008 INFO L290 TraceCheckUtils]: 22: Hoare triple {7398#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7423#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:32,008 INFO L290 TraceCheckUtils]: 23: Hoare triple {7423#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {7423#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:32,008 INFO L272 TraceCheckUtils]: 24: Hoare triple {7423#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7423#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:32,008 INFO L290 TraceCheckUtils]: 25: Hoare triple {7423#(<= ~counter~0 3)} ~cond := #in~cond; {7423#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:32,009 INFO L290 TraceCheckUtils]: 26: Hoare triple {7423#(<= ~counter~0 3)} assume !(0 == ~cond); {7423#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:32,009 INFO L290 TraceCheckUtils]: 27: Hoare triple {7423#(<= ~counter~0 3)} assume true; {7423#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:32,009 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7423#(<= ~counter~0 3)} {7423#(<= ~counter~0 3)} #51#return; {7423#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:32,009 INFO L290 TraceCheckUtils]: 29: Hoare triple {7423#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7423#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:32,010 INFO L290 TraceCheckUtils]: 30: Hoare triple {7423#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7448#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:32,010 INFO L290 TraceCheckUtils]: 31: Hoare triple {7448#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {7448#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:32,010 INFO L272 TraceCheckUtils]: 32: Hoare triple {7448#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7448#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:32,010 INFO L290 TraceCheckUtils]: 33: Hoare triple {7448#(<= ~counter~0 4)} ~cond := #in~cond; {7448#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:32,011 INFO L290 TraceCheckUtils]: 34: Hoare triple {7448#(<= ~counter~0 4)} assume !(0 == ~cond); {7448#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:32,011 INFO L290 TraceCheckUtils]: 35: Hoare triple {7448#(<= ~counter~0 4)} assume true; {7448#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:32,011 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7448#(<= ~counter~0 4)} {7448#(<= ~counter~0 4)} #51#return; {7448#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:32,011 INFO L290 TraceCheckUtils]: 37: Hoare triple {7448#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7448#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:32,012 INFO L290 TraceCheckUtils]: 38: Hoare triple {7448#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7473#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:32,012 INFO L290 TraceCheckUtils]: 39: Hoare triple {7473#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {7473#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:32,012 INFO L272 TraceCheckUtils]: 40: Hoare triple {7473#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7473#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:32,012 INFO L290 TraceCheckUtils]: 41: Hoare triple {7473#(<= ~counter~0 5)} ~cond := #in~cond; {7473#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:32,012 INFO L290 TraceCheckUtils]: 42: Hoare triple {7473#(<= ~counter~0 5)} assume !(0 == ~cond); {7473#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:32,013 INFO L290 TraceCheckUtils]: 43: Hoare triple {7473#(<= ~counter~0 5)} assume true; {7473#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:32,013 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7473#(<= ~counter~0 5)} {7473#(<= ~counter~0 5)} #51#return; {7473#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:32,013 INFO L290 TraceCheckUtils]: 45: Hoare triple {7473#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7473#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:32,013 INFO L290 TraceCheckUtils]: 46: Hoare triple {7473#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7498#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:32,014 INFO L290 TraceCheckUtils]: 47: Hoare triple {7498#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {7498#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:32,014 INFO L272 TraceCheckUtils]: 48: Hoare triple {7498#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7498#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:32,014 INFO L290 TraceCheckUtils]: 49: Hoare triple {7498#(<= ~counter~0 6)} ~cond := #in~cond; {7498#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:32,014 INFO L290 TraceCheckUtils]: 50: Hoare triple {7498#(<= ~counter~0 6)} assume !(0 == ~cond); {7498#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:32,015 INFO L290 TraceCheckUtils]: 51: Hoare triple {7498#(<= ~counter~0 6)} assume true; {7498#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:32,015 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7498#(<= ~counter~0 6)} {7498#(<= ~counter~0 6)} #51#return; {7498#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:32,015 INFO L290 TraceCheckUtils]: 53: Hoare triple {7498#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7498#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:32,015 INFO L290 TraceCheckUtils]: 54: Hoare triple {7498#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7523#(<= ~counter~0 7)} is VALID [2022-04-08 14:16:32,016 INFO L290 TraceCheckUtils]: 55: Hoare triple {7523#(<= ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {7523#(<= ~counter~0 7)} is VALID [2022-04-08 14:16:32,016 INFO L272 TraceCheckUtils]: 56: Hoare triple {7523#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7523#(<= ~counter~0 7)} is VALID [2022-04-08 14:16:32,016 INFO L290 TraceCheckUtils]: 57: Hoare triple {7523#(<= ~counter~0 7)} ~cond := #in~cond; {7523#(<= ~counter~0 7)} is VALID [2022-04-08 14:16:32,016 INFO L290 TraceCheckUtils]: 58: Hoare triple {7523#(<= ~counter~0 7)} assume !(0 == ~cond); {7523#(<= ~counter~0 7)} is VALID [2022-04-08 14:16:32,016 INFO L290 TraceCheckUtils]: 59: Hoare triple {7523#(<= ~counter~0 7)} assume true; {7523#(<= ~counter~0 7)} is VALID [2022-04-08 14:16:32,017 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7523#(<= ~counter~0 7)} {7523#(<= ~counter~0 7)} #51#return; {7523#(<= ~counter~0 7)} is VALID [2022-04-08 14:16:32,017 INFO L290 TraceCheckUtils]: 61: Hoare triple {7523#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7523#(<= ~counter~0 7)} is VALID [2022-04-08 14:16:32,017 INFO L290 TraceCheckUtils]: 62: Hoare triple {7523#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7548#(<= |main_#t~post5| 7)} is VALID [2022-04-08 14:16:32,017 INFO L290 TraceCheckUtils]: 63: Hoare triple {7548#(<= |main_#t~post5| 7)} assume !(#t~post5 < 10);havoc #t~post5; {7350#false} is VALID [2022-04-08 14:16:32,017 INFO L272 TraceCheckUtils]: 64: Hoare triple {7350#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7350#false} is VALID [2022-04-08 14:16:32,018 INFO L290 TraceCheckUtils]: 65: Hoare triple {7350#false} ~cond := #in~cond; {7350#false} is VALID [2022-04-08 14:16:32,018 INFO L290 TraceCheckUtils]: 66: Hoare triple {7350#false} assume 0 == ~cond; {7350#false} is VALID [2022-04-08 14:16:32,018 INFO L290 TraceCheckUtils]: 67: Hoare triple {7350#false} assume !false; {7350#false} is VALID [2022-04-08 14:16:32,018 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 14 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:16:32,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:16:32,232 INFO L290 TraceCheckUtils]: 67: Hoare triple {7350#false} assume !false; {7350#false} is VALID [2022-04-08 14:16:32,233 INFO L290 TraceCheckUtils]: 66: Hoare triple {7350#false} assume 0 == ~cond; {7350#false} is VALID [2022-04-08 14:16:32,233 INFO L290 TraceCheckUtils]: 65: Hoare triple {7350#false} ~cond := #in~cond; {7350#false} is VALID [2022-04-08 14:16:32,233 INFO L272 TraceCheckUtils]: 64: Hoare triple {7350#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7350#false} is VALID [2022-04-08 14:16:32,236 INFO L290 TraceCheckUtils]: 63: Hoare triple {7576#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {7350#false} is VALID [2022-04-08 14:16:32,237 INFO L290 TraceCheckUtils]: 62: Hoare triple {7580#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7576#(< |main_#t~post5| 10)} is VALID [2022-04-08 14:16:32,237 INFO L290 TraceCheckUtils]: 61: Hoare triple {7580#(< ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7580#(< ~counter~0 10)} is VALID [2022-04-08 14:16:32,237 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7349#true} {7580#(< ~counter~0 10)} #51#return; {7580#(< ~counter~0 10)} is VALID [2022-04-08 14:16:32,237 INFO L290 TraceCheckUtils]: 59: Hoare triple {7349#true} assume true; {7349#true} is VALID [2022-04-08 14:16:32,237 INFO L290 TraceCheckUtils]: 58: Hoare triple {7349#true} assume !(0 == ~cond); {7349#true} is VALID [2022-04-08 14:16:32,237 INFO L290 TraceCheckUtils]: 57: Hoare triple {7349#true} ~cond := #in~cond; {7349#true} is VALID [2022-04-08 14:16:32,237 INFO L272 TraceCheckUtils]: 56: Hoare triple {7580#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7349#true} is VALID [2022-04-08 14:16:32,238 INFO L290 TraceCheckUtils]: 55: Hoare triple {7580#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {7580#(< ~counter~0 10)} is VALID [2022-04-08 14:16:32,238 INFO L290 TraceCheckUtils]: 54: Hoare triple {7605#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7580#(< ~counter~0 10)} is VALID [2022-04-08 14:16:32,238 INFO L290 TraceCheckUtils]: 53: Hoare triple {7605#(< ~counter~0 9)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7605#(< ~counter~0 9)} is VALID [2022-04-08 14:16:32,239 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7349#true} {7605#(< ~counter~0 9)} #51#return; {7605#(< ~counter~0 9)} is VALID [2022-04-08 14:16:32,239 INFO L290 TraceCheckUtils]: 51: Hoare triple {7349#true} assume true; {7349#true} is VALID [2022-04-08 14:16:32,239 INFO L290 TraceCheckUtils]: 50: Hoare triple {7349#true} assume !(0 == ~cond); {7349#true} is VALID [2022-04-08 14:16:32,239 INFO L290 TraceCheckUtils]: 49: Hoare triple {7349#true} ~cond := #in~cond; {7349#true} is VALID [2022-04-08 14:16:32,239 INFO L272 TraceCheckUtils]: 48: Hoare triple {7605#(< ~counter~0 9)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7349#true} is VALID [2022-04-08 14:16:32,240 INFO L290 TraceCheckUtils]: 47: Hoare triple {7605#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {7605#(< ~counter~0 9)} is VALID [2022-04-08 14:16:32,240 INFO L290 TraceCheckUtils]: 46: Hoare triple {7523#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7605#(< ~counter~0 9)} is VALID [2022-04-08 14:16:32,241 INFO L290 TraceCheckUtils]: 45: Hoare triple {7523#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7523#(<= ~counter~0 7)} is VALID [2022-04-08 14:16:32,241 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7349#true} {7523#(<= ~counter~0 7)} #51#return; {7523#(<= ~counter~0 7)} is VALID [2022-04-08 14:16:32,241 INFO L290 TraceCheckUtils]: 43: Hoare triple {7349#true} assume true; {7349#true} is VALID [2022-04-08 14:16:32,241 INFO L290 TraceCheckUtils]: 42: Hoare triple {7349#true} assume !(0 == ~cond); {7349#true} is VALID [2022-04-08 14:16:32,241 INFO L290 TraceCheckUtils]: 41: Hoare triple {7349#true} ~cond := #in~cond; {7349#true} is VALID [2022-04-08 14:16:32,241 INFO L272 TraceCheckUtils]: 40: Hoare triple {7523#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7349#true} is VALID [2022-04-08 14:16:32,241 INFO L290 TraceCheckUtils]: 39: Hoare triple {7523#(<= ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {7523#(<= ~counter~0 7)} is VALID [2022-04-08 14:16:32,242 INFO L290 TraceCheckUtils]: 38: Hoare triple {7498#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7523#(<= ~counter~0 7)} is VALID [2022-04-08 14:16:32,242 INFO L290 TraceCheckUtils]: 37: Hoare triple {7498#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7498#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:32,242 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7349#true} {7498#(<= ~counter~0 6)} #51#return; {7498#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:32,242 INFO L290 TraceCheckUtils]: 35: Hoare triple {7349#true} assume true; {7349#true} is VALID [2022-04-08 14:16:32,242 INFO L290 TraceCheckUtils]: 34: Hoare triple {7349#true} assume !(0 == ~cond); {7349#true} is VALID [2022-04-08 14:16:32,242 INFO L290 TraceCheckUtils]: 33: Hoare triple {7349#true} ~cond := #in~cond; {7349#true} is VALID [2022-04-08 14:16:32,242 INFO L272 TraceCheckUtils]: 32: Hoare triple {7498#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7349#true} is VALID [2022-04-08 14:16:32,243 INFO L290 TraceCheckUtils]: 31: Hoare triple {7498#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {7498#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:32,243 INFO L290 TraceCheckUtils]: 30: Hoare triple {7473#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7498#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:32,243 INFO L290 TraceCheckUtils]: 29: Hoare triple {7473#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7473#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:32,243 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7349#true} {7473#(<= ~counter~0 5)} #51#return; {7473#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:32,244 INFO L290 TraceCheckUtils]: 27: Hoare triple {7349#true} assume true; {7349#true} is VALID [2022-04-08 14:16:32,244 INFO L290 TraceCheckUtils]: 26: Hoare triple {7349#true} assume !(0 == ~cond); {7349#true} is VALID [2022-04-08 14:16:32,244 INFO L290 TraceCheckUtils]: 25: Hoare triple {7349#true} ~cond := #in~cond; {7349#true} is VALID [2022-04-08 14:16:32,244 INFO L272 TraceCheckUtils]: 24: Hoare triple {7473#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7349#true} is VALID [2022-04-08 14:16:32,244 INFO L290 TraceCheckUtils]: 23: Hoare triple {7473#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {7473#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:32,244 INFO L290 TraceCheckUtils]: 22: Hoare triple {7448#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7473#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:32,244 INFO L290 TraceCheckUtils]: 21: Hoare triple {7448#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7448#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:32,245 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7349#true} {7448#(<= ~counter~0 4)} #51#return; {7448#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:32,245 INFO L290 TraceCheckUtils]: 19: Hoare triple {7349#true} assume true; {7349#true} is VALID [2022-04-08 14:16:32,245 INFO L290 TraceCheckUtils]: 18: Hoare triple {7349#true} assume !(0 == ~cond); {7349#true} is VALID [2022-04-08 14:16:32,245 INFO L290 TraceCheckUtils]: 17: Hoare triple {7349#true} ~cond := #in~cond; {7349#true} is VALID [2022-04-08 14:16:32,245 INFO L272 TraceCheckUtils]: 16: Hoare triple {7448#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7349#true} is VALID [2022-04-08 14:16:32,246 INFO L290 TraceCheckUtils]: 15: Hoare triple {7448#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {7448#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:32,247 INFO L290 TraceCheckUtils]: 14: Hoare triple {7423#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7448#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:32,247 INFO L290 TraceCheckUtils]: 13: Hoare triple {7423#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7423#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:32,247 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7349#true} {7423#(<= ~counter~0 3)} #51#return; {7423#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:32,247 INFO L290 TraceCheckUtils]: 11: Hoare triple {7349#true} assume true; {7349#true} is VALID [2022-04-08 14:16:32,247 INFO L290 TraceCheckUtils]: 10: Hoare triple {7349#true} assume !(0 == ~cond); {7349#true} is VALID [2022-04-08 14:16:32,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {7349#true} ~cond := #in~cond; {7349#true} is VALID [2022-04-08 14:16:32,248 INFO L272 TraceCheckUtils]: 8: Hoare triple {7423#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7349#true} is VALID [2022-04-08 14:16:32,248 INFO L290 TraceCheckUtils]: 7: Hoare triple {7423#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {7423#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:32,248 INFO L290 TraceCheckUtils]: 6: Hoare triple {7398#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7423#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:32,248 INFO L290 TraceCheckUtils]: 5: Hoare triple {7398#(<= ~counter~0 2)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {7398#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:32,249 INFO L272 TraceCheckUtils]: 4: Hoare triple {7398#(<= ~counter~0 2)} call #t~ret6 := main(); {7398#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:32,249 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7398#(<= ~counter~0 2)} {7349#true} #57#return; {7398#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:32,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {7398#(<= ~counter~0 2)} assume true; {7398#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:32,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {7349#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);~counter~0 := 0; {7398#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:32,249 INFO L272 TraceCheckUtils]: 0: Hoare triple {7349#true} call ULTIMATE.init(); {7349#true} is VALID [2022-04-08 14:16:32,250 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 14 proven. 98 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-08 14:16:32,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:16:32,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356582097] [2022-04-08 14:16:32,250 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:16:32,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259018584] [2022-04-08 14:16:32,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259018584] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:16:32,250 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:16:32,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2022-04-08 14:16:32,250 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:16:32,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [558498580] [2022-04-08 14:16:32,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [558498580] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:16:32,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:16:32,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 14:16:32,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870505801] [2022-04-08 14:16:32,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:16:32,253 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 10 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 68 [2022-04-08 14:16:32,254 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:16:32,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 10 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:16:32,282 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:32,282 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 14:16:32,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:32,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 14:16:32,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 14:16:32,283 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 10 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:16:32,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:32,455 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2022-04-08 14:16:32,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 14:16:32,455 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 10 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 68 [2022-04-08 14:16:32,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:16:32,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 10 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:16:32,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 82 transitions. [2022-04-08 14:16:32,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 10 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:16:32,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 82 transitions. [2022-04-08 14:16:32,458 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 82 transitions. [2022-04-08 14:16:32,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:32,500 INFO L225 Difference]: With dead ends: 82 [2022-04-08 14:16:32,500 INFO L226 Difference]: Without dead ends: 77 [2022-04-08 14:16:32,500 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=162, Invalid=258, Unknown=0, NotChecked=0, Total=420 [2022-04-08 14:16:32,501 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:16:32,501 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 94 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:16:32,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-08 14:16:32,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-04-08 14:16:32,551 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:16:32,551 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 77 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 states have internal predecessors, (58), 11 states have call successors, (11), 11 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:16:32,552 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 77 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 states have internal predecessors, (58), 11 states have call successors, (11), 11 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:16:32,552 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 77 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 states have internal predecessors, (58), 11 states have call successors, (11), 11 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:16:32,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:32,554 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2022-04-08 14:16:32,554 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2022-04-08 14:16:32,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:32,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:32,554 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 states have internal predecessors, (58), 11 states have call successors, (11), 11 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 77 states. [2022-04-08 14:16:32,555 INFO L87 Difference]: Start difference. First operand has 77 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 states have internal predecessors, (58), 11 states have call successors, (11), 11 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 77 states. [2022-04-08 14:16:32,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:32,556 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2022-04-08 14:16:32,556 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2022-04-08 14:16:32,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:32,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:32,556 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:16:32,556 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:16:32,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 states have internal predecessors, (58), 11 states have call successors, (11), 11 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:16:32,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2022-04-08 14:16:32,558 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 68 [2022-04-08 14:16:32,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:16:32,558 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2022-04-08 14:16:32,558 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 10 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:16:32,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 78 transitions. [2022-04-08 14:16:32,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:32,624 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2022-04-08 14:16:32,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-08 14:16:32,624 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:16:32,624 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:16:32,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-08 14:16:32,840 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-08 14:16:32,840 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:16:32,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:16:32,841 INFO L85 PathProgramCache]: Analyzing trace with hash -763940164, now seen corresponding path program 13 times [2022-04-08 14:16:32,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:32,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1493124175] [2022-04-08 14:16:32,932 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:16:32,932 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:16:32,932 INFO L85 PathProgramCache]: Analyzing trace with hash -763940164, now seen corresponding path program 14 times [2022-04-08 14:16:32,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:16:32,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510862766] [2022-04-08 14:16:32,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:16:32,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:16:32,945 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:16:32,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1457778122] [2022-04-08 14:16:32,945 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:16:32,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:32,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:16:32,946 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:16:32,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-08 14:16:33,346 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:16:33,346 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:16:33,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-08 14:16:33,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:16:33,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:16:33,742 INFO L272 TraceCheckUtils]: 0: Hoare triple {8256#true} call ULTIMATE.init(); {8256#true} is VALID [2022-04-08 14:16:33,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {8256#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);~counter~0 := 0; {8256#true} is VALID [2022-04-08 14:16:33,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {8256#true} assume true; {8256#true} is VALID [2022-04-08 14:16:33,743 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8256#true} {8256#true} #57#return; {8256#true} is VALID [2022-04-08 14:16:33,743 INFO L272 TraceCheckUtils]: 4: Hoare triple {8256#true} call #t~ret6 := main(); {8256#true} is VALID [2022-04-08 14:16:33,743 INFO L290 TraceCheckUtils]: 5: Hoare triple {8256#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {8276#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:16:33,743 INFO L290 TraceCheckUtils]: 6: Hoare triple {8276#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8276#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:16:33,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {8276#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {8276#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:16:33,744 INFO L272 TraceCheckUtils]: 8: Hoare triple {8276#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8256#true} is VALID [2022-04-08 14:16:33,744 INFO L290 TraceCheckUtils]: 9: Hoare triple {8256#true} ~cond := #in~cond; {8256#true} is VALID [2022-04-08 14:16:33,744 INFO L290 TraceCheckUtils]: 10: Hoare triple {8256#true} assume !(0 == ~cond); {8256#true} is VALID [2022-04-08 14:16:33,744 INFO L290 TraceCheckUtils]: 11: Hoare triple {8256#true} assume true; {8256#true} is VALID [2022-04-08 14:16:33,744 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {8256#true} {8276#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {8276#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:16:33,745 INFO L290 TraceCheckUtils]: 13: Hoare triple {8276#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8301#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 14:16:33,745 INFO L290 TraceCheckUtils]: 14: Hoare triple {8301#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8301#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 14:16:33,745 INFO L290 TraceCheckUtils]: 15: Hoare triple {8301#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {8301#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 14:16:33,745 INFO L272 TraceCheckUtils]: 16: Hoare triple {8301#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8256#true} is VALID [2022-04-08 14:16:33,745 INFO L290 TraceCheckUtils]: 17: Hoare triple {8256#true} ~cond := #in~cond; {8256#true} is VALID [2022-04-08 14:16:33,745 INFO L290 TraceCheckUtils]: 18: Hoare triple {8256#true} assume !(0 == ~cond); {8256#true} is VALID [2022-04-08 14:16:33,745 INFO L290 TraceCheckUtils]: 19: Hoare triple {8256#true} assume true; {8256#true} is VALID [2022-04-08 14:16:33,746 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {8256#true} {8301#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #51#return; {8301#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 14:16:33,746 INFO L290 TraceCheckUtils]: 21: Hoare triple {8301#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8326#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:16:33,746 INFO L290 TraceCheckUtils]: 22: Hoare triple {8326#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8326#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:16:33,747 INFO L290 TraceCheckUtils]: 23: Hoare triple {8326#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 10);havoc #t~post5; {8326#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:16:33,747 INFO L272 TraceCheckUtils]: 24: Hoare triple {8326#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8256#true} is VALID [2022-04-08 14:16:33,747 INFO L290 TraceCheckUtils]: 25: Hoare triple {8256#true} ~cond := #in~cond; {8256#true} is VALID [2022-04-08 14:16:33,747 INFO L290 TraceCheckUtils]: 26: Hoare triple {8256#true} assume !(0 == ~cond); {8256#true} is VALID [2022-04-08 14:16:33,747 INFO L290 TraceCheckUtils]: 27: Hoare triple {8256#true} assume true; {8256#true} is VALID [2022-04-08 14:16:33,747 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {8256#true} {8326#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #51#return; {8326#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:16:33,748 INFO L290 TraceCheckUtils]: 29: Hoare triple {8326#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8351#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 14:16:33,748 INFO L290 TraceCheckUtils]: 30: Hoare triple {8351#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8351#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 14:16:33,748 INFO L290 TraceCheckUtils]: 31: Hoare triple {8351#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} assume !!(#t~post5 < 10);havoc #t~post5; {8351#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 14:16:33,748 INFO L272 TraceCheckUtils]: 32: Hoare triple {8351#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8256#true} is VALID [2022-04-08 14:16:33,748 INFO L290 TraceCheckUtils]: 33: Hoare triple {8256#true} ~cond := #in~cond; {8256#true} is VALID [2022-04-08 14:16:33,748 INFO L290 TraceCheckUtils]: 34: Hoare triple {8256#true} assume !(0 == ~cond); {8256#true} is VALID [2022-04-08 14:16:33,748 INFO L290 TraceCheckUtils]: 35: Hoare triple {8256#true} assume true; {8256#true} is VALID [2022-04-08 14:16:33,749 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8256#true} {8351#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} #51#return; {8351#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 14:16:33,749 INFO L290 TraceCheckUtils]: 37: Hoare triple {8351#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8376#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 14:16:33,749 INFO L290 TraceCheckUtils]: 38: Hoare triple {8376#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8376#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 14:16:33,750 INFO L290 TraceCheckUtils]: 39: Hoare triple {8376#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !!(#t~post5 < 10);havoc #t~post5; {8376#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 14:16:33,750 INFO L272 TraceCheckUtils]: 40: Hoare triple {8376#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8256#true} is VALID [2022-04-08 14:16:33,750 INFO L290 TraceCheckUtils]: 41: Hoare triple {8256#true} ~cond := #in~cond; {8256#true} is VALID [2022-04-08 14:16:33,750 INFO L290 TraceCheckUtils]: 42: Hoare triple {8256#true} assume !(0 == ~cond); {8256#true} is VALID [2022-04-08 14:16:33,750 INFO L290 TraceCheckUtils]: 43: Hoare triple {8256#true} assume true; {8256#true} is VALID [2022-04-08 14:16:33,750 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {8256#true} {8376#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} #51#return; {8376#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 14:16:33,750 INFO L290 TraceCheckUtils]: 45: Hoare triple {8376#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8401#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 14:16:33,751 INFO L290 TraceCheckUtils]: 46: Hoare triple {8401#(and (= 5 main_~c~0) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8401#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 14:16:33,751 INFO L290 TraceCheckUtils]: 47: Hoare triple {8401#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(#t~post5 < 10);havoc #t~post5; {8401#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 14:16:33,751 INFO L272 TraceCheckUtils]: 48: Hoare triple {8401#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8256#true} is VALID [2022-04-08 14:16:33,751 INFO L290 TraceCheckUtils]: 49: Hoare triple {8256#true} ~cond := #in~cond; {8256#true} is VALID [2022-04-08 14:16:33,751 INFO L290 TraceCheckUtils]: 50: Hoare triple {8256#true} assume !(0 == ~cond); {8256#true} is VALID [2022-04-08 14:16:33,751 INFO L290 TraceCheckUtils]: 51: Hoare triple {8256#true} assume true; {8256#true} is VALID [2022-04-08 14:16:33,752 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8256#true} {8401#(and (= 5 main_~c~0) (= 5 main_~y~0))} #51#return; {8401#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 14:16:33,752 INFO L290 TraceCheckUtils]: 53: Hoare triple {8401#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8426#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 14:16:33,752 INFO L290 TraceCheckUtils]: 54: Hoare triple {8426#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8426#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 14:16:33,752 INFO L290 TraceCheckUtils]: 55: Hoare triple {8426#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !!(#t~post5 < 10);havoc #t~post5; {8426#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 14:16:33,752 INFO L272 TraceCheckUtils]: 56: Hoare triple {8426#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8256#true} is VALID [2022-04-08 14:16:33,753 INFO L290 TraceCheckUtils]: 57: Hoare triple {8256#true} ~cond := #in~cond; {8256#true} is VALID [2022-04-08 14:16:33,753 INFO L290 TraceCheckUtils]: 58: Hoare triple {8256#true} assume !(0 == ~cond); {8256#true} is VALID [2022-04-08 14:16:33,753 INFO L290 TraceCheckUtils]: 59: Hoare triple {8256#true} assume true; {8256#true} is VALID [2022-04-08 14:16:33,753 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8256#true} {8426#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #51#return; {8426#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 14:16:33,753 INFO L290 TraceCheckUtils]: 61: Hoare triple {8426#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8451#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 14:16:33,754 INFO L290 TraceCheckUtils]: 62: Hoare triple {8451#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8451#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 14:16:33,754 INFO L290 TraceCheckUtils]: 63: Hoare triple {8451#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !!(#t~post5 < 10);havoc #t~post5; {8451#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 14:16:33,754 INFO L272 TraceCheckUtils]: 64: Hoare triple {8451#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8256#true} is VALID [2022-04-08 14:16:33,754 INFO L290 TraceCheckUtils]: 65: Hoare triple {8256#true} ~cond := #in~cond; {8256#true} is VALID [2022-04-08 14:16:33,754 INFO L290 TraceCheckUtils]: 66: Hoare triple {8256#true} assume !(0 == ~cond); {8256#true} is VALID [2022-04-08 14:16:33,754 INFO L290 TraceCheckUtils]: 67: Hoare triple {8256#true} assume true; {8256#true} is VALID [2022-04-08 14:16:33,754 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {8256#true} {8451#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #51#return; {8451#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 14:16:33,755 INFO L290 TraceCheckUtils]: 69: Hoare triple {8451#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {8476#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 14:16:33,756 INFO L272 TraceCheckUtils]: 70: Hoare triple {8476#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8480#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:16:33,756 INFO L290 TraceCheckUtils]: 71: Hoare triple {8480#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8484#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:16:33,756 INFO L290 TraceCheckUtils]: 72: Hoare triple {8484#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8257#false} is VALID [2022-04-08 14:16:33,756 INFO L290 TraceCheckUtils]: 73: Hoare triple {8257#false} assume !false; {8257#false} is VALID [2022-04-08 14:16:33,757 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 16 proven. 112 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-08 14:16:33,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:16:33,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:16:33,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510862766] [2022-04-08 14:16:33,980 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:16:33,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457778122] [2022-04-08 14:16:33,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457778122] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:16:33,980 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:16:33,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-08 14:16:33,981 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:16:33,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1493124175] [2022-04-08 14:16:33,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1493124175] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:16:33,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:16:33,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 14:16:33,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000034858] [2022-04-08 14:16:33,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:16:33,981 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 74 [2022-04-08 14:16:33,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:16:33,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:16:34,019 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:34,019 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 14:16:34,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:34,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 14:16:34,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-08 14:16:34,019 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:16:34,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:34,522 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2022-04-08 14:16:34,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 14:16:34,522 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 74 [2022-04-08 14:16:34,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:16:34,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:16:34,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 64 transitions. [2022-04-08 14:16:34,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:16:34,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 64 transitions. [2022-04-08 14:16:34,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 64 transitions. [2022-04-08 14:16:34,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:34,560 INFO L225 Difference]: With dead ends: 84 [2022-04-08 14:16:34,560 INFO L226 Difference]: Without dead ends: 79 [2022-04-08 14:16:34,560 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-04-08 14:16:34,560 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 2 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 14:16:34,560 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 352 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 14:16:34,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-08 14:16:34,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-04-08 14:16:34,634 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:16:34,635 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 79 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 57 states have internal predecessors, (59), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:16:34,635 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 79 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 57 states have internal predecessors, (59), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:16:34,635 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 79 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 57 states have internal predecessors, (59), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:16:34,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:34,636 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2022-04-08 14:16:34,636 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2022-04-08 14:16:34,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:34,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:34,638 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 57 states have internal predecessors, (59), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 79 states. [2022-04-08 14:16:34,638 INFO L87 Difference]: Start difference. First operand has 79 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 57 states have internal predecessors, (59), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 79 states. [2022-04-08 14:16:34,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:34,641 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2022-04-08 14:16:34,641 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2022-04-08 14:16:34,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:34,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:34,641 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:16:34,641 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:16:34,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 57 states have internal predecessors, (59), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:16:34,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2022-04-08 14:16:34,650 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 74 [2022-04-08 14:16:34,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:16:34,651 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2022-04-08 14:16:34,651 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:16:34,651 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 81 transitions. [2022-04-08 14:16:34,742 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:34,742 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2022-04-08 14:16:34,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-08 14:16:34,743 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:16:34,743 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:16:34,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-08 14:16:34,943 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-08 14:16:34,943 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:16:34,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:16:34,944 INFO L85 PathProgramCache]: Analyzing trace with hash 989539297, now seen corresponding path program 15 times [2022-04-08 14:16:34,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:34,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1641930734] [2022-04-08 14:16:35,015 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:16:35,015 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:16:35,015 INFO L85 PathProgramCache]: Analyzing trace with hash 989539297, now seen corresponding path program 16 times [2022-04-08 14:16:35,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:16:35,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918509304] [2022-04-08 14:16:35,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:16:35,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:16:35,024 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:16:35,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1463565679] [2022-04-08 14:16:35,025 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:16:35,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:35,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:16:35,026 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:16:35,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-08 14:16:35,779 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:16:35,779 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:16:35,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 14:16:35,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:16:35,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:16:36,203 INFO L272 TraceCheckUtils]: 0: Hoare triple {9023#true} call ULTIMATE.init(); {9023#true} is VALID [2022-04-08 14:16:36,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {9023#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);~counter~0 := 0; {9031#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:36,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {9031#(<= ~counter~0 0)} assume true; {9031#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:36,204 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9031#(<= ~counter~0 0)} {9023#true} #57#return; {9031#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:36,204 INFO L272 TraceCheckUtils]: 4: Hoare triple {9031#(<= ~counter~0 0)} call #t~ret6 := main(); {9031#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:36,204 INFO L290 TraceCheckUtils]: 5: Hoare triple {9031#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {9031#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:36,205 INFO L290 TraceCheckUtils]: 6: Hoare triple {9031#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9047#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:36,205 INFO L290 TraceCheckUtils]: 7: Hoare triple {9047#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {9047#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:36,206 INFO L272 TraceCheckUtils]: 8: Hoare triple {9047#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9047#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:36,206 INFO L290 TraceCheckUtils]: 9: Hoare triple {9047#(<= ~counter~0 1)} ~cond := #in~cond; {9047#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:36,207 INFO L290 TraceCheckUtils]: 10: Hoare triple {9047#(<= ~counter~0 1)} assume !(0 == ~cond); {9047#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:36,207 INFO L290 TraceCheckUtils]: 11: Hoare triple {9047#(<= ~counter~0 1)} assume true; {9047#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:36,207 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {9047#(<= ~counter~0 1)} {9047#(<= ~counter~0 1)} #51#return; {9047#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:36,208 INFO L290 TraceCheckUtils]: 13: Hoare triple {9047#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9047#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:36,208 INFO L290 TraceCheckUtils]: 14: Hoare triple {9047#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9072#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:36,208 INFO L290 TraceCheckUtils]: 15: Hoare triple {9072#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {9072#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:36,209 INFO L272 TraceCheckUtils]: 16: Hoare triple {9072#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9072#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:36,209 INFO L290 TraceCheckUtils]: 17: Hoare triple {9072#(<= ~counter~0 2)} ~cond := #in~cond; {9072#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:36,209 INFO L290 TraceCheckUtils]: 18: Hoare triple {9072#(<= ~counter~0 2)} assume !(0 == ~cond); {9072#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:36,210 INFO L290 TraceCheckUtils]: 19: Hoare triple {9072#(<= ~counter~0 2)} assume true; {9072#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:36,210 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {9072#(<= ~counter~0 2)} {9072#(<= ~counter~0 2)} #51#return; {9072#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:36,210 INFO L290 TraceCheckUtils]: 21: Hoare triple {9072#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9072#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:36,211 INFO L290 TraceCheckUtils]: 22: Hoare triple {9072#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9097#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:36,211 INFO L290 TraceCheckUtils]: 23: Hoare triple {9097#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {9097#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:36,212 INFO L272 TraceCheckUtils]: 24: Hoare triple {9097#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9097#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:36,212 INFO L290 TraceCheckUtils]: 25: Hoare triple {9097#(<= ~counter~0 3)} ~cond := #in~cond; {9097#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:36,212 INFO L290 TraceCheckUtils]: 26: Hoare triple {9097#(<= ~counter~0 3)} assume !(0 == ~cond); {9097#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:36,212 INFO L290 TraceCheckUtils]: 27: Hoare triple {9097#(<= ~counter~0 3)} assume true; {9097#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:36,213 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {9097#(<= ~counter~0 3)} {9097#(<= ~counter~0 3)} #51#return; {9097#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:36,213 INFO L290 TraceCheckUtils]: 29: Hoare triple {9097#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9097#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:36,214 INFO L290 TraceCheckUtils]: 30: Hoare triple {9097#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9122#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:36,214 INFO L290 TraceCheckUtils]: 31: Hoare triple {9122#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {9122#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:36,214 INFO L272 TraceCheckUtils]: 32: Hoare triple {9122#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9122#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:36,215 INFO L290 TraceCheckUtils]: 33: Hoare triple {9122#(<= ~counter~0 4)} ~cond := #in~cond; {9122#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:36,215 INFO L290 TraceCheckUtils]: 34: Hoare triple {9122#(<= ~counter~0 4)} assume !(0 == ~cond); {9122#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:36,215 INFO L290 TraceCheckUtils]: 35: Hoare triple {9122#(<= ~counter~0 4)} assume true; {9122#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:36,216 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {9122#(<= ~counter~0 4)} {9122#(<= ~counter~0 4)} #51#return; {9122#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:36,216 INFO L290 TraceCheckUtils]: 37: Hoare triple {9122#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9122#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:36,216 INFO L290 TraceCheckUtils]: 38: Hoare triple {9122#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9147#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:36,217 INFO L290 TraceCheckUtils]: 39: Hoare triple {9147#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {9147#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:36,217 INFO L272 TraceCheckUtils]: 40: Hoare triple {9147#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9147#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:36,218 INFO L290 TraceCheckUtils]: 41: Hoare triple {9147#(<= ~counter~0 5)} ~cond := #in~cond; {9147#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:36,218 INFO L290 TraceCheckUtils]: 42: Hoare triple {9147#(<= ~counter~0 5)} assume !(0 == ~cond); {9147#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:36,218 INFO L290 TraceCheckUtils]: 43: Hoare triple {9147#(<= ~counter~0 5)} assume true; {9147#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:36,219 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {9147#(<= ~counter~0 5)} {9147#(<= ~counter~0 5)} #51#return; {9147#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:36,219 INFO L290 TraceCheckUtils]: 45: Hoare triple {9147#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9147#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:36,219 INFO L290 TraceCheckUtils]: 46: Hoare triple {9147#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9172#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:36,220 INFO L290 TraceCheckUtils]: 47: Hoare triple {9172#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {9172#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:36,220 INFO L272 TraceCheckUtils]: 48: Hoare triple {9172#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9172#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:36,220 INFO L290 TraceCheckUtils]: 49: Hoare triple {9172#(<= ~counter~0 6)} ~cond := #in~cond; {9172#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:36,221 INFO L290 TraceCheckUtils]: 50: Hoare triple {9172#(<= ~counter~0 6)} assume !(0 == ~cond); {9172#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:36,221 INFO L290 TraceCheckUtils]: 51: Hoare triple {9172#(<= ~counter~0 6)} assume true; {9172#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:36,221 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {9172#(<= ~counter~0 6)} {9172#(<= ~counter~0 6)} #51#return; {9172#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:36,222 INFO L290 TraceCheckUtils]: 53: Hoare triple {9172#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9172#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:36,222 INFO L290 TraceCheckUtils]: 54: Hoare triple {9172#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9197#(<= ~counter~0 7)} is VALID [2022-04-08 14:16:36,222 INFO L290 TraceCheckUtils]: 55: Hoare triple {9197#(<= ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {9197#(<= ~counter~0 7)} is VALID [2022-04-08 14:16:36,223 INFO L272 TraceCheckUtils]: 56: Hoare triple {9197#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9197#(<= ~counter~0 7)} is VALID [2022-04-08 14:16:36,223 INFO L290 TraceCheckUtils]: 57: Hoare triple {9197#(<= ~counter~0 7)} ~cond := #in~cond; {9197#(<= ~counter~0 7)} is VALID [2022-04-08 14:16:36,223 INFO L290 TraceCheckUtils]: 58: Hoare triple {9197#(<= ~counter~0 7)} assume !(0 == ~cond); {9197#(<= ~counter~0 7)} is VALID [2022-04-08 14:16:36,224 INFO L290 TraceCheckUtils]: 59: Hoare triple {9197#(<= ~counter~0 7)} assume true; {9197#(<= ~counter~0 7)} is VALID [2022-04-08 14:16:36,224 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {9197#(<= ~counter~0 7)} {9197#(<= ~counter~0 7)} #51#return; {9197#(<= ~counter~0 7)} is VALID [2022-04-08 14:16:36,224 INFO L290 TraceCheckUtils]: 61: Hoare triple {9197#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9197#(<= ~counter~0 7)} is VALID [2022-04-08 14:16:36,225 INFO L290 TraceCheckUtils]: 62: Hoare triple {9197#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9222#(<= ~counter~0 8)} is VALID [2022-04-08 14:16:36,225 INFO L290 TraceCheckUtils]: 63: Hoare triple {9222#(<= ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {9222#(<= ~counter~0 8)} is VALID [2022-04-08 14:16:36,226 INFO L272 TraceCheckUtils]: 64: Hoare triple {9222#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9222#(<= ~counter~0 8)} is VALID [2022-04-08 14:16:36,226 INFO L290 TraceCheckUtils]: 65: Hoare triple {9222#(<= ~counter~0 8)} ~cond := #in~cond; {9222#(<= ~counter~0 8)} is VALID [2022-04-08 14:16:36,226 INFO L290 TraceCheckUtils]: 66: Hoare triple {9222#(<= ~counter~0 8)} assume !(0 == ~cond); {9222#(<= ~counter~0 8)} is VALID [2022-04-08 14:16:36,227 INFO L290 TraceCheckUtils]: 67: Hoare triple {9222#(<= ~counter~0 8)} assume true; {9222#(<= ~counter~0 8)} is VALID [2022-04-08 14:16:36,227 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {9222#(<= ~counter~0 8)} {9222#(<= ~counter~0 8)} #51#return; {9222#(<= ~counter~0 8)} is VALID [2022-04-08 14:16:36,227 INFO L290 TraceCheckUtils]: 69: Hoare triple {9222#(<= ~counter~0 8)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9222#(<= ~counter~0 8)} is VALID [2022-04-08 14:16:36,228 INFO L290 TraceCheckUtils]: 70: Hoare triple {9222#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9247#(<= |main_#t~post5| 8)} is VALID [2022-04-08 14:16:36,228 INFO L290 TraceCheckUtils]: 71: Hoare triple {9247#(<= |main_#t~post5| 8)} assume !(#t~post5 < 10);havoc #t~post5; {9024#false} is VALID [2022-04-08 14:16:36,228 INFO L272 TraceCheckUtils]: 72: Hoare triple {9024#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9024#false} is VALID [2022-04-08 14:16:36,228 INFO L290 TraceCheckUtils]: 73: Hoare triple {9024#false} ~cond := #in~cond; {9024#false} is VALID [2022-04-08 14:16:36,228 INFO L290 TraceCheckUtils]: 74: Hoare triple {9024#false} assume 0 == ~cond; {9024#false} is VALID [2022-04-08 14:16:36,228 INFO L290 TraceCheckUtils]: 75: Hoare triple {9024#false} assume !false; {9024#false} is VALID [2022-04-08 14:16:36,229 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 16 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:16:36,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:16:36,605 INFO L290 TraceCheckUtils]: 75: Hoare triple {9024#false} assume !false; {9024#false} is VALID [2022-04-08 14:16:36,605 INFO L290 TraceCheckUtils]: 74: Hoare triple {9024#false} assume 0 == ~cond; {9024#false} is VALID [2022-04-08 14:16:36,605 INFO L290 TraceCheckUtils]: 73: Hoare triple {9024#false} ~cond := #in~cond; {9024#false} is VALID [2022-04-08 14:16:36,605 INFO L272 TraceCheckUtils]: 72: Hoare triple {9024#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9024#false} is VALID [2022-04-08 14:16:36,605 INFO L290 TraceCheckUtils]: 71: Hoare triple {9275#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {9024#false} is VALID [2022-04-08 14:16:36,606 INFO L290 TraceCheckUtils]: 70: Hoare triple {9279#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9275#(< |main_#t~post5| 10)} is VALID [2022-04-08 14:16:36,606 INFO L290 TraceCheckUtils]: 69: Hoare triple {9279#(< ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9279#(< ~counter~0 10)} is VALID [2022-04-08 14:16:36,607 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {9023#true} {9279#(< ~counter~0 10)} #51#return; {9279#(< ~counter~0 10)} is VALID [2022-04-08 14:16:36,607 INFO L290 TraceCheckUtils]: 67: Hoare triple {9023#true} assume true; {9023#true} is VALID [2022-04-08 14:16:36,607 INFO L290 TraceCheckUtils]: 66: Hoare triple {9023#true} assume !(0 == ~cond); {9023#true} is VALID [2022-04-08 14:16:36,607 INFO L290 TraceCheckUtils]: 65: Hoare triple {9023#true} ~cond := #in~cond; {9023#true} is VALID [2022-04-08 14:16:36,607 INFO L272 TraceCheckUtils]: 64: Hoare triple {9279#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9023#true} is VALID [2022-04-08 14:16:36,607 INFO L290 TraceCheckUtils]: 63: Hoare triple {9279#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {9279#(< ~counter~0 10)} is VALID [2022-04-08 14:16:36,608 INFO L290 TraceCheckUtils]: 62: Hoare triple {9222#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9279#(< ~counter~0 10)} is VALID [2022-04-08 14:16:36,608 INFO L290 TraceCheckUtils]: 61: Hoare triple {9222#(<= ~counter~0 8)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9222#(<= ~counter~0 8)} is VALID [2022-04-08 14:16:36,609 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {9023#true} {9222#(<= ~counter~0 8)} #51#return; {9222#(<= ~counter~0 8)} is VALID [2022-04-08 14:16:36,609 INFO L290 TraceCheckUtils]: 59: Hoare triple {9023#true} assume true; {9023#true} is VALID [2022-04-08 14:16:36,609 INFO L290 TraceCheckUtils]: 58: Hoare triple {9023#true} assume !(0 == ~cond); {9023#true} is VALID [2022-04-08 14:16:36,609 INFO L290 TraceCheckUtils]: 57: Hoare triple {9023#true} ~cond := #in~cond; {9023#true} is VALID [2022-04-08 14:16:36,609 INFO L272 TraceCheckUtils]: 56: Hoare triple {9222#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9023#true} is VALID [2022-04-08 14:16:36,610 INFO L290 TraceCheckUtils]: 55: Hoare triple {9222#(<= ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {9222#(<= ~counter~0 8)} is VALID [2022-04-08 14:16:36,610 INFO L290 TraceCheckUtils]: 54: Hoare triple {9197#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9222#(<= ~counter~0 8)} is VALID [2022-04-08 14:16:36,610 INFO L290 TraceCheckUtils]: 53: Hoare triple {9197#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9197#(<= ~counter~0 7)} is VALID [2022-04-08 14:16:36,611 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {9023#true} {9197#(<= ~counter~0 7)} #51#return; {9197#(<= ~counter~0 7)} is VALID [2022-04-08 14:16:36,611 INFO L290 TraceCheckUtils]: 51: Hoare triple {9023#true} assume true; {9023#true} is VALID [2022-04-08 14:16:36,611 INFO L290 TraceCheckUtils]: 50: Hoare triple {9023#true} assume !(0 == ~cond); {9023#true} is VALID [2022-04-08 14:16:36,611 INFO L290 TraceCheckUtils]: 49: Hoare triple {9023#true} ~cond := #in~cond; {9023#true} is VALID [2022-04-08 14:16:36,611 INFO L272 TraceCheckUtils]: 48: Hoare triple {9197#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9023#true} is VALID [2022-04-08 14:16:36,612 INFO L290 TraceCheckUtils]: 47: Hoare triple {9197#(<= ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {9197#(<= ~counter~0 7)} is VALID [2022-04-08 14:16:36,612 INFO L290 TraceCheckUtils]: 46: Hoare triple {9172#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9197#(<= ~counter~0 7)} is VALID [2022-04-08 14:16:36,613 INFO L290 TraceCheckUtils]: 45: Hoare triple {9172#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9172#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:36,613 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {9023#true} {9172#(<= ~counter~0 6)} #51#return; {9172#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:36,613 INFO L290 TraceCheckUtils]: 43: Hoare triple {9023#true} assume true; {9023#true} is VALID [2022-04-08 14:16:36,613 INFO L290 TraceCheckUtils]: 42: Hoare triple {9023#true} assume !(0 == ~cond); {9023#true} is VALID [2022-04-08 14:16:36,613 INFO L290 TraceCheckUtils]: 41: Hoare triple {9023#true} ~cond := #in~cond; {9023#true} is VALID [2022-04-08 14:16:36,614 INFO L272 TraceCheckUtils]: 40: Hoare triple {9172#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9023#true} is VALID [2022-04-08 14:16:36,614 INFO L290 TraceCheckUtils]: 39: Hoare triple {9172#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {9172#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:36,614 INFO L290 TraceCheckUtils]: 38: Hoare triple {9147#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9172#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:36,615 INFO L290 TraceCheckUtils]: 37: Hoare triple {9147#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9147#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:36,615 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {9023#true} {9147#(<= ~counter~0 5)} #51#return; {9147#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:36,615 INFO L290 TraceCheckUtils]: 35: Hoare triple {9023#true} assume true; {9023#true} is VALID [2022-04-08 14:16:36,615 INFO L290 TraceCheckUtils]: 34: Hoare triple {9023#true} assume !(0 == ~cond); {9023#true} is VALID [2022-04-08 14:16:36,616 INFO L290 TraceCheckUtils]: 33: Hoare triple {9023#true} ~cond := #in~cond; {9023#true} is VALID [2022-04-08 14:16:36,616 INFO L272 TraceCheckUtils]: 32: Hoare triple {9147#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9023#true} is VALID [2022-04-08 14:16:36,616 INFO L290 TraceCheckUtils]: 31: Hoare triple {9147#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {9147#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:36,616 INFO L290 TraceCheckUtils]: 30: Hoare triple {9122#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9147#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:36,617 INFO L290 TraceCheckUtils]: 29: Hoare triple {9122#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9122#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:36,617 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {9023#true} {9122#(<= ~counter~0 4)} #51#return; {9122#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:36,617 INFO L290 TraceCheckUtils]: 27: Hoare triple {9023#true} assume true; {9023#true} is VALID [2022-04-08 14:16:36,618 INFO L290 TraceCheckUtils]: 26: Hoare triple {9023#true} assume !(0 == ~cond); {9023#true} is VALID [2022-04-08 14:16:36,618 INFO L290 TraceCheckUtils]: 25: Hoare triple {9023#true} ~cond := #in~cond; {9023#true} is VALID [2022-04-08 14:16:36,618 INFO L272 TraceCheckUtils]: 24: Hoare triple {9122#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9023#true} is VALID [2022-04-08 14:16:36,618 INFO L290 TraceCheckUtils]: 23: Hoare triple {9122#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {9122#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:36,619 INFO L290 TraceCheckUtils]: 22: Hoare triple {9097#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9122#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:36,619 INFO L290 TraceCheckUtils]: 21: Hoare triple {9097#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9097#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:36,620 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {9023#true} {9097#(<= ~counter~0 3)} #51#return; {9097#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:36,620 INFO L290 TraceCheckUtils]: 19: Hoare triple {9023#true} assume true; {9023#true} is VALID [2022-04-08 14:16:36,620 INFO L290 TraceCheckUtils]: 18: Hoare triple {9023#true} assume !(0 == ~cond); {9023#true} is VALID [2022-04-08 14:16:36,620 INFO L290 TraceCheckUtils]: 17: Hoare triple {9023#true} ~cond := #in~cond; {9023#true} is VALID [2022-04-08 14:16:36,620 INFO L272 TraceCheckUtils]: 16: Hoare triple {9097#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9023#true} is VALID [2022-04-08 14:16:36,620 INFO L290 TraceCheckUtils]: 15: Hoare triple {9097#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {9097#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:36,621 INFO L290 TraceCheckUtils]: 14: Hoare triple {9072#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9097#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:36,621 INFO L290 TraceCheckUtils]: 13: Hoare triple {9072#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9072#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:36,622 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {9023#true} {9072#(<= ~counter~0 2)} #51#return; {9072#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:36,622 INFO L290 TraceCheckUtils]: 11: Hoare triple {9023#true} assume true; {9023#true} is VALID [2022-04-08 14:16:36,622 INFO L290 TraceCheckUtils]: 10: Hoare triple {9023#true} assume !(0 == ~cond); {9023#true} is VALID [2022-04-08 14:16:36,622 INFO L290 TraceCheckUtils]: 9: Hoare triple {9023#true} ~cond := #in~cond; {9023#true} is VALID [2022-04-08 14:16:36,622 INFO L272 TraceCheckUtils]: 8: Hoare triple {9072#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9023#true} is VALID [2022-04-08 14:16:36,622 INFO L290 TraceCheckUtils]: 7: Hoare triple {9072#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {9072#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:36,623 INFO L290 TraceCheckUtils]: 6: Hoare triple {9047#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9072#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:36,623 INFO L290 TraceCheckUtils]: 5: Hoare triple {9047#(<= ~counter~0 1)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {9047#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:36,623 INFO L272 TraceCheckUtils]: 4: Hoare triple {9047#(<= ~counter~0 1)} call #t~ret6 := main(); {9047#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:36,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9047#(<= ~counter~0 1)} {9023#true} #57#return; {9047#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:36,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {9047#(<= ~counter~0 1)} assume true; {9047#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:36,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {9023#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);~counter~0 := 0; {9047#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:36,625 INFO L272 TraceCheckUtils]: 0: Hoare triple {9023#true} call ULTIMATE.init(); {9023#true} is VALID [2022-04-08 14:16:36,625 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 16 proven. 128 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-08 14:16:36,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:16:36,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918509304] [2022-04-08 14:16:36,625 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:16:36,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463565679] [2022-04-08 14:16:36,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463565679] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:16:36,626 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:16:36,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2022-04-08 14:16:36,626 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:16:36,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1641930734] [2022-04-08 14:16:36,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1641930734] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:16:36,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:16:36,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 14:16:36,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139147050] [2022-04-08 14:16:36,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:16:36,627 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 11 states have call successors, (11), 11 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 76 [2022-04-08 14:16:36,627 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:16:36,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 11 states have call successors, (11), 11 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:16:36,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:36,688 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 14:16:36,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:36,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 14:16:36,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 14:16:36,688 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 11 states have call successors, (11), 11 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:16:36,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:36,976 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2022-04-08 14:16:36,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 14:16:36,976 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 11 states have call successors, (11), 11 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 76 [2022-04-08 14:16:36,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:16:36,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 11 states have call successors, (11), 11 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:16:36,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 90 transitions. [2022-04-08 14:16:36,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 11 states have call successors, (11), 11 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:16:36,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 90 transitions. [2022-04-08 14:16:36,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 90 transitions. [2022-04-08 14:16:37,041 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:37,042 INFO L225 Difference]: With dead ends: 90 [2022-04-08 14:16:37,042 INFO L226 Difference]: Without dead ends: 85 [2022-04-08 14:16:37,042 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 138 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=175, Invalid=287, Unknown=0, NotChecked=0, Total=462 [2022-04-08 14:16:37,043 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:16:37,043 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 100 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:16:37,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-08 14:16:37,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-04-08 14:16:37,147 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:16:37,147 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 85 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 12 states have call successors, (12), 12 states have call predecessors, (12), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:16:37,147 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 85 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 12 states have call successors, (12), 12 states have call predecessors, (12), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:16:37,147 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 85 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 12 states have call successors, (12), 12 states have call predecessors, (12), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:16:37,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:37,148 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2022-04-08 14:16:37,149 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2022-04-08 14:16:37,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:37,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:37,149 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 12 states have call successors, (12), 12 states have call predecessors, (12), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 85 states. [2022-04-08 14:16:37,149 INFO L87 Difference]: Start difference. First operand has 85 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 12 states have call successors, (12), 12 states have call predecessors, (12), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 85 states. [2022-04-08 14:16:37,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:37,150 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2022-04-08 14:16:37,150 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2022-04-08 14:16:37,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:37,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:37,150 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:16:37,150 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:16:37,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 12 states have call successors, (12), 12 states have call predecessors, (12), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:16:37,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2022-04-08 14:16:37,151 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 76 [2022-04-08 14:16:37,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:16:37,152 INFO L478 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2022-04-08 14:16:37,152 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 11 states have call successors, (11), 11 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:16:37,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 86 transitions. [2022-04-08 14:16:37,245 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:37,245 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2022-04-08 14:16:37,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-08 14:16:37,245 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:16:37,245 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:16:37,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-04-08 14:16:37,446 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:37,446 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:16:37,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:16:37,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1500110401, now seen corresponding path program 15 times [2022-04-08 14:16:37,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:37,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1241895307] [2022-04-08 14:16:37,517 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:16:37,518 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:16:37,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1500110401, now seen corresponding path program 16 times [2022-04-08 14:16:37,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:16:37,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116643782] [2022-04-08 14:16:37,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:16:37,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:16:37,527 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:16:37,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1018031963] [2022-04-08 14:16:37,527 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:16:37,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:37,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:16:37,529 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:16:37,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-08 14:16:38,078 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:16:38,078 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:16:38,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-08 14:16:38,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:16:38,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:16:38,576 INFO L272 TraceCheckUtils]: 0: Hoare triple {10028#true} call ULTIMATE.init(); {10028#true} is VALID [2022-04-08 14:16:38,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {10028#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);~counter~0 := 0; {10028#true} is VALID [2022-04-08 14:16:38,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {10028#true} assume true; {10028#true} is VALID [2022-04-08 14:16:38,577 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10028#true} {10028#true} #57#return; {10028#true} is VALID [2022-04-08 14:16:38,577 INFO L272 TraceCheckUtils]: 4: Hoare triple {10028#true} call #t~ret6 := main(); {10028#true} is VALID [2022-04-08 14:16:38,577 INFO L290 TraceCheckUtils]: 5: Hoare triple {10028#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {10048#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:16:38,577 INFO L290 TraceCheckUtils]: 6: Hoare triple {10048#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10048#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:16:38,578 INFO L290 TraceCheckUtils]: 7: Hoare triple {10048#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {10048#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:16:38,578 INFO L272 TraceCheckUtils]: 8: Hoare triple {10048#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10028#true} is VALID [2022-04-08 14:16:38,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {10028#true} ~cond := #in~cond; {10028#true} is VALID [2022-04-08 14:16:38,578 INFO L290 TraceCheckUtils]: 10: Hoare triple {10028#true} assume !(0 == ~cond); {10028#true} is VALID [2022-04-08 14:16:38,578 INFO L290 TraceCheckUtils]: 11: Hoare triple {10028#true} assume true; {10028#true} is VALID [2022-04-08 14:16:38,579 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10028#true} {10048#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {10048#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:16:38,579 INFO L290 TraceCheckUtils]: 13: Hoare triple {10048#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10073#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 14:16:38,579 INFO L290 TraceCheckUtils]: 14: Hoare triple {10073#(and (= main_~y~0 1) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10073#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 14:16:38,580 INFO L290 TraceCheckUtils]: 15: Hoare triple {10073#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {10073#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 14:16:38,580 INFO L272 TraceCheckUtils]: 16: Hoare triple {10073#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10028#true} is VALID [2022-04-08 14:16:38,580 INFO L290 TraceCheckUtils]: 17: Hoare triple {10028#true} ~cond := #in~cond; {10028#true} is VALID [2022-04-08 14:16:38,580 INFO L290 TraceCheckUtils]: 18: Hoare triple {10028#true} assume !(0 == ~cond); {10028#true} is VALID [2022-04-08 14:16:38,580 INFO L290 TraceCheckUtils]: 19: Hoare triple {10028#true} assume true; {10028#true} is VALID [2022-04-08 14:16:38,580 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {10028#true} {10073#(and (= main_~y~0 1) (= main_~c~0 1))} #51#return; {10073#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 14:16:38,581 INFO L290 TraceCheckUtils]: 21: Hoare triple {10073#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10098#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 14:16:38,581 INFO L290 TraceCheckUtils]: 22: Hoare triple {10098#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10098#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 14:16:38,582 INFO L290 TraceCheckUtils]: 23: Hoare triple {10098#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(#t~post5 < 10);havoc #t~post5; {10098#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 14:16:38,582 INFO L272 TraceCheckUtils]: 24: Hoare triple {10098#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10028#true} is VALID [2022-04-08 14:16:38,582 INFO L290 TraceCheckUtils]: 25: Hoare triple {10028#true} ~cond := #in~cond; {10028#true} is VALID [2022-04-08 14:16:38,582 INFO L290 TraceCheckUtils]: 26: Hoare triple {10028#true} assume !(0 == ~cond); {10028#true} is VALID [2022-04-08 14:16:38,582 INFO L290 TraceCheckUtils]: 27: Hoare triple {10028#true} assume true; {10028#true} is VALID [2022-04-08 14:16:38,582 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {10028#true} {10098#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #51#return; {10098#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 14:16:38,583 INFO L290 TraceCheckUtils]: 29: Hoare triple {10098#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10123#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 14:16:38,583 INFO L290 TraceCheckUtils]: 30: Hoare triple {10123#(and (= main_~y~0 3) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10123#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 14:16:38,583 INFO L290 TraceCheckUtils]: 31: Hoare triple {10123#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(#t~post5 < 10);havoc #t~post5; {10123#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 14:16:38,584 INFO L272 TraceCheckUtils]: 32: Hoare triple {10123#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10028#true} is VALID [2022-04-08 14:16:38,584 INFO L290 TraceCheckUtils]: 33: Hoare triple {10028#true} ~cond := #in~cond; {10028#true} is VALID [2022-04-08 14:16:38,584 INFO L290 TraceCheckUtils]: 34: Hoare triple {10028#true} assume !(0 == ~cond); {10028#true} is VALID [2022-04-08 14:16:38,584 INFO L290 TraceCheckUtils]: 35: Hoare triple {10028#true} assume true; {10028#true} is VALID [2022-04-08 14:16:38,584 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {10028#true} {10123#(and (= main_~y~0 3) (= main_~c~0 3))} #51#return; {10123#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 14:16:38,585 INFO L290 TraceCheckUtils]: 37: Hoare triple {10123#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10148#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 14:16:38,585 INFO L290 TraceCheckUtils]: 38: Hoare triple {10148#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10148#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 14:16:38,585 INFO L290 TraceCheckUtils]: 39: Hoare triple {10148#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !!(#t~post5 < 10);havoc #t~post5; {10148#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 14:16:38,585 INFO L272 TraceCheckUtils]: 40: Hoare triple {10148#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10028#true} is VALID [2022-04-08 14:16:38,585 INFO L290 TraceCheckUtils]: 41: Hoare triple {10028#true} ~cond := #in~cond; {10028#true} is VALID [2022-04-08 14:16:38,586 INFO L290 TraceCheckUtils]: 42: Hoare triple {10028#true} assume !(0 == ~cond); {10028#true} is VALID [2022-04-08 14:16:38,586 INFO L290 TraceCheckUtils]: 43: Hoare triple {10028#true} assume true; {10028#true} is VALID [2022-04-08 14:16:38,586 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {10028#true} {10148#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #51#return; {10148#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 14:16:38,586 INFO L290 TraceCheckUtils]: 45: Hoare triple {10148#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10173#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 14:16:38,587 INFO L290 TraceCheckUtils]: 46: Hoare triple {10173#(and (= 5 main_~c~0) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10173#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 14:16:38,587 INFO L290 TraceCheckUtils]: 47: Hoare triple {10173#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(#t~post5 < 10);havoc #t~post5; {10173#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 14:16:38,587 INFO L272 TraceCheckUtils]: 48: Hoare triple {10173#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10028#true} is VALID [2022-04-08 14:16:38,587 INFO L290 TraceCheckUtils]: 49: Hoare triple {10028#true} ~cond := #in~cond; {10028#true} is VALID [2022-04-08 14:16:38,587 INFO L290 TraceCheckUtils]: 50: Hoare triple {10028#true} assume !(0 == ~cond); {10028#true} is VALID [2022-04-08 14:16:38,588 INFO L290 TraceCheckUtils]: 51: Hoare triple {10028#true} assume true; {10028#true} is VALID [2022-04-08 14:16:38,588 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10028#true} {10173#(and (= 5 main_~c~0) (= 5 main_~y~0))} #51#return; {10173#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 14:16:38,588 INFO L290 TraceCheckUtils]: 53: Hoare triple {10173#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10198#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 14:16:38,589 INFO L290 TraceCheckUtils]: 54: Hoare triple {10198#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10198#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 14:16:38,589 INFO L290 TraceCheckUtils]: 55: Hoare triple {10198#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !!(#t~post5 < 10);havoc #t~post5; {10198#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 14:16:38,589 INFO L272 TraceCheckUtils]: 56: Hoare triple {10198#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10028#true} is VALID [2022-04-08 14:16:38,589 INFO L290 TraceCheckUtils]: 57: Hoare triple {10028#true} ~cond := #in~cond; {10028#true} is VALID [2022-04-08 14:16:38,589 INFO L290 TraceCheckUtils]: 58: Hoare triple {10028#true} assume !(0 == ~cond); {10028#true} is VALID [2022-04-08 14:16:38,589 INFO L290 TraceCheckUtils]: 59: Hoare triple {10028#true} assume true; {10028#true} is VALID [2022-04-08 14:16:38,590 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {10028#true} {10198#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #51#return; {10198#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 14:16:38,590 INFO L290 TraceCheckUtils]: 61: Hoare triple {10198#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10223#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:16:38,591 INFO L290 TraceCheckUtils]: 62: Hoare triple {10223#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10223#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:16:38,591 INFO L290 TraceCheckUtils]: 63: Hoare triple {10223#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 10);havoc #t~post5; {10223#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:16:38,591 INFO L272 TraceCheckUtils]: 64: Hoare triple {10223#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10028#true} is VALID [2022-04-08 14:16:38,591 INFO L290 TraceCheckUtils]: 65: Hoare triple {10028#true} ~cond := #in~cond; {10028#true} is VALID [2022-04-08 14:16:38,591 INFO L290 TraceCheckUtils]: 66: Hoare triple {10028#true} assume !(0 == ~cond); {10028#true} is VALID [2022-04-08 14:16:38,591 INFO L290 TraceCheckUtils]: 67: Hoare triple {10028#true} assume true; {10028#true} is VALID [2022-04-08 14:16:38,592 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10028#true} {10223#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} #51#return; {10223#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:16:38,592 INFO L290 TraceCheckUtils]: 69: Hoare triple {10223#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10248#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} is VALID [2022-04-08 14:16:38,593 INFO L290 TraceCheckUtils]: 70: Hoare triple {10248#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10248#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} is VALID [2022-04-08 14:16:38,593 INFO L290 TraceCheckUtils]: 71: Hoare triple {10248#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} assume !!(#t~post5 < 10);havoc #t~post5; {10248#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} is VALID [2022-04-08 14:16:38,593 INFO L272 TraceCheckUtils]: 72: Hoare triple {10248#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10028#true} is VALID [2022-04-08 14:16:38,593 INFO L290 TraceCheckUtils]: 73: Hoare triple {10028#true} ~cond := #in~cond; {10028#true} is VALID [2022-04-08 14:16:38,593 INFO L290 TraceCheckUtils]: 74: Hoare triple {10028#true} assume !(0 == ~cond); {10028#true} is VALID [2022-04-08 14:16:38,593 INFO L290 TraceCheckUtils]: 75: Hoare triple {10028#true} assume true; {10028#true} is VALID [2022-04-08 14:16:38,594 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {10028#true} {10248#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} #51#return; {10248#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} is VALID [2022-04-08 14:16:38,594 INFO L290 TraceCheckUtils]: 77: Hoare triple {10248#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} assume !(~c~0 < ~k~0); {10273#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~k~0 8))} is VALID [2022-04-08 14:16:38,595 INFO L272 TraceCheckUtils]: 78: Hoare triple {10273#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~k~0 8))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10277#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:16:38,595 INFO L290 TraceCheckUtils]: 79: Hoare triple {10277#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10281#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:16:38,596 INFO L290 TraceCheckUtils]: 80: Hoare triple {10281#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10029#false} is VALID [2022-04-08 14:16:38,596 INFO L290 TraceCheckUtils]: 81: Hoare triple {10029#false} assume !false; {10029#false} is VALID [2022-04-08 14:16:38,596 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 18 proven. 144 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-08 14:16:38,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:16:38,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:16:38,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116643782] [2022-04-08 14:16:38,858 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:16:38,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018031963] [2022-04-08 14:16:38,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018031963] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:16:38,859 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:16:38,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-08 14:16:38,859 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:16:38,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1241895307] [2022-04-08 14:16:38,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1241895307] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:16:38,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:16:38,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 14:16:38,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365483320] [2022-04-08 14:16:38,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:16:38,860 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 82 [2022-04-08 14:16:38,860 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:16:38,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:16:38,902 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:38,902 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 14:16:38,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:38,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 14:16:38,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-08 14:16:38,903 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:16:39,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:39,734 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2022-04-08 14:16:39,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 14:16:39,735 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 82 [2022-04-08 14:16:39,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:16:39,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:16:39,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 69 transitions. [2022-04-08 14:16:39,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:16:39,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 69 transitions. [2022-04-08 14:16:39,739 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 69 transitions. [2022-04-08 14:16:39,788 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:39,790 INFO L225 Difference]: With dead ends: 92 [2022-04-08 14:16:39,790 INFO L226 Difference]: Without dead ends: 87 [2022-04-08 14:16:39,790 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-04-08 14:16:39,790 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 2 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 14:16:39,790 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 408 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 14:16:39,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-04-08 14:16:39,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-04-08 14:16:39,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:16:39,892 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 87 states, 63 states have (on average 1.0317460317460319) internal successors, (65), 63 states have internal predecessors, (65), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:16:39,892 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 87 states, 63 states have (on average 1.0317460317460319) internal successors, (65), 63 states have internal predecessors, (65), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:16:39,892 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 87 states, 63 states have (on average 1.0317460317460319) internal successors, (65), 63 states have internal predecessors, (65), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:16:39,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:39,893 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2022-04-08 14:16:39,893 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2022-04-08 14:16:39,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:39,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:39,894 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 63 states have (on average 1.0317460317460319) internal successors, (65), 63 states have internal predecessors, (65), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 87 states. [2022-04-08 14:16:39,894 INFO L87 Difference]: Start difference. First operand has 87 states, 63 states have (on average 1.0317460317460319) internal successors, (65), 63 states have internal predecessors, (65), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 87 states. [2022-04-08 14:16:39,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:39,895 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2022-04-08 14:16:39,895 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2022-04-08 14:16:39,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:39,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:39,895 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:16:39,895 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:16:39,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 63 states have (on average 1.0317460317460319) internal successors, (65), 63 states have internal predecessors, (65), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:16:39,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2022-04-08 14:16:39,897 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 82 [2022-04-08 14:16:39,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:16:39,897 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2022-04-08 14:16:39,897 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:16:39,897 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 89 transitions. [2022-04-08 14:16:40,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:40,017 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2022-04-08 14:16:40,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-08 14:16:40,017 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:16:40,017 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:16:40,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-04-08 14:16:40,218 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:40,218 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:16:40,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:16:40,218 INFO L85 PathProgramCache]: Analyzing trace with hash -2095421916, now seen corresponding path program 17 times [2022-04-08 14:16:40,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:40,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [657863588] [2022-04-08 14:16:40,293 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:16:40,293 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:16:40,293 INFO L85 PathProgramCache]: Analyzing trace with hash -2095421916, now seen corresponding path program 18 times [2022-04-08 14:16:40,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:16:40,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703229338] [2022-04-08 14:16:40,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:16:40,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:16:40,303 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:16:40,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1808559076] [2022-04-08 14:16:40,303 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:16:40,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:40,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:16:40,306 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:16:40,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process