/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-fb4f59a-m [2022-04-28 14:18:45,032 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 14:18:45,053 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 14:18:45,088 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 14:18:45,088 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 14:18:45,089 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 14:18:45,091 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 14:18:45,093 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 14:18:45,094 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 14:18:45,097 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 14:18:45,098 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 14:18:45,099 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 14:18:45,099 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 14:18:45,100 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 14:18:45,101 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 14:18:45,103 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 14:18:45,103 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 14:18:45,104 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 14:18:45,105 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 14:18:45,109 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 14:18:45,110 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 14:18:45,111 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 14:18:45,112 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 14:18:45,112 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 14:18:45,113 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 14:18:45,118 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 14:18:45,118 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 14:18:45,118 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 14:18:45,119 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 14:18:45,119 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 14:18:45,120 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 14:18:45,120 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 14:18:45,121 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 14:18:45,121 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 14:18:45,122 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 14:18:45,122 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 14:18:45,122 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 14:18:45,123 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 14:18:45,123 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 14:18:45,123 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 14:18:45,123 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 14:18:45,124 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 14:18:45,125 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 14:18:45,134 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 14:18:45,134 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 14:18:45,135 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 14:18:45,135 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 14:18:45,135 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 14:18:45,135 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 14:18:45,135 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 14:18:45,135 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 14:18:45,135 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 14:18:45,136 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 14:18:45,136 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 14:18:45,136 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 14:18:45,136 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 14:18:45,136 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 14:18:45,136 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 14:18:45,136 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 14:18:45,136 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 14:18:45,136 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 14:18:45,136 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 14:18:45,137 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 14:18:45,137 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 14:18:45,137 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 14:18:45,137 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 14:18:45,295 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 14:18:45,312 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 14:18:45,313 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 14:18:45,314 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 14:18:45,315 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 14:18:45,315 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-28 14:18:45,355 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/395b0b094/6b60eb1614fc455cbd567df7200209e5/FLAGb0c70a932 [2022-04-28 14:18:45,724 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 14:18:45,724 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound10.c [2022-04-28 14:18:45,729 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/395b0b094/6b60eb1614fc455cbd567df7200209e5/FLAGb0c70a932 [2022-04-28 14:18:45,739 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/395b0b094/6b60eb1614fc455cbd567df7200209e5 [2022-04-28 14:18:45,742 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 14:18:45,743 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 14:18:45,745 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 14:18:45,745 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 14:18:45,748 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 14:18:45,749 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:18:45" (1/1) ... [2022-04-28 14:18:45,749 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f4fbd3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:18:45, skipping insertion in model container [2022-04-28 14:18:45,750 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:18:45" (1/1) ... [2022-04-28 14:18:45,754 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 14:18:45,763 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 14:18:45,904 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-28 14:18:45,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 14:18:45,929 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 14:18:45,939 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-28 14:18:45,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 14:18:45,963 INFO L208 MainTranslator]: Completed translation [2022-04-28 14:18:45,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:18:45 WrapperNode [2022-04-28 14:18:45,963 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 14:18:45,964 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 14:18:45,964 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 14:18:45,964 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 14:18:45,971 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:18:45" (1/1) ... [2022-04-28 14:18:45,971 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:18:45" (1/1) ... [2022-04-28 14:18:45,975 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:18:45" (1/1) ... [2022-04-28 14:18:45,975 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:18:45" (1/1) ... [2022-04-28 14:18:45,984 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:18:45" (1/1) ... [2022-04-28 14:18:45,988 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:18:45" (1/1) ... [2022-04-28 14:18:45,989 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:18:45" (1/1) ... [2022-04-28 14:18:45,993 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 14:18:45,994 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 14:18:45,994 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 14:18:45,994 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 14:18:45,994 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:18:45" (1/1) ... [2022-04-28 14:18:45,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 14:18:46,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:18:46,014 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 14:18:46,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 14:18:46,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 14:18:46,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 14:18:46,045 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 14:18:46,045 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 14:18:46,045 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 14:18:46,045 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 14:18:46,045 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 14:18:46,046 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 14:18:46,046 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 14:18:46,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 14:18:46,046 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-28 14:18:46,046 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 14:18:46,046 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 14:18:46,046 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 14:18:46,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 14:18:46,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 14:18:46,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 14:18:46,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 14:18:46,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 14:18:46,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 14:18:46,090 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 14:18:46,091 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 14:18:46,167 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 14:18:46,171 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 14:18:46,171 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 14:18:46,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:18:46 BoogieIcfgContainer [2022-04-28 14:18:46,172 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 14:18:46,174 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 14:18:46,174 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 14:18:46,175 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 14:18:46,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 02:18:45" (1/3) ... [2022-04-28 14:18:46,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25af1666 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:18:46, skipping insertion in model container [2022-04-28 14:18:46,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:18:45" (2/3) ... [2022-04-28 14:18:46,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25af1666 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:18:46, skipping insertion in model container [2022-04-28 14:18:46,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:18:46" (3/3) ... [2022-04-28 14:18:46,177 INFO L111 eAbstractionObserver]: Analyzing ICFG ps4-ll_unwindbound10.c [2022-04-28 14:18:46,186 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 14:18:46,186 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 14:18:46,213 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 14:18:46,217 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@20b1f72, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4f9c2385 [2022-04-28 14:18:46,217 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 14:18:46,222 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-28 14:18:46,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 14:18:46,226 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:18:46,226 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:18:46,226 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:18:46,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:18:46,229 INFO L85 PathProgramCache]: Analyzing trace with hash -2133548928, now seen corresponding path program 1 times [2022-04-28 14:18:46,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:18:46,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1294295042] [2022-04-28 14:18:46,245 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:18:46,245 INFO L85 PathProgramCache]: Analyzing trace with hash -2133548928, now seen corresponding path program 2 times [2022-04-28 14:18:46,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:18:46,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489633371] [2022-04-28 14:18:46,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:18:46,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:18:46,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:18:46,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:18:46,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:18:46,420 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-28 14:18:46,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-28 14:18:46,421 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #57#return; {26#true} is VALID [2022-04-28 14:18:46,436 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-28 14:18:46,436 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-28 14:18:46,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-28 14:18:46,437 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #57#return; {26#true} is VALID [2022-04-28 14:18:46,437 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret6 := main(); {26#true} is VALID [2022-04-28 14:18:46,437 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-28 14:18:46,438 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} assume !true; {27#false} is VALID [2022-04-28 14:18:46,438 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-28 14:18:46,438 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2022-04-28 14:18:46,438 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2022-04-28 14:18:46,438 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-04-28 14:18:46,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:18:46,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:18:46,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489633371] [2022-04-28 14:18:46,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489633371] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:18:46,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:18:46,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 14:18:46,441 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:18:46,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1294295042] [2022-04-28 14:18:46,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1294295042] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:18:46,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:18:46,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 14:18:46,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816386271] [2022-04-28 14:18:46,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:18:46,445 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-28 14:18:46,446 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:18:46,448 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-28 14:18:46,476 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-28 14:18:46,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 14:18:46,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:18:46,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 14:18:46,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 14:18:46,496 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-28 14:18:46,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:18:46,609 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2022-04-28 14:18:46,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 14:18:46,609 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-28 14:18:46,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:18:46,610 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-28 14:18:46,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-28 14:18:46,622 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-28 14:18:46,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-28 14:18:46,629 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2022-04-28 14:18:46,696 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-28 14:18:46,704 INFO L225 Difference]: With dead ends: 41 [2022-04-28 14:18:46,705 INFO L226 Difference]: Without dead ends: 19 [2022-04-28 14:18:46,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 14:18:46,710 INFO L413 NwaCegarLoop]: 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-28 14:18:46,712 INFO L414 NwaCegarLoop]: 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-28 14:18:46,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-28 14:18:46,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-04-28 14:18:46,736 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:18:46,736 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-28 14:18:46,737 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-28 14:18:46,737 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-28 14:18:46,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:18:46,755 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-28 14:18:46,755 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-28 14:18:46,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:18:46,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:18:46,756 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-28 14:18:46,756 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-28 14:18:46,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:18:46,759 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-28 14:18:46,759 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-28 14:18:46,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:18:46,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:18:46,760 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:18:46,760 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:18:46,760 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-28 14:18:46,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-04-28 14:18:46,762 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 11 [2022-04-28 14:18:46,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:18:46,762 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-04-28 14:18:46,762 INFO L496 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-28 14:18:46,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 21 transitions. [2022-04-28 14:18:46,784 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-28 14:18:46,785 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-28 14:18:46,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 14:18:46,788 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:18:46,789 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:18:46,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 14:18:46,794 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:18:46,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:18:46,795 INFO L85 PathProgramCache]: Analyzing trace with hash -2118701623, now seen corresponding path program 1 times [2022-04-28 14:18:46,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:18:46,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1577419018] [2022-04-28 14:18:46,797 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:18:46,797 INFO L85 PathProgramCache]: Analyzing trace with hash -2118701623, now seen corresponding path program 2 times [2022-04-28 14:18:46,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:18:46,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115227401] [2022-04-28 14:18:46,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:18:46,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:18:46,825 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:18:46,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1040510141] [2022-04-28 14:18:46,825 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:18:46,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:18:46,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:18:46,832 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:18:46,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 14:18:46,875 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 14:18:46,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:18:46,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 14:18:46,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:18:46,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:18:47,025 INFO L272 TraceCheckUtils]: 0: Hoare triple {190#true} call ULTIMATE.init(); {190#true} is VALID [2022-04-28 14:18:47,026 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-28 14:18:47,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {198#(<= ~counter~0 0)} assume true; {198#(<= ~counter~0 0)} is VALID [2022-04-28 14:18:47,026 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {198#(<= ~counter~0 0)} {190#true} #57#return; {198#(<= ~counter~0 0)} is VALID [2022-04-28 14:18:47,028 INFO L272 TraceCheckUtils]: 4: Hoare triple {198#(<= ~counter~0 0)} call #t~ret6 := main(); {198#(<= ~counter~0 0)} is VALID [2022-04-28 14:18:47,028 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-28 14:18:47,029 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-28 14:18:47,029 INFO L290 TraceCheckUtils]: 7: Hoare triple {214#(<= |main_#t~post5| 0)} assume !(#t~post5 < 10);havoc #t~post5; {191#false} is VALID [2022-04-28 14:18:47,029 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-28 14:18:47,030 INFO L290 TraceCheckUtils]: 9: Hoare triple {191#false} ~cond := #in~cond; {191#false} is VALID [2022-04-28 14:18:47,030 INFO L290 TraceCheckUtils]: 10: Hoare triple {191#false} assume 0 == ~cond; {191#false} is VALID [2022-04-28 14:18:47,030 INFO L290 TraceCheckUtils]: 11: Hoare triple {191#false} assume !false; {191#false} is VALID [2022-04-28 14:18:47,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:18:47,030 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 14:18:47,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:18:47,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115227401] [2022-04-28 14:18:47,030 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:18:47,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040510141] [2022-04-28 14:18:47,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040510141] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:18:47,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:18:47,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:18:47,031 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:18:47,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1577419018] [2022-04-28 14:18:47,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1577419018] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:18:47,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:18:47,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:18:47,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143456141] [2022-04-28 14:18:47,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:18:47,032 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-28 14:18:47,032 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:18:47,033 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-28 14:18:47,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:18:47,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:18:47,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:18:47,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:18:47,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:18:47,046 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-28 14:18:47,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:18:47,095 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-28 14:18:47,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:18:47,096 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-28 14:18:47,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:18:47,096 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-28 14:18:47,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-04-28 14:18:47,100 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-28 14:18:47,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-04-28 14:18:47,109 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 32 transitions. [2022-04-28 14:18:47,128 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:18:47,130 INFO L225 Difference]: With dead ends: 28 [2022-04-28 14:18:47,130 INFO L226 Difference]: Without dead ends: 20 [2022-04-28 14:18:47,130 INFO L412 NwaCegarLoop]: 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-28 14:18:47,132 INFO L413 NwaCegarLoop]: 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-28 14:18:47,136 INFO L414 NwaCegarLoop]: 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-28 14:18:47,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-28 14:18:47,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-28 14:18:47,146 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:18:47,147 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-28 14:18:47,148 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-28 14:18:47,148 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-28 14:18:47,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:18:47,150 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-28 14:18:47,150 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-28 14:18:47,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:18:47,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:18:47,151 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-28 14:18:47,152 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-28 14:18:47,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:18:47,155 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-28 14:18:47,155 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-28 14:18:47,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:18:47,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:18:47,156 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:18:47,156 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:18:47,156 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-28 14:18:47,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-04-28 14:18:47,158 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 12 [2022-04-28 14:18:47,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:18:47,158 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-04-28 14:18:47,158 INFO L496 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-28 14:18:47,158 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 23 transitions. [2022-04-28 14:18:47,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:18:47,174 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-28 14:18:47,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 14:18:47,175 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:18:47,175 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:18:47,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 14:18:47,390 WARN L477 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-28 14:18:47,390 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:18:47,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:18:47,391 INFO L85 PathProgramCache]: Analyzing trace with hash -2116914163, now seen corresponding path program 1 times [2022-04-28 14:18:47,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:18:47,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1180154110] [2022-04-28 14:18:47,392 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:18:47,392 INFO L85 PathProgramCache]: Analyzing trace with hash -2116914163, now seen corresponding path program 2 times [2022-04-28 14:18:47,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:18:47,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335836978] [2022-04-28 14:18:47,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:18:47,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:18:47,411 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:18:47,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1608323089] [2022-04-28 14:18:47,411 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:18:47,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:18:47,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:18:47,414 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:18:47,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 14:18:47,448 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 14:18:47,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:18:47,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 14:18:47,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:18:47,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:18:47,544 INFO L272 TraceCheckUtils]: 0: Hoare triple {365#true} call ULTIMATE.init(); {365#true} is VALID [2022-04-28 14:18:47,544 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-28 14:18:47,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {365#true} assume true; {365#true} is VALID [2022-04-28 14:18:47,545 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {365#true} {365#true} #57#return; {365#true} is VALID [2022-04-28 14:18:47,545 INFO L272 TraceCheckUtils]: 4: Hoare triple {365#true} call #t~ret6 := main(); {365#true} is VALID [2022-04-28 14:18:47,545 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-28 14:18:47,546 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-28 14:18:47,546 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-28 14:18:47,547 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-28 14:18:47,548 INFO L290 TraceCheckUtils]: 9: Hoare triple {395#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {399#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:18:47,548 INFO L290 TraceCheckUtils]: 10: Hoare triple {399#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {366#false} is VALID [2022-04-28 14:18:47,548 INFO L290 TraceCheckUtils]: 11: Hoare triple {366#false} assume !false; {366#false} is VALID [2022-04-28 14:18:47,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:18:47,549 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 14:18:47,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:18:47,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335836978] [2022-04-28 14:18:47,549 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:18:47,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608323089] [2022-04-28 14:18:47,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608323089] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:18:47,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:18:47,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:18:47,551 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:18:47,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1180154110] [2022-04-28 14:18:47,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1180154110] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:18:47,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:18:47,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:18:47,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087731088] [2022-04-28 14:18:47,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:18:47,552 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 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-28 14:18:47,552 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:18:47,552 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-28 14:18:47,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:18:47,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:18:47,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:18:47,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:18:47,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 14:18:47,560 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-28 14:18:47,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:18:47,661 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-28 14:18:47,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:18:47,661 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-28 14:18:47,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:18:47,661 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-28 14:18:47,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-28 14:18:47,663 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-28 14:18:47,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-28 14:18:47,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 35 transitions. [2022-04-28 14:18:47,689 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-28 14:18:47,690 INFO L225 Difference]: With dead ends: 30 [2022-04-28 14:18:47,690 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 14:18:47,691 INFO L412 NwaCegarLoop]: 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-28 14:18:47,691 INFO L413 NwaCegarLoop]: 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-28 14:18:47,691 INFO L414 NwaCegarLoop]: 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-28 14:18:47,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 14:18:47,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-28 14:18:47,702 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:18:47,702 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-28 14:18:47,702 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-28 14:18:47,703 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-28 14:18:47,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:18:47,704 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-28 14:18:47,704 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-28 14:18:47,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:18:47,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:18:47,705 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-28 14:18:47,705 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-28 14:18:47,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:18:47,706 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-28 14:18:47,707 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-28 14:18:47,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:18:47,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:18:47,707 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:18:47,707 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:18:47,707 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-28 14:18:47,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-04-28 14:18:47,708 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 12 [2022-04-28 14:18:47,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:18:47,709 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-04-28 14:18:47,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 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-28 14:18:47,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 29 transitions. [2022-04-28 14:18:47,753 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-28 14:18:47,754 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-28 14:18:47,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 14:18:47,754 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:18:47,754 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:18:47,789 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-28 14:18:47,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-28 14:18:47,957 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:18:47,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:18:47,957 INFO L85 PathProgramCache]: Analyzing trace with hash -263585780, now seen corresponding path program 1 times [2022-04-28 14:18:47,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:18:47,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1178086627] [2022-04-28 14:18:48,112 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:18:48,112 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:18:48,112 INFO L85 PathProgramCache]: Analyzing trace with hash -263585780, now seen corresponding path program 2 times [2022-04-28 14:18:48,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:18:48,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840565902] [2022-04-28 14:18:48,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:18:48,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:18:48,121 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:18:48,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1289651949] [2022-04-28 14:18:48,121 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:18:48,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:18:48,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:18:48,122 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:18:48,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 14:18:48,154 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:18:48,154 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:18:48,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 14:18:48,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:18:48,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:18:48,268 INFO L272 TraceCheckUtils]: 0: Hoare triple {571#true} call ULTIMATE.init(); {571#true} is VALID [2022-04-28 14:18:48,270 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-28 14:18:48,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {579#(<= ~counter~0 0)} assume true; {579#(<= ~counter~0 0)} is VALID [2022-04-28 14:18:48,271 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {579#(<= ~counter~0 0)} {571#true} #57#return; {579#(<= ~counter~0 0)} is VALID [2022-04-28 14:18:48,271 INFO L272 TraceCheckUtils]: 4: Hoare triple {579#(<= ~counter~0 0)} call #t~ret6 := main(); {579#(<= ~counter~0 0)} is VALID [2022-04-28 14:18:48,271 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-28 14:18:48,273 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-28 14:18:48,274 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-28 14:18:48,277 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-28 14:18:48,277 INFO L290 TraceCheckUtils]: 9: Hoare triple {595#(<= ~counter~0 1)} ~cond := #in~cond; {595#(<= ~counter~0 1)} is VALID [2022-04-28 14:18:48,278 INFO L290 TraceCheckUtils]: 10: Hoare triple {595#(<= ~counter~0 1)} assume !(0 == ~cond); {595#(<= ~counter~0 1)} is VALID [2022-04-28 14:18:48,279 INFO L290 TraceCheckUtils]: 11: Hoare triple {595#(<= ~counter~0 1)} assume true; {595#(<= ~counter~0 1)} is VALID [2022-04-28 14:18:48,279 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {595#(<= ~counter~0 1)} {595#(<= ~counter~0 1)} #51#return; {595#(<= ~counter~0 1)} is VALID [2022-04-28 14:18:48,280 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-28 14:18:48,280 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-28 14:18:48,281 INFO L290 TraceCheckUtils]: 15: Hoare triple {620#(<= |main_#t~post5| 1)} assume !(#t~post5 < 10);havoc #t~post5; {572#false} is VALID [2022-04-28 14:18:48,281 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-28 14:18:48,281 INFO L290 TraceCheckUtils]: 17: Hoare triple {572#false} ~cond := #in~cond; {572#false} is VALID [2022-04-28 14:18:48,281 INFO L290 TraceCheckUtils]: 18: Hoare triple {572#false} assume 0 == ~cond; {572#false} is VALID [2022-04-28 14:18:48,281 INFO L290 TraceCheckUtils]: 19: Hoare triple {572#false} assume !false; {572#false} is VALID [2022-04-28 14:18:48,282 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-28 14:18:48,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:18:48,392 INFO L290 TraceCheckUtils]: 19: Hoare triple {572#false} assume !false; {572#false} is VALID [2022-04-28 14:18:48,393 INFO L290 TraceCheckUtils]: 18: Hoare triple {572#false} assume 0 == ~cond; {572#false} is VALID [2022-04-28 14:18:48,393 INFO L290 TraceCheckUtils]: 17: Hoare triple {572#false} ~cond := #in~cond; {572#false} is VALID [2022-04-28 14:18:48,393 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-28 14:18:48,393 INFO L290 TraceCheckUtils]: 15: Hoare triple {648#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {572#false} is VALID [2022-04-28 14:18:48,394 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-28 14:18:48,394 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-28 14:18:48,394 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {571#true} {652#(< ~counter~0 10)} #51#return; {652#(< ~counter~0 10)} is VALID [2022-04-28 14:18:48,395 INFO L290 TraceCheckUtils]: 11: Hoare triple {571#true} assume true; {571#true} is VALID [2022-04-28 14:18:48,395 INFO L290 TraceCheckUtils]: 10: Hoare triple {571#true} assume !(0 == ~cond); {571#true} is VALID [2022-04-28 14:18:48,395 INFO L290 TraceCheckUtils]: 9: Hoare triple {571#true} ~cond := #in~cond; {571#true} is VALID [2022-04-28 14:18:48,395 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-28 14:18:48,395 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-28 14:18:48,396 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-28 14:18:48,396 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-28 14:18:48,396 INFO L272 TraceCheckUtils]: 4: Hoare triple {677#(< ~counter~0 9)} call #t~ret6 := main(); {677#(< ~counter~0 9)} is VALID [2022-04-28 14:18:48,397 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {677#(< ~counter~0 9)} {571#true} #57#return; {677#(< ~counter~0 9)} is VALID [2022-04-28 14:18:48,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {677#(< ~counter~0 9)} assume true; {677#(< ~counter~0 9)} is VALID [2022-04-28 14:18:48,397 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-28 14:18:48,397 INFO L272 TraceCheckUtils]: 0: Hoare triple {571#true} call ULTIMATE.init(); {571#true} is VALID [2022-04-28 14:18:48,398 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-28 14:18:48,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:18:48,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840565902] [2022-04-28 14:18:48,398 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:18:48,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289651949] [2022-04-28 14:18:48,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289651949] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:18:48,398 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:18:48,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-28 14:18:48,398 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:18:48,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1178086627] [2022-04-28 14:18:48,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1178086627] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:18:48,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:18:48,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:18:48,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840056955] [2022-04-28 14:18:48,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:18:48,399 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-28 14:18:48,399 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:18:48,399 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-28 14:18:48,411 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:18:48,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:18:48,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:18:48,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:18:48,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-28 14:18:48,412 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-28 14:18:48,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:18:48,479 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-04-28 14:18:48,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 14:18:48,480 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-28 14:18:48,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:18:48,480 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-28 14:18:48,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-28 14:18:48,481 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-28 14:18:48,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-28 14:18:48,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-04-28 14:18:48,510 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-28 14:18:48,511 INFO L225 Difference]: With dead ends: 36 [2022-04-28 14:18:48,511 INFO L226 Difference]: Without dead ends: 28 [2022-04-28 14:18:48,511 INFO L412 NwaCegarLoop]: 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-28 14:18:48,513 INFO L413 NwaCegarLoop]: 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-28 14:18:48,513 INFO L414 NwaCegarLoop]: 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-28 14:18:48,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-28 14:18:48,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-28 14:18:48,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:18:48,530 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-28 14:18:48,530 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-28 14:18:48,531 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-28 14:18:48,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:18:48,532 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-04-28 14:18:48,532 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-04-28 14:18:48,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:18:48,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:18:48,532 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-28 14:18:48,532 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-28 14:18:48,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:18:48,533 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-04-28 14:18:48,533 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-04-28 14:18:48,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:18:48,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:18:48,534 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:18:48,534 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:18:48,534 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-28 14:18:48,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-04-28 14:18:48,535 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 20 [2022-04-28 14:18:48,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:18:48,535 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-04-28 14:18:48,535 INFO L496 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-28 14:18:48,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 31 transitions. [2022-04-28 14:18:48,562 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-28 14:18:48,562 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-04-28 14:18:48,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 14:18:48,564 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:18:48,564 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:18:48,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 14:18:48,775 WARN L477 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-28 14:18:48,775 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:18:48,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:18:48,776 INFO L85 PathProgramCache]: Analyzing trace with hash -261798320, now seen corresponding path program 1 times [2022-04-28 14:18:48,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:18:48,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [232635241] [2022-04-28 14:18:48,886 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:18:48,886 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:18:48,886 INFO L85 PathProgramCache]: Analyzing trace with hash -261798320, now seen corresponding path program 2 times [2022-04-28 14:18:48,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:18:48,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356621303] [2022-04-28 14:18:48,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:18:48,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:18:48,903 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:18:48,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1779931928] [2022-04-28 14:18:48,904 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:18:48,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:18:48,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:18:48,905 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:18:48,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 14:18:48,936 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:18:48,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:18:48,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 14:18:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:18:48,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:18:49,038 INFO L272 TraceCheckUtils]: 0: Hoare triple {884#true} call ULTIMATE.init(); {884#true} is VALID [2022-04-28 14:18:49,038 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-28 14:18:49,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {884#true} assume true; {884#true} is VALID [2022-04-28 14:18:49,038 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {884#true} {884#true} #57#return; {884#true} is VALID [2022-04-28 14:18:49,038 INFO L272 TraceCheckUtils]: 4: Hoare triple {884#true} call #t~ret6 := main(); {884#true} is VALID [2022-04-28 14:18:49,039 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-28 14:18:49,039 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-28 14:18:49,039 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-28 14:18:49,040 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-28 14:18:49,040 INFO L290 TraceCheckUtils]: 9: Hoare triple {884#true} ~cond := #in~cond; {884#true} is VALID [2022-04-28 14:18:49,040 INFO L290 TraceCheckUtils]: 10: Hoare triple {884#true} assume !(0 == ~cond); {884#true} is VALID [2022-04-28 14:18:49,040 INFO L290 TraceCheckUtils]: 11: Hoare triple {884#true} assume true; {884#true} is VALID [2022-04-28 14:18:49,041 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-28 14:18:49,041 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-28 14:18:49,042 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-28 14:18:49,042 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-28 14:18:49,043 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-28 14:18:49,043 INFO L290 TraceCheckUtils]: 17: Hoare triple {939#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {943#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:18:49,043 INFO L290 TraceCheckUtils]: 18: Hoare triple {943#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {885#false} is VALID [2022-04-28 14:18:49,043 INFO L290 TraceCheckUtils]: 19: Hoare triple {885#false} assume !false; {885#false} is VALID [2022-04-28 14:18:49,044 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-28 14:18:49,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:18:49,200 INFO L290 TraceCheckUtils]: 19: Hoare triple {885#false} assume !false; {885#false} is VALID [2022-04-28 14:18:49,201 INFO L290 TraceCheckUtils]: 18: Hoare triple {943#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {885#false} is VALID [2022-04-28 14:18:49,201 INFO L290 TraceCheckUtils]: 17: Hoare triple {939#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {943#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:18:49,202 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-28 14:18:49,203 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-28 14:18:49,203 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-28 14:18:49,210 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-28 14:18:49,211 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-28 14:18:49,211 INFO L290 TraceCheckUtils]: 11: Hoare triple {884#true} assume true; {884#true} is VALID [2022-04-28 14:18:49,211 INFO L290 TraceCheckUtils]: 10: Hoare triple {884#true} assume !(0 == ~cond); {884#true} is VALID [2022-04-28 14:18:49,211 INFO L290 TraceCheckUtils]: 9: Hoare triple {884#true} ~cond := #in~cond; {884#true} is VALID [2022-04-28 14:18:49,211 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-28 14:18:49,212 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-28 14:18:49,212 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-28 14:18:49,213 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-28 14:18:49,213 INFO L272 TraceCheckUtils]: 4: Hoare triple {884#true} call #t~ret6 := main(); {884#true} is VALID [2022-04-28 14:18:49,213 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {884#true} {884#true} #57#return; {884#true} is VALID [2022-04-28 14:18:49,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {884#true} assume true; {884#true} is VALID [2022-04-28 14:18:49,213 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-28 14:18:49,213 INFO L272 TraceCheckUtils]: 0: Hoare triple {884#true} call ULTIMATE.init(); {884#true} is VALID [2022-04-28 14:18:49,213 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-28 14:18:49,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:18:49,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356621303] [2022-04-28 14:18:49,214 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:18:49,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779931928] [2022-04-28 14:18:49,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779931928] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 14:18:49,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:18:49,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-28 14:18:49,214 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:18:49,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [232635241] [2022-04-28 14:18:49,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [232635241] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:18:49,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:18:49,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:18:49,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806834740] [2022-04-28 14:18:49,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:18:49,215 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-28 14:18:49,215 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:18:49,215 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-28 14:18:49,234 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-28 14:18:49,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:18:49,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:18:49,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:18:49,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 14:18:49,235 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-28 14:18:49,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:18:49,325 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-28 14:18:49,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:18:49,325 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-28 14:18:49,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:18:49,326 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-28 14:18:49,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-04-28 14:18:49,326 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-28 14:18:49,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-04-28 14:18:49,327 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 26 transitions. [2022-04-28 14:18:49,354 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-28 14:18:49,355 INFO L225 Difference]: With dead ends: 34 [2022-04-28 14:18:49,355 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 14:18:49,355 INFO L412 NwaCegarLoop]: 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-28 14:18:49,356 INFO L413 NwaCegarLoop]: 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-28 14:18:49,356 INFO L414 NwaCegarLoop]: 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-28 14:18:49,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 14:18:49,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-28 14:18:49,372 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:18:49,373 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-28 14:18:49,373 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-28 14:18:49,373 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-28 14:18:49,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:18:49,374 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-28 14:18:49,374 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-28 14:18:49,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:18:49,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:18:49,374 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-28 14:18:49,374 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-28 14:18:49,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:18:49,375 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-28 14:18:49,375 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-28 14:18:49,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:18:49,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:18:49,375 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:18:49,375 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:18:49,376 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-28 14:18:49,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2022-04-28 14:18:49,376 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 20 [2022-04-28 14:18:49,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:18:49,376 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2022-04-28 14:18:49,377 INFO L496 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-28 14:18:49,377 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 30 transitions. [2022-04-28 14:18:49,408 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-28 14:18:49,408 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-28 14:18:49,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 14:18:49,408 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:18:49,408 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:18:49,427 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-28 14:18:49,609 WARN L477 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-28 14:18:49,609 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:18:49,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:18:49,610 INFO L85 PathProgramCache]: Analyzing trace with hash 891414954, now seen corresponding path program 1 times [2022-04-28 14:18:49,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:18:49,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [760639245] [2022-04-28 14:18:49,731 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:18:49,731 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:18:49,731 INFO L85 PathProgramCache]: Analyzing trace with hash 891414954, now seen corresponding path program 2 times [2022-04-28 14:18:49,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:18:49,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690070661] [2022-04-28 14:18:49,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:18:49,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:18:49,741 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:18:49,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1110848409] [2022-04-28 14:18:49,742 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:18:49,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:18:49,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:18:49,756 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:18:49,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 14:18:49,806 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:18:49,807 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:18:49,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 14:18:49,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:18:49,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:18:50,086 INFO L272 TraceCheckUtils]: 0: Hoare triple {1196#true} call ULTIMATE.init(); {1196#true} is VALID [2022-04-28 14:18:50,087 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-28 14:18:50,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {1196#true} assume true; {1196#true} is VALID [2022-04-28 14:18:50,087 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1196#true} {1196#true} #57#return; {1196#true} is VALID [2022-04-28 14:18:50,087 INFO L272 TraceCheckUtils]: 4: Hoare triple {1196#true} call #t~ret6 := main(); {1196#true} is VALID [2022-04-28 14:18:50,095 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-28 14:18:50,096 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-28 14:18:50,097 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-28 14:18:50,097 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-28 14:18:50,097 INFO L290 TraceCheckUtils]: 9: Hoare triple {1196#true} ~cond := #in~cond; {1196#true} is VALID [2022-04-28 14:18:50,097 INFO L290 TraceCheckUtils]: 10: Hoare triple {1196#true} assume !(0 == ~cond); {1196#true} is VALID [2022-04-28 14:18:50,097 INFO L290 TraceCheckUtils]: 11: Hoare triple {1196#true} assume true; {1196#true} is VALID [2022-04-28 14:18:50,098 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-28 14:18:50,098 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-28 14:18:50,099 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-28 14:18:50,099 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-28 14:18:50,100 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-28 14:18:50,100 INFO L290 TraceCheckUtils]: 17: Hoare triple {1196#true} ~cond := #in~cond; {1196#true} is VALID [2022-04-28 14:18:50,100 INFO L290 TraceCheckUtils]: 18: Hoare triple {1196#true} assume !(0 == ~cond); {1196#true} is VALID [2022-04-28 14:18:50,100 INFO L290 TraceCheckUtils]: 19: Hoare triple {1196#true} assume true; {1196#true} is VALID [2022-04-28 14:18:50,101 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-28 14:18:50,101 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-28 14:18:50,102 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-28 14:18:50,103 INFO L290 TraceCheckUtils]: 23: Hoare triple {1270#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1274#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:18:50,103 INFO L290 TraceCheckUtils]: 24: Hoare triple {1274#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1197#false} is VALID [2022-04-28 14:18:50,103 INFO L290 TraceCheckUtils]: 25: Hoare triple {1197#false} assume !false; {1197#false} is VALID [2022-04-28 14:18:50,103 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-28 14:18:50,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:18:50,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:18:50,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690070661] [2022-04-28 14:18:50,387 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:18:50,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110848409] [2022-04-28 14:18:50,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110848409] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:18:50,387 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:18:50,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-28 14:18:50,387 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:18:50,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [760639245] [2022-04-28 14:18:50,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [760639245] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:18:50,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:18:50,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 14:18:50,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902596154] [2022-04-28 14:18:50,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:18:50,388 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-28 14:18:50,388 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:18:50,388 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-28 14:18:50,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:18:50,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 14:18:50,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:18:50,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 14:18:50,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 14:18:50,407 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-28 14:18:50,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:18:50,575 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-28 14:18:50,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 14:18:50,575 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-28 14:18:50,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:18:50,575 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-28 14:18:50,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-04-28 14:18:50,576 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-28 14:18:50,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-04-28 14:18:50,577 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 34 transitions. [2022-04-28 14:18:50,601 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-28 14:18:50,602 INFO L225 Difference]: With dead ends: 36 [2022-04-28 14:18:50,602 INFO L226 Difference]: Without dead ends: 31 [2022-04-28 14:18:50,602 INFO L412 NwaCegarLoop]: 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-28 14:18:50,603 INFO L413 NwaCegarLoop]: 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-28 14:18:50,603 INFO L414 NwaCegarLoop]: 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-28 14:18:50,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-28 14:18:50,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-28 14:18:50,628 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:18:50,628 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-28 14:18:50,628 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-28 14:18:50,628 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-28 14:18:50,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:18:50,629 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-04-28 14:18:50,629 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-28 14:18:50,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:18:50,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:18:50,630 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-28 14:18:50,630 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-28 14:18:50,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:18:50,631 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-04-28 14:18:50,631 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-28 14:18:50,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:18:50,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:18:50,631 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:18:50,631 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:18:50,631 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-28 14:18:50,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2022-04-28 14:18:50,632 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 26 [2022-04-28 14:18:50,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:18:50,632 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2022-04-28 14:18:50,632 INFO L496 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-28 14:18:50,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 33 transitions. [2022-04-28 14:18:50,667 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-28 14:18:50,667 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-28 14:18:50,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 14:18:50,668 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:18:50,668 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:18:50,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 14:18:50,868 WARN L477 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-28 14:18:50,869 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:18:50,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:18:50,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1647059121, now seen corresponding path program 3 times [2022-04-28 14:18:50,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:18:50,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [516572392] [2022-04-28 14:18:50,973 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:18:50,973 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:18:50,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1647059121, now seen corresponding path program 4 times [2022-04-28 14:18:50,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:18:50,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71198608] [2022-04-28 14:18:50,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:18:50,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:18:50,980 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:18:50,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [979219702] [2022-04-28 14:18:50,980 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:18:50,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:18:50,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:18:50,981 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:18:51,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 14:18:51,022 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:18:51,023 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:18:51,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 14:18:51,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:18:51,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:18:51,179 INFO L272 TraceCheckUtils]: 0: Hoare triple {1525#true} call ULTIMATE.init(); {1525#true} is VALID [2022-04-28 14:18:51,180 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-28 14:18:51,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {1533#(<= ~counter~0 0)} assume true; {1533#(<= ~counter~0 0)} is VALID [2022-04-28 14:18:51,180 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1533#(<= ~counter~0 0)} {1525#true} #57#return; {1533#(<= ~counter~0 0)} is VALID [2022-04-28 14:18:51,181 INFO L272 TraceCheckUtils]: 4: Hoare triple {1533#(<= ~counter~0 0)} call #t~ret6 := main(); {1533#(<= ~counter~0 0)} is VALID [2022-04-28 14:18:51,181 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-28 14:18:51,181 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-28 14:18:51,183 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-28 14:18:51,183 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-28 14:18:51,183 INFO L290 TraceCheckUtils]: 9: Hoare triple {1549#(<= ~counter~0 1)} ~cond := #in~cond; {1549#(<= ~counter~0 1)} is VALID [2022-04-28 14:18:51,184 INFO L290 TraceCheckUtils]: 10: Hoare triple {1549#(<= ~counter~0 1)} assume !(0 == ~cond); {1549#(<= ~counter~0 1)} is VALID [2022-04-28 14:18:51,184 INFO L290 TraceCheckUtils]: 11: Hoare triple {1549#(<= ~counter~0 1)} assume true; {1549#(<= ~counter~0 1)} is VALID [2022-04-28 14:18:51,185 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1549#(<= ~counter~0 1)} {1549#(<= ~counter~0 1)} #51#return; {1549#(<= ~counter~0 1)} is VALID [2022-04-28 14:18:51,185 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-28 14:18:51,185 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-28 14:18:51,186 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-28 14:18:51,186 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-28 14:18:51,186 INFO L290 TraceCheckUtils]: 17: Hoare triple {1574#(<= ~counter~0 2)} ~cond := #in~cond; {1574#(<= ~counter~0 2)} is VALID [2022-04-28 14:18:51,187 INFO L290 TraceCheckUtils]: 18: Hoare triple {1574#(<= ~counter~0 2)} assume !(0 == ~cond); {1574#(<= ~counter~0 2)} is VALID [2022-04-28 14:18:51,187 INFO L290 TraceCheckUtils]: 19: Hoare triple {1574#(<= ~counter~0 2)} assume true; {1574#(<= ~counter~0 2)} is VALID [2022-04-28 14:18:51,187 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1574#(<= ~counter~0 2)} {1574#(<= ~counter~0 2)} #51#return; {1574#(<= ~counter~0 2)} is VALID [2022-04-28 14:18:51,187 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-28 14:18:51,188 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-28 14:18:51,188 INFO L290 TraceCheckUtils]: 23: Hoare triple {1599#(<= |main_#t~post5| 2)} assume !(#t~post5 < 10);havoc #t~post5; {1526#false} is VALID [2022-04-28 14:18:51,188 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-28 14:18:51,188 INFO L290 TraceCheckUtils]: 25: Hoare triple {1526#false} ~cond := #in~cond; {1526#false} is VALID [2022-04-28 14:18:51,188 INFO L290 TraceCheckUtils]: 26: Hoare triple {1526#false} assume 0 == ~cond; {1526#false} is VALID [2022-04-28 14:18:51,188 INFO L290 TraceCheckUtils]: 27: Hoare triple {1526#false} assume !false; {1526#false} is VALID [2022-04-28 14:18:51,189 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-28 14:18:51,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:18:51,368 INFO L290 TraceCheckUtils]: 27: Hoare triple {1526#false} assume !false; {1526#false} is VALID [2022-04-28 14:18:51,369 INFO L290 TraceCheckUtils]: 26: Hoare triple {1526#false} assume 0 == ~cond; {1526#false} is VALID [2022-04-28 14:18:51,369 INFO L290 TraceCheckUtils]: 25: Hoare triple {1526#false} ~cond := #in~cond; {1526#false} is VALID [2022-04-28 14:18:51,369 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-28 14:18:51,369 INFO L290 TraceCheckUtils]: 23: Hoare triple {1627#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {1526#false} is VALID [2022-04-28 14:18:51,370 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-28 14:18:51,370 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-28 14:18:51,371 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1525#true} {1631#(< ~counter~0 10)} #51#return; {1631#(< ~counter~0 10)} is VALID [2022-04-28 14:18:51,371 INFO L290 TraceCheckUtils]: 19: Hoare triple {1525#true} assume true; {1525#true} is VALID [2022-04-28 14:18:51,372 INFO L290 TraceCheckUtils]: 18: Hoare triple {1525#true} assume !(0 == ~cond); {1525#true} is VALID [2022-04-28 14:18:51,372 INFO L290 TraceCheckUtils]: 17: Hoare triple {1525#true} ~cond := #in~cond; {1525#true} is VALID [2022-04-28 14:18:51,372 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-28 14:18:51,373 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-28 14:18:51,374 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-28 14:18:51,374 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-28 14:18:51,375 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1525#true} {1656#(< ~counter~0 9)} #51#return; {1656#(< ~counter~0 9)} is VALID [2022-04-28 14:18:51,375 INFO L290 TraceCheckUtils]: 11: Hoare triple {1525#true} assume true; {1525#true} is VALID [2022-04-28 14:18:51,375 INFO L290 TraceCheckUtils]: 10: Hoare triple {1525#true} assume !(0 == ~cond); {1525#true} is VALID [2022-04-28 14:18:51,375 INFO L290 TraceCheckUtils]: 9: Hoare triple {1525#true} ~cond := #in~cond; {1525#true} is VALID [2022-04-28 14:18:51,375 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-28 14:18:51,376 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-28 14:18:51,376 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-28 14:18:51,376 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-28 14:18:51,377 INFO L272 TraceCheckUtils]: 4: Hoare triple {1681#(< ~counter~0 8)} call #t~ret6 := main(); {1681#(< ~counter~0 8)} is VALID [2022-04-28 14:18:51,377 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1681#(< ~counter~0 8)} {1525#true} #57#return; {1681#(< ~counter~0 8)} is VALID [2022-04-28 14:18:51,378 INFO L290 TraceCheckUtils]: 2: Hoare triple {1681#(< ~counter~0 8)} assume true; {1681#(< ~counter~0 8)} is VALID [2022-04-28 14:18:51,378 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-28 14:18:51,378 INFO L272 TraceCheckUtils]: 0: Hoare triple {1525#true} call ULTIMATE.init(); {1525#true} is VALID [2022-04-28 14:18:51,379 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-28 14:18:51,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:18:51,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71198608] [2022-04-28 14:18:51,379 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:18:51,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979219702] [2022-04-28 14:18:51,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979219702] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:18:51,379 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:18:51,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-28 14:18:51,379 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:18:51,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [516572392] [2022-04-28 14:18:51,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [516572392] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:18:51,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:18:51,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 14:18:51,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639453997] [2022-04-28 14:18:51,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:18:51,380 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-28 14:18:51,380 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:18:51,381 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-28 14:18:51,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:18:51,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 14:18:51,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:18:51,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 14:18:51,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 14:18:51,403 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-28 14:18:51,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:18:51,508 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2022-04-28 14:18:51,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 14:18:51,508 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-28 14:18:51,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:18:51,508 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-28 14:18:51,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-28 14:18:51,510 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-28 14:18:51,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-28 14:18:51,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 42 transitions. [2022-04-28 14:18:51,542 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-28 14:18:51,542 INFO L225 Difference]: With dead ends: 42 [2022-04-28 14:18:51,543 INFO L226 Difference]: Without dead ends: 37 [2022-04-28 14:18:51,543 INFO L412 NwaCegarLoop]: 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-28 14:18:51,543 INFO L413 NwaCegarLoop]: 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-28 14:18:51,544 INFO L414 NwaCegarLoop]: 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-28 14:18:51,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-28 14:18:51,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-28 14:18:51,575 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:18:51,575 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-28 14:18:51,575 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-28 14:18:51,576 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-28 14:18:51,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:18:51,577 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2022-04-28 14:18:51,577 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-04-28 14:18:51,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:18:51,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:18:51,577 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-28 14:18:51,578 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-28 14:18:51,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:18:51,579 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2022-04-28 14:18:51,579 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-04-28 14:18:51,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:18:51,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:18:51,579 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:18:51,579 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:18:51,579 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-28 14:18:51,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2022-04-28 14:18:51,580 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 28 [2022-04-28 14:18:51,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:18:51,581 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2022-04-28 14:18:51,581 INFO L496 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-28 14:18:51,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 38 transitions. [2022-04-28 14:18:51,627 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-28 14:18:51,628 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-04-28 14:18:51,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 14:18:51,628 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:18:51,628 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:18:51,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 14:18:51,829 WARN L477 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-28 14:18:51,829 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:18:51,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:18:51,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1036651181, now seen corresponding path program 3 times [2022-04-28 14:18:51,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:18:51,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1009833117] [2022-04-28 14:18:51,918 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:18:51,918 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:18:51,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1036651181, now seen corresponding path program 4 times [2022-04-28 14:18:51,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:18:51,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335361461] [2022-04-28 14:18:51,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:18:51,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:18:51,930 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:18:51,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1931758878] [2022-04-28 14:18:51,930 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:18:51,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:18:51,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:18:51,931 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-28 14:18:51,932 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-28 14:18:51,981 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:18:51,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:18:51,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 14:18:51,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:18:51,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:18:52,276 INFO L272 TraceCheckUtils]: 0: Hoare triple {1938#true} call ULTIMATE.init(); {1938#true} is VALID [2022-04-28 14:18:52,276 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-28 14:18:52,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {1938#true} assume true; {1938#true} is VALID [2022-04-28 14:18:52,276 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1938#true} {1938#true} #57#return; {1938#true} is VALID [2022-04-28 14:18:52,276 INFO L272 TraceCheckUtils]: 4: Hoare triple {1938#true} call #t~ret6 := main(); {1938#true} is VALID [2022-04-28 14:18:52,277 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-28 14:18:52,277 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-28 14:18:52,277 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-28 14:18:52,277 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-28 14:18:52,278 INFO L290 TraceCheckUtils]: 9: Hoare triple {1938#true} ~cond := #in~cond; {1938#true} is VALID [2022-04-28 14:18:52,278 INFO L290 TraceCheckUtils]: 10: Hoare triple {1938#true} assume !(0 == ~cond); {1938#true} is VALID [2022-04-28 14:18:52,278 INFO L290 TraceCheckUtils]: 11: Hoare triple {1938#true} assume true; {1938#true} is VALID [2022-04-28 14:18:52,278 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-28 14:18:52,279 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-28 14:18:52,279 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-28 14:18:52,279 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-28 14:18:52,279 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-28 14:18:52,279 INFO L290 TraceCheckUtils]: 17: Hoare triple {1938#true} ~cond := #in~cond; {1938#true} is VALID [2022-04-28 14:18:52,279 INFO L290 TraceCheckUtils]: 18: Hoare triple {1938#true} assume !(0 == ~cond); {1938#true} is VALID [2022-04-28 14:18:52,280 INFO L290 TraceCheckUtils]: 19: Hoare triple {1938#true} assume true; {1938#true} is VALID [2022-04-28 14:18:52,280 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-28 14:18:52,281 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-28 14:18:52,281 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-28 14:18:52,281 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-28 14:18:52,282 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-28 14:18:52,282 INFO L290 TraceCheckUtils]: 25: Hoare triple {1938#true} ~cond := #in~cond; {1938#true} is VALID [2022-04-28 14:18:52,282 INFO L290 TraceCheckUtils]: 26: Hoare triple {1938#true} assume !(0 == ~cond); {1938#true} is VALID [2022-04-28 14:18:52,282 INFO L290 TraceCheckUtils]: 27: Hoare triple {1938#true} assume true; {1938#true} is VALID [2022-04-28 14:18:52,282 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-28 14:18:52,283 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-28 14:18:52,283 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-28 14:18:52,284 INFO L290 TraceCheckUtils]: 31: Hoare triple {2037#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2041#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:18:52,284 INFO L290 TraceCheckUtils]: 32: Hoare triple {2041#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1939#false} is VALID [2022-04-28 14:18:52,284 INFO L290 TraceCheckUtils]: 33: Hoare triple {1939#false} assume !false; {1939#false} is VALID [2022-04-28 14:18:52,284 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-28 14:18:52,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:18:52,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:18:52,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335361461] [2022-04-28 14:18:52,593 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:18:52,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931758878] [2022-04-28 14:18:52,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931758878] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:18:52,593 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:18:52,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-28 14:18:52,593 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:18:52,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1009833117] [2022-04-28 14:18:52,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1009833117] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:18:52,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:18:52,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 14:18:52,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227094054] [2022-04-28 14:18:52,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:18:52,594 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-28 14:18:52,594 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:18:52,594 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-28 14:18:52,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:18:52,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 14:18:52,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:18:52,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 14:18:52,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-28 14:18:52,617 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-28 14:18:52,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:18:52,853 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-28 14:18:52,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 14:18:52,853 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-28 14:18:52,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:18:52,854 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-28 14:18:52,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-28 14:18:52,855 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-28 14:18:52,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-28 14:18:52,855 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 39 transitions. [2022-04-28 14:18:52,881 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:18:52,881 INFO L225 Difference]: With dead ends: 44 [2022-04-28 14:18:52,881 INFO L226 Difference]: Without dead ends: 39 [2022-04-28 14:18:52,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-28 14:18:52,882 INFO L413 NwaCegarLoop]: 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-28 14:18:52,882 INFO L414 NwaCegarLoop]: 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-28 14:18:52,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-28 14:18:52,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-28 14:18:52,910 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:18:52,911 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-28 14:18:52,911 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-28 14:18:52,911 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-28 14:18:52,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:18:52,912 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2022-04-28 14:18:52,912 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-04-28 14:18:52,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:18:52,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:18:52,912 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-28 14:18:52,912 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-28 14:18:52,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:18:52,913 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2022-04-28 14:18:52,913 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-04-28 14:18:52,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:18:52,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:18:52,914 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:18:52,914 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:18:52,914 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-28 14:18:52,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2022-04-28 14:18:52,915 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 34 [2022-04-28 14:18:52,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:18:52,915 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2022-04-28 14:18:52,915 INFO L496 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-28 14:18:52,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 41 transitions. [2022-04-28 14:18:52,961 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-28 14:18:52,961 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-04-28 14:18:52,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 14:18:52,961 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:18:52,962 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:18:52,981 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-28 14:18:53,162 WARN L477 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-28 14:18:53,162 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:18:53,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:18:53,162 INFO L85 PathProgramCache]: Analyzing trace with hash 486001554, now seen corresponding path program 5 times [2022-04-28 14:18:53,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:18:53,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1953138282] [2022-04-28 14:18:53,247 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:18:53,247 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:18:53,247 INFO L85 PathProgramCache]: Analyzing trace with hash 486001554, now seen corresponding path program 6 times [2022-04-28 14:18:53,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:18:53,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396388845] [2022-04-28 14:18:53,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:18:53,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:18:53,264 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:18:53,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1946740810] [2022-04-28 14:18:53,265 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:18:53,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:18:53,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:18:53,265 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-28 14:18:53,266 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-28 14:18:53,303 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 14:18:53,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:18:53,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 14:18:53,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:18:53,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:18:53,506 INFO L272 TraceCheckUtils]: 0: Hoare triple {2365#true} call ULTIMATE.init(); {2365#true} is VALID [2022-04-28 14:18:53,507 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-28 14:18:53,507 INFO L290 TraceCheckUtils]: 2: Hoare triple {2373#(<= ~counter~0 0)} assume true; {2373#(<= ~counter~0 0)} is VALID [2022-04-28 14:18:53,507 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2373#(<= ~counter~0 0)} {2365#true} #57#return; {2373#(<= ~counter~0 0)} is VALID [2022-04-28 14:18:53,508 INFO L272 TraceCheckUtils]: 4: Hoare triple {2373#(<= ~counter~0 0)} call #t~ret6 := main(); {2373#(<= ~counter~0 0)} is VALID [2022-04-28 14:18:53,508 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-28 14:18:53,509 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-28 14:18:53,509 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-28 14:18:53,514 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-28 14:18:53,514 INFO L290 TraceCheckUtils]: 9: Hoare triple {2389#(<= ~counter~0 1)} ~cond := #in~cond; {2389#(<= ~counter~0 1)} is VALID [2022-04-28 14:18:53,515 INFO L290 TraceCheckUtils]: 10: Hoare triple {2389#(<= ~counter~0 1)} assume !(0 == ~cond); {2389#(<= ~counter~0 1)} is VALID [2022-04-28 14:18:53,516 INFO L290 TraceCheckUtils]: 11: Hoare triple {2389#(<= ~counter~0 1)} assume true; {2389#(<= ~counter~0 1)} is VALID [2022-04-28 14:18:53,519 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2389#(<= ~counter~0 1)} {2389#(<= ~counter~0 1)} #51#return; {2389#(<= ~counter~0 1)} is VALID [2022-04-28 14:18:53,520 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-28 14:18:53,520 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-28 14:18:53,520 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-28 14:18:53,523 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-28 14:18:53,523 INFO L290 TraceCheckUtils]: 17: Hoare triple {2414#(<= ~counter~0 2)} ~cond := #in~cond; {2414#(<= ~counter~0 2)} is VALID [2022-04-28 14:18:53,523 INFO L290 TraceCheckUtils]: 18: Hoare triple {2414#(<= ~counter~0 2)} assume !(0 == ~cond); {2414#(<= ~counter~0 2)} is VALID [2022-04-28 14:18:53,524 INFO L290 TraceCheckUtils]: 19: Hoare triple {2414#(<= ~counter~0 2)} assume true; {2414#(<= ~counter~0 2)} is VALID [2022-04-28 14:18:53,524 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2414#(<= ~counter~0 2)} {2414#(<= ~counter~0 2)} #51#return; {2414#(<= ~counter~0 2)} is VALID [2022-04-28 14:18:53,524 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-28 14:18:53,525 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-28 14:18:53,525 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-28 14:18:53,526 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-28 14:18:53,526 INFO L290 TraceCheckUtils]: 25: Hoare triple {2439#(<= ~counter~0 3)} ~cond := #in~cond; {2439#(<= ~counter~0 3)} is VALID [2022-04-28 14:18:53,526 INFO L290 TraceCheckUtils]: 26: Hoare triple {2439#(<= ~counter~0 3)} assume !(0 == ~cond); {2439#(<= ~counter~0 3)} is VALID [2022-04-28 14:18:53,526 INFO L290 TraceCheckUtils]: 27: Hoare triple {2439#(<= ~counter~0 3)} assume true; {2439#(<= ~counter~0 3)} is VALID [2022-04-28 14:18:53,527 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2439#(<= ~counter~0 3)} {2439#(<= ~counter~0 3)} #51#return; {2439#(<= ~counter~0 3)} is VALID [2022-04-28 14:18:53,527 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-28 14:18:53,528 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-28 14:18:53,528 INFO L290 TraceCheckUtils]: 31: Hoare triple {2464#(<= |main_#t~post5| 3)} assume !(#t~post5 < 10);havoc #t~post5; {2366#false} is VALID [2022-04-28 14:18:53,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-28 14:18:53,528 INFO L290 TraceCheckUtils]: 33: Hoare triple {2366#false} ~cond := #in~cond; {2366#false} is VALID [2022-04-28 14:18:53,528 INFO L290 TraceCheckUtils]: 34: Hoare triple {2366#false} assume 0 == ~cond; {2366#false} is VALID [2022-04-28 14:18:53,528 INFO L290 TraceCheckUtils]: 35: Hoare triple {2366#false} assume !false; {2366#false} is VALID [2022-04-28 14:18:53,528 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-28 14:18:53,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:18:53,705 INFO L290 TraceCheckUtils]: 35: Hoare triple {2366#false} assume !false; {2366#false} is VALID [2022-04-28 14:18:53,705 INFO L290 TraceCheckUtils]: 34: Hoare triple {2366#false} assume 0 == ~cond; {2366#false} is VALID [2022-04-28 14:18:53,705 INFO L290 TraceCheckUtils]: 33: Hoare triple {2366#false} ~cond := #in~cond; {2366#false} is VALID [2022-04-28 14:18:53,705 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-28 14:18:53,705 INFO L290 TraceCheckUtils]: 31: Hoare triple {2492#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {2366#false} is VALID [2022-04-28 14:18:53,706 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-28 14:18:53,706 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-28 14:18:53,707 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2365#true} {2496#(< ~counter~0 10)} #51#return; {2496#(< ~counter~0 10)} is VALID [2022-04-28 14:18:53,707 INFO L290 TraceCheckUtils]: 27: Hoare triple {2365#true} assume true; {2365#true} is VALID [2022-04-28 14:18:53,707 INFO L290 TraceCheckUtils]: 26: Hoare triple {2365#true} assume !(0 == ~cond); {2365#true} is VALID [2022-04-28 14:18:53,707 INFO L290 TraceCheckUtils]: 25: Hoare triple {2365#true} ~cond := #in~cond; {2365#true} is VALID [2022-04-28 14:18:53,707 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-28 14:18:53,707 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-28 14:18:53,708 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-28 14:18:53,708 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-28 14:18:53,709 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2365#true} {2521#(< ~counter~0 9)} #51#return; {2521#(< ~counter~0 9)} is VALID [2022-04-28 14:18:53,709 INFO L290 TraceCheckUtils]: 19: Hoare triple {2365#true} assume true; {2365#true} is VALID [2022-04-28 14:18:53,709 INFO L290 TraceCheckUtils]: 18: Hoare triple {2365#true} assume !(0 == ~cond); {2365#true} is VALID [2022-04-28 14:18:53,709 INFO L290 TraceCheckUtils]: 17: Hoare triple {2365#true} ~cond := #in~cond; {2365#true} is VALID [2022-04-28 14:18:53,709 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-28 14:18:53,709 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-28 14:18:53,710 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-28 14:18:53,710 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-28 14:18:53,711 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2365#true} {2546#(< ~counter~0 8)} #51#return; {2546#(< ~counter~0 8)} is VALID [2022-04-28 14:18:53,711 INFO L290 TraceCheckUtils]: 11: Hoare triple {2365#true} assume true; {2365#true} is VALID [2022-04-28 14:18:53,711 INFO L290 TraceCheckUtils]: 10: Hoare triple {2365#true} assume !(0 == ~cond); {2365#true} is VALID [2022-04-28 14:18:53,711 INFO L290 TraceCheckUtils]: 9: Hoare triple {2365#true} ~cond := #in~cond; {2365#true} is VALID [2022-04-28 14:18:53,711 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-28 14:18:53,711 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-28 14:18:53,712 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-28 14:18:53,712 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-28 14:18:53,712 INFO L272 TraceCheckUtils]: 4: Hoare triple {2571#(< ~counter~0 7)} call #t~ret6 := main(); {2571#(< ~counter~0 7)} is VALID [2022-04-28 14:18:53,713 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2571#(< ~counter~0 7)} {2365#true} #57#return; {2571#(< ~counter~0 7)} is VALID [2022-04-28 14:18:53,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {2571#(< ~counter~0 7)} assume true; {2571#(< ~counter~0 7)} is VALID [2022-04-28 14:18:53,714 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-28 14:18:53,714 INFO L272 TraceCheckUtils]: 0: Hoare triple {2365#true} call ULTIMATE.init(); {2365#true} is VALID [2022-04-28 14:18:53,714 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-28 14:18:53,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:18:53,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396388845] [2022-04-28 14:18:53,714 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:18:53,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946740810] [2022-04-28 14:18:53,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946740810] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:18:53,714 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:18:53,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-28 14:18:53,714 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:18:53,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1953138282] [2022-04-28 14:18:53,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1953138282] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:18:53,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:18:53,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 14:18:53,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923012784] [2022-04-28 14:18:53,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:18:53,716 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-28 14:18:53,716 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:18:53,716 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-28 14:18:53,738 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-28 14:18:53,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 14:18:53,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:18:53,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 14:18:53,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-28 14:18:53,739 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-28 14:18:53,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:18:53,859 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2022-04-28 14:18:53,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 14:18:53,859 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-28 14:18:53,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:18:53,860 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-28 14:18:53,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2022-04-28 14:18:53,873 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-28 14:18:53,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2022-04-28 14:18:53,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 50 transitions. [2022-04-28 14:18:53,902 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-28 14:18:53,903 INFO L225 Difference]: With dead ends: 50 [2022-04-28 14:18:53,903 INFO L226 Difference]: Without dead ends: 45 [2022-04-28 14:18:53,903 INFO L412 NwaCegarLoop]: 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-28 14:18:53,904 INFO L413 NwaCegarLoop]: 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-28 14:18:53,904 INFO L414 NwaCegarLoop]: 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-28 14:18:53,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-28 14:18:53,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-28 14:18:53,941 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:18:53,941 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-28 14:18:53,941 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-28 14:18:53,942 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-28 14:18:53,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:18:53,943 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2022-04-28 14:18:53,943 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-04-28 14:18:53,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:18:53,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:18:53,943 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-28 14:18:53,943 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-28 14:18:53,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:18:53,944 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2022-04-28 14:18:53,944 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-04-28 14:18:53,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:18:53,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:18:53,944 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:18:53,944 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:18:53,944 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-28 14:18:53,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2022-04-28 14:18:53,945 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 36 [2022-04-28 14:18:53,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:18:53,945 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2022-04-28 14:18:53,945 INFO L496 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-28 14:18:53,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 46 transitions. [2022-04-28 14:18:53,990 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-28 14:18:53,990 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-04-28 14:18:53,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 14:18:53,990 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:18:53,990 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:18:54,006 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-28 14:18:54,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-28 14:18:54,196 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:18:54,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:18:54,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1383171920, now seen corresponding path program 5 times [2022-04-28 14:18:54,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:18:54,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [493112424] [2022-04-28 14:18:54,304 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:18:54,304 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:18:54,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1383171920, now seen corresponding path program 6 times [2022-04-28 14:18:54,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:18:54,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128640243] [2022-04-28 14:18:54,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:18:54,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:18:54,317 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:18:54,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [930424518] [2022-04-28 14:18:54,318 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:18:54,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:18:54,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:18:54,318 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-28 14:18:54,337 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-28 14:18:54,407 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 14:18:54,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:18:54,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 14:18:54,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:18:54,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:18:54,662 INFO L272 TraceCheckUtils]: 0: Hoare triple {2878#true} call ULTIMATE.init(); {2878#true} is VALID [2022-04-28 14:18:54,662 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-28 14:18:54,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-28 14:18:54,663 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2878#true} {2878#true} #57#return; {2878#true} is VALID [2022-04-28 14:18:54,663 INFO L272 TraceCheckUtils]: 4: Hoare triple {2878#true} call #t~ret6 := main(); {2878#true} is VALID [2022-04-28 14:18:54,663 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-28 14:18:54,663 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-28 14:18:54,664 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-28 14:18:54,664 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-28 14:18:54,664 INFO L290 TraceCheckUtils]: 9: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-28 14:18:54,664 INFO L290 TraceCheckUtils]: 10: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-28 14:18:54,664 INFO L290 TraceCheckUtils]: 11: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-28 14:18:54,664 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-28 14:18:54,665 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-28 14:18:54,665 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-28 14:18:54,665 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-28 14:18:54,666 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-28 14:18:54,666 INFO L290 TraceCheckUtils]: 17: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-28 14:18:54,666 INFO L290 TraceCheckUtils]: 18: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-28 14:18:54,666 INFO L290 TraceCheckUtils]: 19: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-28 14:18:54,666 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-28 14:18:54,667 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-28 14:18:54,667 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-28 14:18:54,667 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-28 14:18:54,667 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-28 14:18:54,667 INFO L290 TraceCheckUtils]: 25: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-28 14:18:54,667 INFO L290 TraceCheckUtils]: 26: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-28 14:18:54,668 INFO L290 TraceCheckUtils]: 27: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-28 14:18:54,668 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-28 14:18:54,668 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-28 14:18:54,669 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-28 14:18:54,669 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-28 14:18:54,669 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-28 14:18:54,669 INFO L290 TraceCheckUtils]: 33: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-28 14:18:54,669 INFO L290 TraceCheckUtils]: 34: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-28 14:18:54,669 INFO L290 TraceCheckUtils]: 35: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-28 14:18:54,670 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-28 14:18:54,670 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-28 14:18:54,671 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-28 14:18:54,671 INFO L290 TraceCheckUtils]: 39: Hoare triple {3002#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3006#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:18:54,671 INFO L290 TraceCheckUtils]: 40: Hoare triple {3006#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2879#false} is VALID [2022-04-28 14:18:54,671 INFO L290 TraceCheckUtils]: 41: Hoare triple {2879#false} assume !false; {2879#false} is VALID [2022-04-28 14:18:54,672 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-28 14:18:54,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:18:54,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:18:54,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128640243] [2022-04-28 14:18:54,906 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:18:54,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930424518] [2022-04-28 14:18:54,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930424518] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:18:54,906 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:18:54,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-28 14:18:54,906 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:18:54,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [493112424] [2022-04-28 14:18:54,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [493112424] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:18:54,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:18:54,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 14:18:54,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560856207] [2022-04-28 14:18:54,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:18:54,907 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-28 14:18:54,907 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:18:54,907 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-28 14:18:54,928 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-28 14:18:54,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 14:18:54,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:18:54,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 14:18:54,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-28 14:18:54,929 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-28 14:18:55,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:18:55,219 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-28 14:18:55,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 14:18:55,220 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-28 14:18:55,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:18:55,220 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-28 14:18:55,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-28 14:18:55,221 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-28 14:18:55,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-28 14:18:55,221 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 44 transitions. [2022-04-28 14:18:55,252 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-28 14:18:55,252 INFO L225 Difference]: With dead ends: 52 [2022-04-28 14:18:55,252 INFO L226 Difference]: Without dead ends: 47 [2022-04-28 14:18:55,253 INFO L412 NwaCegarLoop]: 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-28 14:18:55,253 INFO L413 NwaCegarLoop]: 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-28 14:18:55,253 INFO L414 NwaCegarLoop]: 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-28 14:18:55,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-28 14:18:55,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-28 14:18:55,300 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:18:55,300 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-28 14:18:55,300 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-28 14:18:55,300 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-28 14:18:55,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:18:55,301 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-04-28 14:18:55,301 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-28 14:18:55,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:18:55,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:18:55,302 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-28 14:18:55,302 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-28 14:18:55,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:18:55,303 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-04-28 14:18:55,303 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-28 14:18:55,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:18:55,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:18:55,303 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:18:55,303 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:18:55,303 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-28 14:18:55,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2022-04-28 14:18:55,304 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 42 [2022-04-28 14:18:55,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:18:55,304 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2022-04-28 14:18:55,304 INFO L496 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-28 14:18:55,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 49 transitions. [2022-04-28 14:18:55,361 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-28 14:18:55,361 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-28 14:18:55,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 14:18:55,361 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:18:55,361 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:18:55,377 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-28 14:18:55,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 14:18:55,564 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:18:55,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:18:55,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1386691371, now seen corresponding path program 7 times [2022-04-28 14:18:55,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:18:55,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [898629577] [2022-04-28 14:18:55,659 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:18:55,659 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:18:55,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1386691371, now seen corresponding path program 8 times [2022-04-28 14:18:55,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:18:55,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366513924] [2022-04-28 14:18:55,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:18:55,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:18:55,677 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:18:55,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1835990219] [2022-04-28 14:18:55,677 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:18:55,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:18:55,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:18:55,678 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-28 14:18:55,694 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-28 14:18:55,722 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:18:55,722 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:18:55,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 14:18:55,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:18:55,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:18:55,940 INFO L272 TraceCheckUtils]: 0: Hoare triple {3353#true} call ULTIMATE.init(); {3353#true} is VALID [2022-04-28 14:18:55,941 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-28 14:18:55,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {3361#(<= ~counter~0 0)} assume true; {3361#(<= ~counter~0 0)} is VALID [2022-04-28 14:18:55,942 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3361#(<= ~counter~0 0)} {3353#true} #57#return; {3361#(<= ~counter~0 0)} is VALID [2022-04-28 14:18:55,942 INFO L272 TraceCheckUtils]: 4: Hoare triple {3361#(<= ~counter~0 0)} call #t~ret6 := main(); {3361#(<= ~counter~0 0)} is VALID [2022-04-28 14:18:55,942 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-28 14:18:55,943 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-28 14:18:55,943 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-28 14:18:55,943 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-28 14:18:55,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {3377#(<= ~counter~0 1)} ~cond := #in~cond; {3377#(<= ~counter~0 1)} is VALID [2022-04-28 14:18:55,944 INFO L290 TraceCheckUtils]: 10: Hoare triple {3377#(<= ~counter~0 1)} assume !(0 == ~cond); {3377#(<= ~counter~0 1)} is VALID [2022-04-28 14:18:55,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {3377#(<= ~counter~0 1)} assume true; {3377#(<= ~counter~0 1)} is VALID [2022-04-28 14:18:55,944 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3377#(<= ~counter~0 1)} {3377#(<= ~counter~0 1)} #51#return; {3377#(<= ~counter~0 1)} is VALID [2022-04-28 14:18:55,945 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-28 14:18:55,945 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-28 14:18:55,945 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-28 14:18:55,947 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-28 14:18:55,947 INFO L290 TraceCheckUtils]: 17: Hoare triple {3402#(<= ~counter~0 2)} ~cond := #in~cond; {3402#(<= ~counter~0 2)} is VALID [2022-04-28 14:18:55,947 INFO L290 TraceCheckUtils]: 18: Hoare triple {3402#(<= ~counter~0 2)} assume !(0 == ~cond); {3402#(<= ~counter~0 2)} is VALID [2022-04-28 14:18:55,947 INFO L290 TraceCheckUtils]: 19: Hoare triple {3402#(<= ~counter~0 2)} assume true; {3402#(<= ~counter~0 2)} is VALID [2022-04-28 14:18:55,948 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3402#(<= ~counter~0 2)} {3402#(<= ~counter~0 2)} #51#return; {3402#(<= ~counter~0 2)} is VALID [2022-04-28 14:18:55,948 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-28 14:18:55,949 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-28 14:18:55,949 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-28 14:18:55,950 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-28 14:18:55,950 INFO L290 TraceCheckUtils]: 25: Hoare triple {3427#(<= ~counter~0 3)} ~cond := #in~cond; {3427#(<= ~counter~0 3)} is VALID [2022-04-28 14:18:55,951 INFO L290 TraceCheckUtils]: 26: Hoare triple {3427#(<= ~counter~0 3)} assume !(0 == ~cond); {3427#(<= ~counter~0 3)} is VALID [2022-04-28 14:18:55,951 INFO L290 TraceCheckUtils]: 27: Hoare triple {3427#(<= ~counter~0 3)} assume true; {3427#(<= ~counter~0 3)} is VALID [2022-04-28 14:18:55,952 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3427#(<= ~counter~0 3)} {3427#(<= ~counter~0 3)} #51#return; {3427#(<= ~counter~0 3)} is VALID [2022-04-28 14:18:55,952 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-28 14:18:55,953 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-28 14:18:55,953 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-28 14:18:55,953 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-28 14:18:55,954 INFO L290 TraceCheckUtils]: 33: Hoare triple {3452#(<= ~counter~0 4)} ~cond := #in~cond; {3452#(<= ~counter~0 4)} is VALID [2022-04-28 14:18:55,954 INFO L290 TraceCheckUtils]: 34: Hoare triple {3452#(<= ~counter~0 4)} assume !(0 == ~cond); {3452#(<= ~counter~0 4)} is VALID [2022-04-28 14:18:55,954 INFO L290 TraceCheckUtils]: 35: Hoare triple {3452#(<= ~counter~0 4)} assume true; {3452#(<= ~counter~0 4)} is VALID [2022-04-28 14:18:55,955 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3452#(<= ~counter~0 4)} {3452#(<= ~counter~0 4)} #51#return; {3452#(<= ~counter~0 4)} is VALID [2022-04-28 14:18:55,955 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-28 14:18:55,955 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-28 14:18:55,955 INFO L290 TraceCheckUtils]: 39: Hoare triple {3477#(<= |main_#t~post5| 4)} assume !(#t~post5 < 10);havoc #t~post5; {3354#false} is VALID [2022-04-28 14:18:55,956 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-28 14:18:55,956 INFO L290 TraceCheckUtils]: 41: Hoare triple {3354#false} ~cond := #in~cond; {3354#false} is VALID [2022-04-28 14:18:55,956 INFO L290 TraceCheckUtils]: 42: Hoare triple {3354#false} assume 0 == ~cond; {3354#false} is VALID [2022-04-28 14:18:55,956 INFO L290 TraceCheckUtils]: 43: Hoare triple {3354#false} assume !false; {3354#false} is VALID [2022-04-28 14:18:55,956 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-28 14:18:55,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:18:56,188 INFO L290 TraceCheckUtils]: 43: Hoare triple {3354#false} assume !false; {3354#false} is VALID [2022-04-28 14:18:56,188 INFO L290 TraceCheckUtils]: 42: Hoare triple {3354#false} assume 0 == ~cond; {3354#false} is VALID [2022-04-28 14:18:56,188 INFO L290 TraceCheckUtils]: 41: Hoare triple {3354#false} ~cond := #in~cond; {3354#false} is VALID [2022-04-28 14:18:56,188 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-28 14:18:56,190 INFO L290 TraceCheckUtils]: 39: Hoare triple {3505#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {3354#false} is VALID [2022-04-28 14:18:56,190 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-28 14:18:56,190 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-28 14:18:56,191 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3353#true} {3509#(< ~counter~0 10)} #51#return; {3509#(< ~counter~0 10)} is VALID [2022-04-28 14:18:56,191 INFO L290 TraceCheckUtils]: 35: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 14:18:56,191 INFO L290 TraceCheckUtils]: 34: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 14:18:56,191 INFO L290 TraceCheckUtils]: 33: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 14:18:56,191 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-28 14:18:56,191 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-28 14:18:56,191 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-28 14:18:56,192 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-28 14:18:56,192 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3353#true} {3534#(< ~counter~0 9)} #51#return; {3534#(< ~counter~0 9)} is VALID [2022-04-28 14:18:56,192 INFO L290 TraceCheckUtils]: 27: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 14:18:56,192 INFO L290 TraceCheckUtils]: 26: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 14:18:56,192 INFO L290 TraceCheckUtils]: 25: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 14:18:56,192 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-28 14:18:56,193 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-28 14:18:56,193 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-28 14:18:56,193 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-28 14:18:56,194 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3353#true} {3559#(< ~counter~0 8)} #51#return; {3559#(< ~counter~0 8)} is VALID [2022-04-28 14:18:56,194 INFO L290 TraceCheckUtils]: 19: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 14:18:56,194 INFO L290 TraceCheckUtils]: 18: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 14:18:56,194 INFO L290 TraceCheckUtils]: 17: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 14:18:56,194 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-28 14:18:56,194 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-28 14:18:56,195 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-28 14:18:56,195 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-28 14:18:56,195 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3353#true} {3584#(< ~counter~0 7)} #51#return; {3584#(< ~counter~0 7)} is VALID [2022-04-28 14:18:56,195 INFO L290 TraceCheckUtils]: 11: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 14:18:56,195 INFO L290 TraceCheckUtils]: 10: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 14:18:56,195 INFO L290 TraceCheckUtils]: 9: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 14:18:56,195 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-28 14:18:56,196 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-28 14:18:56,196 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-28 14:18:56,196 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-28 14:18:56,197 INFO L272 TraceCheckUtils]: 4: Hoare triple {3609#(< ~counter~0 6)} call #t~ret6 := main(); {3609#(< ~counter~0 6)} is VALID [2022-04-28 14:18:56,197 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3609#(< ~counter~0 6)} {3353#true} #57#return; {3609#(< ~counter~0 6)} is VALID [2022-04-28 14:18:56,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {3609#(< ~counter~0 6)} assume true; {3609#(< ~counter~0 6)} is VALID [2022-04-28 14:18:56,198 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-28 14:18:56,198 INFO L272 TraceCheckUtils]: 0: Hoare triple {3353#true} call ULTIMATE.init(); {3353#true} is VALID [2022-04-28 14:18:56,198 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-28 14:18:56,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:18:56,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366513924] [2022-04-28 14:18:56,198 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:18:56,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835990219] [2022-04-28 14:18:56,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835990219] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:18:56,198 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:18:56,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-28 14:18:56,198 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:18:56,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [898629577] [2022-04-28 14:18:56,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [898629577] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:18:56,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:18:56,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 14:18:56,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89592217] [2022-04-28 14:18:56,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:18:56,199 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-28 14:18:56,199 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:18:56,199 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-28 14:18:56,225 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-28 14:18:56,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 14:18:56,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:18:56,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 14:18:56,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 14:18:56,231 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-28 14:18:56,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:18:56,375 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2022-04-28 14:18:56,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 14:18:56,376 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-28 14:18:56,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:18:56,377 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-28 14:18:56,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 58 transitions. [2022-04-28 14:18:56,379 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-28 14:18:56,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 58 transitions. [2022-04-28 14:18:56,381 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 58 transitions. [2022-04-28 14:18:56,416 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-28 14:18:56,417 INFO L225 Difference]: With dead ends: 58 [2022-04-28 14:18:56,417 INFO L226 Difference]: Without dead ends: 53 [2022-04-28 14:18:56,417 INFO L412 NwaCegarLoop]: 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-28 14:18:56,417 INFO L413 NwaCegarLoop]: 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-28 14:18:56,418 INFO L414 NwaCegarLoop]: 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-28 14:18:56,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-28 14:18:56,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-04-28 14:18:56,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:18:56,474 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-28 14:18:56,474 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-28 14:18:56,474 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-28 14:18:56,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:18:56,475 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2022-04-28 14:18:56,475 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2022-04-28 14:18:56,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:18:56,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:18:56,475 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-28 14:18:56,475 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-28 14:18:56,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:18:56,476 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2022-04-28 14:18:56,476 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2022-04-28 14:18:56,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:18:56,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:18:56,476 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:18:56,476 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:18:56,476 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-28 14:18:56,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2022-04-28 14:18:56,477 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 44 [2022-04-28 14:18:56,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:18:56,477 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2022-04-28 14:18:56,477 INFO L496 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-28 14:18:56,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 54 transitions. [2022-04-28 14:18:56,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:18:56,541 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2022-04-28 14:18:56,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 14:18:56,542 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:18:56,542 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:18:56,557 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-28 14:18:56,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-28 14:18:56,743 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:18:56,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:18:56,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1037185971, now seen corresponding path program 7 times [2022-04-28 14:18:56,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:18:56,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2100957883] [2022-04-28 14:18:56,823 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:18:56,823 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:18:56,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1037185971, now seen corresponding path program 8 times [2022-04-28 14:18:56,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:18:56,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409551986] [2022-04-28 14:18:56,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:18:56,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:18:56,832 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:18:56,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2080860576] [2022-04-28 14:18:56,832 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:18:56,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:18:56,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:18:56,833 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-28 14:18:56,834 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-28 14:18:56,927 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:18:56,927 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:18:56,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 14:18:56,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:18:56,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:18:57,281 INFO L272 TraceCheckUtils]: 0: Hoare triple {3966#true} call ULTIMATE.init(); {3966#true} is VALID [2022-04-28 14:18:57,282 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-28 14:18:57,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {3966#true} assume true; {3966#true} is VALID [2022-04-28 14:18:57,282 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3966#true} {3966#true} #57#return; {3966#true} is VALID [2022-04-28 14:18:57,282 INFO L272 TraceCheckUtils]: 4: Hoare triple {3966#true} call #t~ret6 := main(); {3966#true} is VALID [2022-04-28 14:18:57,282 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-28 14:18:57,283 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-28 14:18:57,283 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-28 14:18:57,283 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-28 14:18:57,283 INFO L290 TraceCheckUtils]: 9: Hoare triple {3966#true} ~cond := #in~cond; {3966#true} is VALID [2022-04-28 14:18:57,284 INFO L290 TraceCheckUtils]: 10: Hoare triple {3966#true} assume !(0 == ~cond); {3966#true} is VALID [2022-04-28 14:18:57,284 INFO L290 TraceCheckUtils]: 11: Hoare triple {3966#true} assume true; {3966#true} is VALID [2022-04-28 14:18:57,284 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-28 14:18:57,285 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-28 14:18:57,285 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-28 14:18:57,285 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-28 14:18:57,285 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-28 14:18:57,285 INFO L290 TraceCheckUtils]: 17: Hoare triple {3966#true} ~cond := #in~cond; {3966#true} is VALID [2022-04-28 14:18:57,286 INFO L290 TraceCheckUtils]: 18: Hoare triple {3966#true} assume !(0 == ~cond); {3966#true} is VALID [2022-04-28 14:18:57,286 INFO L290 TraceCheckUtils]: 19: Hoare triple {3966#true} assume true; {3966#true} is VALID [2022-04-28 14:18:57,286 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-28 14:18:57,286 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-28 14:18:57,287 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-28 14:18:57,287 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-28 14:18:57,287 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-28 14:18:57,287 INFO L290 TraceCheckUtils]: 25: Hoare triple {3966#true} ~cond := #in~cond; {3966#true} is VALID [2022-04-28 14:18:57,287 INFO L290 TraceCheckUtils]: 26: Hoare triple {3966#true} assume !(0 == ~cond); {3966#true} is VALID [2022-04-28 14:18:57,287 INFO L290 TraceCheckUtils]: 27: Hoare triple {3966#true} assume true; {3966#true} is VALID [2022-04-28 14:18:57,288 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-28 14:18:57,288 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-28 14:18:57,289 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-28 14:18:57,289 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-28 14:18:57,289 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-28 14:18:57,289 INFO L290 TraceCheckUtils]: 33: Hoare triple {3966#true} ~cond := #in~cond; {3966#true} is VALID [2022-04-28 14:18:57,289 INFO L290 TraceCheckUtils]: 34: Hoare triple {3966#true} assume !(0 == ~cond); {3966#true} is VALID [2022-04-28 14:18:57,289 INFO L290 TraceCheckUtils]: 35: Hoare triple {3966#true} assume true; {3966#true} is VALID [2022-04-28 14:18:57,290 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-28 14:18:57,290 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-28 14:18:57,290 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-28 14:18:57,291 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-28 14:18:57,291 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-28 14:18:57,291 INFO L290 TraceCheckUtils]: 41: Hoare triple {3966#true} ~cond := #in~cond; {3966#true} is VALID [2022-04-28 14:18:57,291 INFO L290 TraceCheckUtils]: 42: Hoare triple {3966#true} assume !(0 == ~cond); {3966#true} is VALID [2022-04-28 14:18:57,291 INFO L290 TraceCheckUtils]: 43: Hoare triple {3966#true} assume true; {3966#true} is VALID [2022-04-28 14:18:57,291 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-28 14:18:57,292 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-28 14:18:57,292 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-28 14:18:57,293 INFO L290 TraceCheckUtils]: 47: Hoare triple {4115#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4119#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:18:57,293 INFO L290 TraceCheckUtils]: 48: Hoare triple {4119#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3967#false} is VALID [2022-04-28 14:18:57,293 INFO L290 TraceCheckUtils]: 49: Hoare triple {3967#false} assume !false; {3967#false} is VALID [2022-04-28 14:18:57,293 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-28 14:18:57,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:18:57,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:18:57,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409551986] [2022-04-28 14:18:57,560 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:18:57,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080860576] [2022-04-28 14:18:57,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080860576] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:18:57,560 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:18:57,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-28 14:18:57,560 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:18:57,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2100957883] [2022-04-28 14:18:57,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2100957883] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:18:57,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:18:57,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 14:18:57,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511090024] [2022-04-28 14:18:57,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:18:57,562 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-28 14:18:57,562 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:18:57,562 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-28 14:18:57,587 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-28 14:18:57,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 14:18:57,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:18:57,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 14:18:57,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-28 14:18:57,588 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-28 14:18:57,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:18:57,968 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-04-28 14:18:57,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 14:18:57,968 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-28 14:18:57,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:18:57,969 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-28 14:18:57,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 49 transitions. [2022-04-28 14:18:57,970 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-28 14:18:57,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 49 transitions. [2022-04-28 14:18:57,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 49 transitions. [2022-04-28 14:18:58,029 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-28 14:18:58,029 INFO L225 Difference]: With dead ends: 60 [2022-04-28 14:18:58,030 INFO L226 Difference]: Without dead ends: 55 [2022-04-28 14:18:58,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-04-28 14:18:58,030 INFO L413 NwaCegarLoop]: 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-28 14:18:58,030 INFO L414 NwaCegarLoop]: 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-28 14:18:58,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-28 14:18:58,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-28 14:18:58,110 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:18:58,110 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-28 14:18:58,111 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-28 14:18:58,111 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-28 14:18:58,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:18:58,112 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2022-04-28 14:18:58,112 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-04-28 14:18:58,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:18:58,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:18:58,112 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-28 14:18:58,112 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-28 14:18:58,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:18:58,113 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2022-04-28 14:18:58,113 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-04-28 14:18:58,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:18:58,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:18:58,113 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:18:58,113 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:18:58,113 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-28 14:18:58,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2022-04-28 14:18:58,114 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 50 [2022-04-28 14:18:58,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:18:58,114 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2022-04-28 14:18:58,115 INFO L496 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-28 14:18:58,115 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 57 transitions. [2022-04-28 14:18:58,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:18:58,182 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-04-28 14:18:58,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-28 14:18:58,182 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:18:58,182 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:18:58,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-28 14:18:58,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 14:18:58,383 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:18:58,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:18:58,383 INFO L85 PathProgramCache]: Analyzing trace with hash 999934744, now seen corresponding path program 9 times [2022-04-28 14:18:58,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:18:58,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1179664201] [2022-04-28 14:18:58,472 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:18:58,472 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:18:58,472 INFO L85 PathProgramCache]: Analyzing trace with hash 999934744, now seen corresponding path program 10 times [2022-04-28 14:18:58,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:18:58,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473799039] [2022-04-28 14:18:58,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:18:58,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:18:58,481 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:18:58,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1686910146] [2022-04-28 14:18:58,481 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:18:58,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:18:58,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:18:58,482 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-28 14:18:58,483 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-28 14:18:58,623 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:18:58,623 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:18:58,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 14:18:58,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:18:58,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:18:58,902 INFO L272 TraceCheckUtils]: 0: Hoare triple {4514#true} call ULTIMATE.init(); {4514#true} is VALID [2022-04-28 14:18:58,903 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-28 14:18:58,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {4522#(<= ~counter~0 0)} assume true; {4522#(<= ~counter~0 0)} is VALID [2022-04-28 14:18:58,903 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4522#(<= ~counter~0 0)} {4514#true} #57#return; {4522#(<= ~counter~0 0)} is VALID [2022-04-28 14:18:58,904 INFO L272 TraceCheckUtils]: 4: Hoare triple {4522#(<= ~counter~0 0)} call #t~ret6 := main(); {4522#(<= ~counter~0 0)} is VALID [2022-04-28 14:18:58,904 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-28 14:18:58,905 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-28 14:18:58,905 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-28 14:18:58,905 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-28 14:18:58,906 INFO L290 TraceCheckUtils]: 9: Hoare triple {4538#(<= ~counter~0 1)} ~cond := #in~cond; {4538#(<= ~counter~0 1)} is VALID [2022-04-28 14:18:58,906 INFO L290 TraceCheckUtils]: 10: Hoare triple {4538#(<= ~counter~0 1)} assume !(0 == ~cond); {4538#(<= ~counter~0 1)} is VALID [2022-04-28 14:18:58,906 INFO L290 TraceCheckUtils]: 11: Hoare triple {4538#(<= ~counter~0 1)} assume true; {4538#(<= ~counter~0 1)} is VALID [2022-04-28 14:18:58,907 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4538#(<= ~counter~0 1)} {4538#(<= ~counter~0 1)} #51#return; {4538#(<= ~counter~0 1)} is VALID [2022-04-28 14:18:58,907 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-28 14:18:58,911 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-28 14:18:58,912 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-28 14:18:58,912 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-28 14:18:58,912 INFO L290 TraceCheckUtils]: 17: Hoare triple {4563#(<= ~counter~0 2)} ~cond := #in~cond; {4563#(<= ~counter~0 2)} is VALID [2022-04-28 14:18:58,913 INFO L290 TraceCheckUtils]: 18: Hoare triple {4563#(<= ~counter~0 2)} assume !(0 == ~cond); {4563#(<= ~counter~0 2)} is VALID [2022-04-28 14:18:58,913 INFO L290 TraceCheckUtils]: 19: Hoare triple {4563#(<= ~counter~0 2)} assume true; {4563#(<= ~counter~0 2)} is VALID [2022-04-28 14:18:58,915 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {4563#(<= ~counter~0 2)} {4563#(<= ~counter~0 2)} #51#return; {4563#(<= ~counter~0 2)} is VALID [2022-04-28 14:18:58,915 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-28 14:18:58,916 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-28 14:18:58,916 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-28 14:18:58,916 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-28 14:18:58,916 INFO L290 TraceCheckUtils]: 25: Hoare triple {4588#(<= ~counter~0 3)} ~cond := #in~cond; {4588#(<= ~counter~0 3)} is VALID [2022-04-28 14:18:58,917 INFO L290 TraceCheckUtils]: 26: Hoare triple {4588#(<= ~counter~0 3)} assume !(0 == ~cond); {4588#(<= ~counter~0 3)} is VALID [2022-04-28 14:18:58,917 INFO L290 TraceCheckUtils]: 27: Hoare triple {4588#(<= ~counter~0 3)} assume true; {4588#(<= ~counter~0 3)} is VALID [2022-04-28 14:18:58,917 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4588#(<= ~counter~0 3)} {4588#(<= ~counter~0 3)} #51#return; {4588#(<= ~counter~0 3)} is VALID [2022-04-28 14:18:58,918 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-28 14:18:58,918 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-28 14:18:58,918 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-28 14:18:58,919 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-28 14:18:58,919 INFO L290 TraceCheckUtils]: 33: Hoare triple {4613#(<= ~counter~0 4)} ~cond := #in~cond; {4613#(<= ~counter~0 4)} is VALID [2022-04-28 14:18:58,920 INFO L290 TraceCheckUtils]: 34: Hoare triple {4613#(<= ~counter~0 4)} assume !(0 == ~cond); {4613#(<= ~counter~0 4)} is VALID [2022-04-28 14:18:58,920 INFO L290 TraceCheckUtils]: 35: Hoare triple {4613#(<= ~counter~0 4)} assume true; {4613#(<= ~counter~0 4)} is VALID [2022-04-28 14:18:58,920 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4613#(<= ~counter~0 4)} {4613#(<= ~counter~0 4)} #51#return; {4613#(<= ~counter~0 4)} is VALID [2022-04-28 14:18:58,921 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-28 14:18:58,921 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-28 14:18:58,921 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-28 14:18:58,922 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-28 14:18:58,922 INFO L290 TraceCheckUtils]: 41: Hoare triple {4638#(<= ~counter~0 5)} ~cond := #in~cond; {4638#(<= ~counter~0 5)} is VALID [2022-04-28 14:18:58,922 INFO L290 TraceCheckUtils]: 42: Hoare triple {4638#(<= ~counter~0 5)} assume !(0 == ~cond); {4638#(<= ~counter~0 5)} is VALID [2022-04-28 14:18:58,923 INFO L290 TraceCheckUtils]: 43: Hoare triple {4638#(<= ~counter~0 5)} assume true; {4638#(<= ~counter~0 5)} is VALID [2022-04-28 14:18:58,923 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {4638#(<= ~counter~0 5)} {4638#(<= ~counter~0 5)} #51#return; {4638#(<= ~counter~0 5)} is VALID [2022-04-28 14:18:58,923 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-28 14:18:58,924 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-28 14:18:58,924 INFO L290 TraceCheckUtils]: 47: Hoare triple {4663#(<= |main_#t~post5| 5)} assume !(#t~post5 < 10);havoc #t~post5; {4515#false} is VALID [2022-04-28 14:18:58,924 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-28 14:18:58,924 INFO L290 TraceCheckUtils]: 49: Hoare triple {4515#false} ~cond := #in~cond; {4515#false} is VALID [2022-04-28 14:18:58,924 INFO L290 TraceCheckUtils]: 50: Hoare triple {4515#false} assume 0 == ~cond; {4515#false} is VALID [2022-04-28 14:18:58,924 INFO L290 TraceCheckUtils]: 51: Hoare triple {4515#false} assume !false; {4515#false} is VALID [2022-04-28 14:18:58,924 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-28 14:18:58,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:18:59,184 INFO L290 TraceCheckUtils]: 51: Hoare triple {4515#false} assume !false; {4515#false} is VALID [2022-04-28 14:18:59,185 INFO L290 TraceCheckUtils]: 50: Hoare triple {4515#false} assume 0 == ~cond; {4515#false} is VALID [2022-04-28 14:18:59,185 INFO L290 TraceCheckUtils]: 49: Hoare triple {4515#false} ~cond := #in~cond; {4515#false} is VALID [2022-04-28 14:18:59,185 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-28 14:18:59,185 INFO L290 TraceCheckUtils]: 47: Hoare triple {4691#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {4515#false} is VALID [2022-04-28 14:18:59,185 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-28 14:18:59,186 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-28 14:18:59,186 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {4514#true} {4695#(< ~counter~0 10)} #51#return; {4695#(< ~counter~0 10)} is VALID [2022-04-28 14:18:59,186 INFO L290 TraceCheckUtils]: 43: Hoare triple {4514#true} assume true; {4514#true} is VALID [2022-04-28 14:18:59,186 INFO L290 TraceCheckUtils]: 42: Hoare triple {4514#true} assume !(0 == ~cond); {4514#true} is VALID [2022-04-28 14:18:59,186 INFO L290 TraceCheckUtils]: 41: Hoare triple {4514#true} ~cond := #in~cond; {4514#true} is VALID [2022-04-28 14:18:59,186 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-28 14:18:59,187 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-28 14:18:59,187 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-28 14:18:59,187 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-28 14:18:59,188 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4514#true} {4720#(< ~counter~0 9)} #51#return; {4720#(< ~counter~0 9)} is VALID [2022-04-28 14:18:59,188 INFO L290 TraceCheckUtils]: 35: Hoare triple {4514#true} assume true; {4514#true} is VALID [2022-04-28 14:18:59,188 INFO L290 TraceCheckUtils]: 34: Hoare triple {4514#true} assume !(0 == ~cond); {4514#true} is VALID [2022-04-28 14:18:59,188 INFO L290 TraceCheckUtils]: 33: Hoare triple {4514#true} ~cond := #in~cond; {4514#true} is VALID [2022-04-28 14:18:59,188 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-28 14:18:59,188 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-28 14:18:59,189 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-28 14:18:59,189 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-28 14:18:59,189 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4514#true} {4745#(< ~counter~0 8)} #51#return; {4745#(< ~counter~0 8)} is VALID [2022-04-28 14:18:59,190 INFO L290 TraceCheckUtils]: 27: Hoare triple {4514#true} assume true; {4514#true} is VALID [2022-04-28 14:18:59,190 INFO L290 TraceCheckUtils]: 26: Hoare triple {4514#true} assume !(0 == ~cond); {4514#true} is VALID [2022-04-28 14:18:59,190 INFO L290 TraceCheckUtils]: 25: Hoare triple {4514#true} ~cond := #in~cond; {4514#true} is VALID [2022-04-28 14:18:59,190 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-28 14:18:59,190 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-28 14:18:59,190 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-28 14:18:59,191 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-28 14:18:59,191 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {4514#true} {4770#(< ~counter~0 7)} #51#return; {4770#(< ~counter~0 7)} is VALID [2022-04-28 14:18:59,191 INFO L290 TraceCheckUtils]: 19: Hoare triple {4514#true} assume true; {4514#true} is VALID [2022-04-28 14:18:59,191 INFO L290 TraceCheckUtils]: 18: Hoare triple {4514#true} assume !(0 == ~cond); {4514#true} is VALID [2022-04-28 14:18:59,191 INFO L290 TraceCheckUtils]: 17: Hoare triple {4514#true} ~cond := #in~cond; {4514#true} is VALID [2022-04-28 14:18:59,191 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-28 14:18:59,192 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-28 14:18:59,192 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-28 14:18:59,192 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-28 14:18:59,193 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4514#true} {4638#(<= ~counter~0 5)} #51#return; {4638#(<= ~counter~0 5)} is VALID [2022-04-28 14:18:59,193 INFO L290 TraceCheckUtils]: 11: Hoare triple {4514#true} assume true; {4514#true} is VALID [2022-04-28 14:18:59,193 INFO L290 TraceCheckUtils]: 10: Hoare triple {4514#true} assume !(0 == ~cond); {4514#true} is VALID [2022-04-28 14:18:59,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {4514#true} ~cond := #in~cond; {4514#true} is VALID [2022-04-28 14:18:59,193 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-28 14:18:59,193 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-28 14:18:59,193 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-28 14:18:59,194 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-28 14:18:59,194 INFO L272 TraceCheckUtils]: 4: Hoare triple {4613#(<= ~counter~0 4)} call #t~ret6 := main(); {4613#(<= ~counter~0 4)} is VALID [2022-04-28 14:18:59,194 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4613#(<= ~counter~0 4)} {4514#true} #57#return; {4613#(<= ~counter~0 4)} is VALID [2022-04-28 14:18:59,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {4613#(<= ~counter~0 4)} assume true; {4613#(<= ~counter~0 4)} is VALID [2022-04-28 14:18:59,195 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-28 14:18:59,195 INFO L272 TraceCheckUtils]: 0: Hoare triple {4514#true} call ULTIMATE.init(); {4514#true} is VALID [2022-04-28 14:18:59,195 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-28 14:18:59,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:18:59,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473799039] [2022-04-28 14:18:59,195 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:18:59,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686910146] [2022-04-28 14:18:59,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686910146] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:18:59,196 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:18:59,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-28 14:18:59,196 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:18:59,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1179664201] [2022-04-28 14:18:59,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1179664201] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:18:59,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:18:59,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 14:18:59,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611543961] [2022-04-28 14:18:59,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:18:59,196 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-28 14:18:59,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:18:59,197 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-28 14:18:59,230 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-28 14:18:59,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 14:18:59,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:18:59,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 14:18:59,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 14:18:59,231 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-28 14:18:59,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:18:59,431 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2022-04-28 14:18:59,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 14:18:59,431 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-28 14:18:59,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:18:59,432 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-28 14:18:59,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 66 transitions. [2022-04-28 14:18:59,433 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-28 14:18:59,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 66 transitions. [2022-04-28 14:18:59,434 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 66 transitions. [2022-04-28 14:18:59,476 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:18:59,476 INFO L225 Difference]: With dead ends: 66 [2022-04-28 14:18:59,476 INFO L226 Difference]: Without dead ends: 61 [2022-04-28 14:18:59,477 INFO L412 NwaCegarLoop]: 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-28 14:18:59,477 INFO L413 NwaCegarLoop]: 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-28 14:18:59,477 INFO L414 NwaCegarLoop]: 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-28 14:18:59,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-28 14:18:59,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-28 14:18:59,539 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:18:59,539 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-28 14:18:59,540 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-28 14:18:59,540 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-28 14:18:59,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:18:59,541 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2022-04-28 14:18:59,541 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2022-04-28 14:18:59,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:18:59,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:18:59,541 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-28 14:18:59,541 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-28 14:18:59,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:18:59,542 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2022-04-28 14:18:59,542 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2022-04-28 14:18:59,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:18:59,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:18:59,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:18:59,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:18:59,542 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-28 14:18:59,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2022-04-28 14:18:59,543 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 52 [2022-04-28 14:18:59,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:18:59,543 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2022-04-28 14:18:59,543 INFO L496 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-28 14:18:59,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 62 transitions. [2022-04-28 14:18:59,611 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-28 14:18:59,611 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2022-04-28 14:18:59,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-28 14:18:59,611 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:18:59,611 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:18:59,617 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-28 14:18:59,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 14:18:59,816 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:18:59,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:18:59,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1795671114, now seen corresponding path program 9 times [2022-04-28 14:18:59,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:18:59,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1362991518] [2022-04-28 14:18:59,889 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:18:59,889 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:18:59,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1795671114, now seen corresponding path program 10 times [2022-04-28 14:18:59,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:18:59,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480419795] [2022-04-28 14:18:59,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:18:59,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:18:59,898 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:18:59,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1272231650] [2022-04-28 14:18:59,898 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:18:59,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:18:59,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:18:59,899 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-28 14:18:59,900 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-28 14:19:00,148 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:19:00,148 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:19:00,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 14:19:00,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:19:00,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:19:00,557 INFO L272 TraceCheckUtils]: 0: Hoare triple {5225#true} call ULTIMATE.init(); {5225#true} is VALID [2022-04-28 14:19:00,557 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-28 14:19:00,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {5225#true} assume true; {5225#true} is VALID [2022-04-28 14:19:00,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5225#true} {5225#true} #57#return; {5225#true} is VALID [2022-04-28 14:19:00,557 INFO L272 TraceCheckUtils]: 4: Hoare triple {5225#true} call #t~ret6 := main(); {5225#true} is VALID [2022-04-28 14:19:00,558 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-28 14:19:00,558 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-28 14:19:00,559 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-28 14:19:00,559 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-28 14:19:00,559 INFO L290 TraceCheckUtils]: 9: Hoare triple {5225#true} ~cond := #in~cond; {5225#true} is VALID [2022-04-28 14:19:00,559 INFO L290 TraceCheckUtils]: 10: Hoare triple {5225#true} assume !(0 == ~cond); {5225#true} is VALID [2022-04-28 14:19:00,559 INFO L290 TraceCheckUtils]: 11: Hoare triple {5225#true} assume true; {5225#true} is VALID [2022-04-28 14:19:00,559 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-28 14:19:00,560 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-28 14:19:00,560 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-28 14:19:00,561 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-28 14:19:00,561 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-28 14:19:00,561 INFO L290 TraceCheckUtils]: 17: Hoare triple {5225#true} ~cond := #in~cond; {5225#true} is VALID [2022-04-28 14:19:00,561 INFO L290 TraceCheckUtils]: 18: Hoare triple {5225#true} assume !(0 == ~cond); {5225#true} is VALID [2022-04-28 14:19:00,561 INFO L290 TraceCheckUtils]: 19: Hoare triple {5225#true} assume true; {5225#true} is VALID [2022-04-28 14:19:00,561 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-28 14:19:00,562 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-28 14:19:00,562 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-28 14:19:00,562 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-28 14:19:00,563 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-28 14:19:00,563 INFO L290 TraceCheckUtils]: 25: Hoare triple {5225#true} ~cond := #in~cond; {5225#true} is VALID [2022-04-28 14:19:00,563 INFO L290 TraceCheckUtils]: 26: Hoare triple {5225#true} assume !(0 == ~cond); {5225#true} is VALID [2022-04-28 14:19:00,563 INFO L290 TraceCheckUtils]: 27: Hoare triple {5225#true} assume true; {5225#true} is VALID [2022-04-28 14:19:00,563 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-28 14:19:00,564 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-28 14:19:00,564 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-28 14:19:00,564 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-28 14:19:00,565 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-28 14:19:00,565 INFO L290 TraceCheckUtils]: 33: Hoare triple {5225#true} ~cond := #in~cond; {5225#true} is VALID [2022-04-28 14:19:00,565 INFO L290 TraceCheckUtils]: 34: Hoare triple {5225#true} assume !(0 == ~cond); {5225#true} is VALID [2022-04-28 14:19:00,565 INFO L290 TraceCheckUtils]: 35: Hoare triple {5225#true} assume true; {5225#true} is VALID [2022-04-28 14:19:00,565 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-28 14:19:00,566 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-28 14:19:00,566 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-28 14:19:00,566 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-28 14:19:00,566 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-28 14:19:00,567 INFO L290 TraceCheckUtils]: 41: Hoare triple {5225#true} ~cond := #in~cond; {5225#true} is VALID [2022-04-28 14:19:00,567 INFO L290 TraceCheckUtils]: 42: Hoare triple {5225#true} assume !(0 == ~cond); {5225#true} is VALID [2022-04-28 14:19:00,567 INFO L290 TraceCheckUtils]: 43: Hoare triple {5225#true} assume true; {5225#true} is VALID [2022-04-28 14:19:00,567 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-28 14:19:00,568 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-28 14:19:00,568 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-28 14:19:00,568 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-28 14:19:00,568 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-28 14:19:00,568 INFO L290 TraceCheckUtils]: 49: Hoare triple {5225#true} ~cond := #in~cond; {5225#true} is VALID [2022-04-28 14:19:00,569 INFO L290 TraceCheckUtils]: 50: Hoare triple {5225#true} assume !(0 == ~cond); {5225#true} is VALID [2022-04-28 14:19:00,569 INFO L290 TraceCheckUtils]: 51: Hoare triple {5225#true} assume true; {5225#true} is VALID [2022-04-28 14:19:00,569 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-28 14:19:00,570 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-28 14:19:00,570 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-28 14:19:00,571 INFO L290 TraceCheckUtils]: 55: Hoare triple {5399#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5403#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:19:00,571 INFO L290 TraceCheckUtils]: 56: Hoare triple {5403#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5226#false} is VALID [2022-04-28 14:19:00,571 INFO L290 TraceCheckUtils]: 57: Hoare triple {5226#false} assume !false; {5226#false} is VALID [2022-04-28 14:19:00,571 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-28 14:19:00,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:19:00,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:19:00,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480419795] [2022-04-28 14:19:00,808 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:19:00,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272231650] [2022-04-28 14:19:00,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272231650] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:19:00,808 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:19:00,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-28 14:19:00,808 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:19:00,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1362991518] [2022-04-28 14:19:00,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1362991518] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:19:00,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:19:00,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 14:19:00,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924869724] [2022-04-28 14:19:00,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:19:00,809 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-28 14:19:00,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:19:00,809 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-28 14:19:00,837 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-28 14:19:00,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 14:19:00,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:19:00,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 14:19:00,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-28 14:19:00,837 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-28 14:19:01,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:19:01,322 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2022-04-28 14:19:01,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 14:19:01,322 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-28 14:19:01,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:19:01,323 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-28 14:19:01,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 54 transitions. [2022-04-28 14:19:01,324 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-28 14:19:01,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 54 transitions. [2022-04-28 14:19:01,324 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 54 transitions. [2022-04-28 14:19:01,361 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:19:01,362 INFO L225 Difference]: With dead ends: 68 [2022-04-28 14:19:01,362 INFO L226 Difference]: Without dead ends: 63 [2022-04-28 14:19:01,362 INFO L412 NwaCegarLoop]: 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-28 14:19:01,362 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 2 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-28 14:19:01,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 252 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 14:19:01,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-28 14:19:01,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-04-28 14:19:01,436 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:19:01,437 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-28 14:19:01,437 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-28 14:19:01,437 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-28 14:19:01,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:19:01,438 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2022-04-28 14:19:01,438 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2022-04-28 14:19:01,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:19:01,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:19:01,438 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-28 14:19:01,438 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-28 14:19:01,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:19:01,439 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2022-04-28 14:19:01,439 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2022-04-28 14:19:01,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:19:01,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:19:01,440 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:19:01,440 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:19:01,440 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-28 14:19:01,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2022-04-28 14:19:01,441 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 58 [2022-04-28 14:19:01,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:19:01,441 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2022-04-28 14:19:01,441 INFO L496 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-28 14:19:01,441 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 65 transitions. [2022-04-28 14:19:01,507 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-28 14:19:01,507 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2022-04-28 14:19:01,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-28 14:19:01,507 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:19:01,508 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:19:01,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-28 14:19:01,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-28 14:19:01,712 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:19:01,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:19:01,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1633541723, now seen corresponding path program 11 times [2022-04-28 14:19:01,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:19:01,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1908119091] [2022-04-28 14:19:01,786 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:19:01,786 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:19:01,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1633541723, now seen corresponding path program 12 times [2022-04-28 14:19:01,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:19:01,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130315322] [2022-04-28 14:19:01,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:19:01,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:19:01,800 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:19:01,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2018392342] [2022-04-28 14:19:01,800 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:19:01,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:19:01,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:19:01,812 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-28 14:19:01,813 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-28 14:19:01,976 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 14:19:01,976 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:19:01,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 14:19:01,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:19:01,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:19:02,252 INFO L272 TraceCheckUtils]: 0: Hoare triple {5846#true} call ULTIMATE.init(); {5846#true} is VALID [2022-04-28 14:19:02,253 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-28 14:19:02,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {5854#(<= ~counter~0 0)} assume true; {5854#(<= ~counter~0 0)} is VALID [2022-04-28 14:19:02,264 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5854#(<= ~counter~0 0)} {5846#true} #57#return; {5854#(<= ~counter~0 0)} is VALID [2022-04-28 14:19:02,264 INFO L272 TraceCheckUtils]: 4: Hoare triple {5854#(<= ~counter~0 0)} call #t~ret6 := main(); {5854#(<= ~counter~0 0)} is VALID [2022-04-28 14:19:02,264 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-28 14:19:02,265 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-28 14:19:02,265 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-28 14:19:02,266 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-28 14:19:02,266 INFO L290 TraceCheckUtils]: 9: Hoare triple {5870#(<= ~counter~0 1)} ~cond := #in~cond; {5870#(<= ~counter~0 1)} is VALID [2022-04-28 14:19:02,266 INFO L290 TraceCheckUtils]: 10: Hoare triple {5870#(<= ~counter~0 1)} assume !(0 == ~cond); {5870#(<= ~counter~0 1)} is VALID [2022-04-28 14:19:02,266 INFO L290 TraceCheckUtils]: 11: Hoare triple {5870#(<= ~counter~0 1)} assume true; {5870#(<= ~counter~0 1)} is VALID [2022-04-28 14:19:02,267 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5870#(<= ~counter~0 1)} {5870#(<= ~counter~0 1)} #51#return; {5870#(<= ~counter~0 1)} is VALID [2022-04-28 14:19:02,267 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-28 14:19:02,268 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-28 14:19:02,268 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-28 14:19:02,268 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-28 14:19:02,269 INFO L290 TraceCheckUtils]: 17: Hoare triple {5895#(<= ~counter~0 2)} ~cond := #in~cond; {5895#(<= ~counter~0 2)} is VALID [2022-04-28 14:19:02,269 INFO L290 TraceCheckUtils]: 18: Hoare triple {5895#(<= ~counter~0 2)} assume !(0 == ~cond); {5895#(<= ~counter~0 2)} is VALID [2022-04-28 14:19:02,269 INFO L290 TraceCheckUtils]: 19: Hoare triple {5895#(<= ~counter~0 2)} assume true; {5895#(<= ~counter~0 2)} is VALID [2022-04-28 14:19:02,269 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {5895#(<= ~counter~0 2)} {5895#(<= ~counter~0 2)} #51#return; {5895#(<= ~counter~0 2)} is VALID [2022-04-28 14:19:02,270 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-28 14:19:02,270 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-28 14:19:02,270 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-28 14:19:02,271 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-28 14:19:02,271 INFO L290 TraceCheckUtils]: 25: Hoare triple {5920#(<= ~counter~0 3)} ~cond := #in~cond; {5920#(<= ~counter~0 3)} is VALID [2022-04-28 14:19:02,271 INFO L290 TraceCheckUtils]: 26: Hoare triple {5920#(<= ~counter~0 3)} assume !(0 == ~cond); {5920#(<= ~counter~0 3)} is VALID [2022-04-28 14:19:02,272 INFO L290 TraceCheckUtils]: 27: Hoare triple {5920#(<= ~counter~0 3)} assume true; {5920#(<= ~counter~0 3)} is VALID [2022-04-28 14:19:02,272 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5920#(<= ~counter~0 3)} {5920#(<= ~counter~0 3)} #51#return; {5920#(<= ~counter~0 3)} is VALID [2022-04-28 14:19:02,272 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-28 14:19:02,273 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-28 14:19:02,273 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-28 14:19:02,274 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-28 14:19:02,274 INFO L290 TraceCheckUtils]: 33: Hoare triple {5945#(<= ~counter~0 4)} ~cond := #in~cond; {5945#(<= ~counter~0 4)} is VALID [2022-04-28 14:19:02,274 INFO L290 TraceCheckUtils]: 34: Hoare triple {5945#(<= ~counter~0 4)} assume !(0 == ~cond); {5945#(<= ~counter~0 4)} is VALID [2022-04-28 14:19:02,274 INFO L290 TraceCheckUtils]: 35: Hoare triple {5945#(<= ~counter~0 4)} assume true; {5945#(<= ~counter~0 4)} is VALID [2022-04-28 14:19:02,275 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5945#(<= ~counter~0 4)} {5945#(<= ~counter~0 4)} #51#return; {5945#(<= ~counter~0 4)} is VALID [2022-04-28 14:19:02,275 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-28 14:19:02,275 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-28 14:19:02,276 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-28 14:19:02,276 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-28 14:19:02,276 INFO L290 TraceCheckUtils]: 41: Hoare triple {5970#(<= ~counter~0 5)} ~cond := #in~cond; {5970#(<= ~counter~0 5)} is VALID [2022-04-28 14:19:02,277 INFO L290 TraceCheckUtils]: 42: Hoare triple {5970#(<= ~counter~0 5)} assume !(0 == ~cond); {5970#(<= ~counter~0 5)} is VALID [2022-04-28 14:19:02,277 INFO L290 TraceCheckUtils]: 43: Hoare triple {5970#(<= ~counter~0 5)} assume true; {5970#(<= ~counter~0 5)} is VALID [2022-04-28 14:19:02,277 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5970#(<= ~counter~0 5)} {5970#(<= ~counter~0 5)} #51#return; {5970#(<= ~counter~0 5)} is VALID [2022-04-28 14:19:02,277 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-28 14:19:02,278 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-28 14:19:02,278 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-28 14:19:02,278 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-28 14:19:02,279 INFO L290 TraceCheckUtils]: 49: Hoare triple {5995#(<= ~counter~0 6)} ~cond := #in~cond; {5995#(<= ~counter~0 6)} is VALID [2022-04-28 14:19:02,279 INFO L290 TraceCheckUtils]: 50: Hoare triple {5995#(<= ~counter~0 6)} assume !(0 == ~cond); {5995#(<= ~counter~0 6)} is VALID [2022-04-28 14:19:02,279 INFO L290 TraceCheckUtils]: 51: Hoare triple {5995#(<= ~counter~0 6)} assume true; {5995#(<= ~counter~0 6)} is VALID [2022-04-28 14:19:02,280 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5995#(<= ~counter~0 6)} {5995#(<= ~counter~0 6)} #51#return; {5995#(<= ~counter~0 6)} is VALID [2022-04-28 14:19:02,280 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-28 14:19:02,280 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-28 14:19:02,280 INFO L290 TraceCheckUtils]: 55: Hoare triple {6020#(<= |main_#t~post5| 6)} assume !(#t~post5 < 10);havoc #t~post5; {5847#false} is VALID [2022-04-28 14:19:02,281 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-28 14:19:02,281 INFO L290 TraceCheckUtils]: 57: Hoare triple {5847#false} ~cond := #in~cond; {5847#false} is VALID [2022-04-28 14:19:02,281 INFO L290 TraceCheckUtils]: 58: Hoare triple {5847#false} assume 0 == ~cond; {5847#false} is VALID [2022-04-28 14:19:02,281 INFO L290 TraceCheckUtils]: 59: Hoare triple {5847#false} assume !false; {5847#false} is VALID [2022-04-28 14:19:02,281 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-28 14:19:02,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:19:02,552 INFO L290 TraceCheckUtils]: 59: Hoare triple {5847#false} assume !false; {5847#false} is VALID [2022-04-28 14:19:02,552 INFO L290 TraceCheckUtils]: 58: Hoare triple {5847#false} assume 0 == ~cond; {5847#false} is VALID [2022-04-28 14:19:02,552 INFO L290 TraceCheckUtils]: 57: Hoare triple {5847#false} ~cond := #in~cond; {5847#false} is VALID [2022-04-28 14:19:02,552 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-28 14:19:02,552 INFO L290 TraceCheckUtils]: 55: Hoare triple {6048#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {5847#false} is VALID [2022-04-28 14:19:02,553 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-28 14:19:02,553 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-28 14:19:02,556 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5846#true} {6052#(< ~counter~0 10)} #51#return; {6052#(< ~counter~0 10)} is VALID [2022-04-28 14:19:02,556 INFO L290 TraceCheckUtils]: 51: Hoare triple {5846#true} assume true; {5846#true} is VALID [2022-04-28 14:19:02,556 INFO L290 TraceCheckUtils]: 50: Hoare triple {5846#true} assume !(0 == ~cond); {5846#true} is VALID [2022-04-28 14:19:02,556 INFO L290 TraceCheckUtils]: 49: Hoare triple {5846#true} ~cond := #in~cond; {5846#true} is VALID [2022-04-28 14:19:02,556 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-28 14:19:02,557 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-28 14:19:02,557 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-28 14:19:02,558 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-28 14:19:02,559 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5846#true} {6077#(< ~counter~0 9)} #51#return; {6077#(< ~counter~0 9)} is VALID [2022-04-28 14:19:02,560 INFO L290 TraceCheckUtils]: 43: Hoare triple {5846#true} assume true; {5846#true} is VALID [2022-04-28 14:19:02,560 INFO L290 TraceCheckUtils]: 42: Hoare triple {5846#true} assume !(0 == ~cond); {5846#true} is VALID [2022-04-28 14:19:02,560 INFO L290 TraceCheckUtils]: 41: Hoare triple {5846#true} ~cond := #in~cond; {5846#true} is VALID [2022-04-28 14:19:02,560 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-28 14:19:02,560 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-28 14:19:02,561 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-28 14:19:02,561 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-28 14:19:02,562 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5846#true} {6102#(< ~counter~0 8)} #51#return; {6102#(< ~counter~0 8)} is VALID [2022-04-28 14:19:02,562 INFO L290 TraceCheckUtils]: 35: Hoare triple {5846#true} assume true; {5846#true} is VALID [2022-04-28 14:19:02,562 INFO L290 TraceCheckUtils]: 34: Hoare triple {5846#true} assume !(0 == ~cond); {5846#true} is VALID [2022-04-28 14:19:02,562 INFO L290 TraceCheckUtils]: 33: Hoare triple {5846#true} ~cond := #in~cond; {5846#true} is VALID [2022-04-28 14:19:02,562 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-28 14:19:02,563 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-28 14:19:02,563 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-28 14:19:02,563 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-28 14:19:02,564 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5846#true} {5995#(<= ~counter~0 6)} #51#return; {5995#(<= ~counter~0 6)} is VALID [2022-04-28 14:19:02,564 INFO L290 TraceCheckUtils]: 27: Hoare triple {5846#true} assume true; {5846#true} is VALID [2022-04-28 14:19:02,564 INFO L290 TraceCheckUtils]: 26: Hoare triple {5846#true} assume !(0 == ~cond); {5846#true} is VALID [2022-04-28 14:19:02,564 INFO L290 TraceCheckUtils]: 25: Hoare triple {5846#true} ~cond := #in~cond; {5846#true} is VALID [2022-04-28 14:19:02,564 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-28 14:19:02,564 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-28 14:19:02,565 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-28 14:19:02,565 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-28 14:19:02,565 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {5846#true} {5970#(<= ~counter~0 5)} #51#return; {5970#(<= ~counter~0 5)} is VALID [2022-04-28 14:19:02,565 INFO L290 TraceCheckUtils]: 19: Hoare triple {5846#true} assume true; {5846#true} is VALID [2022-04-28 14:19:02,565 INFO L290 TraceCheckUtils]: 18: Hoare triple {5846#true} assume !(0 == ~cond); {5846#true} is VALID [2022-04-28 14:19:02,566 INFO L290 TraceCheckUtils]: 17: Hoare triple {5846#true} ~cond := #in~cond; {5846#true} is VALID [2022-04-28 14:19:02,566 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-28 14:19:02,566 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-28 14:19:02,566 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-28 14:19:02,566 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-28 14:19:02,567 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5846#true} {5945#(<= ~counter~0 4)} #51#return; {5945#(<= ~counter~0 4)} is VALID [2022-04-28 14:19:02,567 INFO L290 TraceCheckUtils]: 11: Hoare triple {5846#true} assume true; {5846#true} is VALID [2022-04-28 14:19:02,567 INFO L290 TraceCheckUtils]: 10: Hoare triple {5846#true} assume !(0 == ~cond); {5846#true} is VALID [2022-04-28 14:19:02,567 INFO L290 TraceCheckUtils]: 9: Hoare triple {5846#true} ~cond := #in~cond; {5846#true} is VALID [2022-04-28 14:19:02,567 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-28 14:19:02,567 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-28 14:19:02,568 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-28 14:19:02,568 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-28 14:19:02,568 INFO L272 TraceCheckUtils]: 4: Hoare triple {5920#(<= ~counter~0 3)} call #t~ret6 := main(); {5920#(<= ~counter~0 3)} is VALID [2022-04-28 14:19:02,569 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5920#(<= ~counter~0 3)} {5846#true} #57#return; {5920#(<= ~counter~0 3)} is VALID [2022-04-28 14:19:02,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {5920#(<= ~counter~0 3)} assume true; {5920#(<= ~counter~0 3)} is VALID [2022-04-28 14:19:02,575 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-28 14:19:02,575 INFO L272 TraceCheckUtils]: 0: Hoare triple {5846#true} call ULTIMATE.init(); {5846#true} is VALID [2022-04-28 14:19:02,575 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-28 14:19:02,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:19:02,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130315322] [2022-04-28 14:19:02,576 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:19:02,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018392342] [2022-04-28 14:19:02,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018392342] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:19:02,576 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:19:02,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-04-28 14:19:02,576 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:19:02,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1908119091] [2022-04-28 14:19:02,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1908119091] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:19:02,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:19:02,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 14:19:02,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856287709] [2022-04-28 14:19:02,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:19:02,577 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-28 14:19:02,577 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:19:02,577 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-28 14:19:02,616 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-28 14:19:02,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 14:19:02,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:19:02,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 14:19:02,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 14:19:02,617 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-28 14:19:02,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:19:02,835 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2022-04-28 14:19:02,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 14:19:02,835 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-28 14:19:02,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:19:02,835 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-28 14:19:02,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 74 transitions. [2022-04-28 14:19:02,836 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-28 14:19:02,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 74 transitions. [2022-04-28 14:19:02,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 74 transitions. [2022-04-28 14:19:02,882 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-28 14:19:02,882 INFO L225 Difference]: With dead ends: 74 [2022-04-28 14:19:02,882 INFO L226 Difference]: Without dead ends: 69 [2022-04-28 14:19:02,883 INFO L412 NwaCegarLoop]: 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-28 14:19:02,883 INFO L413 NwaCegarLoop]: 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-28 14:19:02,883 INFO L414 NwaCegarLoop]: 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-28 14:19:02,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-28 14:19:02,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-04-28 14:19:02,955 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:19:02,955 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-28 14:19:02,955 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-28 14:19:02,955 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-28 14:19:02,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:19:02,956 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2022-04-28 14:19:02,956 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2022-04-28 14:19:02,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:19:02,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:19:02,956 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-28 14:19:02,956 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-28 14:19:02,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:19:02,957 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2022-04-28 14:19:02,957 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2022-04-28 14:19:02,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:19:02,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:19:02,958 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:19:02,958 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:19:02,958 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-28 14:19:02,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2022-04-28 14:19:02,959 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 60 [2022-04-28 14:19:02,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:19:02,959 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2022-04-28 14:19:02,959 INFO L496 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-28 14:19:02,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 70 transitions. [2022-04-28 14:19:03,037 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-28 14:19:03,038 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2022-04-28 14:19:03,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 14:19:03,038 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:19:03,038 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:19:03,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-28 14:19:03,239 WARN L477 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-28 14:19:03,239 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:19:03,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:19:03,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1180930233, now seen corresponding path program 11 times [2022-04-28 14:19:03,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:19:03,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [632692837] [2022-04-28 14:19:03,323 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:19:03,323 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:19:03,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1180930233, now seen corresponding path program 12 times [2022-04-28 14:19:03,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:19:03,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822988297] [2022-04-28 14:19:03,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:19:03,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:19:03,332 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:19:03,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [81801314] [2022-04-28 14:19:03,332 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:19:03,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:19:03,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:19:03,333 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-28 14:19:03,334 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-28 14:19:03,652 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 14:19:03,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:19:03,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 14:19:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:19:03,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:19:04,035 INFO L272 TraceCheckUtils]: 0: Hoare triple {6655#true} call ULTIMATE.init(); {6655#true} is VALID [2022-04-28 14:19:04,036 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-28 14:19:04,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {6655#true} assume true; {6655#true} is VALID [2022-04-28 14:19:04,036 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6655#true} {6655#true} #57#return; {6655#true} is VALID [2022-04-28 14:19:04,036 INFO L272 TraceCheckUtils]: 4: Hoare triple {6655#true} call #t~ret6 := main(); {6655#true} is VALID [2022-04-28 14:19:04,036 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-28 14:19:04,037 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-28 14:19:04,037 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-28 14:19:04,037 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-28 14:19:04,037 INFO L290 TraceCheckUtils]: 9: Hoare triple {6655#true} ~cond := #in~cond; {6655#true} is VALID [2022-04-28 14:19:04,037 INFO L290 TraceCheckUtils]: 10: Hoare triple {6655#true} assume !(0 == ~cond); {6655#true} is VALID [2022-04-28 14:19:04,037 INFO L290 TraceCheckUtils]: 11: Hoare triple {6655#true} assume true; {6655#true} is VALID [2022-04-28 14:19:04,038 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-28 14:19:04,038 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-28 14:19:04,038 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-28 14:19:04,038 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-28 14:19:04,039 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-28 14:19:04,039 INFO L290 TraceCheckUtils]: 17: Hoare triple {6655#true} ~cond := #in~cond; {6655#true} is VALID [2022-04-28 14:19:04,039 INFO L290 TraceCheckUtils]: 18: Hoare triple {6655#true} assume !(0 == ~cond); {6655#true} is VALID [2022-04-28 14:19:04,039 INFO L290 TraceCheckUtils]: 19: Hoare triple {6655#true} assume true; {6655#true} is VALID [2022-04-28 14:19:04,039 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-28 14:19:04,040 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-28 14:19:04,040 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-28 14:19:04,040 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-28 14:19:04,040 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-28 14:19:04,040 INFO L290 TraceCheckUtils]: 25: Hoare triple {6655#true} ~cond := #in~cond; {6655#true} is VALID [2022-04-28 14:19:04,040 INFO L290 TraceCheckUtils]: 26: Hoare triple {6655#true} assume !(0 == ~cond); {6655#true} is VALID [2022-04-28 14:19:04,040 INFO L290 TraceCheckUtils]: 27: Hoare triple {6655#true} assume true; {6655#true} is VALID [2022-04-28 14:19:04,041 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-28 14:19:04,041 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-28 14:19:04,041 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-28 14:19:04,042 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-28 14:19:04,042 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-28 14:19:04,042 INFO L290 TraceCheckUtils]: 33: Hoare triple {6655#true} ~cond := #in~cond; {6655#true} is VALID [2022-04-28 14:19:04,042 INFO L290 TraceCheckUtils]: 34: Hoare triple {6655#true} assume !(0 == ~cond); {6655#true} is VALID [2022-04-28 14:19:04,042 INFO L290 TraceCheckUtils]: 35: Hoare triple {6655#true} assume true; {6655#true} is VALID [2022-04-28 14:19:04,042 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-28 14:19:04,043 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-28 14:19:04,043 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-28 14:19:04,043 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-28 14:19:04,043 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-28 14:19:04,044 INFO L290 TraceCheckUtils]: 41: Hoare triple {6655#true} ~cond := #in~cond; {6655#true} is VALID [2022-04-28 14:19:04,044 INFO L290 TraceCheckUtils]: 42: Hoare triple {6655#true} assume !(0 == ~cond); {6655#true} is VALID [2022-04-28 14:19:04,044 INFO L290 TraceCheckUtils]: 43: Hoare triple {6655#true} assume true; {6655#true} is VALID [2022-04-28 14:19:04,044 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-28 14:19:04,044 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-28 14:19:04,045 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-28 14:19:04,045 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-28 14:19:04,045 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-28 14:19:04,045 INFO L290 TraceCheckUtils]: 49: Hoare triple {6655#true} ~cond := #in~cond; {6655#true} is VALID [2022-04-28 14:19:04,045 INFO L290 TraceCheckUtils]: 50: Hoare triple {6655#true} assume !(0 == ~cond); {6655#true} is VALID [2022-04-28 14:19:04,045 INFO L290 TraceCheckUtils]: 51: Hoare triple {6655#true} assume true; {6655#true} is VALID [2022-04-28 14:19:04,046 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-28 14:19:04,046 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-28 14:19:04,046 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-28 14:19:04,047 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-28 14:19:04,047 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-28 14:19:04,047 INFO L290 TraceCheckUtils]: 57: Hoare triple {6655#true} ~cond := #in~cond; {6655#true} is VALID [2022-04-28 14:19:04,047 INFO L290 TraceCheckUtils]: 58: Hoare triple {6655#true} assume !(0 == ~cond); {6655#true} is VALID [2022-04-28 14:19:04,047 INFO L290 TraceCheckUtils]: 59: Hoare triple {6655#true} assume true; {6655#true} is VALID [2022-04-28 14:19:04,047 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-28 14:19:04,048 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-28 14:19:04,048 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-28 14:19:04,049 INFO L290 TraceCheckUtils]: 63: Hoare triple {6854#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6858#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:19:04,049 INFO L290 TraceCheckUtils]: 64: Hoare triple {6858#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6656#false} is VALID [2022-04-28 14:19:04,049 INFO L290 TraceCheckUtils]: 65: Hoare triple {6656#false} assume !false; {6656#false} is VALID [2022-04-28 14:19:04,049 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-28 14:19:04,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:19:04,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:19:04,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822988297] [2022-04-28 14:19:04,280 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:19:04,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81801314] [2022-04-28 14:19:04,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81801314] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:19:04,281 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:19:04,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-28 14:19:04,281 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:19:04,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [632692837] [2022-04-28 14:19:04,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [632692837] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:19:04,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:19:04,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 14:19:04,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874061749] [2022-04-28 14:19:04,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:19:04,281 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-28 14:19:04,282 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:19:04,282 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-28 14:19:04,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:19:04,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 14:19:04,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:19:04,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 14:19:04,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-28 14:19:04,313 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-28 14:19:04,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:19:04,859 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2022-04-28 14:19:04,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 14:19:04,860 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-28 14:19:04,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:19:04,860 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-28 14:19:04,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 59 transitions. [2022-04-28 14:19:04,861 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-28 14:19:04,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 59 transitions. [2022-04-28 14:19:04,862 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 59 transitions. [2022-04-28 14:19:04,898 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-28 14:19:04,899 INFO L225 Difference]: With dead ends: 76 [2022-04-28 14:19:04,899 INFO L226 Difference]: Without dead ends: 71 [2022-04-28 14:19:04,899 INFO L412 NwaCegarLoop]: 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-28 14:19:04,900 INFO L413 NwaCegarLoop]: 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-28 14:19:04,900 INFO L414 NwaCegarLoop]: 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-28 14:19:04,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-28 14:19:04,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-04-28 14:19:04,976 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:19:04,976 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-28 14:19:04,977 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-28 14:19:04,977 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-28 14:19:04,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:19:04,978 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2022-04-28 14:19:04,978 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2022-04-28 14:19:04,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:19:04,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:19:04,978 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-28 14:19:04,978 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-28 14:19:04,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:19:04,979 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2022-04-28 14:19:04,979 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2022-04-28 14:19:04,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:19:04,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:19:04,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:19:04,980 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:19:04,980 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-28 14:19:04,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2022-04-28 14:19:04,981 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 66 [2022-04-28 14:19:04,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:19:04,981 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2022-04-28 14:19:04,981 INFO L496 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-28 14:19:04,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 73 transitions. [2022-04-28 14:19:05,056 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-28 14:19:05,056 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2022-04-28 14:19:05,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-28 14:19:05,056 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:19:05,056 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:19:05,063 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-28 14:19:05,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-28 14:19:05,263 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:19:05,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:19:05,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1699217054, now seen corresponding path program 13 times [2022-04-28 14:19:05,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:19:05,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2022550345] [2022-04-28 14:19:05,365 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:19:05,365 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:19:05,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1699217054, now seen corresponding path program 14 times [2022-04-28 14:19:05,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:19:05,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435304950] [2022-04-28 14:19:05,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:19:05,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:19:05,375 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:19:05,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1095820680] [2022-04-28 14:19:05,375 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:19:05,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:19:05,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:19:05,376 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-28 14:19:05,377 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-28 14:19:05,422 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:19:05,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:19:05,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 14:19:05,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:19:05,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:19:05,756 INFO L272 TraceCheckUtils]: 0: Hoare triple {7349#true} call ULTIMATE.init(); {7349#true} is VALID [2022-04-28 14:19:05,756 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-28 14:19:05,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {7357#(<= ~counter~0 0)} assume true; {7357#(<= ~counter~0 0)} is VALID [2022-04-28 14:19:05,757 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7357#(<= ~counter~0 0)} {7349#true} #57#return; {7357#(<= ~counter~0 0)} is VALID [2022-04-28 14:19:05,757 INFO L272 TraceCheckUtils]: 4: Hoare triple {7357#(<= ~counter~0 0)} call #t~ret6 := main(); {7357#(<= ~counter~0 0)} is VALID [2022-04-28 14:19:05,757 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-28 14:19:05,758 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-28 14:19:05,758 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-28 14:19:05,759 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-28 14:19:05,759 INFO L290 TraceCheckUtils]: 9: Hoare triple {7373#(<= ~counter~0 1)} ~cond := #in~cond; {7373#(<= ~counter~0 1)} is VALID [2022-04-28 14:19:05,759 INFO L290 TraceCheckUtils]: 10: Hoare triple {7373#(<= ~counter~0 1)} assume !(0 == ~cond); {7373#(<= ~counter~0 1)} is VALID [2022-04-28 14:19:05,759 INFO L290 TraceCheckUtils]: 11: Hoare triple {7373#(<= ~counter~0 1)} assume true; {7373#(<= ~counter~0 1)} is VALID [2022-04-28 14:19:05,760 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7373#(<= ~counter~0 1)} {7373#(<= ~counter~0 1)} #51#return; {7373#(<= ~counter~0 1)} is VALID [2022-04-28 14:19:05,760 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-28 14:19:05,760 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-28 14:19:05,761 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-28 14:19:05,761 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-28 14:19:05,761 INFO L290 TraceCheckUtils]: 17: Hoare triple {7398#(<= ~counter~0 2)} ~cond := #in~cond; {7398#(<= ~counter~0 2)} is VALID [2022-04-28 14:19:05,761 INFO L290 TraceCheckUtils]: 18: Hoare triple {7398#(<= ~counter~0 2)} assume !(0 == ~cond); {7398#(<= ~counter~0 2)} is VALID [2022-04-28 14:19:05,762 INFO L290 TraceCheckUtils]: 19: Hoare triple {7398#(<= ~counter~0 2)} assume true; {7398#(<= ~counter~0 2)} is VALID [2022-04-28 14:19:05,762 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7398#(<= ~counter~0 2)} {7398#(<= ~counter~0 2)} #51#return; {7398#(<= ~counter~0 2)} is VALID [2022-04-28 14:19:05,762 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-28 14:19:05,763 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-28 14:19:05,763 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-28 14:19:05,763 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-28 14:19:05,764 INFO L290 TraceCheckUtils]: 25: Hoare triple {7423#(<= ~counter~0 3)} ~cond := #in~cond; {7423#(<= ~counter~0 3)} is VALID [2022-04-28 14:19:05,764 INFO L290 TraceCheckUtils]: 26: Hoare triple {7423#(<= ~counter~0 3)} assume !(0 == ~cond); {7423#(<= ~counter~0 3)} is VALID [2022-04-28 14:19:05,764 INFO L290 TraceCheckUtils]: 27: Hoare triple {7423#(<= ~counter~0 3)} assume true; {7423#(<= ~counter~0 3)} is VALID [2022-04-28 14:19:05,765 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7423#(<= ~counter~0 3)} {7423#(<= ~counter~0 3)} #51#return; {7423#(<= ~counter~0 3)} is VALID [2022-04-28 14:19:05,765 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-28 14:19:05,765 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-28 14:19:05,765 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-28 14:19:05,766 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-28 14:19:05,766 INFO L290 TraceCheckUtils]: 33: Hoare triple {7448#(<= ~counter~0 4)} ~cond := #in~cond; {7448#(<= ~counter~0 4)} is VALID [2022-04-28 14:19:05,766 INFO L290 TraceCheckUtils]: 34: Hoare triple {7448#(<= ~counter~0 4)} assume !(0 == ~cond); {7448#(<= ~counter~0 4)} is VALID [2022-04-28 14:19:05,767 INFO L290 TraceCheckUtils]: 35: Hoare triple {7448#(<= ~counter~0 4)} assume true; {7448#(<= ~counter~0 4)} is VALID [2022-04-28 14:19:05,767 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7448#(<= ~counter~0 4)} {7448#(<= ~counter~0 4)} #51#return; {7448#(<= ~counter~0 4)} is VALID [2022-04-28 14:19:05,767 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-28 14:19:05,768 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-28 14:19:05,768 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-28 14:19:05,768 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-28 14:19:05,768 INFO L290 TraceCheckUtils]: 41: Hoare triple {7473#(<= ~counter~0 5)} ~cond := #in~cond; {7473#(<= ~counter~0 5)} is VALID [2022-04-28 14:19:05,769 INFO L290 TraceCheckUtils]: 42: Hoare triple {7473#(<= ~counter~0 5)} assume !(0 == ~cond); {7473#(<= ~counter~0 5)} is VALID [2022-04-28 14:19:05,769 INFO L290 TraceCheckUtils]: 43: Hoare triple {7473#(<= ~counter~0 5)} assume true; {7473#(<= ~counter~0 5)} is VALID [2022-04-28 14:19:05,769 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7473#(<= ~counter~0 5)} {7473#(<= ~counter~0 5)} #51#return; {7473#(<= ~counter~0 5)} is VALID [2022-04-28 14:19:05,770 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-28 14:19:05,770 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-28 14:19:05,770 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-28 14:19:05,771 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-28 14:19:05,771 INFO L290 TraceCheckUtils]: 49: Hoare triple {7498#(<= ~counter~0 6)} ~cond := #in~cond; {7498#(<= ~counter~0 6)} is VALID [2022-04-28 14:19:05,771 INFO L290 TraceCheckUtils]: 50: Hoare triple {7498#(<= ~counter~0 6)} assume !(0 == ~cond); {7498#(<= ~counter~0 6)} is VALID [2022-04-28 14:19:05,771 INFO L290 TraceCheckUtils]: 51: Hoare triple {7498#(<= ~counter~0 6)} assume true; {7498#(<= ~counter~0 6)} is VALID [2022-04-28 14:19:05,772 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7498#(<= ~counter~0 6)} {7498#(<= ~counter~0 6)} #51#return; {7498#(<= ~counter~0 6)} is VALID [2022-04-28 14:19:05,772 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-28 14:19:05,772 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-28 14:19:05,773 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-28 14:19:05,773 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-28 14:19:05,773 INFO L290 TraceCheckUtils]: 57: Hoare triple {7523#(<= ~counter~0 7)} ~cond := #in~cond; {7523#(<= ~counter~0 7)} is VALID [2022-04-28 14:19:05,773 INFO L290 TraceCheckUtils]: 58: Hoare triple {7523#(<= ~counter~0 7)} assume !(0 == ~cond); {7523#(<= ~counter~0 7)} is VALID [2022-04-28 14:19:05,774 INFO L290 TraceCheckUtils]: 59: Hoare triple {7523#(<= ~counter~0 7)} assume true; {7523#(<= ~counter~0 7)} is VALID [2022-04-28 14:19:05,774 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7523#(<= ~counter~0 7)} {7523#(<= ~counter~0 7)} #51#return; {7523#(<= ~counter~0 7)} is VALID [2022-04-28 14:19:05,774 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-28 14:19:05,775 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-28 14:19:05,775 INFO L290 TraceCheckUtils]: 63: Hoare triple {7548#(<= |main_#t~post5| 7)} assume !(#t~post5 < 10);havoc #t~post5; {7350#false} is VALID [2022-04-28 14:19:05,775 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-28 14:19:05,775 INFO L290 TraceCheckUtils]: 65: Hoare triple {7350#false} ~cond := #in~cond; {7350#false} is VALID [2022-04-28 14:19:05,775 INFO L290 TraceCheckUtils]: 66: Hoare triple {7350#false} assume 0 == ~cond; {7350#false} is VALID [2022-04-28 14:19:05,775 INFO L290 TraceCheckUtils]: 67: Hoare triple {7350#false} assume !false; {7350#false} is VALID [2022-04-28 14:19:05,775 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-28 14:19:05,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:19:06,104 INFO L290 TraceCheckUtils]: 67: Hoare triple {7350#false} assume !false; {7350#false} is VALID [2022-04-28 14:19:06,104 INFO L290 TraceCheckUtils]: 66: Hoare triple {7350#false} assume 0 == ~cond; {7350#false} is VALID [2022-04-28 14:19:06,104 INFO L290 TraceCheckUtils]: 65: Hoare triple {7350#false} ~cond := #in~cond; {7350#false} is VALID [2022-04-28 14:19:06,104 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-28 14:19:06,108 INFO L290 TraceCheckUtils]: 63: Hoare triple {7576#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {7350#false} is VALID [2022-04-28 14:19:06,108 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-28 14:19:06,109 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-28 14:19:06,109 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7349#true} {7580#(< ~counter~0 10)} #51#return; {7580#(< ~counter~0 10)} is VALID [2022-04-28 14:19:06,109 INFO L290 TraceCheckUtils]: 59: Hoare triple {7349#true} assume true; {7349#true} is VALID [2022-04-28 14:19:06,109 INFO L290 TraceCheckUtils]: 58: Hoare triple {7349#true} assume !(0 == ~cond); {7349#true} is VALID [2022-04-28 14:19:06,109 INFO L290 TraceCheckUtils]: 57: Hoare triple {7349#true} ~cond := #in~cond; {7349#true} is VALID [2022-04-28 14:19:06,109 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-28 14:19:06,109 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-28 14:19:06,110 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-28 14:19:06,110 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-28 14:19:06,111 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7349#true} {7605#(< ~counter~0 9)} #51#return; {7605#(< ~counter~0 9)} is VALID [2022-04-28 14:19:06,111 INFO L290 TraceCheckUtils]: 51: Hoare triple {7349#true} assume true; {7349#true} is VALID [2022-04-28 14:19:06,111 INFO L290 TraceCheckUtils]: 50: Hoare triple {7349#true} assume !(0 == ~cond); {7349#true} is VALID [2022-04-28 14:19:06,111 INFO L290 TraceCheckUtils]: 49: Hoare triple {7349#true} ~cond := #in~cond; {7349#true} is VALID [2022-04-28 14:19:06,111 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-28 14:19:06,111 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-28 14:19:06,112 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-28 14:19:06,112 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-28 14:19:06,112 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7349#true} {7523#(<= ~counter~0 7)} #51#return; {7523#(<= ~counter~0 7)} is VALID [2022-04-28 14:19:06,112 INFO L290 TraceCheckUtils]: 43: Hoare triple {7349#true} assume true; {7349#true} is VALID [2022-04-28 14:19:06,112 INFO L290 TraceCheckUtils]: 42: Hoare triple {7349#true} assume !(0 == ~cond); {7349#true} is VALID [2022-04-28 14:19:06,112 INFO L290 TraceCheckUtils]: 41: Hoare triple {7349#true} ~cond := #in~cond; {7349#true} is VALID [2022-04-28 14:19:06,112 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-28 14:19:06,116 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-28 14:19:06,116 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-28 14:19:06,116 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-28 14:19:06,117 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7349#true} {7498#(<= ~counter~0 6)} #51#return; {7498#(<= ~counter~0 6)} is VALID [2022-04-28 14:19:06,117 INFO L290 TraceCheckUtils]: 35: Hoare triple {7349#true} assume true; {7349#true} is VALID [2022-04-28 14:19:06,117 INFO L290 TraceCheckUtils]: 34: Hoare triple {7349#true} assume !(0 == ~cond); {7349#true} is VALID [2022-04-28 14:19:06,117 INFO L290 TraceCheckUtils]: 33: Hoare triple {7349#true} ~cond := #in~cond; {7349#true} is VALID [2022-04-28 14:19:06,117 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-28 14:19:06,117 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-28 14:19:06,118 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-28 14:19:06,118 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-28 14:19:06,118 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7349#true} {7473#(<= ~counter~0 5)} #51#return; {7473#(<= ~counter~0 5)} is VALID [2022-04-28 14:19:06,118 INFO L290 TraceCheckUtils]: 27: Hoare triple {7349#true} assume true; {7349#true} is VALID [2022-04-28 14:19:06,118 INFO L290 TraceCheckUtils]: 26: Hoare triple {7349#true} assume !(0 == ~cond); {7349#true} is VALID [2022-04-28 14:19:06,118 INFO L290 TraceCheckUtils]: 25: Hoare triple {7349#true} ~cond := #in~cond; {7349#true} is VALID [2022-04-28 14:19:06,118 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-28 14:19:06,119 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-28 14:19:06,119 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-28 14:19:06,119 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-28 14:19:06,120 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7349#true} {7448#(<= ~counter~0 4)} #51#return; {7448#(<= ~counter~0 4)} is VALID [2022-04-28 14:19:06,120 INFO L290 TraceCheckUtils]: 19: Hoare triple {7349#true} assume true; {7349#true} is VALID [2022-04-28 14:19:06,120 INFO L290 TraceCheckUtils]: 18: Hoare triple {7349#true} assume !(0 == ~cond); {7349#true} is VALID [2022-04-28 14:19:06,120 INFO L290 TraceCheckUtils]: 17: Hoare triple {7349#true} ~cond := #in~cond; {7349#true} is VALID [2022-04-28 14:19:06,120 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-28 14:19:06,120 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-28 14:19:06,121 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-28 14:19:06,121 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-28 14:19:06,121 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7349#true} {7423#(<= ~counter~0 3)} #51#return; {7423#(<= ~counter~0 3)} is VALID [2022-04-28 14:19:06,121 INFO L290 TraceCheckUtils]: 11: Hoare triple {7349#true} assume true; {7349#true} is VALID [2022-04-28 14:19:06,121 INFO L290 TraceCheckUtils]: 10: Hoare triple {7349#true} assume !(0 == ~cond); {7349#true} is VALID [2022-04-28 14:19:06,121 INFO L290 TraceCheckUtils]: 9: Hoare triple {7349#true} ~cond := #in~cond; {7349#true} is VALID [2022-04-28 14:19:06,121 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-28 14:19:06,122 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-28 14:19:06,122 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-28 14:19:06,122 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-28 14:19:06,123 INFO L272 TraceCheckUtils]: 4: Hoare triple {7398#(<= ~counter~0 2)} call #t~ret6 := main(); {7398#(<= ~counter~0 2)} is VALID [2022-04-28 14:19:06,123 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7398#(<= ~counter~0 2)} {7349#true} #57#return; {7398#(<= ~counter~0 2)} is VALID [2022-04-28 14:19:06,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {7398#(<= ~counter~0 2)} assume true; {7398#(<= ~counter~0 2)} is VALID [2022-04-28 14:19:06,124 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-28 14:19:06,124 INFO L272 TraceCheckUtils]: 0: Hoare triple {7349#true} call ULTIMATE.init(); {7349#true} is VALID [2022-04-28 14:19:06,124 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-28 14:19:06,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:19:06,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435304950] [2022-04-28 14:19:06,124 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:19:06,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095820680] [2022-04-28 14:19:06,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095820680] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:19:06,124 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:19:06,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2022-04-28 14:19:06,124 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:19:06,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2022550345] [2022-04-28 14:19:06,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2022550345] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:19:06,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:19:06,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 14:19:06,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502490411] [2022-04-28 14:19:06,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:19:06,125 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-28 14:19:06,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:19:06,125 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-28 14:19:06,174 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-28 14:19:06,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 14:19:06,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:19:06,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 14:19:06,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 14:19:06,175 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-28 14:19:06,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:19:06,406 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2022-04-28 14:19:06,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 14:19:06,406 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-28 14:19:06,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:19:06,406 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-28 14:19:06,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 82 transitions. [2022-04-28 14:19:06,408 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-28 14:19:06,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 82 transitions. [2022-04-28 14:19:06,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 82 transitions. [2022-04-28 14:19:06,467 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-28 14:19:06,468 INFO L225 Difference]: With dead ends: 82 [2022-04-28 14:19:06,468 INFO L226 Difference]: Without dead ends: 77 [2022-04-28 14:19:06,469 INFO L412 NwaCegarLoop]: 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-28 14:19:06,469 INFO L413 NwaCegarLoop]: 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-28 14:19:06,469 INFO L414 NwaCegarLoop]: 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-28 14:19:06,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-28 14:19:06,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-04-28 14:19:06,552 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:19:06,553 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-28 14:19:06,553 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-28 14:19:06,553 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-28 14:19:06,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:19:06,554 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2022-04-28 14:19:06,554 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2022-04-28 14:19:06,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:19:06,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:19:06,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-28 14:19:06,554 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-28 14:19:06,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:19:06,555 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2022-04-28 14:19:06,555 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2022-04-28 14:19:06,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:19:06,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:19:06,556 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:19:06,556 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:19:06,556 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-28 14:19:06,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2022-04-28 14:19:06,557 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 68 [2022-04-28 14:19:06,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:19:06,557 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2022-04-28 14:19:06,557 INFO L496 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-28 14:19:06,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 78 transitions. [2022-04-28 14:19:06,646 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-28 14:19:06,646 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2022-04-28 14:19:06,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-28 14:19:06,647 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:19:06,647 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:19:06,663 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-28 14:19:06,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-28 14:19:06,847 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:19:06,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:19:06,848 INFO L85 PathProgramCache]: Analyzing trace with hash -763940164, now seen corresponding path program 13 times [2022-04-28 14:19:06,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:19:06,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1243317579] [2022-04-28 14:19:06,935 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:19:06,935 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:19:06,935 INFO L85 PathProgramCache]: Analyzing trace with hash -763940164, now seen corresponding path program 14 times [2022-04-28 14:19:06,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:19:06,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110247240] [2022-04-28 14:19:06,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:19:06,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:19:06,959 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:19:06,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1471692947] [2022-04-28 14:19:06,959 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:19:06,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:19:06,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:19:06,971 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-28 14:19:06,973 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-28 14:19:07,367 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:19:07,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:19:07,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-28 14:19:07,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:19:07,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:19:07,757 INFO L272 TraceCheckUtils]: 0: Hoare triple {8256#true} call ULTIMATE.init(); {8256#true} is VALID [2022-04-28 14:19:07,757 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-28 14:19:07,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {8256#true} assume true; {8256#true} is VALID [2022-04-28 14:19:07,757 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8256#true} {8256#true} #57#return; {8256#true} is VALID [2022-04-28 14:19:07,758 INFO L272 TraceCheckUtils]: 4: Hoare triple {8256#true} call #t~ret6 := main(); {8256#true} is VALID [2022-04-28 14:19:07,758 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-28 14:19:07,758 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-28 14:19:07,758 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-28 14:19:07,759 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-28 14:19:07,759 INFO L290 TraceCheckUtils]: 9: Hoare triple {8256#true} ~cond := #in~cond; {8256#true} is VALID [2022-04-28 14:19:07,759 INFO L290 TraceCheckUtils]: 10: Hoare triple {8256#true} assume !(0 == ~cond); {8256#true} is VALID [2022-04-28 14:19:07,759 INFO L290 TraceCheckUtils]: 11: Hoare triple {8256#true} assume true; {8256#true} is VALID [2022-04-28 14:19:07,759 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-28 14:19:07,759 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-28 14:19:07,760 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-28 14:19:07,760 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-28 14:19:07,760 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-28 14:19:07,760 INFO L290 TraceCheckUtils]: 17: Hoare triple {8256#true} ~cond := #in~cond; {8256#true} is VALID [2022-04-28 14:19:07,760 INFO L290 TraceCheckUtils]: 18: Hoare triple {8256#true} assume !(0 == ~cond); {8256#true} is VALID [2022-04-28 14:19:07,760 INFO L290 TraceCheckUtils]: 19: Hoare triple {8256#true} assume true; {8256#true} is VALID [2022-04-28 14:19:07,761 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-28 14:19:07,761 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-28 14:19:07,761 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-28 14:19:07,762 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-28 14:19:07,762 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-28 14:19:07,762 INFO L290 TraceCheckUtils]: 25: Hoare triple {8256#true} ~cond := #in~cond; {8256#true} is VALID [2022-04-28 14:19:07,762 INFO L290 TraceCheckUtils]: 26: Hoare triple {8256#true} assume !(0 == ~cond); {8256#true} is VALID [2022-04-28 14:19:07,762 INFO L290 TraceCheckUtils]: 27: Hoare triple {8256#true} assume true; {8256#true} is VALID [2022-04-28 14:19:07,762 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-28 14:19:07,763 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-28 14:19:07,763 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-28 14:19:07,763 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-28 14:19:07,764 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-28 14:19:07,764 INFO L290 TraceCheckUtils]: 33: Hoare triple {8256#true} ~cond := #in~cond; {8256#true} is VALID [2022-04-28 14:19:07,764 INFO L290 TraceCheckUtils]: 34: Hoare triple {8256#true} assume !(0 == ~cond); {8256#true} is VALID [2022-04-28 14:19:07,764 INFO L290 TraceCheckUtils]: 35: Hoare triple {8256#true} assume true; {8256#true} is VALID [2022-04-28 14:19:07,764 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-28 14:19:07,764 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-28 14:19:07,765 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-28 14:19:07,765 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-28 14:19:07,765 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-28 14:19:07,765 INFO L290 TraceCheckUtils]: 41: Hoare triple {8256#true} ~cond := #in~cond; {8256#true} is VALID [2022-04-28 14:19:07,765 INFO L290 TraceCheckUtils]: 42: Hoare triple {8256#true} assume !(0 == ~cond); {8256#true} is VALID [2022-04-28 14:19:07,765 INFO L290 TraceCheckUtils]: 43: Hoare triple {8256#true} assume true; {8256#true} is VALID [2022-04-28 14:19:07,766 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-28 14:19:07,766 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-28 14:19:07,766 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-28 14:19:07,767 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-28 14:19:07,767 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-28 14:19:07,767 INFO L290 TraceCheckUtils]: 49: Hoare triple {8256#true} ~cond := #in~cond; {8256#true} is VALID [2022-04-28 14:19:07,767 INFO L290 TraceCheckUtils]: 50: Hoare triple {8256#true} assume !(0 == ~cond); {8256#true} is VALID [2022-04-28 14:19:07,767 INFO L290 TraceCheckUtils]: 51: Hoare triple {8256#true} assume true; {8256#true} is VALID [2022-04-28 14:19:07,767 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-28 14:19:07,768 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-28 14:19:07,768 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-28 14:19:07,768 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-28 14:19:07,768 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-28 14:19:07,769 INFO L290 TraceCheckUtils]: 57: Hoare triple {8256#true} ~cond := #in~cond; {8256#true} is VALID [2022-04-28 14:19:07,769 INFO L290 TraceCheckUtils]: 58: Hoare triple {8256#true} assume !(0 == ~cond); {8256#true} is VALID [2022-04-28 14:19:07,769 INFO L290 TraceCheckUtils]: 59: Hoare triple {8256#true} assume true; {8256#true} is VALID [2022-04-28 14:19:07,769 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-28 14:19:07,769 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-28 14:19:07,770 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-28 14:19:07,770 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-28 14:19:07,770 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-28 14:19:07,770 INFO L290 TraceCheckUtils]: 65: Hoare triple {8256#true} ~cond := #in~cond; {8256#true} is VALID [2022-04-28 14:19:07,770 INFO L290 TraceCheckUtils]: 66: Hoare triple {8256#true} assume !(0 == ~cond); {8256#true} is VALID [2022-04-28 14:19:07,770 INFO L290 TraceCheckUtils]: 67: Hoare triple {8256#true} assume true; {8256#true} is VALID [2022-04-28 14:19:07,771 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-28 14:19:07,771 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-28 14:19:07,772 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-28 14:19:07,772 INFO L290 TraceCheckUtils]: 71: Hoare triple {8480#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8484#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:19:07,772 INFO L290 TraceCheckUtils]: 72: Hoare triple {8484#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8257#false} is VALID [2022-04-28 14:19:07,773 INFO L290 TraceCheckUtils]: 73: Hoare triple {8257#false} assume !false; {8257#false} is VALID [2022-04-28 14:19:07,773 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-28 14:19:07,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:19:08,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:19:08,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110247240] [2022-04-28 14:19:08,027 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:19:08,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471692947] [2022-04-28 14:19:08,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471692947] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:19:08,027 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:19:08,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-28 14:19:08,027 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:19:08,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1243317579] [2022-04-28 14:19:08,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1243317579] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:19:08,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:19:08,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 14:19:08,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009199107] [2022-04-28 14:19:08,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:19:08,028 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-28 14:19:08,028 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:19:08,028 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-28 14:19:08,063 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-28 14:19:08,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 14:19:08,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:19:08,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 14:19:08,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-28 14:19:08,064 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-28 14:19:08,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:19:08,735 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2022-04-28 14:19:08,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 14:19:08,735 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-28 14:19:08,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:19:08,736 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-28 14:19:08,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 64 transitions. [2022-04-28 14:19:08,737 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-28 14:19:08,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 64 transitions. [2022-04-28 14:19:08,737 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 64 transitions. [2022-04-28 14:19:08,781 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-28 14:19:08,782 INFO L225 Difference]: With dead ends: 84 [2022-04-28 14:19:08,782 INFO L226 Difference]: Without dead ends: 79 [2022-04-28 14:19:08,782 INFO L412 NwaCegarLoop]: 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-28 14:19:08,783 INFO L413 NwaCegarLoop]: 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-28 14:19:08,783 INFO L414 NwaCegarLoop]: 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-28 14:19:08,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-28 14:19:08,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-04-28 14:19:08,897 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:19:08,897 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-28 14:19:08,897 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-28 14:19:08,897 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-28 14:19:08,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:19:08,898 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2022-04-28 14:19:08,899 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2022-04-28 14:19:08,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:19:08,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:19:08,899 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-28 14:19:08,899 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-28 14:19:08,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:19:08,900 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2022-04-28 14:19:08,900 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2022-04-28 14:19:08,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:19:08,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:19:08,900 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:19:08,900 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:19:08,900 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-28 14:19:08,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2022-04-28 14:19:08,901 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 74 [2022-04-28 14:19:08,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:19:08,902 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2022-04-28 14:19:08,902 INFO L496 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-28 14:19:08,902 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 81 transitions. [2022-04-28 14:19:08,989 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-28 14:19:08,990 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2022-04-28 14:19:08,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-28 14:19:08,990 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:19:08,990 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:19:08,997 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-28 14:19:09,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-28 14:19:09,191 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:19:09,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:19:09,191 INFO L85 PathProgramCache]: Analyzing trace with hash 989539297, now seen corresponding path program 15 times [2022-04-28 14:19:09,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:19:09,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1661607687] [2022-04-28 14:19:09,257 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:19:09,258 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:19:09,258 INFO L85 PathProgramCache]: Analyzing trace with hash 989539297, now seen corresponding path program 16 times [2022-04-28 14:19:09,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:19:09,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960687785] [2022-04-28 14:19:09,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:19:09,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:19:09,267 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:19:09,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [220352303] [2022-04-28 14:19:09,267 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:19:09,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:19:09,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:19:09,268 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-28 14:19:09,269 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-28 14:19:10,012 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:19:10,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:19:10,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 14:19:10,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:19:10,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:19:10,398 INFO L272 TraceCheckUtils]: 0: Hoare triple {9023#true} call ULTIMATE.init(); {9023#true} is VALID [2022-04-28 14:19:10,398 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-28 14:19:10,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {9031#(<= ~counter~0 0)} assume true; {9031#(<= ~counter~0 0)} is VALID [2022-04-28 14:19:10,399 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9031#(<= ~counter~0 0)} {9023#true} #57#return; {9031#(<= ~counter~0 0)} is VALID [2022-04-28 14:19:10,399 INFO L272 TraceCheckUtils]: 4: Hoare triple {9031#(<= ~counter~0 0)} call #t~ret6 := main(); {9031#(<= ~counter~0 0)} is VALID [2022-04-28 14:19:10,400 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-28 14:19:10,400 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-28 14:19:10,400 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-28 14:19:10,401 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-28 14:19:10,401 INFO L290 TraceCheckUtils]: 9: Hoare triple {9047#(<= ~counter~0 1)} ~cond := #in~cond; {9047#(<= ~counter~0 1)} is VALID [2022-04-28 14:19:10,401 INFO L290 TraceCheckUtils]: 10: Hoare triple {9047#(<= ~counter~0 1)} assume !(0 == ~cond); {9047#(<= ~counter~0 1)} is VALID [2022-04-28 14:19:10,402 INFO L290 TraceCheckUtils]: 11: Hoare triple {9047#(<= ~counter~0 1)} assume true; {9047#(<= ~counter~0 1)} is VALID [2022-04-28 14:19:10,402 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {9047#(<= ~counter~0 1)} {9047#(<= ~counter~0 1)} #51#return; {9047#(<= ~counter~0 1)} is VALID [2022-04-28 14:19:10,402 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-28 14:19:10,403 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-28 14:19:10,403 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-28 14:19:10,403 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-28 14:19:10,404 INFO L290 TraceCheckUtils]: 17: Hoare triple {9072#(<= ~counter~0 2)} ~cond := #in~cond; {9072#(<= ~counter~0 2)} is VALID [2022-04-28 14:19:10,404 INFO L290 TraceCheckUtils]: 18: Hoare triple {9072#(<= ~counter~0 2)} assume !(0 == ~cond); {9072#(<= ~counter~0 2)} is VALID [2022-04-28 14:19:10,404 INFO L290 TraceCheckUtils]: 19: Hoare triple {9072#(<= ~counter~0 2)} assume true; {9072#(<= ~counter~0 2)} is VALID [2022-04-28 14:19:10,405 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {9072#(<= ~counter~0 2)} {9072#(<= ~counter~0 2)} #51#return; {9072#(<= ~counter~0 2)} is VALID [2022-04-28 14:19:10,405 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-28 14:19:10,405 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-28 14:19:10,405 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-28 14:19:10,406 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-28 14:19:10,406 INFO L290 TraceCheckUtils]: 25: Hoare triple {9097#(<= ~counter~0 3)} ~cond := #in~cond; {9097#(<= ~counter~0 3)} is VALID [2022-04-28 14:19:10,406 INFO L290 TraceCheckUtils]: 26: Hoare triple {9097#(<= ~counter~0 3)} assume !(0 == ~cond); {9097#(<= ~counter~0 3)} is VALID [2022-04-28 14:19:10,407 INFO L290 TraceCheckUtils]: 27: Hoare triple {9097#(<= ~counter~0 3)} assume true; {9097#(<= ~counter~0 3)} is VALID [2022-04-28 14:19:10,407 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {9097#(<= ~counter~0 3)} {9097#(<= ~counter~0 3)} #51#return; {9097#(<= ~counter~0 3)} is VALID [2022-04-28 14:19:10,407 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-28 14:19:10,408 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-28 14:19:10,408 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-28 14:19:10,408 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-28 14:19:10,409 INFO L290 TraceCheckUtils]: 33: Hoare triple {9122#(<= ~counter~0 4)} ~cond := #in~cond; {9122#(<= ~counter~0 4)} is VALID [2022-04-28 14:19:10,409 INFO L290 TraceCheckUtils]: 34: Hoare triple {9122#(<= ~counter~0 4)} assume !(0 == ~cond); {9122#(<= ~counter~0 4)} is VALID [2022-04-28 14:19:10,409 INFO L290 TraceCheckUtils]: 35: Hoare triple {9122#(<= ~counter~0 4)} assume true; {9122#(<= ~counter~0 4)} is VALID [2022-04-28 14:19:10,409 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {9122#(<= ~counter~0 4)} {9122#(<= ~counter~0 4)} #51#return; {9122#(<= ~counter~0 4)} is VALID [2022-04-28 14:19:10,410 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-28 14:19:10,410 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-28 14:19:10,410 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-28 14:19:10,411 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-28 14:19:10,411 INFO L290 TraceCheckUtils]: 41: Hoare triple {9147#(<= ~counter~0 5)} ~cond := #in~cond; {9147#(<= ~counter~0 5)} is VALID [2022-04-28 14:19:10,411 INFO L290 TraceCheckUtils]: 42: Hoare triple {9147#(<= ~counter~0 5)} assume !(0 == ~cond); {9147#(<= ~counter~0 5)} is VALID [2022-04-28 14:19:10,412 INFO L290 TraceCheckUtils]: 43: Hoare triple {9147#(<= ~counter~0 5)} assume true; {9147#(<= ~counter~0 5)} is VALID [2022-04-28 14:19:10,412 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {9147#(<= ~counter~0 5)} {9147#(<= ~counter~0 5)} #51#return; {9147#(<= ~counter~0 5)} is VALID [2022-04-28 14:19:10,412 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-28 14:19:10,413 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-28 14:19:10,413 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-28 14:19:10,413 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-28 14:19:10,414 INFO L290 TraceCheckUtils]: 49: Hoare triple {9172#(<= ~counter~0 6)} ~cond := #in~cond; {9172#(<= ~counter~0 6)} is VALID [2022-04-28 14:19:10,414 INFO L290 TraceCheckUtils]: 50: Hoare triple {9172#(<= ~counter~0 6)} assume !(0 == ~cond); {9172#(<= ~counter~0 6)} is VALID [2022-04-28 14:19:10,414 INFO L290 TraceCheckUtils]: 51: Hoare triple {9172#(<= ~counter~0 6)} assume true; {9172#(<= ~counter~0 6)} is VALID [2022-04-28 14:19:10,414 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {9172#(<= ~counter~0 6)} {9172#(<= ~counter~0 6)} #51#return; {9172#(<= ~counter~0 6)} is VALID [2022-04-28 14:19:10,415 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-28 14:19:10,415 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-28 14:19:10,415 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-28 14:19:10,416 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-28 14:19:10,416 INFO L290 TraceCheckUtils]: 57: Hoare triple {9197#(<= ~counter~0 7)} ~cond := #in~cond; {9197#(<= ~counter~0 7)} is VALID [2022-04-28 14:19:10,416 INFO L290 TraceCheckUtils]: 58: Hoare triple {9197#(<= ~counter~0 7)} assume !(0 == ~cond); {9197#(<= ~counter~0 7)} is VALID [2022-04-28 14:19:10,416 INFO L290 TraceCheckUtils]: 59: Hoare triple {9197#(<= ~counter~0 7)} assume true; {9197#(<= ~counter~0 7)} is VALID [2022-04-28 14:19:10,417 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {9197#(<= ~counter~0 7)} {9197#(<= ~counter~0 7)} #51#return; {9197#(<= ~counter~0 7)} is VALID [2022-04-28 14:19:10,417 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-28 14:19:10,418 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-28 14:19:10,418 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-28 14:19:10,418 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-28 14:19:10,418 INFO L290 TraceCheckUtils]: 65: Hoare triple {9222#(<= ~counter~0 8)} ~cond := #in~cond; {9222#(<= ~counter~0 8)} is VALID [2022-04-28 14:19:10,419 INFO L290 TraceCheckUtils]: 66: Hoare triple {9222#(<= ~counter~0 8)} assume !(0 == ~cond); {9222#(<= ~counter~0 8)} is VALID [2022-04-28 14:19:10,419 INFO L290 TraceCheckUtils]: 67: Hoare triple {9222#(<= ~counter~0 8)} assume true; {9222#(<= ~counter~0 8)} is VALID [2022-04-28 14:19:10,419 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {9222#(<= ~counter~0 8)} {9222#(<= ~counter~0 8)} #51#return; {9222#(<= ~counter~0 8)} is VALID [2022-04-28 14:19:10,420 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-28 14:19:10,420 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-28 14:19:10,420 INFO L290 TraceCheckUtils]: 71: Hoare triple {9247#(<= |main_#t~post5| 8)} assume !(#t~post5 < 10);havoc #t~post5; {9024#false} is VALID [2022-04-28 14:19:10,420 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-28 14:19:10,420 INFO L290 TraceCheckUtils]: 73: Hoare triple {9024#false} ~cond := #in~cond; {9024#false} is VALID [2022-04-28 14:19:10,420 INFO L290 TraceCheckUtils]: 74: Hoare triple {9024#false} assume 0 == ~cond; {9024#false} is VALID [2022-04-28 14:19:10,420 INFO L290 TraceCheckUtils]: 75: Hoare triple {9024#false} assume !false; {9024#false} is VALID [2022-04-28 14:19:10,421 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-28 14:19:10,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:19:10,745 INFO L290 TraceCheckUtils]: 75: Hoare triple {9024#false} assume !false; {9024#false} is VALID [2022-04-28 14:19:10,745 INFO L290 TraceCheckUtils]: 74: Hoare triple {9024#false} assume 0 == ~cond; {9024#false} is VALID [2022-04-28 14:19:10,745 INFO L290 TraceCheckUtils]: 73: Hoare triple {9024#false} ~cond := #in~cond; {9024#false} is VALID [2022-04-28 14:19:10,745 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-28 14:19:10,746 INFO L290 TraceCheckUtils]: 71: Hoare triple {9275#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {9024#false} is VALID [2022-04-28 14:19:10,746 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-28 14:19:10,746 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-28 14:19:10,747 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {9023#true} {9279#(< ~counter~0 10)} #51#return; {9279#(< ~counter~0 10)} is VALID [2022-04-28 14:19:10,747 INFO L290 TraceCheckUtils]: 67: Hoare triple {9023#true} assume true; {9023#true} is VALID [2022-04-28 14:19:10,747 INFO L290 TraceCheckUtils]: 66: Hoare triple {9023#true} assume !(0 == ~cond); {9023#true} is VALID [2022-04-28 14:19:10,747 INFO L290 TraceCheckUtils]: 65: Hoare triple {9023#true} ~cond := #in~cond; {9023#true} is VALID [2022-04-28 14:19:10,747 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-28 14:19:10,747 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-28 14:19:10,748 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-28 14:19:10,748 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-28 14:19:10,748 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {9023#true} {9222#(<= ~counter~0 8)} #51#return; {9222#(<= ~counter~0 8)} is VALID [2022-04-28 14:19:10,748 INFO L290 TraceCheckUtils]: 59: Hoare triple {9023#true} assume true; {9023#true} is VALID [2022-04-28 14:19:10,748 INFO L290 TraceCheckUtils]: 58: Hoare triple {9023#true} assume !(0 == ~cond); {9023#true} is VALID [2022-04-28 14:19:10,749 INFO L290 TraceCheckUtils]: 57: Hoare triple {9023#true} ~cond := #in~cond; {9023#true} is VALID [2022-04-28 14:19:10,749 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-28 14:19:10,749 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-28 14:19:10,749 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-28 14:19:10,750 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-28 14:19:10,750 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {9023#true} {9197#(<= ~counter~0 7)} #51#return; {9197#(<= ~counter~0 7)} is VALID [2022-04-28 14:19:10,750 INFO L290 TraceCheckUtils]: 51: Hoare triple {9023#true} assume true; {9023#true} is VALID [2022-04-28 14:19:10,750 INFO L290 TraceCheckUtils]: 50: Hoare triple {9023#true} assume !(0 == ~cond); {9023#true} is VALID [2022-04-28 14:19:10,750 INFO L290 TraceCheckUtils]: 49: Hoare triple {9023#true} ~cond := #in~cond; {9023#true} is VALID [2022-04-28 14:19:10,750 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-28 14:19:10,750 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-28 14:19:10,751 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-28 14:19:10,751 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-28 14:19:10,751 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {9023#true} {9172#(<= ~counter~0 6)} #51#return; {9172#(<= ~counter~0 6)} is VALID [2022-04-28 14:19:10,752 INFO L290 TraceCheckUtils]: 43: Hoare triple {9023#true} assume true; {9023#true} is VALID [2022-04-28 14:19:10,752 INFO L290 TraceCheckUtils]: 42: Hoare triple {9023#true} assume !(0 == ~cond); {9023#true} is VALID [2022-04-28 14:19:10,752 INFO L290 TraceCheckUtils]: 41: Hoare triple {9023#true} ~cond := #in~cond; {9023#true} is VALID [2022-04-28 14:19:10,752 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-28 14:19:10,752 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-28 14:19:10,752 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-28 14:19:10,753 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-28 14:19:10,753 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {9023#true} {9147#(<= ~counter~0 5)} #51#return; {9147#(<= ~counter~0 5)} is VALID [2022-04-28 14:19:10,753 INFO L290 TraceCheckUtils]: 35: Hoare triple {9023#true} assume true; {9023#true} is VALID [2022-04-28 14:19:10,753 INFO L290 TraceCheckUtils]: 34: Hoare triple {9023#true} assume !(0 == ~cond); {9023#true} is VALID [2022-04-28 14:19:10,753 INFO L290 TraceCheckUtils]: 33: Hoare triple {9023#true} ~cond := #in~cond; {9023#true} is VALID [2022-04-28 14:19:10,754 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-28 14:19:10,754 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-28 14:19:10,754 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-28 14:19:10,754 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-28 14:19:10,755 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {9023#true} {9122#(<= ~counter~0 4)} #51#return; {9122#(<= ~counter~0 4)} is VALID [2022-04-28 14:19:10,755 INFO L290 TraceCheckUtils]: 27: Hoare triple {9023#true} assume true; {9023#true} is VALID [2022-04-28 14:19:10,755 INFO L290 TraceCheckUtils]: 26: Hoare triple {9023#true} assume !(0 == ~cond); {9023#true} is VALID [2022-04-28 14:19:10,755 INFO L290 TraceCheckUtils]: 25: Hoare triple {9023#true} ~cond := #in~cond; {9023#true} is VALID [2022-04-28 14:19:10,755 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-28 14:19:10,755 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-28 14:19:10,756 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-28 14:19:10,756 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-28 14:19:10,756 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {9023#true} {9097#(<= ~counter~0 3)} #51#return; {9097#(<= ~counter~0 3)} is VALID [2022-04-28 14:19:10,757 INFO L290 TraceCheckUtils]: 19: Hoare triple {9023#true} assume true; {9023#true} is VALID [2022-04-28 14:19:10,757 INFO L290 TraceCheckUtils]: 18: Hoare triple {9023#true} assume !(0 == ~cond); {9023#true} is VALID [2022-04-28 14:19:10,757 INFO L290 TraceCheckUtils]: 17: Hoare triple {9023#true} ~cond := #in~cond; {9023#true} is VALID [2022-04-28 14:19:10,757 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-28 14:19:10,757 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-28 14:19:10,758 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-28 14:19:10,758 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-28 14:19:10,758 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {9023#true} {9072#(<= ~counter~0 2)} #51#return; {9072#(<= ~counter~0 2)} is VALID [2022-04-28 14:19:10,758 INFO L290 TraceCheckUtils]: 11: Hoare triple {9023#true} assume true; {9023#true} is VALID [2022-04-28 14:19:10,758 INFO L290 TraceCheckUtils]: 10: Hoare triple {9023#true} assume !(0 == ~cond); {9023#true} is VALID [2022-04-28 14:19:10,758 INFO L290 TraceCheckUtils]: 9: Hoare triple {9023#true} ~cond := #in~cond; {9023#true} is VALID [2022-04-28 14:19:10,759 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-28 14:19:10,759 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-28 14:19:10,759 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-28 14:19:10,759 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-28 14:19:10,760 INFO L272 TraceCheckUtils]: 4: Hoare triple {9047#(<= ~counter~0 1)} call #t~ret6 := main(); {9047#(<= ~counter~0 1)} is VALID [2022-04-28 14:19:10,760 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9047#(<= ~counter~0 1)} {9023#true} #57#return; {9047#(<= ~counter~0 1)} is VALID [2022-04-28 14:19:10,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {9047#(<= ~counter~0 1)} assume true; {9047#(<= ~counter~0 1)} is VALID [2022-04-28 14:19:10,761 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-28 14:19:10,761 INFO L272 TraceCheckUtils]: 0: Hoare triple {9023#true} call ULTIMATE.init(); {9023#true} is VALID [2022-04-28 14:19:10,761 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-28 14:19:10,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:19:10,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960687785] [2022-04-28 14:19:10,761 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:19:10,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220352303] [2022-04-28 14:19:10,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220352303] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:19:10,762 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:19:10,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2022-04-28 14:19:10,762 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:19:10,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1661607687] [2022-04-28 14:19:10,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1661607687] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:19:10,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:19:10,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 14:19:10,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894722564] [2022-04-28 14:19:10,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:19:10,763 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-28 14:19:10,763 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:19:10,763 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-28 14:19:10,812 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-28 14:19:10,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 14:19:10,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:19:10,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 14:19:10,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 14:19:10,813 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-28 14:19:11,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:19:11,113 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2022-04-28 14:19:11,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 14:19:11,113 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-28 14:19:11,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:19:11,113 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-28 14:19:11,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 90 transitions. [2022-04-28 14:19:11,115 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-28 14:19:11,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 90 transitions. [2022-04-28 14:19:11,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 90 transitions. [2022-04-28 14:19:11,173 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-28 14:19:11,174 INFO L225 Difference]: With dead ends: 90 [2022-04-28 14:19:11,174 INFO L226 Difference]: Without dead ends: 85 [2022-04-28 14:19:11,174 INFO L412 NwaCegarLoop]: 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-28 14:19:11,175 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:19:11,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 100 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:19:11,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-28 14:19:11,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-04-28 14:19:11,266 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:19:11,266 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-28 14:19:11,267 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-28 14:19:11,267 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-28 14:19:11,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:19:11,268 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2022-04-28 14:19:11,268 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2022-04-28 14:19:11,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:19:11,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:19:11,268 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-28 14:19:11,268 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-28 14:19:11,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:19:11,269 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2022-04-28 14:19:11,269 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2022-04-28 14:19:11,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:19:11,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:19:11,270 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:19:11,270 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:19:11,270 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-28 14:19:11,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2022-04-28 14:19:11,271 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 76 [2022-04-28 14:19:11,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:19:11,271 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2022-04-28 14:19:11,271 INFO L496 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-28 14:19:11,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 86 transitions. [2022-04-28 14:19:11,363 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-28 14:19:11,363 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2022-04-28 14:19:11,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-28 14:19:11,364 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:19:11,364 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:19:11,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-28 14:19:11,564 WARN L477 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-28 14:19:11,565 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:19:11,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:19:11,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1500110401, now seen corresponding path program 15 times [2022-04-28 14:19:11,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:19:11,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1849758611] [2022-04-28 14:19:11,650 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:19:11,650 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:19:11,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1500110401, now seen corresponding path program 16 times [2022-04-28 14:19:11,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:19:11,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938843511] [2022-04-28 14:19:11,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:19:11,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:19:11,670 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:19:11,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [575010706] [2022-04-28 14:19:11,670 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:19:11,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:19:11,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:19:11,671 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-28 14:19:11,672 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-28 14:19:12,216 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:19:12,216 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:19:12,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-28 14:19:12,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:19:12,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:19:12,628 INFO L272 TraceCheckUtils]: 0: Hoare triple {10028#true} call ULTIMATE.init(); {10028#true} is VALID [2022-04-28 14:19:12,628 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-28 14:19:12,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {10028#true} assume true; {10028#true} is VALID [2022-04-28 14:19:12,628 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10028#true} {10028#true} #57#return; {10028#true} is VALID [2022-04-28 14:19:12,628 INFO L272 TraceCheckUtils]: 4: Hoare triple {10028#true} call #t~ret6 := main(); {10028#true} is VALID [2022-04-28 14:19:12,629 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-28 14:19:12,629 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-28 14:19:12,629 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-28 14:19:12,629 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-28 14:19:12,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {10028#true} ~cond := #in~cond; {10028#true} is VALID [2022-04-28 14:19:12,630 INFO L290 TraceCheckUtils]: 10: Hoare triple {10028#true} assume !(0 == ~cond); {10028#true} is VALID [2022-04-28 14:19:12,630 INFO L290 TraceCheckUtils]: 11: Hoare triple {10028#true} assume true; {10028#true} is VALID [2022-04-28 14:19:12,630 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-28 14:19:12,630 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-28 14:19:12,631 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-28 14:19:12,631 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-28 14:19:12,631 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-28 14:19:12,631 INFO L290 TraceCheckUtils]: 17: Hoare triple {10028#true} ~cond := #in~cond; {10028#true} is VALID [2022-04-28 14:19:12,631 INFO L290 TraceCheckUtils]: 18: Hoare triple {10028#true} assume !(0 == ~cond); {10028#true} is VALID [2022-04-28 14:19:12,631 INFO L290 TraceCheckUtils]: 19: Hoare triple {10028#true} assume true; {10028#true} is VALID [2022-04-28 14:19:12,632 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-28 14:19:12,632 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-28 14:19:12,632 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-28 14:19:12,633 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-28 14:19:12,633 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-28 14:19:12,633 INFO L290 TraceCheckUtils]: 25: Hoare triple {10028#true} ~cond := #in~cond; {10028#true} is VALID [2022-04-28 14:19:12,633 INFO L290 TraceCheckUtils]: 26: Hoare triple {10028#true} assume !(0 == ~cond); {10028#true} is VALID [2022-04-28 14:19:12,633 INFO L290 TraceCheckUtils]: 27: Hoare triple {10028#true} assume true; {10028#true} is VALID [2022-04-28 14:19:12,633 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-28 14:19:12,634 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-28 14:19:12,634 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-28 14:19:12,634 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-28 14:19:12,634 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-28 14:19:12,634 INFO L290 TraceCheckUtils]: 33: Hoare triple {10028#true} ~cond := #in~cond; {10028#true} is VALID [2022-04-28 14:19:12,634 INFO L290 TraceCheckUtils]: 34: Hoare triple {10028#true} assume !(0 == ~cond); {10028#true} is VALID [2022-04-28 14:19:12,635 INFO L290 TraceCheckUtils]: 35: Hoare triple {10028#true} assume true; {10028#true} is VALID [2022-04-28 14:19:12,635 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-28 14:19:12,635 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-28 14:19:12,636 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-28 14:19:12,636 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-28 14:19:12,636 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-28 14:19:12,636 INFO L290 TraceCheckUtils]: 41: Hoare triple {10028#true} ~cond := #in~cond; {10028#true} is VALID [2022-04-28 14:19:12,636 INFO L290 TraceCheckUtils]: 42: Hoare triple {10028#true} assume !(0 == ~cond); {10028#true} is VALID [2022-04-28 14:19:12,636 INFO L290 TraceCheckUtils]: 43: Hoare triple {10028#true} assume true; {10028#true} is VALID [2022-04-28 14:19:12,636 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-28 14:19:12,637 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-28 14:19:12,637 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-28 14:19:12,637 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-28 14:19:12,638 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-28 14:19:12,638 INFO L290 TraceCheckUtils]: 49: Hoare triple {10028#true} ~cond := #in~cond; {10028#true} is VALID [2022-04-28 14:19:12,638 INFO L290 TraceCheckUtils]: 50: Hoare triple {10028#true} assume !(0 == ~cond); {10028#true} is VALID [2022-04-28 14:19:12,638 INFO L290 TraceCheckUtils]: 51: Hoare triple {10028#true} assume true; {10028#true} is VALID [2022-04-28 14:19:12,638 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-28 14:19:12,638 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-28 14:19:12,639 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-28 14:19:12,639 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-28 14:19:12,639 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-28 14:19:12,639 INFO L290 TraceCheckUtils]: 57: Hoare triple {10028#true} ~cond := #in~cond; {10028#true} is VALID [2022-04-28 14:19:12,639 INFO L290 TraceCheckUtils]: 58: Hoare triple {10028#true} assume !(0 == ~cond); {10028#true} is VALID [2022-04-28 14:19:12,639 INFO L290 TraceCheckUtils]: 59: Hoare triple {10028#true} assume true; {10028#true} is VALID [2022-04-28 14:19:12,640 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-28 14:19:12,640 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-28 14:19:12,640 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-28 14:19:12,641 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-28 14:19:12,641 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-28 14:19:12,641 INFO L290 TraceCheckUtils]: 65: Hoare triple {10028#true} ~cond := #in~cond; {10028#true} is VALID [2022-04-28 14:19:12,641 INFO L290 TraceCheckUtils]: 66: Hoare triple {10028#true} assume !(0 == ~cond); {10028#true} is VALID [2022-04-28 14:19:12,641 INFO L290 TraceCheckUtils]: 67: Hoare triple {10028#true} assume true; {10028#true} is VALID [2022-04-28 14:19:12,641 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-28 14:19:12,642 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-28 14:19:12,642 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-28 14:19:12,642 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-28 14:19:12,642 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-28 14:19:12,643 INFO L290 TraceCheckUtils]: 73: Hoare triple {10028#true} ~cond := #in~cond; {10028#true} is VALID [2022-04-28 14:19:12,643 INFO L290 TraceCheckUtils]: 74: Hoare triple {10028#true} assume !(0 == ~cond); {10028#true} is VALID [2022-04-28 14:19:12,643 INFO L290 TraceCheckUtils]: 75: Hoare triple {10028#true} assume true; {10028#true} is VALID [2022-04-28 14:19:12,666 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-28 14:19:12,667 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-28 14:19:12,667 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-28 14:19:12,668 INFO L290 TraceCheckUtils]: 79: Hoare triple {10277#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10281#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:19:12,668 INFO L290 TraceCheckUtils]: 80: Hoare triple {10281#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10029#false} is VALID [2022-04-28 14:19:12,668 INFO L290 TraceCheckUtils]: 81: Hoare triple {10029#false} assume !false; {10029#false} is VALID [2022-04-28 14:19:12,668 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-28 14:19:12,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:19:12,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:19:12,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938843511] [2022-04-28 14:19:12,920 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:19:12,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575010706] [2022-04-28 14:19:12,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575010706] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:19:12,920 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:19:12,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-28 14:19:12,921 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:19:12,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1849758611] [2022-04-28 14:19:12,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1849758611] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:19:12,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:19:12,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 14:19:12,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068074862] [2022-04-28 14:19:12,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:19:12,921 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-28 14:19:12,921 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:19:12,922 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-28 14:19:12,960 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-28 14:19:12,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 14:19:12,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:19:12,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 14:19:12,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-28 14:19:12,961 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-28 14:19:13,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:19:13,810 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2022-04-28 14:19:13,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 14:19:13,810 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-28 14:19:13,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:19:13,811 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-28 14:19:13,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 69 transitions. [2022-04-28 14:19:13,812 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-28 14:19:13,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 69 transitions. [2022-04-28 14:19:13,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 69 transitions. [2022-04-28 14:19:13,860 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-28 14:19:13,861 INFO L225 Difference]: With dead ends: 92 [2022-04-28 14:19:13,861 INFO L226 Difference]: Without dead ends: 87 [2022-04-28 14:19:13,861 INFO L412 NwaCegarLoop]: 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-28 14:19:13,862 INFO L413 NwaCegarLoop]: 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-28 14:19:13,862 INFO L414 NwaCegarLoop]: 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-28 14:19:13,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-04-28 14:19:13,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-04-28 14:19:13,965 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:19:13,966 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-28 14:19:13,966 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-28 14:19:13,966 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-28 14:19:13,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:19:13,967 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2022-04-28 14:19:13,967 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2022-04-28 14:19:13,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:19:13,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:19:13,968 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-28 14:19:13,968 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-28 14:19:13,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:19:13,970 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2022-04-28 14:19:13,970 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2022-04-28 14:19:13,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:19:13,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:19:13,970 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:19:13,970 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:19:13,970 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-28 14:19:13,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2022-04-28 14:19:13,973 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 82 [2022-04-28 14:19:13,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:19:13,974 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2022-04-28 14:19:13,974 INFO L496 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-28 14:19:13,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 89 transitions. [2022-04-28 14:19:14,065 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-28 14:19:14,065 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2022-04-28 14:19:14,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-28 14:19:14,066 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:19:14,066 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:19:14,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-28 14:19:14,270 WARN L477 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-28 14:19:14,270 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:19:14,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:19:14,270 INFO L85 PathProgramCache]: Analyzing trace with hash -2095421916, now seen corresponding path program 17 times [2022-04-28 14:19:14,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:19:14,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1654575866] [2022-04-28 14:19:14,337 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:19:14,337 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:19:14,337 INFO L85 PathProgramCache]: Analyzing trace with hash -2095421916, now seen corresponding path program 18 times [2022-04-28 14:19:14,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:19:14,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44175232] [2022-04-28 14:19:14,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:19:14,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:19:14,349 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:19:14,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [86220594] [2022-04-28 14:19:14,349 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:19:14,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:19:14,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:19:14,350 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-28 14:19:14,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process