/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 07:42:22,915 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 07:42:22,924 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 07:42:22,957 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 07:42:22,958 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 07:42:22,958 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 07:42:22,962 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 07:42:22,966 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 07:42:22,967 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 07:42:22,970 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 07:42:22,971 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 07:42:22,972 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 07:42:22,972 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 07:42:22,974 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 07:42:22,974 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 07:42:22,975 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 07:42:22,976 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 07:42:22,976 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 07:42:22,979 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 07:42:22,983 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 07:42:22,984 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 07:42:22,985 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 07:42:22,985 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 07:42:22,986 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 07:42:22,987 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 07:42:22,991 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 07:42:22,991 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 07:42:22,992 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 07:42:22,992 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 07:42:22,993 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 07:42:22,993 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 07:42:22,994 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 07:42:22,995 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 07:42:22,995 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 07:42:22,996 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 07:42:22,996 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 07:42:22,996 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 07:42:22,997 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 07:42:22,997 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 07:42:22,997 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 07:42:22,997 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 07:42:22,998 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 07:42:22,999 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 07:42:23,008 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 07:42:23,008 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 07:42:23,009 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 07:42:23,009 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 07:42:23,009 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 07:42:23,009 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 07:42:23,009 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 07:42:23,009 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 07:42:23,009 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 07:42:23,010 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 07:42:23,010 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 07:42:23,010 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 07:42:23,010 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 07:42:23,010 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 07:42:23,011 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 07:42:23,011 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 07:42:23,011 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 07:42:23,011 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 07:42:23,011 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 07:42:23,011 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 07:42:23,011 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 07:42:23,011 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 07:42:23,011 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 07:42:23,011 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 07:42:23,011 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 07:42:23,011 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 07:42:23,191 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 07:42:23,208 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 07:42:23,211 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 07:42:23,212 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 07:42:23,212 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 07:42:23,213 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound50.c [2022-04-28 07:42:23,256 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99e846df0/f19f051248d1470989b7af19c5fe9396/FLAGb215a9176 [2022-04-28 07:42:23,589 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 07:42:23,589 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound50.c [2022-04-28 07:42:23,593 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99e846df0/f19f051248d1470989b7af19c5fe9396/FLAGb215a9176 [2022-04-28 07:42:24,020 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99e846df0/f19f051248d1470989b7af19c5fe9396 [2022-04-28 07:42:24,022 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 07:42:24,023 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 07:42:24,025 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 07:42:24,025 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 07:42:24,027 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 07:42:24,028 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 07:42:24" (1/1) ... [2022-04-28 07:42:24,029 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5be0e2c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:42:24, skipping insertion in model container [2022-04-28 07:42:24,029 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 07:42:24" (1/1) ... [2022-04-28 07:42:24,033 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 07:42:24,043 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 07:42:24,193 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_unwindbound50.c[458,471] [2022-04-28 07:42:24,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 07:42:24,221 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 07:42:24,231 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_unwindbound50.c[458,471] [2022-04-28 07:42:24,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 07:42:24,253 INFO L208 MainTranslator]: Completed translation [2022-04-28 07:42:24,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:42:24 WrapperNode [2022-04-28 07:42:24,254 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 07:42:24,254 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 07:42:24,254 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 07:42:24,254 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 07:42:24,261 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:42:24" (1/1) ... [2022-04-28 07:42:24,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:42:24" (1/1) ... [2022-04-28 07:42:24,267 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:42:24" (1/1) ... [2022-04-28 07:42:24,267 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:42:24" (1/1) ... [2022-04-28 07:42:24,277 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:42:24" (1/1) ... [2022-04-28 07:42:24,280 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:42:24" (1/1) ... [2022-04-28 07:42:24,281 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:42:24" (1/1) ... [2022-04-28 07:42:24,284 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 07:42:24,285 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 07:42:24,285 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 07:42:24,285 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 07:42:24,286 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:42:24" (1/1) ... [2022-04-28 07:42:24,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 07:42:24,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:42:24,304 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 07:42:24,360 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 07:42:24,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 07:42:24,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 07:42:24,374 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 07:42:24,374 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 07:42:24,374 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 07:42:24,374 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 07:42:24,374 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 07:42:24,374 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 07:42:24,374 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 07:42:24,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 07:42:24,374 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-28 07:42:24,375 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 07:42:24,375 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 07:42:24,375 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 07:42:24,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 07:42:24,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 07:42:24,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 07:42:24,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 07:42:24,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 07:42:24,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 07:42:24,421 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 07:42:24,422 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 07:42:24,514 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 07:42:24,519 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 07:42:24,519 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 07:42:24,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 07:42:24 BoogieIcfgContainer [2022-04-28 07:42:24,523 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 07:42:24,524 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 07:42:24,524 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 07:42:24,526 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 07:42:24,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 07:42:24" (1/3) ... [2022-04-28 07:42:24,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9200dba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 07:42:24, skipping insertion in model container [2022-04-28 07:42:24,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:42:24" (2/3) ... [2022-04-28 07:42:24,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9200dba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 07:42:24, skipping insertion in model container [2022-04-28 07:42:24,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 07:42:24" (3/3) ... [2022-04-28 07:42:24,528 INFO L111 eAbstractionObserver]: Analyzing ICFG ps4-ll_unwindbound50.c [2022-04-28 07:42:24,536 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 07:42:24,537 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 07:42:24,583 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 07:42:24,617 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@7d4a90aa, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@47cc07d4 [2022-04-28 07:42:24,617 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 07:42:24,622 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 07:42:24,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 07:42:24,626 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:42:24,627 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:42:24,627 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:42:24,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:42:24,638 INFO L85 PathProgramCache]: Analyzing trace with hash -2133548928, now seen corresponding path program 1 times [2022-04-28 07:42:24,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:24,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1155827668] [2022-04-28 07:42:24,666 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:42:24,666 INFO L85 PathProgramCache]: Analyzing trace with hash -2133548928, now seen corresponding path program 2 times [2022-04-28 07:42:24,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:42:24,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081941090] [2022-04-28 07:42:24,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:42:24,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:42:24,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:42:24,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 07:42:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:42:24,832 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 07:42:24,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-28 07:42:24,832 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #57#return; {26#true} is VALID [2022-04-28 07:42:24,834 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 07:42:24,834 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 07:42:24,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-28 07:42:24,835 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #57#return; {26#true} is VALID [2022-04-28 07:42:24,835 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret6 := main(); {26#true} is VALID [2022-04-28 07:42:24,835 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 07:42:24,836 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} assume !true; {27#false} is VALID [2022-04-28 07:42:24,836 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 07:42:24,836 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2022-04-28 07:42:24,837 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2022-04-28 07:42:24,837 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-04-28 07:42:24,837 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 07:42:24,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:42:24,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081941090] [2022-04-28 07:42:24,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081941090] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:42:24,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:42:24,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 07:42:24,841 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:42:24,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1155827668] [2022-04-28 07:42:24,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1155827668] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:42:24,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:42:24,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 07:42:24,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107159091] [2022-04-28 07:42:24,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:42:24,846 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 07:42:24,847 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:42:24,849 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 07:42:24,864 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 07:42:24,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 07:42:24,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:24,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 07:42:24,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 07:42:24,887 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 07:42:24,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:24,986 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2022-04-28 07:42:24,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 07:42:24,987 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 07:42:24,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:42:24,988 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 07:42:24,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-28 07:42:24,996 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 07:42:25,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-28 07:42:25,001 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2022-04-28 07:42:25,066 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 07:42:25,075 INFO L225 Difference]: With dead ends: 41 [2022-04-28 07:42:25,075 INFO L226 Difference]: Without dead ends: 19 [2022-04-28 07:42:25,078 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 07:42:25,080 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 07:42:25,081 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 07:42:25,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-28 07:42:25,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-04-28 07:42:25,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:42:25,110 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 07:42:25,110 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 07:42:25,111 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 07:42:25,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:25,114 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-28 07:42:25,114 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-28 07:42:25,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:25,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:25,115 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 07:42:25,116 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 07:42:25,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:25,123 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-28 07:42:25,123 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-28 07:42:25,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:25,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:25,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:42:25,124 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:42:25,125 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 07:42:25,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-04-28 07:42:25,128 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 11 [2022-04-28 07:42:25,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:42:25,128 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-04-28 07:42:25,129 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 07:42:25,130 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 21 transitions. [2022-04-28 07:42:25,152 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 07:42:25,152 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-28 07:42:25,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 07:42:25,157 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:42:25,157 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:42:25,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 07:42:25,157 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:42:25,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:42:25,158 INFO L85 PathProgramCache]: Analyzing trace with hash -2118701623, now seen corresponding path program 1 times [2022-04-28 07:42:25,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:25,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [32114997] [2022-04-28 07:42:25,159 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:42:25,159 INFO L85 PathProgramCache]: Analyzing trace with hash -2118701623, now seen corresponding path program 2 times [2022-04-28 07:42:25,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:42:25,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945916301] [2022-04-28 07:42:25,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:42:25,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:42:25,186 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:42:25,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1243267141] [2022-04-28 07:42:25,186 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:42:25,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:42:25,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:42:25,212 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 07:42:25,215 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 07:42:25,252 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 07:42:25,253 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:42:25,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 07:42:25,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:42:25,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:42:25,343 INFO L272 TraceCheckUtils]: 0: Hoare triple {190#true} call ULTIMATE.init(); {190#true} is VALID [2022-04-28 07:42:25,343 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 07:42:25,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {198#(<= ~counter~0 0)} assume true; {198#(<= ~counter~0 0)} is VALID [2022-04-28 07:42:25,344 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {198#(<= ~counter~0 0)} {190#true} #57#return; {198#(<= ~counter~0 0)} is VALID [2022-04-28 07:42:25,345 INFO L272 TraceCheckUtils]: 4: Hoare triple {198#(<= ~counter~0 0)} call #t~ret6 := main(); {198#(<= ~counter~0 0)} is VALID [2022-04-28 07:42:25,345 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 07:42:25,345 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 07:42:25,346 INFO L290 TraceCheckUtils]: 7: Hoare triple {214#(<= |main_#t~post5| 0)} assume !(#t~post5 < 50);havoc #t~post5; {191#false} is VALID [2022-04-28 07:42:25,346 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 07:42:25,346 INFO L290 TraceCheckUtils]: 9: Hoare triple {191#false} ~cond := #in~cond; {191#false} is VALID [2022-04-28 07:42:25,346 INFO L290 TraceCheckUtils]: 10: Hoare triple {191#false} assume 0 == ~cond; {191#false} is VALID [2022-04-28 07:42:25,346 INFO L290 TraceCheckUtils]: 11: Hoare triple {191#false} assume !false; {191#false} is VALID [2022-04-28 07:42:25,347 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 07:42:25,347 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 07:42:25,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:42:25,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945916301] [2022-04-28 07:42:25,347 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:42:25,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243267141] [2022-04-28 07:42:25,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243267141] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:42:25,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:42:25,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 07:42:25,348 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:42:25,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [32114997] [2022-04-28 07:42:25,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [32114997] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:42:25,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:42:25,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 07:42:25,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494539583] [2022-04-28 07:42:25,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:42:25,349 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 07:42:25,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:42:25,349 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 07:42:25,357 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 07:42:25,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 07:42:25,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:25,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 07:42:25,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 07:42:25,358 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 07:42:25,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:25,397 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-28 07:42:25,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 07:42:25,397 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 07:42:25,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:42:25,398 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 07:42:25,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-04-28 07:42:25,399 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 07:42:25,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-04-28 07:42:25,400 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 32 transitions. [2022-04-28 07:42:25,421 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 07:42:25,422 INFO L225 Difference]: With dead ends: 28 [2022-04-28 07:42:25,422 INFO L226 Difference]: Without dead ends: 20 [2022-04-28 07:42:25,422 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 07:42:25,423 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 07:42:25,423 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 07:42:25,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-28 07:42:25,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-28 07:42:25,429 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:42:25,429 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 07:42:25,430 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 07:42:25,430 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 07:42:25,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:25,431 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-28 07:42:25,431 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-28 07:42:25,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:25,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:25,432 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 07:42:25,432 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 07:42:25,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:25,433 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-28 07:42:25,433 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-28 07:42:25,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:25,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:25,433 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:42:25,433 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:42:25,433 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 07:42:25,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-04-28 07:42:25,434 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 12 [2022-04-28 07:42:25,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:42:25,435 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-04-28 07:42:25,435 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 07:42:25,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 23 transitions. [2022-04-28 07:42:25,452 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 07:42:25,452 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-28 07:42:25,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 07:42:25,452 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:42:25,452 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:42:25,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 07:42:25,668 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 07:42:25,668 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:42:25,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:42:25,669 INFO L85 PathProgramCache]: Analyzing trace with hash -2116914163, now seen corresponding path program 1 times [2022-04-28 07:42:25,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:25,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [873147493] [2022-04-28 07:42:25,670 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:42:25,670 INFO L85 PathProgramCache]: Analyzing trace with hash -2116914163, now seen corresponding path program 2 times [2022-04-28 07:42:25,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:42:25,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000907859] [2022-04-28 07:42:25,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:42:25,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:42:25,679 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:42:25,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [487361325] [2022-04-28 07:42:25,679 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:42:25,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:42:25,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:42:25,689 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 07:42:25,722 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 07:42:25,735 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 07:42:25,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:42:25,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 07:42:25,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:42:25,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:42:25,843 INFO L272 TraceCheckUtils]: 0: Hoare triple {365#true} call ULTIMATE.init(); {365#true} is VALID [2022-04-28 07:42:25,844 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 07:42:25,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {365#true} assume true; {365#true} is VALID [2022-04-28 07:42:25,844 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {365#true} {365#true} #57#return; {365#true} is VALID [2022-04-28 07:42:25,844 INFO L272 TraceCheckUtils]: 4: Hoare triple {365#true} call #t~ret6 := main(); {365#true} is VALID [2022-04-28 07:42:25,845 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 07:42:25,845 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 07:42:25,845 INFO L290 TraceCheckUtils]: 7: Hoare triple {385#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {385#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:42:25,847 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 07:42:25,847 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 07:42:25,847 INFO L290 TraceCheckUtils]: 10: Hoare triple {399#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {366#false} is VALID [2022-04-28 07:42:25,848 INFO L290 TraceCheckUtils]: 11: Hoare triple {366#false} assume !false; {366#false} is VALID [2022-04-28 07:42:25,848 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 07:42:25,848 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 07:42:25,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:42:25,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000907859] [2022-04-28 07:42:25,848 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:42:25,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487361325] [2022-04-28 07:42:25,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487361325] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:42:25,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:42:25,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:42:25,849 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:42:25,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [873147493] [2022-04-28 07:42:25,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [873147493] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:42:25,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:42:25,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:42:25,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985998673] [2022-04-28 07:42:25,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:42:25,849 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 07:42:25,850 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:42:25,850 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 07:42:25,858 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 07:42:25,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 07:42:25,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:25,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 07:42:25,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 07:42:25,859 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 07:42:25,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:25,964 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-28 07:42:25,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 07:42:25,964 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 07:42:25,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:42:25,965 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 07:42:25,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-28 07:42:25,966 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 07:42:25,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-28 07:42:25,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 35 transitions. [2022-04-28 07:42:25,998 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 07:42:25,999 INFO L225 Difference]: With dead ends: 30 [2022-04-28 07:42:25,999 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 07:42:26,004 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 07:42:26,015 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 07:42:26,016 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 07:42:26,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 07:42:26,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-28 07:42:26,041 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:42:26,042 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 07:42:26,042 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 07:42:26,042 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 07:42:26,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:26,043 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-28 07:42:26,043 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-28 07:42:26,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:26,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:26,044 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 07:42:26,044 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 07:42:26,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:26,045 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-28 07:42:26,045 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-28 07:42:26,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:26,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:26,045 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:42:26,045 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:42:26,046 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 07:42:26,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-04-28 07:42:26,047 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 12 [2022-04-28 07:42:26,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:42:26,047 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-04-28 07:42:26,047 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 07:42:26,047 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 29 transitions. [2022-04-28 07:42:26,074 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 07:42:26,074 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-28 07:42:26,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 07:42:26,075 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:42:26,075 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 07:42:26,105 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 07:42:26,291 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 07:42:26,291 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:42:26,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:42:26,291 INFO L85 PathProgramCache]: Analyzing trace with hash -263585780, now seen corresponding path program 1 times [2022-04-28 07:42:26,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:26,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1537732813] [2022-04-28 07:42:26,463 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:42:26,463 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:42:26,463 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:42:26,463 INFO L85 PathProgramCache]: Analyzing trace with hash -263585780, now seen corresponding path program 2 times [2022-04-28 07:42:26,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:42:26,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122083929] [2022-04-28 07:42:26,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:42:26,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:42:26,478 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:42:26,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1035077105] [2022-04-28 07:42:26,478 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:42:26,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:42:26,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:42:26,479 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 07:42:26,480 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 07:42:26,515 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:42:26,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:42:26,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 07:42:26,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:42:26,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:42:26,614 INFO L272 TraceCheckUtils]: 0: Hoare triple {571#true} call ULTIMATE.init(); {571#true} is VALID [2022-04-28 07:42:26,615 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 07:42:26,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {579#(<= ~counter~0 0)} assume true; {579#(<= ~counter~0 0)} is VALID [2022-04-28 07:42:26,616 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {579#(<= ~counter~0 0)} {571#true} #57#return; {579#(<= ~counter~0 0)} is VALID [2022-04-28 07:42:26,619 INFO L272 TraceCheckUtils]: 4: Hoare triple {579#(<= ~counter~0 0)} call #t~ret6 := main(); {579#(<= ~counter~0 0)} is VALID [2022-04-28 07:42:26,619 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 07:42:26,620 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 07:42:26,621 INFO L290 TraceCheckUtils]: 7: Hoare triple {595#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {595#(<= ~counter~0 1)} is VALID [2022-04-28 07:42:26,622 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 07:42:26,622 INFO L290 TraceCheckUtils]: 9: Hoare triple {595#(<= ~counter~0 1)} ~cond := #in~cond; {595#(<= ~counter~0 1)} is VALID [2022-04-28 07:42:26,623 INFO L290 TraceCheckUtils]: 10: Hoare triple {595#(<= ~counter~0 1)} assume !(0 == ~cond); {595#(<= ~counter~0 1)} is VALID [2022-04-28 07:42:26,624 INFO L290 TraceCheckUtils]: 11: Hoare triple {595#(<= ~counter~0 1)} assume true; {595#(<= ~counter~0 1)} is VALID [2022-04-28 07:42:26,627 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 07:42:26,628 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 07:42:26,628 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 07:42:26,628 INFO L290 TraceCheckUtils]: 15: Hoare triple {620#(<= |main_#t~post5| 1)} assume !(#t~post5 < 50);havoc #t~post5; {572#false} is VALID [2022-04-28 07:42:26,629 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 07:42:26,629 INFO L290 TraceCheckUtils]: 17: Hoare triple {572#false} ~cond := #in~cond; {572#false} is VALID [2022-04-28 07:42:26,629 INFO L290 TraceCheckUtils]: 18: Hoare triple {572#false} assume 0 == ~cond; {572#false} is VALID [2022-04-28 07:42:26,629 INFO L290 TraceCheckUtils]: 19: Hoare triple {572#false} assume !false; {572#false} is VALID [2022-04-28 07:42:26,629 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 07:42:26,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:42:26,757 INFO L290 TraceCheckUtils]: 19: Hoare triple {572#false} assume !false; {572#false} is VALID [2022-04-28 07:42:26,758 INFO L290 TraceCheckUtils]: 18: Hoare triple {572#false} assume 0 == ~cond; {572#false} is VALID [2022-04-28 07:42:26,758 INFO L290 TraceCheckUtils]: 17: Hoare triple {572#false} ~cond := #in~cond; {572#false} is VALID [2022-04-28 07:42:26,758 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 07:42:26,759 INFO L290 TraceCheckUtils]: 15: Hoare triple {648#(< |main_#t~post5| 50)} assume !(#t~post5 < 50);havoc #t~post5; {572#false} is VALID [2022-04-28 07:42:26,760 INFO L290 TraceCheckUtils]: 14: Hoare triple {652#(< ~counter~0 50)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {648#(< |main_#t~post5| 50)} is VALID [2022-04-28 07:42:26,760 INFO L290 TraceCheckUtils]: 13: Hoare triple {652#(< ~counter~0 50)} 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 50)} is VALID [2022-04-28 07:42:26,761 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {571#true} {652#(< ~counter~0 50)} #51#return; {652#(< ~counter~0 50)} is VALID [2022-04-28 07:42:26,761 INFO L290 TraceCheckUtils]: 11: Hoare triple {571#true} assume true; {571#true} is VALID [2022-04-28 07:42:26,761 INFO L290 TraceCheckUtils]: 10: Hoare triple {571#true} assume !(0 == ~cond); {571#true} is VALID [2022-04-28 07:42:26,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {571#true} ~cond := #in~cond; {571#true} is VALID [2022-04-28 07:42:26,761 INFO L272 TraceCheckUtils]: 8: Hoare triple {652#(< ~counter~0 50)} 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 07:42:26,761 INFO L290 TraceCheckUtils]: 7: Hoare triple {652#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {652#(< ~counter~0 50)} is VALID [2022-04-28 07:42:26,762 INFO L290 TraceCheckUtils]: 6: Hoare triple {677#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {652#(< ~counter~0 50)} is VALID [2022-04-28 07:42:26,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {677#(< ~counter~0 49)} 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 49)} is VALID [2022-04-28 07:42:26,763 INFO L272 TraceCheckUtils]: 4: Hoare triple {677#(< ~counter~0 49)} call #t~ret6 := main(); {677#(< ~counter~0 49)} is VALID [2022-04-28 07:42:26,763 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {677#(< ~counter~0 49)} {571#true} #57#return; {677#(< ~counter~0 49)} is VALID [2022-04-28 07:42:26,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {677#(< ~counter~0 49)} assume true; {677#(< ~counter~0 49)} is VALID [2022-04-28 07:42:26,764 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 49)} is VALID [2022-04-28 07:42:26,764 INFO L272 TraceCheckUtils]: 0: Hoare triple {571#true} call ULTIMATE.init(); {571#true} is VALID [2022-04-28 07:42:26,764 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 07:42:26,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:42:26,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122083929] [2022-04-28 07:42:26,765 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:42:26,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035077105] [2022-04-28 07:42:26,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035077105] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:42:26,765 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:42:26,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-28 07:42:26,765 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:42:26,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1537732813] [2022-04-28 07:42:26,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1537732813] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:42:26,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:42:26,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:42:26,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461332888] [2022-04-28 07:42:26,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:42:26,766 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 07:42:26,766 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:42:26,767 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 07:42:26,780 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 07:42:26,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 07:42:26,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:26,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 07:42:26,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-28 07:42:26,781 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 07:42:26,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:26,861 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-04-28 07:42:26,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 07:42:26,861 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 07:42:26,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:42:26,861 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 07:42:26,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-28 07:42:26,863 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 07:42:26,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-28 07:42:26,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-04-28 07:42:26,911 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 07:42:26,912 INFO L225 Difference]: With dead ends: 36 [2022-04-28 07:42:26,912 INFO L226 Difference]: Without dead ends: 28 [2022-04-28 07:42:26,912 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 07:42:26,913 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 07:42:26,913 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 07:42:26,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-28 07:42:26,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-28 07:42:26,927 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:42:26,927 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 07:42:26,927 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 07:42:26,927 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 07:42:26,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:26,929 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-04-28 07:42:26,929 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-04-28 07:42:26,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:26,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:26,929 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 07:42:26,929 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 07:42:26,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:26,931 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-04-28 07:42:26,931 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-04-28 07:42:26,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:26,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:26,931 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:42:26,931 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:42:26,931 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 07:42:26,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-04-28 07:42:26,932 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 20 [2022-04-28 07:42:26,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:42:26,933 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-04-28 07:42:26,933 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 07:42:26,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 31 transitions. [2022-04-28 07:42:26,961 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 07:42:26,961 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-04-28 07:42:26,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 07:42:26,961 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:42:26,962 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:42:26,995 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 07:42:27,178 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 07:42:27,178 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:42:27,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:42:27,179 INFO L85 PathProgramCache]: Analyzing trace with hash -261798320, now seen corresponding path program 1 times [2022-04-28 07:42:27,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:27,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [994797390] [2022-04-28 07:42:27,270 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:42:27,271 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:42:27,271 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:42:27,271 INFO L85 PathProgramCache]: Analyzing trace with hash -261798320, now seen corresponding path program 2 times [2022-04-28 07:42:27,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:42:27,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105585992] [2022-04-28 07:42:27,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:42:27,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:42:27,283 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:42:27,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1859758424] [2022-04-28 07:42:27,283 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:42:27,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:42:27,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:42:27,284 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 07:42:27,321 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 07:42:27,337 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:42:27,338 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:42:27,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 07:42:27,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:42:27,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:42:27,439 INFO L272 TraceCheckUtils]: 0: Hoare triple {884#true} call ULTIMATE.init(); {884#true} is VALID [2022-04-28 07:42:27,439 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 07:42:27,440 INFO L290 TraceCheckUtils]: 2: Hoare triple {884#true} assume true; {884#true} is VALID [2022-04-28 07:42:27,440 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {884#true} {884#true} #57#return; {884#true} is VALID [2022-04-28 07:42:27,440 INFO L272 TraceCheckUtils]: 4: Hoare triple {884#true} call #t~ret6 := main(); {884#true} is VALID [2022-04-28 07:42:27,440 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 07:42:27,441 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 07:42:27,441 INFO L290 TraceCheckUtils]: 7: Hoare triple {904#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {904#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:42:27,441 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 07:42:27,441 INFO L290 TraceCheckUtils]: 9: Hoare triple {884#true} ~cond := #in~cond; {884#true} is VALID [2022-04-28 07:42:27,442 INFO L290 TraceCheckUtils]: 10: Hoare triple {884#true} assume !(0 == ~cond); {884#true} is VALID [2022-04-28 07:42:27,442 INFO L290 TraceCheckUtils]: 11: Hoare triple {884#true} assume true; {884#true} is VALID [2022-04-28 07:42:27,443 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 07:42:27,443 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 07:42:27,444 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 07:42:27,444 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 < 50);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 07:42:27,445 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 07:42:27,445 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 07:42:27,445 INFO L290 TraceCheckUtils]: 18: Hoare triple {943#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {885#false} is VALID [2022-04-28 07:42:27,446 INFO L290 TraceCheckUtils]: 19: Hoare triple {885#false} assume !false; {885#false} is VALID [2022-04-28 07:42:27,446 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 07:42:27,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:42:27,615 INFO L290 TraceCheckUtils]: 19: Hoare triple {885#false} assume !false; {885#false} is VALID [2022-04-28 07:42:27,615 INFO L290 TraceCheckUtils]: 18: Hoare triple {943#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {885#false} is VALID [2022-04-28 07:42:27,616 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 07:42:27,616 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 07:42:27,617 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 < 50);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 07:42:27,617 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 07:42:27,626 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 07:42:27,626 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 07:42:27,626 INFO L290 TraceCheckUtils]: 11: Hoare triple {884#true} assume true; {884#true} is VALID [2022-04-28 07:42:27,627 INFO L290 TraceCheckUtils]: 10: Hoare triple {884#true} assume !(0 == ~cond); {884#true} is VALID [2022-04-28 07:42:27,627 INFO L290 TraceCheckUtils]: 9: Hoare triple {884#true} ~cond := #in~cond; {884#true} is VALID [2022-04-28 07:42:27,627 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 07:42:27,627 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 < 50);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 07:42:27,628 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 07:42:27,628 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 07:42:27,628 INFO L272 TraceCheckUtils]: 4: Hoare triple {884#true} call #t~ret6 := main(); {884#true} is VALID [2022-04-28 07:42:27,628 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {884#true} {884#true} #57#return; {884#true} is VALID [2022-04-28 07:42:27,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {884#true} assume true; {884#true} is VALID [2022-04-28 07:42:27,629 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 07:42:27,629 INFO L272 TraceCheckUtils]: 0: Hoare triple {884#true} call ULTIMATE.init(); {884#true} is VALID [2022-04-28 07:42:27,629 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 07:42:27,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:42:27,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105585992] [2022-04-28 07:42:27,629 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:42:27,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859758424] [2022-04-28 07:42:27,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859758424] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 07:42:27,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:42:27,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-28 07:42:27,630 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:42:27,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [994797390] [2022-04-28 07:42:27,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [994797390] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:42:27,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:42:27,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:42:27,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185384514] [2022-04-28 07:42:27,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:42:27,630 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 07:42:27,630 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:42:27,631 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 07:42:27,648 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 07:42:27,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 07:42:27,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:27,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 07:42:27,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 07:42:27,649 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 07:42:27,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:27,735 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-28 07:42:27,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 07:42:27,736 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 07:42:27,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:42:27,736 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 07:42:27,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-04-28 07:42:27,737 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 07:42:27,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-04-28 07:42:27,737 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 26 transitions. [2022-04-28 07:42:27,778 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 07:42:27,779 INFO L225 Difference]: With dead ends: 34 [2022-04-28 07:42:27,779 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 07:42:27,779 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 07:42:27,780 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 07:42:27,780 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 07:42:27,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 07:42:27,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-28 07:42:27,796 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:42:27,797 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 07:42:27,797 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 07:42:27,798 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 07:42:27,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:27,802 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-28 07:42:27,802 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-28 07:42:27,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:27,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:27,803 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 07:42:27,803 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 07:42:27,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:27,803 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-28 07:42:27,804 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-28 07:42:27,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:27,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:27,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:42:27,804 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:42:27,804 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 07:42:27,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2022-04-28 07:42:27,805 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 20 [2022-04-28 07:42:27,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:42:27,805 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2022-04-28 07:42:27,805 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 07:42:27,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 30 transitions. [2022-04-28 07:42:27,851 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 07:42:27,851 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-28 07:42:27,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 07:42:27,852 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:42:27,852 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 07:42:27,868 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 07:42:28,068 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 07:42:28,068 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:42:28,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:42:28,069 INFO L85 PathProgramCache]: Analyzing trace with hash 891414954, now seen corresponding path program 1 times [2022-04-28 07:42:28,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:28,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1946107589] [2022-04-28 07:42:28,160 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:42:28,160 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:42:28,160 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:42:28,160 INFO L85 PathProgramCache]: Analyzing trace with hash 891414954, now seen corresponding path program 2 times [2022-04-28 07:42:28,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:42:28,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097259506] [2022-04-28 07:42:28,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:42:28,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:42:28,178 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:42:28,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1283957841] [2022-04-28 07:42:28,179 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:42:28,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:42:28,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:42:28,196 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 07:42:28,200 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 07:42:28,230 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:42:28,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:42:28,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 07:42:28,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:42:28,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:42:28,423 INFO L272 TraceCheckUtils]: 0: Hoare triple {1196#true} call ULTIMATE.init(); {1196#true} is VALID [2022-04-28 07:42:28,423 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 07:42:28,424 INFO L290 TraceCheckUtils]: 2: Hoare triple {1196#true} assume true; {1196#true} is VALID [2022-04-28 07:42:28,424 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1196#true} {1196#true} #57#return; {1196#true} is VALID [2022-04-28 07:42:28,424 INFO L272 TraceCheckUtils]: 4: Hoare triple {1196#true} call #t~ret6 := main(); {1196#true} is VALID [2022-04-28 07:42:28,424 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 07:42:28,425 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 07:42:28,425 INFO L290 TraceCheckUtils]: 7: Hoare triple {1216#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {1216#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:42:28,425 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 07:42:28,425 INFO L290 TraceCheckUtils]: 9: Hoare triple {1196#true} ~cond := #in~cond; {1196#true} is VALID [2022-04-28 07:42:28,425 INFO L290 TraceCheckUtils]: 10: Hoare triple {1196#true} assume !(0 == ~cond); {1196#true} is VALID [2022-04-28 07:42:28,425 INFO L290 TraceCheckUtils]: 11: Hoare triple {1196#true} assume true; {1196#true} is VALID [2022-04-28 07:42:28,426 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 07:42:28,426 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 07:42:28,427 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 07:42:28,427 INFO L290 TraceCheckUtils]: 15: Hoare triple {1241#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {1241#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 07:42:28,427 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 07:42:28,427 INFO L290 TraceCheckUtils]: 17: Hoare triple {1196#true} ~cond := #in~cond; {1196#true} is VALID [2022-04-28 07:42:28,427 INFO L290 TraceCheckUtils]: 18: Hoare triple {1196#true} assume !(0 == ~cond); {1196#true} is VALID [2022-04-28 07:42:28,428 INFO L290 TraceCheckUtils]: 19: Hoare triple {1196#true} assume true; {1196#true} is VALID [2022-04-28 07:42:28,428 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 07:42:28,429 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 07:42:28,429 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 07:42:28,429 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 07:42:28,430 INFO L290 TraceCheckUtils]: 24: Hoare triple {1274#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1197#false} is VALID [2022-04-28 07:42:28,430 INFO L290 TraceCheckUtils]: 25: Hoare triple {1197#false} assume !false; {1197#false} is VALID [2022-04-28 07:42:28,430 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 07:42:28,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:42:28,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:42:28,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097259506] [2022-04-28 07:42:28,711 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:42:28,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283957841] [2022-04-28 07:42:28,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283957841] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:42:28,711 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:42:28,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-28 07:42:28,712 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:42:28,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1946107589] [2022-04-28 07:42:28,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1946107589] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:42:28,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:42:28,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 07:42:28,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440774430] [2022-04-28 07:42:28,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:42:28,712 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 07:42:28,712 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:42:28,712 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 07:42:28,728 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 07:42:28,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 07:42:28,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:28,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 07:42:28,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 07:42:28,729 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 07:42:28,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:28,872 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-28 07:42:28,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 07:42:28,873 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 07:42:28,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:42:28,873 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 07:42:28,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-04-28 07:42:28,874 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 07:42:28,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-04-28 07:42:28,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 34 transitions. [2022-04-28 07:42:28,897 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 07:42:28,900 INFO L225 Difference]: With dead ends: 36 [2022-04-28 07:42:28,900 INFO L226 Difference]: Without dead ends: 31 [2022-04-28 07:42:28,900 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 07:42:28,900 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 07:42:28,901 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 07:42:28,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-28 07:42:28,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-28 07:42:28,920 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:42:28,921 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 07:42:28,921 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 07:42:28,921 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 07:42:28,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:28,922 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-04-28 07:42:28,922 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-28 07:42:28,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:28,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:28,922 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 07:42:28,923 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 07:42:28,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:28,923 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-04-28 07:42:28,924 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-28 07:42:28,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:28,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:28,924 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:42:28,924 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:42:28,924 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 07:42:28,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2022-04-28 07:42:28,925 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 26 [2022-04-28 07:42:28,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:42:28,925 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2022-04-28 07:42:28,925 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 07:42:28,925 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 33 transitions. [2022-04-28 07:42:28,960 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 07:42:28,960 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-28 07:42:28,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 07:42:28,961 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:42:28,961 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 07:42:28,993 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 07:42:29,161 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 07:42:29,162 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:42:29,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:42:29,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1647059121, now seen corresponding path program 3 times [2022-04-28 07:42:29,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:29,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [756247751] [2022-04-28 07:42:29,245 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:42:29,246 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:42:29,246 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:42:29,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1647059121, now seen corresponding path program 4 times [2022-04-28 07:42:29,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:42:29,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347564115] [2022-04-28 07:42:29,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:42:29,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:42:29,261 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:42:29,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1014561987] [2022-04-28 07:42:29,261 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:42:29,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:42:29,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:42:29,262 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 07:42:29,263 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 07:42:29,293 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:42:29,293 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:42:29,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 07:42:29,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:42:29,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:42:29,431 INFO L272 TraceCheckUtils]: 0: Hoare triple {1525#true} call ULTIMATE.init(); {1525#true} is VALID [2022-04-28 07:42:29,432 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 07:42:29,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {1533#(<= ~counter~0 0)} assume true; {1533#(<= ~counter~0 0)} is VALID [2022-04-28 07:42:29,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1533#(<= ~counter~0 0)} {1525#true} #57#return; {1533#(<= ~counter~0 0)} is VALID [2022-04-28 07:42:29,433 INFO L272 TraceCheckUtils]: 4: Hoare triple {1533#(<= ~counter~0 0)} call #t~ret6 := main(); {1533#(<= ~counter~0 0)} is VALID [2022-04-28 07:42:29,433 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 07:42:29,434 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 07:42:29,434 INFO L290 TraceCheckUtils]: 7: Hoare triple {1549#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {1549#(<= ~counter~0 1)} is VALID [2022-04-28 07:42:29,435 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 07:42:29,435 INFO L290 TraceCheckUtils]: 9: Hoare triple {1549#(<= ~counter~0 1)} ~cond := #in~cond; {1549#(<= ~counter~0 1)} is VALID [2022-04-28 07:42:29,435 INFO L290 TraceCheckUtils]: 10: Hoare triple {1549#(<= ~counter~0 1)} assume !(0 == ~cond); {1549#(<= ~counter~0 1)} is VALID [2022-04-28 07:42:29,436 INFO L290 TraceCheckUtils]: 11: Hoare triple {1549#(<= ~counter~0 1)} assume true; {1549#(<= ~counter~0 1)} is VALID [2022-04-28 07:42:29,436 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 07:42:29,436 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 07:42:29,437 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 07:42:29,437 INFO L290 TraceCheckUtils]: 15: Hoare triple {1574#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {1574#(<= ~counter~0 2)} is VALID [2022-04-28 07:42:29,438 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 07:42:29,438 INFO L290 TraceCheckUtils]: 17: Hoare triple {1574#(<= ~counter~0 2)} ~cond := #in~cond; {1574#(<= ~counter~0 2)} is VALID [2022-04-28 07:42:29,438 INFO L290 TraceCheckUtils]: 18: Hoare triple {1574#(<= ~counter~0 2)} assume !(0 == ~cond); {1574#(<= ~counter~0 2)} is VALID [2022-04-28 07:42:29,439 INFO L290 TraceCheckUtils]: 19: Hoare triple {1574#(<= ~counter~0 2)} assume true; {1574#(<= ~counter~0 2)} is VALID [2022-04-28 07:42:29,439 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 07:42:29,439 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 07:42:29,440 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 07:42:29,440 INFO L290 TraceCheckUtils]: 23: Hoare triple {1599#(<= |main_#t~post5| 2)} assume !(#t~post5 < 50);havoc #t~post5; {1526#false} is VALID [2022-04-28 07:42:29,440 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 07:42:29,440 INFO L290 TraceCheckUtils]: 25: Hoare triple {1526#false} ~cond := #in~cond; {1526#false} is VALID [2022-04-28 07:42:29,440 INFO L290 TraceCheckUtils]: 26: Hoare triple {1526#false} assume 0 == ~cond; {1526#false} is VALID [2022-04-28 07:42:29,441 INFO L290 TraceCheckUtils]: 27: Hoare triple {1526#false} assume !false; {1526#false} is VALID [2022-04-28 07:42:29,441 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 07:42:29,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:42:29,604 INFO L290 TraceCheckUtils]: 27: Hoare triple {1526#false} assume !false; {1526#false} is VALID [2022-04-28 07:42:29,604 INFO L290 TraceCheckUtils]: 26: Hoare triple {1526#false} assume 0 == ~cond; {1526#false} is VALID [2022-04-28 07:42:29,604 INFO L290 TraceCheckUtils]: 25: Hoare triple {1526#false} ~cond := #in~cond; {1526#false} is VALID [2022-04-28 07:42:29,604 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 07:42:29,604 INFO L290 TraceCheckUtils]: 23: Hoare triple {1627#(< |main_#t~post5| 50)} assume !(#t~post5 < 50);havoc #t~post5; {1526#false} is VALID [2022-04-28 07:42:29,605 INFO L290 TraceCheckUtils]: 22: Hoare triple {1631#(< ~counter~0 50)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1627#(< |main_#t~post5| 50)} is VALID [2022-04-28 07:42:29,605 INFO L290 TraceCheckUtils]: 21: Hoare triple {1631#(< ~counter~0 50)} 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 50)} is VALID [2022-04-28 07:42:29,606 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1525#true} {1631#(< ~counter~0 50)} #51#return; {1631#(< ~counter~0 50)} is VALID [2022-04-28 07:42:29,606 INFO L290 TraceCheckUtils]: 19: Hoare triple {1525#true} assume true; {1525#true} is VALID [2022-04-28 07:42:29,606 INFO L290 TraceCheckUtils]: 18: Hoare triple {1525#true} assume !(0 == ~cond); {1525#true} is VALID [2022-04-28 07:42:29,606 INFO L290 TraceCheckUtils]: 17: Hoare triple {1525#true} ~cond := #in~cond; {1525#true} is VALID [2022-04-28 07:42:29,606 INFO L272 TraceCheckUtils]: 16: Hoare triple {1631#(< ~counter~0 50)} 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 07:42:29,606 INFO L290 TraceCheckUtils]: 15: Hoare triple {1631#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {1631#(< ~counter~0 50)} is VALID [2022-04-28 07:42:29,607 INFO L290 TraceCheckUtils]: 14: Hoare triple {1656#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1631#(< ~counter~0 50)} is VALID [2022-04-28 07:42:29,607 INFO L290 TraceCheckUtils]: 13: Hoare triple {1656#(< ~counter~0 49)} 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 49)} is VALID [2022-04-28 07:42:29,608 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1525#true} {1656#(< ~counter~0 49)} #51#return; {1656#(< ~counter~0 49)} is VALID [2022-04-28 07:42:29,608 INFO L290 TraceCheckUtils]: 11: Hoare triple {1525#true} assume true; {1525#true} is VALID [2022-04-28 07:42:29,608 INFO L290 TraceCheckUtils]: 10: Hoare triple {1525#true} assume !(0 == ~cond); {1525#true} is VALID [2022-04-28 07:42:29,608 INFO L290 TraceCheckUtils]: 9: Hoare triple {1525#true} ~cond := #in~cond; {1525#true} is VALID [2022-04-28 07:42:29,608 INFO L272 TraceCheckUtils]: 8: Hoare triple {1656#(< ~counter~0 49)} 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 07:42:29,608 INFO L290 TraceCheckUtils]: 7: Hoare triple {1656#(< ~counter~0 49)} assume !!(#t~post5 < 50);havoc #t~post5; {1656#(< ~counter~0 49)} is VALID [2022-04-28 07:42:29,609 INFO L290 TraceCheckUtils]: 6: Hoare triple {1681#(< ~counter~0 48)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1656#(< ~counter~0 49)} is VALID [2022-04-28 07:42:29,609 INFO L290 TraceCheckUtils]: 5: Hoare triple {1681#(< ~counter~0 48)} 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 48)} is VALID [2022-04-28 07:42:29,609 INFO L272 TraceCheckUtils]: 4: Hoare triple {1681#(< ~counter~0 48)} call #t~ret6 := main(); {1681#(< ~counter~0 48)} is VALID [2022-04-28 07:42:29,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1681#(< ~counter~0 48)} {1525#true} #57#return; {1681#(< ~counter~0 48)} is VALID [2022-04-28 07:42:29,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {1681#(< ~counter~0 48)} assume true; {1681#(< ~counter~0 48)} is VALID [2022-04-28 07:42:29,611 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 48)} is VALID [2022-04-28 07:42:29,611 INFO L272 TraceCheckUtils]: 0: Hoare triple {1525#true} call ULTIMATE.init(); {1525#true} is VALID [2022-04-28 07:42:29,611 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 07:42:29,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:42:29,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347564115] [2022-04-28 07:42:29,611 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:42:29,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014561987] [2022-04-28 07:42:29,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014561987] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:42:29,611 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:42:29,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-28 07:42:29,612 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:42:29,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [756247751] [2022-04-28 07:42:29,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [756247751] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:42:29,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:42:29,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 07:42:29,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746016525] [2022-04-28 07:42:29,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:42:29,612 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 07:42:29,612 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:42:29,612 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 07:42:29,630 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 07:42:29,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 07:42:29,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:29,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 07:42:29,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 07:42:29,631 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 07:42:29,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:29,715 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2022-04-28 07:42:29,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 07:42:29,715 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 07:42:29,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:42:29,715 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 07:42:29,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-28 07:42:29,716 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 07:42:29,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-28 07:42:29,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 42 transitions. [2022-04-28 07:42:29,753 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 07:42:29,754 INFO L225 Difference]: With dead ends: 42 [2022-04-28 07:42:29,754 INFO L226 Difference]: Without dead ends: 37 [2022-04-28 07:42:29,754 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 07:42:29,754 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 07:42:29,755 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 07:42:29,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-28 07:42:29,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-28 07:42:29,786 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:42:29,786 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 07:42:29,786 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 07:42:29,786 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 07:42:29,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:29,787 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2022-04-28 07:42:29,787 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-04-28 07:42:29,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:29,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:29,788 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 07:42:29,788 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 07:42:29,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:29,789 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2022-04-28 07:42:29,789 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-04-28 07:42:29,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:29,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:29,789 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:42:29,789 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:42:29,789 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 07:42:29,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2022-04-28 07:42:29,790 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 28 [2022-04-28 07:42:29,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:42:29,790 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2022-04-28 07:42:29,790 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 07:42:29,790 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 38 transitions. [2022-04-28 07:42:29,822 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 07:42:29,823 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-04-28 07:42:29,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 07:42:29,823 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:42:29,823 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 07:42:29,857 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 07:42:30,023 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 07:42:30,024 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:42:30,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:42:30,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1036651181, now seen corresponding path program 3 times [2022-04-28 07:42:30,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:30,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1062582280] [2022-04-28 07:42:30,109 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:42:30,109 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:42:30,109 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:42:30,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1036651181, now seen corresponding path program 4 times [2022-04-28 07:42:30,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:42:30,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727881965] [2022-04-28 07:42:30,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:42:30,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:42:30,129 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:42:30,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1186572515] [2022-04-28 07:42:30,130 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:42:30,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:42:30,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:42:30,140 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 07:42:30,144 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 07:42:30,204 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:42:30,204 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:42:30,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 07:42:30,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:42:30,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:42:30,513 INFO L272 TraceCheckUtils]: 0: Hoare triple {1938#true} call ULTIMATE.init(); {1938#true} is VALID [2022-04-28 07:42:30,514 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 07:42:30,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {1938#true} assume true; {1938#true} is VALID [2022-04-28 07:42:30,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1938#true} {1938#true} #57#return; {1938#true} is VALID [2022-04-28 07:42:30,514 INFO L272 TraceCheckUtils]: 4: Hoare triple {1938#true} call #t~ret6 := main(); {1938#true} is VALID [2022-04-28 07:42:30,514 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 07:42:30,515 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 07:42:30,515 INFO L290 TraceCheckUtils]: 7: Hoare triple {1958#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {1958#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:42:30,515 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 07:42:30,515 INFO L290 TraceCheckUtils]: 9: Hoare triple {1938#true} ~cond := #in~cond; {1938#true} is VALID [2022-04-28 07:42:30,516 INFO L290 TraceCheckUtils]: 10: Hoare triple {1938#true} assume !(0 == ~cond); {1938#true} is VALID [2022-04-28 07:42:30,516 INFO L290 TraceCheckUtils]: 11: Hoare triple {1938#true} assume true; {1938#true} is VALID [2022-04-28 07:42:30,516 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 07:42:30,516 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 07:42:30,517 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 07:42:30,517 INFO L290 TraceCheckUtils]: 15: Hoare triple {1983#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {1983#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-28 07:42:30,517 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 07:42:30,517 INFO L290 TraceCheckUtils]: 17: Hoare triple {1938#true} ~cond := #in~cond; {1938#true} is VALID [2022-04-28 07:42:30,518 INFO L290 TraceCheckUtils]: 18: Hoare triple {1938#true} assume !(0 == ~cond); {1938#true} is VALID [2022-04-28 07:42:30,518 INFO L290 TraceCheckUtils]: 19: Hoare triple {1938#true} assume true; {1938#true} is VALID [2022-04-28 07:42:30,518 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 07:42:30,518 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 07:42:30,519 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 07:42:30,519 INFO L290 TraceCheckUtils]: 23: Hoare triple {2008#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !!(#t~post5 < 50);havoc #t~post5; {2008#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-28 07:42:30,519 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 07:42:30,519 INFO L290 TraceCheckUtils]: 25: Hoare triple {1938#true} ~cond := #in~cond; {1938#true} is VALID [2022-04-28 07:42:30,519 INFO L290 TraceCheckUtils]: 26: Hoare triple {1938#true} assume !(0 == ~cond); {1938#true} is VALID [2022-04-28 07:42:30,520 INFO L290 TraceCheckUtils]: 27: Hoare triple {1938#true} assume true; {1938#true} is VALID [2022-04-28 07:42:30,520 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 07:42:30,520 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 07:42:30,521 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 07:42:30,521 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 07:42:30,522 INFO L290 TraceCheckUtils]: 32: Hoare triple {2041#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1939#false} is VALID [2022-04-28 07:42:30,522 INFO L290 TraceCheckUtils]: 33: Hoare triple {1939#false} assume !false; {1939#false} is VALID [2022-04-28 07:42:30,522 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 07:42:30,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:42:30,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:42:30,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727881965] [2022-04-28 07:42:30,813 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:42:30,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186572515] [2022-04-28 07:42:30,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186572515] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:42:30,813 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:42:30,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-28 07:42:30,814 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:42:30,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1062582280] [2022-04-28 07:42:30,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1062582280] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:42:30,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:42:30,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 07:42:30,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648406177] [2022-04-28 07:42:30,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:42:30,814 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 07:42:30,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:42:30,815 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 07:42:30,833 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 07:42:30,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 07:42:30,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:30,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 07:42:30,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-28 07:42:30,834 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 07:42:31,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:31,047 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-28 07:42:31,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 07:42:31,047 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 07:42:31,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:42:31,047 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 07:42:31,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-28 07:42:31,048 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 07:42:31,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-28 07:42:31,049 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 39 transitions. [2022-04-28 07:42:31,075 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 07:42:31,076 INFO L225 Difference]: With dead ends: 44 [2022-04-28 07:42:31,076 INFO L226 Difference]: Without dead ends: 39 [2022-04-28 07:42:31,076 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 07:42:31,077 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 07:42:31,077 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 07:42:31,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-28 07:42:31,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-28 07:42:31,107 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:42:31,107 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 07:42:31,108 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 07:42:31,108 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 07:42:31,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:31,109 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2022-04-28 07:42:31,109 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-04-28 07:42:31,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:31,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:31,109 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 07:42:31,109 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 07:42:31,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:31,110 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2022-04-28 07:42:31,110 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-04-28 07:42:31,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:31,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:31,111 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:42:31,111 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:42:31,111 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 07:42:31,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2022-04-28 07:42:31,112 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 34 [2022-04-28 07:42:31,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:42:31,112 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2022-04-28 07:42:31,112 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 07:42:31,112 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 41 transitions. [2022-04-28 07:42:31,155 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 07:42:31,155 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-04-28 07:42:31,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 07:42:31,156 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:42:31,156 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 07:42:31,169 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 07:42:31,356 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 07:42:31,356 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:42:31,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:42:31,357 INFO L85 PathProgramCache]: Analyzing trace with hash 486001554, now seen corresponding path program 5 times [2022-04-28 07:42:31,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:31,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [725804124] [2022-04-28 07:42:31,439 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:42:31,439 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:42:31,439 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:42:31,440 INFO L85 PathProgramCache]: Analyzing trace with hash 486001554, now seen corresponding path program 6 times [2022-04-28 07:42:31,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:42:31,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897286984] [2022-04-28 07:42:31,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:42:31,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:42:31,447 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:42:31,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1058861419] [2022-04-28 07:42:31,448 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:42:31,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:42:31,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:42:31,449 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 07:42:31,463 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 07:42:31,496 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 07:42:31,496 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:42:31,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 07:42:31,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:42:31,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:42:31,670 INFO L272 TraceCheckUtils]: 0: Hoare triple {2365#true} call ULTIMATE.init(); {2365#true} is VALID [2022-04-28 07:42:31,671 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 07:42:31,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {2373#(<= ~counter~0 0)} assume true; {2373#(<= ~counter~0 0)} is VALID [2022-04-28 07:42:31,672 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2373#(<= ~counter~0 0)} {2365#true} #57#return; {2373#(<= ~counter~0 0)} is VALID [2022-04-28 07:42:31,672 INFO L272 TraceCheckUtils]: 4: Hoare triple {2373#(<= ~counter~0 0)} call #t~ret6 := main(); {2373#(<= ~counter~0 0)} is VALID [2022-04-28 07:42:31,672 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 07:42:31,673 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 07:42:31,673 INFO L290 TraceCheckUtils]: 7: Hoare triple {2389#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {2389#(<= ~counter~0 1)} is VALID [2022-04-28 07:42:31,674 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 07:42:31,674 INFO L290 TraceCheckUtils]: 9: Hoare triple {2389#(<= ~counter~0 1)} ~cond := #in~cond; {2389#(<= ~counter~0 1)} is VALID [2022-04-28 07:42:31,674 INFO L290 TraceCheckUtils]: 10: Hoare triple {2389#(<= ~counter~0 1)} assume !(0 == ~cond); {2389#(<= ~counter~0 1)} is VALID [2022-04-28 07:42:31,674 INFO L290 TraceCheckUtils]: 11: Hoare triple {2389#(<= ~counter~0 1)} assume true; {2389#(<= ~counter~0 1)} is VALID [2022-04-28 07:42:31,675 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 07:42:31,675 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 07:42:31,676 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 07:42:31,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {2414#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {2414#(<= ~counter~0 2)} is VALID [2022-04-28 07:42:31,679 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 07:42:31,684 INFO L290 TraceCheckUtils]: 17: Hoare triple {2414#(<= ~counter~0 2)} ~cond := #in~cond; {2414#(<= ~counter~0 2)} is VALID [2022-04-28 07:42:31,685 INFO L290 TraceCheckUtils]: 18: Hoare triple {2414#(<= ~counter~0 2)} assume !(0 == ~cond); {2414#(<= ~counter~0 2)} is VALID [2022-04-28 07:42:31,685 INFO L290 TraceCheckUtils]: 19: Hoare triple {2414#(<= ~counter~0 2)} assume true; {2414#(<= ~counter~0 2)} is VALID [2022-04-28 07:42:31,686 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 07:42:31,688 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 07:42:31,688 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 07:42:31,689 INFO L290 TraceCheckUtils]: 23: Hoare triple {2439#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {2439#(<= ~counter~0 3)} is VALID [2022-04-28 07:42:31,689 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 07:42:31,690 INFO L290 TraceCheckUtils]: 25: Hoare triple {2439#(<= ~counter~0 3)} ~cond := #in~cond; {2439#(<= ~counter~0 3)} is VALID [2022-04-28 07:42:31,690 INFO L290 TraceCheckUtils]: 26: Hoare triple {2439#(<= ~counter~0 3)} assume !(0 == ~cond); {2439#(<= ~counter~0 3)} is VALID [2022-04-28 07:42:31,691 INFO L290 TraceCheckUtils]: 27: Hoare triple {2439#(<= ~counter~0 3)} assume true; {2439#(<= ~counter~0 3)} is VALID [2022-04-28 07:42:31,692 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 07:42:31,692 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 07:42:31,692 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 07:42:31,693 INFO L290 TraceCheckUtils]: 31: Hoare triple {2464#(<= |main_#t~post5| 3)} assume !(#t~post5 < 50);havoc #t~post5; {2366#false} is VALID [2022-04-28 07:42:31,693 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 07:42:31,693 INFO L290 TraceCheckUtils]: 33: Hoare triple {2366#false} ~cond := #in~cond; {2366#false} is VALID [2022-04-28 07:42:31,693 INFO L290 TraceCheckUtils]: 34: Hoare triple {2366#false} assume 0 == ~cond; {2366#false} is VALID [2022-04-28 07:42:31,693 INFO L290 TraceCheckUtils]: 35: Hoare triple {2366#false} assume !false; {2366#false} is VALID [2022-04-28 07:42:31,694 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 07:42:31,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:42:31,893 INFO L290 TraceCheckUtils]: 35: Hoare triple {2366#false} assume !false; {2366#false} is VALID [2022-04-28 07:42:31,893 INFO L290 TraceCheckUtils]: 34: Hoare triple {2366#false} assume 0 == ~cond; {2366#false} is VALID [2022-04-28 07:42:31,893 INFO L290 TraceCheckUtils]: 33: Hoare triple {2366#false} ~cond := #in~cond; {2366#false} is VALID [2022-04-28 07:42:31,893 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 07:42:31,893 INFO L290 TraceCheckUtils]: 31: Hoare triple {2492#(< |main_#t~post5| 50)} assume !(#t~post5 < 50);havoc #t~post5; {2366#false} is VALID [2022-04-28 07:42:31,894 INFO L290 TraceCheckUtils]: 30: Hoare triple {2496#(< ~counter~0 50)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2492#(< |main_#t~post5| 50)} is VALID [2022-04-28 07:42:31,894 INFO L290 TraceCheckUtils]: 29: Hoare triple {2496#(< ~counter~0 50)} 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 50)} is VALID [2022-04-28 07:42:31,895 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2365#true} {2496#(< ~counter~0 50)} #51#return; {2496#(< ~counter~0 50)} is VALID [2022-04-28 07:42:31,895 INFO L290 TraceCheckUtils]: 27: Hoare triple {2365#true} assume true; {2365#true} is VALID [2022-04-28 07:42:31,895 INFO L290 TraceCheckUtils]: 26: Hoare triple {2365#true} assume !(0 == ~cond); {2365#true} is VALID [2022-04-28 07:42:31,895 INFO L290 TraceCheckUtils]: 25: Hoare triple {2365#true} ~cond := #in~cond; {2365#true} is VALID [2022-04-28 07:42:31,895 INFO L272 TraceCheckUtils]: 24: Hoare triple {2496#(< ~counter~0 50)} 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 07:42:31,896 INFO L290 TraceCheckUtils]: 23: Hoare triple {2496#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {2496#(< ~counter~0 50)} is VALID [2022-04-28 07:42:31,896 INFO L290 TraceCheckUtils]: 22: Hoare triple {2521#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2496#(< ~counter~0 50)} is VALID [2022-04-28 07:42:31,897 INFO L290 TraceCheckUtils]: 21: Hoare triple {2521#(< ~counter~0 49)} 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 49)} is VALID [2022-04-28 07:42:31,897 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2365#true} {2521#(< ~counter~0 49)} #51#return; {2521#(< ~counter~0 49)} is VALID [2022-04-28 07:42:31,897 INFO L290 TraceCheckUtils]: 19: Hoare triple {2365#true} assume true; {2365#true} is VALID [2022-04-28 07:42:31,897 INFO L290 TraceCheckUtils]: 18: Hoare triple {2365#true} assume !(0 == ~cond); {2365#true} is VALID [2022-04-28 07:42:31,897 INFO L290 TraceCheckUtils]: 17: Hoare triple {2365#true} ~cond := #in~cond; {2365#true} is VALID [2022-04-28 07:42:31,897 INFO L272 TraceCheckUtils]: 16: Hoare triple {2521#(< ~counter~0 49)} 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 07:42:31,898 INFO L290 TraceCheckUtils]: 15: Hoare triple {2521#(< ~counter~0 49)} assume !!(#t~post5 < 50);havoc #t~post5; {2521#(< ~counter~0 49)} is VALID [2022-04-28 07:42:31,898 INFO L290 TraceCheckUtils]: 14: Hoare triple {2546#(< ~counter~0 48)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2521#(< ~counter~0 49)} is VALID [2022-04-28 07:42:31,899 INFO L290 TraceCheckUtils]: 13: Hoare triple {2546#(< ~counter~0 48)} 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 48)} is VALID [2022-04-28 07:42:31,899 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2365#true} {2546#(< ~counter~0 48)} #51#return; {2546#(< ~counter~0 48)} is VALID [2022-04-28 07:42:31,899 INFO L290 TraceCheckUtils]: 11: Hoare triple {2365#true} assume true; {2365#true} is VALID [2022-04-28 07:42:31,899 INFO L290 TraceCheckUtils]: 10: Hoare triple {2365#true} assume !(0 == ~cond); {2365#true} is VALID [2022-04-28 07:42:31,899 INFO L290 TraceCheckUtils]: 9: Hoare triple {2365#true} ~cond := #in~cond; {2365#true} is VALID [2022-04-28 07:42:31,899 INFO L272 TraceCheckUtils]: 8: Hoare triple {2546#(< ~counter~0 48)} 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 07:42:31,900 INFO L290 TraceCheckUtils]: 7: Hoare triple {2546#(< ~counter~0 48)} assume !!(#t~post5 < 50);havoc #t~post5; {2546#(< ~counter~0 48)} is VALID [2022-04-28 07:42:31,900 INFO L290 TraceCheckUtils]: 6: Hoare triple {2571#(< ~counter~0 47)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2546#(< ~counter~0 48)} is VALID [2022-04-28 07:42:31,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {2571#(< ~counter~0 47)} 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 47)} is VALID [2022-04-28 07:42:31,901 INFO L272 TraceCheckUtils]: 4: Hoare triple {2571#(< ~counter~0 47)} call #t~ret6 := main(); {2571#(< ~counter~0 47)} is VALID [2022-04-28 07:42:31,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2571#(< ~counter~0 47)} {2365#true} #57#return; {2571#(< ~counter~0 47)} is VALID [2022-04-28 07:42:31,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {2571#(< ~counter~0 47)} assume true; {2571#(< ~counter~0 47)} is VALID [2022-04-28 07:42:31,902 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 47)} is VALID [2022-04-28 07:42:31,902 INFO L272 TraceCheckUtils]: 0: Hoare triple {2365#true} call ULTIMATE.init(); {2365#true} is VALID [2022-04-28 07:42:31,902 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 07:42:31,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:42:31,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897286984] [2022-04-28 07:42:31,903 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:42:31,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058861419] [2022-04-28 07:42:31,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058861419] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:42:31,903 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:42:31,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-28 07:42:31,903 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:42:31,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [725804124] [2022-04-28 07:42:31,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [725804124] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:42:31,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:42:31,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 07:42:31,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205809991] [2022-04-28 07:42:31,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:42:31,904 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 07:42:31,904 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:42:31,905 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 07:42:31,931 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 07:42:31,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 07:42:31,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:31,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 07:42:31,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-28 07:42:31,932 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 07:42:32,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:32,052 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2022-04-28 07:42:32,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 07:42:32,053 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 07:42:32,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:42:32,053 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 07:42:32,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2022-04-28 07:42:32,054 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 07:42:32,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2022-04-28 07:42:32,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 50 transitions. [2022-04-28 07:42:32,086 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 07:42:32,086 INFO L225 Difference]: With dead ends: 50 [2022-04-28 07:42:32,086 INFO L226 Difference]: Without dead ends: 45 [2022-04-28 07:42:32,087 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 07:42:32,087 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 07:42:32,087 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 07:42:32,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-28 07:42:32,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-28 07:42:32,125 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:42:32,125 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 07:42:32,125 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 07:42:32,125 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 07:42:32,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:32,126 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2022-04-28 07:42:32,126 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-04-28 07:42:32,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:32,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:32,127 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 07:42:32,127 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 07:42:32,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:32,128 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2022-04-28 07:42:32,128 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-04-28 07:42:32,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:32,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:32,128 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:42:32,128 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:42:32,128 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 07:42:32,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2022-04-28 07:42:32,129 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 36 [2022-04-28 07:42:32,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:42:32,129 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2022-04-28 07:42:32,130 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 07:42:32,130 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 46 transitions. [2022-04-28 07:42:32,176 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 07:42:32,176 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-04-28 07:42:32,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 07:42:32,177 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:42:32,177 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 07:42:32,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 07:42:32,377 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 07:42:32,378 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:42:32,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:42:32,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1383171920, now seen corresponding path program 5 times [2022-04-28 07:42:32,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:32,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [462730773] [2022-04-28 07:42:32,461 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:42:32,461 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:42:32,461 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:42:32,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1383171920, now seen corresponding path program 6 times [2022-04-28 07:42:32,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:42:32,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331722571] [2022-04-28 07:42:32,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:42:32,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:42:32,469 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:42:32,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [963835266] [2022-04-28 07:42:32,469 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:42:32,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:42:32,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:42:32,470 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 07:42:32,471 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 07:42:32,553 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 07:42:32,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:42:32,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 07:42:32,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:42:32,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:42:32,877 INFO L272 TraceCheckUtils]: 0: Hoare triple {2878#true} call ULTIMATE.init(); {2878#true} is VALID [2022-04-28 07:42:32,877 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 07:42:32,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-28 07:42:32,877 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2878#true} {2878#true} #57#return; {2878#true} is VALID [2022-04-28 07:42:32,877 INFO L272 TraceCheckUtils]: 4: Hoare triple {2878#true} call #t~ret6 := main(); {2878#true} is VALID [2022-04-28 07:42:32,878 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 07:42:32,878 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 07:42:32,878 INFO L290 TraceCheckUtils]: 7: Hoare triple {2898#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {2898#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:42:32,878 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 07:42:32,879 INFO L290 TraceCheckUtils]: 9: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-28 07:42:32,879 INFO L290 TraceCheckUtils]: 10: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-28 07:42:32,879 INFO L290 TraceCheckUtils]: 11: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-28 07:42:32,879 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 07:42:32,880 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 07:42:32,880 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 07:42:32,880 INFO L290 TraceCheckUtils]: 15: Hoare triple {2923#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {2923#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:42:32,881 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 07:42:32,881 INFO L290 TraceCheckUtils]: 17: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-28 07:42:32,881 INFO L290 TraceCheckUtils]: 18: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-28 07:42:32,881 INFO L290 TraceCheckUtils]: 19: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-28 07:42:32,881 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 07:42:32,882 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 07:42:32,882 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 07:42:32,882 INFO L290 TraceCheckUtils]: 23: Hoare triple {2948#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(#t~post5 < 50);havoc #t~post5; {2948#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 07:42:32,883 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 07:42:32,883 INFO L290 TraceCheckUtils]: 25: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-28 07:42:32,883 INFO L290 TraceCheckUtils]: 26: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-28 07:42:32,883 INFO L290 TraceCheckUtils]: 27: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-28 07:42:32,883 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 07:42:32,884 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 07:42:32,884 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 07:42:32,884 INFO L290 TraceCheckUtils]: 31: Hoare triple {2973#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} assume !!(#t~post5 < 50);havoc #t~post5; {2973#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} is VALID [2022-04-28 07:42:32,884 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 07:42:32,884 INFO L290 TraceCheckUtils]: 33: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-28 07:42:32,885 INFO L290 TraceCheckUtils]: 34: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-28 07:42:32,885 INFO L290 TraceCheckUtils]: 35: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-28 07:42:32,885 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 07:42:32,885 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 07:42:32,886 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 07:42:32,886 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 07:42:32,887 INFO L290 TraceCheckUtils]: 40: Hoare triple {3006#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2879#false} is VALID [2022-04-28 07:42:32,887 INFO L290 TraceCheckUtils]: 41: Hoare triple {2879#false} assume !false; {2879#false} is VALID [2022-04-28 07:42:32,887 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 07:42:32,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:42:33,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:42:33,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331722571] [2022-04-28 07:42:33,174 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:42:33,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963835266] [2022-04-28 07:42:33,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963835266] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:42:33,174 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:42:33,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-28 07:42:33,175 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:42:33,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [462730773] [2022-04-28 07:42:33,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [462730773] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:42:33,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:42:33,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 07:42:33,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043039152] [2022-04-28 07:42:33,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:42:33,175 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 07:42:33,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:42:33,176 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 07:42:33,199 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 07:42:33,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 07:42:33,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:33,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 07:42:33,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-28 07:42:33,199 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 07:42:33,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:33,478 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-28 07:42:33,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 07:42:33,478 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 07:42:33,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:42:33,479 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 07:42:33,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-28 07:42:33,480 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 07:42:33,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-28 07:42:33,480 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 44 transitions. [2022-04-28 07:42:33,508 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 07:42:33,509 INFO L225 Difference]: With dead ends: 52 [2022-04-28 07:42:33,509 INFO L226 Difference]: Without dead ends: 47 [2022-04-28 07:42:33,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-28 07:42:33,509 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 07:42:33,509 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 07:42:33,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-28 07:42:33,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-28 07:42:33,550 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:42:33,550 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 07:42:33,550 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 07:42:33,550 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 07:42:33,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:33,551 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-04-28 07:42:33,551 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-28 07:42:33,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:33,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:33,552 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 07:42:33,552 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 07:42:33,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:33,552 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-04-28 07:42:33,553 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-28 07:42:33,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:33,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:33,553 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:42:33,553 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:42:33,553 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 07:42:33,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2022-04-28 07:42:33,554 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 42 [2022-04-28 07:42:33,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:42:33,554 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2022-04-28 07:42:33,554 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 07:42:33,554 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 49 transitions. [2022-04-28 07:42:33,605 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 07:42:33,605 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-28 07:42:33,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 07:42:33,605 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:42:33,605 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 07:42:33,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-28 07:42:33,806 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 07:42:33,806 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:42:33,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:42:33,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1386691371, now seen corresponding path program 7 times [2022-04-28 07:42:33,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:33,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1144513463] [2022-04-28 07:42:33,889 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:42:33,889 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:42:33,889 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:42:33,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1386691371, now seen corresponding path program 8 times [2022-04-28 07:42:33,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:42:33,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020537909] [2022-04-28 07:42:33,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:42:33,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:42:33,908 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:42:33,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2029032871] [2022-04-28 07:42:33,908 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:42:33,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:42:33,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:42:33,928 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 07:42:33,973 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 07:42:33,990 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:42:33,990 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:42:33,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 07:42:34,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:42:34,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:42:34,175 INFO L272 TraceCheckUtils]: 0: Hoare triple {3353#true} call ULTIMATE.init(); {3353#true} is VALID [2022-04-28 07:42:34,175 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 07:42:34,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {3361#(<= ~counter~0 0)} assume true; {3361#(<= ~counter~0 0)} is VALID [2022-04-28 07:42:34,176 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3361#(<= ~counter~0 0)} {3353#true} #57#return; {3361#(<= ~counter~0 0)} is VALID [2022-04-28 07:42:34,176 INFO L272 TraceCheckUtils]: 4: Hoare triple {3361#(<= ~counter~0 0)} call #t~ret6 := main(); {3361#(<= ~counter~0 0)} is VALID [2022-04-28 07:42:34,176 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 07:42:34,177 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 07:42:34,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {3377#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {3377#(<= ~counter~0 1)} is VALID [2022-04-28 07:42:34,177 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 07:42:34,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {3377#(<= ~counter~0 1)} ~cond := #in~cond; {3377#(<= ~counter~0 1)} is VALID [2022-04-28 07:42:34,178 INFO L290 TraceCheckUtils]: 10: Hoare triple {3377#(<= ~counter~0 1)} assume !(0 == ~cond); {3377#(<= ~counter~0 1)} is VALID [2022-04-28 07:42:34,178 INFO L290 TraceCheckUtils]: 11: Hoare triple {3377#(<= ~counter~0 1)} assume true; {3377#(<= ~counter~0 1)} is VALID [2022-04-28 07:42:34,178 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 07:42:34,179 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 07:42:34,179 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 07:42:34,179 INFO L290 TraceCheckUtils]: 15: Hoare triple {3402#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {3402#(<= ~counter~0 2)} is VALID [2022-04-28 07:42:34,180 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 07:42:34,180 INFO L290 TraceCheckUtils]: 17: Hoare triple {3402#(<= ~counter~0 2)} ~cond := #in~cond; {3402#(<= ~counter~0 2)} is VALID [2022-04-28 07:42:34,181 INFO L290 TraceCheckUtils]: 18: Hoare triple {3402#(<= ~counter~0 2)} assume !(0 == ~cond); {3402#(<= ~counter~0 2)} is VALID [2022-04-28 07:42:34,181 INFO L290 TraceCheckUtils]: 19: Hoare triple {3402#(<= ~counter~0 2)} assume true; {3402#(<= ~counter~0 2)} is VALID [2022-04-28 07:42:34,181 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 07:42:34,181 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 07:42:34,182 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 07:42:34,182 INFO L290 TraceCheckUtils]: 23: Hoare triple {3427#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {3427#(<= ~counter~0 3)} is VALID [2022-04-28 07:42:34,182 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 07:42:34,183 INFO L290 TraceCheckUtils]: 25: Hoare triple {3427#(<= ~counter~0 3)} ~cond := #in~cond; {3427#(<= ~counter~0 3)} is VALID [2022-04-28 07:42:34,183 INFO L290 TraceCheckUtils]: 26: Hoare triple {3427#(<= ~counter~0 3)} assume !(0 == ~cond); {3427#(<= ~counter~0 3)} is VALID [2022-04-28 07:42:34,183 INFO L290 TraceCheckUtils]: 27: Hoare triple {3427#(<= ~counter~0 3)} assume true; {3427#(<= ~counter~0 3)} is VALID [2022-04-28 07:42:34,183 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 07:42:34,185 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 07:42:34,187 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 07:42:34,188 INFO L290 TraceCheckUtils]: 31: Hoare triple {3452#(<= ~counter~0 4)} assume !!(#t~post5 < 50);havoc #t~post5; {3452#(<= ~counter~0 4)} is VALID [2022-04-28 07:42:34,188 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 07:42:34,188 INFO L290 TraceCheckUtils]: 33: Hoare triple {3452#(<= ~counter~0 4)} ~cond := #in~cond; {3452#(<= ~counter~0 4)} is VALID [2022-04-28 07:42:34,188 INFO L290 TraceCheckUtils]: 34: Hoare triple {3452#(<= ~counter~0 4)} assume !(0 == ~cond); {3452#(<= ~counter~0 4)} is VALID [2022-04-28 07:42:34,189 INFO L290 TraceCheckUtils]: 35: Hoare triple {3452#(<= ~counter~0 4)} assume true; {3452#(<= ~counter~0 4)} is VALID [2022-04-28 07:42:34,189 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 07:42:34,189 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 07:42:34,189 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 07:42:34,190 INFO L290 TraceCheckUtils]: 39: Hoare triple {3477#(<= |main_#t~post5| 4)} assume !(#t~post5 < 50);havoc #t~post5; {3354#false} is VALID [2022-04-28 07:42:34,190 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 07:42:34,190 INFO L290 TraceCheckUtils]: 41: Hoare triple {3354#false} ~cond := #in~cond; {3354#false} is VALID [2022-04-28 07:42:34,190 INFO L290 TraceCheckUtils]: 42: Hoare triple {3354#false} assume 0 == ~cond; {3354#false} is VALID [2022-04-28 07:42:34,190 INFO L290 TraceCheckUtils]: 43: Hoare triple {3354#false} assume !false; {3354#false} is VALID [2022-04-28 07:42:34,190 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 07:42:34,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:42:34,412 INFO L290 TraceCheckUtils]: 43: Hoare triple {3354#false} assume !false; {3354#false} is VALID [2022-04-28 07:42:34,412 INFO L290 TraceCheckUtils]: 42: Hoare triple {3354#false} assume 0 == ~cond; {3354#false} is VALID [2022-04-28 07:42:34,412 INFO L290 TraceCheckUtils]: 41: Hoare triple {3354#false} ~cond := #in~cond; {3354#false} is VALID [2022-04-28 07:42:34,412 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 07:42:34,412 INFO L290 TraceCheckUtils]: 39: Hoare triple {3505#(< |main_#t~post5| 50)} assume !(#t~post5 < 50);havoc #t~post5; {3354#false} is VALID [2022-04-28 07:42:34,413 INFO L290 TraceCheckUtils]: 38: Hoare triple {3509#(< ~counter~0 50)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3505#(< |main_#t~post5| 50)} is VALID [2022-04-28 07:42:34,413 INFO L290 TraceCheckUtils]: 37: Hoare triple {3509#(< ~counter~0 50)} 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 50)} is VALID [2022-04-28 07:42:34,413 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3353#true} {3509#(< ~counter~0 50)} #51#return; {3509#(< ~counter~0 50)} is VALID [2022-04-28 07:42:34,414 INFO L290 TraceCheckUtils]: 35: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 07:42:34,414 INFO L290 TraceCheckUtils]: 34: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 07:42:34,414 INFO L290 TraceCheckUtils]: 33: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 07:42:34,414 INFO L272 TraceCheckUtils]: 32: Hoare triple {3509#(< ~counter~0 50)} 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 07:42:34,414 INFO L290 TraceCheckUtils]: 31: Hoare triple {3509#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {3509#(< ~counter~0 50)} is VALID [2022-04-28 07:42:34,414 INFO L290 TraceCheckUtils]: 30: Hoare triple {3534#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3509#(< ~counter~0 50)} is VALID [2022-04-28 07:42:34,415 INFO L290 TraceCheckUtils]: 29: Hoare triple {3534#(< ~counter~0 49)} 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 49)} is VALID [2022-04-28 07:42:34,415 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3353#true} {3534#(< ~counter~0 49)} #51#return; {3534#(< ~counter~0 49)} is VALID [2022-04-28 07:42:34,415 INFO L290 TraceCheckUtils]: 27: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 07:42:34,415 INFO L290 TraceCheckUtils]: 26: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 07:42:34,415 INFO L290 TraceCheckUtils]: 25: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 07:42:34,415 INFO L272 TraceCheckUtils]: 24: Hoare triple {3534#(< ~counter~0 49)} 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 07:42:34,416 INFO L290 TraceCheckUtils]: 23: Hoare triple {3534#(< ~counter~0 49)} assume !!(#t~post5 < 50);havoc #t~post5; {3534#(< ~counter~0 49)} is VALID [2022-04-28 07:42:34,416 INFO L290 TraceCheckUtils]: 22: Hoare triple {3559#(< ~counter~0 48)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3534#(< ~counter~0 49)} is VALID [2022-04-28 07:42:34,416 INFO L290 TraceCheckUtils]: 21: Hoare triple {3559#(< ~counter~0 48)} 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 48)} is VALID [2022-04-28 07:42:34,417 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3353#true} {3559#(< ~counter~0 48)} #51#return; {3559#(< ~counter~0 48)} is VALID [2022-04-28 07:42:34,417 INFO L290 TraceCheckUtils]: 19: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 07:42:34,417 INFO L290 TraceCheckUtils]: 18: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 07:42:34,417 INFO L290 TraceCheckUtils]: 17: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 07:42:34,417 INFO L272 TraceCheckUtils]: 16: Hoare triple {3559#(< ~counter~0 48)} 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 07:42:34,417 INFO L290 TraceCheckUtils]: 15: Hoare triple {3559#(< ~counter~0 48)} assume !!(#t~post5 < 50);havoc #t~post5; {3559#(< ~counter~0 48)} is VALID [2022-04-28 07:42:34,418 INFO L290 TraceCheckUtils]: 14: Hoare triple {3584#(< ~counter~0 47)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3559#(< ~counter~0 48)} is VALID [2022-04-28 07:42:34,418 INFO L290 TraceCheckUtils]: 13: Hoare triple {3584#(< ~counter~0 47)} 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 47)} is VALID [2022-04-28 07:42:34,418 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3353#true} {3584#(< ~counter~0 47)} #51#return; {3584#(< ~counter~0 47)} is VALID [2022-04-28 07:42:34,418 INFO L290 TraceCheckUtils]: 11: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 07:42:34,418 INFO L290 TraceCheckUtils]: 10: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 07:42:34,418 INFO L290 TraceCheckUtils]: 9: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 07:42:34,419 INFO L272 TraceCheckUtils]: 8: Hoare triple {3584#(< ~counter~0 47)} 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 07:42:34,419 INFO L290 TraceCheckUtils]: 7: Hoare triple {3584#(< ~counter~0 47)} assume !!(#t~post5 < 50);havoc #t~post5; {3584#(< ~counter~0 47)} is VALID [2022-04-28 07:42:34,419 INFO L290 TraceCheckUtils]: 6: Hoare triple {3609#(< ~counter~0 46)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3584#(< ~counter~0 47)} is VALID [2022-04-28 07:42:34,419 INFO L290 TraceCheckUtils]: 5: Hoare triple {3609#(< ~counter~0 46)} 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 46)} is VALID [2022-04-28 07:42:34,420 INFO L272 TraceCheckUtils]: 4: Hoare triple {3609#(< ~counter~0 46)} call #t~ret6 := main(); {3609#(< ~counter~0 46)} is VALID [2022-04-28 07:42:34,420 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3609#(< ~counter~0 46)} {3353#true} #57#return; {3609#(< ~counter~0 46)} is VALID [2022-04-28 07:42:34,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {3609#(< ~counter~0 46)} assume true; {3609#(< ~counter~0 46)} is VALID [2022-04-28 07:42:34,421 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 46)} is VALID [2022-04-28 07:42:34,421 INFO L272 TraceCheckUtils]: 0: Hoare triple {3353#true} call ULTIMATE.init(); {3353#true} is VALID [2022-04-28 07:42:34,422 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 07:42:34,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:42:34,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020537909] [2022-04-28 07:42:34,422 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:42:34,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029032871] [2022-04-28 07:42:34,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029032871] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:42:34,422 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:42:34,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-28 07:42:34,422 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:42:34,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1144513463] [2022-04-28 07:42:34,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1144513463] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:42:34,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:42:34,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 07:42:34,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568746910] [2022-04-28 07:42:34,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:42:34,425 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 07:42:34,425 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:42:34,425 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 07:42:34,461 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 07:42:34,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 07:42:34,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:34,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 07:42:34,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 07:42:34,462 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 07:42:34,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:34,595 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2022-04-28 07:42:34,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 07:42:34,595 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 07:42:34,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:42:34,596 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 07:42:34,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 58 transitions. [2022-04-28 07:42:34,597 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 07:42:34,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 58 transitions. [2022-04-28 07:42:34,598 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 58 transitions. [2022-04-28 07:42:34,631 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 07:42:34,638 INFO L225 Difference]: With dead ends: 58 [2022-04-28 07:42:34,638 INFO L226 Difference]: Without dead ends: 53 [2022-04-28 07:42:34,641 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 07:42:34,642 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 07:42:34,642 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 07:42:34,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-28 07:42:34,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-04-28 07:42:34,684 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:42:34,685 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 07:42:34,685 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 07:42:34,686 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 07:42:34,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:34,703 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2022-04-28 07:42:34,703 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2022-04-28 07:42:34,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:34,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:34,704 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 07:42:34,704 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 07:42:34,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:34,705 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2022-04-28 07:42:34,706 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2022-04-28 07:42:34,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:34,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:34,706 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:42:34,706 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:42:34,706 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 07:42:34,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2022-04-28 07:42:34,708 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 44 [2022-04-28 07:42:34,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:42:34,708 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2022-04-28 07:42:34,708 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 07:42:34,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 54 transitions. [2022-04-28 07:42:34,782 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 07:42:34,782 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2022-04-28 07:42:34,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 07:42:34,782 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:42:34,782 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 07:42:34,799 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 07:42:34,983 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 07:42:34,983 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:42:34,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:42:34,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1037185971, now seen corresponding path program 7 times [2022-04-28 07:42:34,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:34,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1517314188] [2022-04-28 07:42:35,067 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:42:35,067 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:42:35,067 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:42:35,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1037185971, now seen corresponding path program 8 times [2022-04-28 07:42:35,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:42:35,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785980503] [2022-04-28 07:42:35,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:42:35,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:42:35,076 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:42:35,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [703662762] [2022-04-28 07:42:35,076 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:42:35,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:42:35,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:42:35,077 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 07:42:35,078 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 07:42:35,170 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:42:35,171 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:42:35,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 07:42:35,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:42:35,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:42:35,466 INFO L272 TraceCheckUtils]: 0: Hoare triple {3966#true} call ULTIMATE.init(); {3966#true} is VALID [2022-04-28 07:42:35,466 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 07:42:35,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {3966#true} assume true; {3966#true} is VALID [2022-04-28 07:42:35,466 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3966#true} {3966#true} #57#return; {3966#true} is VALID [2022-04-28 07:42:35,466 INFO L272 TraceCheckUtils]: 4: Hoare triple {3966#true} call #t~ret6 := main(); {3966#true} is VALID [2022-04-28 07:42:35,466 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 07:42:35,467 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 07:42:35,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {3986#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {3986#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:42:35,467 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 07:42:35,467 INFO L290 TraceCheckUtils]: 9: Hoare triple {3966#true} ~cond := #in~cond; {3966#true} is VALID [2022-04-28 07:42:35,467 INFO L290 TraceCheckUtils]: 10: Hoare triple {3966#true} assume !(0 == ~cond); {3966#true} is VALID [2022-04-28 07:42:35,467 INFO L290 TraceCheckUtils]: 11: Hoare triple {3966#true} assume true; {3966#true} is VALID [2022-04-28 07:42:35,468 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 07:42:35,468 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 07:42:35,469 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 07:42:35,469 INFO L290 TraceCheckUtils]: 15: Hoare triple {4011#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {4011#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:42:35,469 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 07:42:35,469 INFO L290 TraceCheckUtils]: 17: Hoare triple {3966#true} ~cond := #in~cond; {3966#true} is VALID [2022-04-28 07:42:35,469 INFO L290 TraceCheckUtils]: 18: Hoare triple {3966#true} assume !(0 == ~cond); {3966#true} is VALID [2022-04-28 07:42:35,469 INFO L290 TraceCheckUtils]: 19: Hoare triple {3966#true} assume true; {3966#true} is VALID [2022-04-28 07:42:35,470 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 07:42:35,470 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 07:42:35,470 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 07:42:35,471 INFO L290 TraceCheckUtils]: 23: Hoare triple {4036#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(#t~post5 < 50);havoc #t~post5; {4036#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 07:42:35,471 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 07:42:35,471 INFO L290 TraceCheckUtils]: 25: Hoare triple {3966#true} ~cond := #in~cond; {3966#true} is VALID [2022-04-28 07:42:35,471 INFO L290 TraceCheckUtils]: 26: Hoare triple {3966#true} assume !(0 == ~cond); {3966#true} is VALID [2022-04-28 07:42:35,471 INFO L290 TraceCheckUtils]: 27: Hoare triple {3966#true} assume true; {3966#true} is VALID [2022-04-28 07:42:35,472 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 07:42:35,472 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 07:42:35,472 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 07:42:35,473 INFO L290 TraceCheckUtils]: 31: Hoare triple {4061#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} assume !!(#t~post5 < 50);havoc #t~post5; {4061#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-28 07:42:35,473 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 07:42:35,473 INFO L290 TraceCheckUtils]: 33: Hoare triple {3966#true} ~cond := #in~cond; {3966#true} is VALID [2022-04-28 07:42:35,473 INFO L290 TraceCheckUtils]: 34: Hoare triple {3966#true} assume !(0 == ~cond); {3966#true} is VALID [2022-04-28 07:42:35,473 INFO L290 TraceCheckUtils]: 35: Hoare triple {3966#true} assume true; {3966#true} is VALID [2022-04-28 07:42:35,473 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 07:42:35,474 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 07:42:35,474 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 07:42:35,474 INFO L290 TraceCheckUtils]: 39: Hoare triple {4086#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} assume !!(#t~post5 < 50);havoc #t~post5; {4086#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} is VALID [2022-04-28 07:42:35,475 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 07:42:35,475 INFO L290 TraceCheckUtils]: 41: Hoare triple {3966#true} ~cond := #in~cond; {3966#true} is VALID [2022-04-28 07:42:35,475 INFO L290 TraceCheckUtils]: 42: Hoare triple {3966#true} assume !(0 == ~cond); {3966#true} is VALID [2022-04-28 07:42:35,475 INFO L290 TraceCheckUtils]: 43: Hoare triple {3966#true} assume true; {3966#true} is VALID [2022-04-28 07:42:35,475 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 07:42:35,476 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 07:42:35,476 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 07:42:35,477 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 07:42:35,477 INFO L290 TraceCheckUtils]: 48: Hoare triple {4119#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3967#false} is VALID [2022-04-28 07:42:35,477 INFO L290 TraceCheckUtils]: 49: Hoare triple {3967#false} assume !false; {3967#false} is VALID [2022-04-28 07:42:35,477 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 07:42:35,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:42:35,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:42:35,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785980503] [2022-04-28 07:42:35,748 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:42:35,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703662762] [2022-04-28 07:42:35,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703662762] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:42:35,748 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:42:35,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-28 07:42:35,748 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:42:35,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1517314188] [2022-04-28 07:42:35,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1517314188] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:42:35,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:42:35,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 07:42:35,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069400418] [2022-04-28 07:42:35,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:42:35,749 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 07:42:35,749 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:42:35,750 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 07:42:35,776 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 07:42:35,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 07:42:35,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:35,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 07:42:35,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-28 07:42:35,777 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 07:42:36,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:36,154 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-04-28 07:42:36,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 07:42:36,154 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 07:42:36,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:42:36,155 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 07:42:36,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 49 transitions. [2022-04-28 07:42:36,157 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 07:42:36,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 49 transitions. [2022-04-28 07:42:36,158 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 49 transitions. [2022-04-28 07:42:36,180 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 07:42:36,187 INFO L225 Difference]: With dead ends: 60 [2022-04-28 07:42:36,187 INFO L226 Difference]: Without dead ends: 55 [2022-04-28 07:42:36,187 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 07:42:36,191 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 07:42:36,191 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 07:42:36,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-28 07:42:36,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-28 07:42:36,266 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:42:36,266 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 07:42:36,266 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 07:42:36,267 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 07:42:36,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:36,268 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2022-04-28 07:42:36,268 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-04-28 07:42:36,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:36,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:36,268 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 07:42:36,268 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 07:42:36,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:36,269 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2022-04-28 07:42:36,269 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-04-28 07:42:36,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:36,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:36,270 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:42:36,270 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:42:36,270 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 07:42:36,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2022-04-28 07:42:36,271 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 50 [2022-04-28 07:42:36,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:42:36,271 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2022-04-28 07:42:36,271 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 07:42:36,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 57 transitions. [2022-04-28 07:42:36,328 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 07:42:36,328 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-04-28 07:42:36,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-28 07:42:36,328 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:42:36,328 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 07:42:36,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-28 07:42:36,532 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 07:42:36,533 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:42:36,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:42:36,533 INFO L85 PathProgramCache]: Analyzing trace with hash 999934744, now seen corresponding path program 9 times [2022-04-28 07:42:36,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:36,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [488222401] [2022-04-28 07:42:36,602 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:42:36,602 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:42:36,602 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:42:36,602 INFO L85 PathProgramCache]: Analyzing trace with hash 999934744, now seen corresponding path program 10 times [2022-04-28 07:42:36,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:42:36,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729636755] [2022-04-28 07:42:36,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:42:36,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:42:36,611 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:42:36,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1264346825] [2022-04-28 07:42:36,611 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:42:36,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:42:36,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:42:36,612 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 07:42:36,653 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 07:42:36,742 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:42:36,742 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:42:36,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 07:42:36,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:42:36,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:42:37,037 INFO L272 TraceCheckUtils]: 0: Hoare triple {4514#true} call ULTIMATE.init(); {4514#true} is VALID [2022-04-28 07:42:37,040 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 07:42:37,040 INFO L290 TraceCheckUtils]: 2: Hoare triple {4522#(<= ~counter~0 0)} assume true; {4522#(<= ~counter~0 0)} is VALID [2022-04-28 07:42:37,040 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4522#(<= ~counter~0 0)} {4514#true} #57#return; {4522#(<= ~counter~0 0)} is VALID [2022-04-28 07:42:37,041 INFO L272 TraceCheckUtils]: 4: Hoare triple {4522#(<= ~counter~0 0)} call #t~ret6 := main(); {4522#(<= ~counter~0 0)} is VALID [2022-04-28 07:42:37,041 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 07:42:37,041 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 07:42:37,042 INFO L290 TraceCheckUtils]: 7: Hoare triple {4538#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {4538#(<= ~counter~0 1)} is VALID [2022-04-28 07:42:37,042 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 07:42:37,043 INFO L290 TraceCheckUtils]: 9: Hoare triple {4538#(<= ~counter~0 1)} ~cond := #in~cond; {4538#(<= ~counter~0 1)} is VALID [2022-04-28 07:42:37,043 INFO L290 TraceCheckUtils]: 10: Hoare triple {4538#(<= ~counter~0 1)} assume !(0 == ~cond); {4538#(<= ~counter~0 1)} is VALID [2022-04-28 07:42:37,043 INFO L290 TraceCheckUtils]: 11: Hoare triple {4538#(<= ~counter~0 1)} assume true; {4538#(<= ~counter~0 1)} is VALID [2022-04-28 07:42:37,044 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 07:42:37,044 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 07:42:37,045 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 07:42:37,045 INFO L290 TraceCheckUtils]: 15: Hoare triple {4563#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {4563#(<= ~counter~0 2)} is VALID [2022-04-28 07:42:37,045 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 07:42:37,046 INFO L290 TraceCheckUtils]: 17: Hoare triple {4563#(<= ~counter~0 2)} ~cond := #in~cond; {4563#(<= ~counter~0 2)} is VALID [2022-04-28 07:42:37,046 INFO L290 TraceCheckUtils]: 18: Hoare triple {4563#(<= ~counter~0 2)} assume !(0 == ~cond); {4563#(<= ~counter~0 2)} is VALID [2022-04-28 07:42:37,046 INFO L290 TraceCheckUtils]: 19: Hoare triple {4563#(<= ~counter~0 2)} assume true; {4563#(<= ~counter~0 2)} is VALID [2022-04-28 07:42:37,047 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 07:42:37,047 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 07:42:37,048 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 07:42:37,049 INFO L290 TraceCheckUtils]: 23: Hoare triple {4588#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {4588#(<= ~counter~0 3)} is VALID [2022-04-28 07:42:37,050 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 07:42:37,050 INFO L290 TraceCheckUtils]: 25: Hoare triple {4588#(<= ~counter~0 3)} ~cond := #in~cond; {4588#(<= ~counter~0 3)} is VALID [2022-04-28 07:42:37,050 INFO L290 TraceCheckUtils]: 26: Hoare triple {4588#(<= ~counter~0 3)} assume !(0 == ~cond); {4588#(<= ~counter~0 3)} is VALID [2022-04-28 07:42:37,051 INFO L290 TraceCheckUtils]: 27: Hoare triple {4588#(<= ~counter~0 3)} assume true; {4588#(<= ~counter~0 3)} is VALID [2022-04-28 07:42:37,051 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 07:42:37,052 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 07:42:37,052 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 07:42:37,052 INFO L290 TraceCheckUtils]: 31: Hoare triple {4613#(<= ~counter~0 4)} assume !!(#t~post5 < 50);havoc #t~post5; {4613#(<= ~counter~0 4)} is VALID [2022-04-28 07:42:37,053 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 07:42:37,053 INFO L290 TraceCheckUtils]: 33: Hoare triple {4613#(<= ~counter~0 4)} ~cond := #in~cond; {4613#(<= ~counter~0 4)} is VALID [2022-04-28 07:42:37,053 INFO L290 TraceCheckUtils]: 34: Hoare triple {4613#(<= ~counter~0 4)} assume !(0 == ~cond); {4613#(<= ~counter~0 4)} is VALID [2022-04-28 07:42:37,054 INFO L290 TraceCheckUtils]: 35: Hoare triple {4613#(<= ~counter~0 4)} assume true; {4613#(<= ~counter~0 4)} is VALID [2022-04-28 07:42:37,054 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 07:42:37,054 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 07:42:37,055 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 07:42:37,055 INFO L290 TraceCheckUtils]: 39: Hoare triple {4638#(<= ~counter~0 5)} assume !!(#t~post5 < 50);havoc #t~post5; {4638#(<= ~counter~0 5)} is VALID [2022-04-28 07:42:37,055 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 07:42:37,056 INFO L290 TraceCheckUtils]: 41: Hoare triple {4638#(<= ~counter~0 5)} ~cond := #in~cond; {4638#(<= ~counter~0 5)} is VALID [2022-04-28 07:42:37,056 INFO L290 TraceCheckUtils]: 42: Hoare triple {4638#(<= ~counter~0 5)} assume !(0 == ~cond); {4638#(<= ~counter~0 5)} is VALID [2022-04-28 07:42:37,056 INFO L290 TraceCheckUtils]: 43: Hoare triple {4638#(<= ~counter~0 5)} assume true; {4638#(<= ~counter~0 5)} is VALID [2022-04-28 07:42:37,057 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 07:42:37,057 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 07:42:37,057 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 07:42:37,058 INFO L290 TraceCheckUtils]: 47: Hoare triple {4663#(<= |main_#t~post5| 5)} assume !(#t~post5 < 50);havoc #t~post5; {4515#false} is VALID [2022-04-28 07:42:37,058 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 07:42:37,058 INFO L290 TraceCheckUtils]: 49: Hoare triple {4515#false} ~cond := #in~cond; {4515#false} is VALID [2022-04-28 07:42:37,058 INFO L290 TraceCheckUtils]: 50: Hoare triple {4515#false} assume 0 == ~cond; {4515#false} is VALID [2022-04-28 07:42:37,058 INFO L290 TraceCheckUtils]: 51: Hoare triple {4515#false} assume !false; {4515#false} is VALID [2022-04-28 07:42:37,058 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 07:42:37,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:42:37,352 INFO L290 TraceCheckUtils]: 51: Hoare triple {4515#false} assume !false; {4515#false} is VALID [2022-04-28 07:42:37,352 INFO L290 TraceCheckUtils]: 50: Hoare triple {4515#false} assume 0 == ~cond; {4515#false} is VALID [2022-04-28 07:42:37,352 INFO L290 TraceCheckUtils]: 49: Hoare triple {4515#false} ~cond := #in~cond; {4515#false} is VALID [2022-04-28 07:42:37,352 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 07:42:37,352 INFO L290 TraceCheckUtils]: 47: Hoare triple {4691#(< |main_#t~post5| 50)} assume !(#t~post5 < 50);havoc #t~post5; {4515#false} is VALID [2022-04-28 07:42:37,353 INFO L290 TraceCheckUtils]: 46: Hoare triple {4695#(< ~counter~0 50)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4691#(< |main_#t~post5| 50)} is VALID [2022-04-28 07:42:37,353 INFO L290 TraceCheckUtils]: 45: Hoare triple {4695#(< ~counter~0 50)} 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 50)} is VALID [2022-04-28 07:42:37,353 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {4514#true} {4695#(< ~counter~0 50)} #51#return; {4695#(< ~counter~0 50)} is VALID [2022-04-28 07:42:37,353 INFO L290 TraceCheckUtils]: 43: Hoare triple {4514#true} assume true; {4514#true} is VALID [2022-04-28 07:42:37,353 INFO L290 TraceCheckUtils]: 42: Hoare triple {4514#true} assume !(0 == ~cond); {4514#true} is VALID [2022-04-28 07:42:37,354 INFO L290 TraceCheckUtils]: 41: Hoare triple {4514#true} ~cond := #in~cond; {4514#true} is VALID [2022-04-28 07:42:37,354 INFO L272 TraceCheckUtils]: 40: Hoare triple {4695#(< ~counter~0 50)} 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 07:42:37,354 INFO L290 TraceCheckUtils]: 39: Hoare triple {4695#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {4695#(< ~counter~0 50)} is VALID [2022-04-28 07:42:37,354 INFO L290 TraceCheckUtils]: 38: Hoare triple {4720#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4695#(< ~counter~0 50)} is VALID [2022-04-28 07:42:37,355 INFO L290 TraceCheckUtils]: 37: Hoare triple {4720#(< ~counter~0 49)} 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 49)} is VALID [2022-04-28 07:42:37,355 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4514#true} {4720#(< ~counter~0 49)} #51#return; {4720#(< ~counter~0 49)} is VALID [2022-04-28 07:42:37,355 INFO L290 TraceCheckUtils]: 35: Hoare triple {4514#true} assume true; {4514#true} is VALID [2022-04-28 07:42:37,355 INFO L290 TraceCheckUtils]: 34: Hoare triple {4514#true} assume !(0 == ~cond); {4514#true} is VALID [2022-04-28 07:42:37,355 INFO L290 TraceCheckUtils]: 33: Hoare triple {4514#true} ~cond := #in~cond; {4514#true} is VALID [2022-04-28 07:42:37,355 INFO L272 TraceCheckUtils]: 32: Hoare triple {4720#(< ~counter~0 49)} 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 07:42:37,356 INFO L290 TraceCheckUtils]: 31: Hoare triple {4720#(< ~counter~0 49)} assume !!(#t~post5 < 50);havoc #t~post5; {4720#(< ~counter~0 49)} is VALID [2022-04-28 07:42:37,356 INFO L290 TraceCheckUtils]: 30: Hoare triple {4745#(< ~counter~0 48)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4720#(< ~counter~0 49)} is VALID [2022-04-28 07:42:37,356 INFO L290 TraceCheckUtils]: 29: Hoare triple {4745#(< ~counter~0 48)} 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 48)} is VALID [2022-04-28 07:42:37,357 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4514#true} {4745#(< ~counter~0 48)} #51#return; {4745#(< ~counter~0 48)} is VALID [2022-04-28 07:42:37,357 INFO L290 TraceCheckUtils]: 27: Hoare triple {4514#true} assume true; {4514#true} is VALID [2022-04-28 07:42:37,357 INFO L290 TraceCheckUtils]: 26: Hoare triple {4514#true} assume !(0 == ~cond); {4514#true} is VALID [2022-04-28 07:42:37,357 INFO L290 TraceCheckUtils]: 25: Hoare triple {4514#true} ~cond := #in~cond; {4514#true} is VALID [2022-04-28 07:42:37,357 INFO L272 TraceCheckUtils]: 24: Hoare triple {4745#(< ~counter~0 48)} 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 07:42:37,357 INFO L290 TraceCheckUtils]: 23: Hoare triple {4745#(< ~counter~0 48)} assume !!(#t~post5 < 50);havoc #t~post5; {4745#(< ~counter~0 48)} is VALID [2022-04-28 07:42:37,358 INFO L290 TraceCheckUtils]: 22: Hoare triple {4770#(< ~counter~0 47)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4745#(< ~counter~0 48)} is VALID [2022-04-28 07:42:37,358 INFO L290 TraceCheckUtils]: 21: Hoare triple {4770#(< ~counter~0 47)} 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 47)} is VALID [2022-04-28 07:42:37,359 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {4514#true} {4770#(< ~counter~0 47)} #51#return; {4770#(< ~counter~0 47)} is VALID [2022-04-28 07:42:37,359 INFO L290 TraceCheckUtils]: 19: Hoare triple {4514#true} assume true; {4514#true} is VALID [2022-04-28 07:42:37,359 INFO L290 TraceCheckUtils]: 18: Hoare triple {4514#true} assume !(0 == ~cond); {4514#true} is VALID [2022-04-28 07:42:37,359 INFO L290 TraceCheckUtils]: 17: Hoare triple {4514#true} ~cond := #in~cond; {4514#true} is VALID [2022-04-28 07:42:37,359 INFO L272 TraceCheckUtils]: 16: Hoare triple {4770#(< ~counter~0 47)} 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 07:42:37,359 INFO L290 TraceCheckUtils]: 15: Hoare triple {4770#(< ~counter~0 47)} assume !!(#t~post5 < 50);havoc #t~post5; {4770#(< ~counter~0 47)} is VALID [2022-04-28 07:42:37,360 INFO L290 TraceCheckUtils]: 14: Hoare triple {4795#(< ~counter~0 46)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4770#(< ~counter~0 47)} is VALID [2022-04-28 07:42:37,360 INFO L290 TraceCheckUtils]: 13: Hoare triple {4795#(< ~counter~0 46)} 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; {4795#(< ~counter~0 46)} is VALID [2022-04-28 07:42:37,360 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4514#true} {4795#(< ~counter~0 46)} #51#return; {4795#(< ~counter~0 46)} is VALID [2022-04-28 07:42:37,360 INFO L290 TraceCheckUtils]: 11: Hoare triple {4514#true} assume true; {4514#true} is VALID [2022-04-28 07:42:37,361 INFO L290 TraceCheckUtils]: 10: Hoare triple {4514#true} assume !(0 == ~cond); {4514#true} is VALID [2022-04-28 07:42:37,361 INFO L290 TraceCheckUtils]: 9: Hoare triple {4514#true} ~cond := #in~cond; {4514#true} is VALID [2022-04-28 07:42:37,361 INFO L272 TraceCheckUtils]: 8: Hoare triple {4795#(< ~counter~0 46)} 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 07:42:37,361 INFO L290 TraceCheckUtils]: 7: Hoare triple {4795#(< ~counter~0 46)} assume !!(#t~post5 < 50);havoc #t~post5; {4795#(< ~counter~0 46)} is VALID [2022-04-28 07:42:37,361 INFO L290 TraceCheckUtils]: 6: Hoare triple {4820#(< ~counter~0 45)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4795#(< ~counter~0 46)} is VALID [2022-04-28 07:42:37,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {4820#(< ~counter~0 45)} 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; {4820#(< ~counter~0 45)} is VALID [2022-04-28 07:42:37,362 INFO L272 TraceCheckUtils]: 4: Hoare triple {4820#(< ~counter~0 45)} call #t~ret6 := main(); {4820#(< ~counter~0 45)} is VALID [2022-04-28 07:42:37,362 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4820#(< ~counter~0 45)} {4514#true} #57#return; {4820#(< ~counter~0 45)} is VALID [2022-04-28 07:42:37,363 INFO L290 TraceCheckUtils]: 2: Hoare triple {4820#(< ~counter~0 45)} assume true; {4820#(< ~counter~0 45)} is VALID [2022-04-28 07:42:37,363 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; {4820#(< ~counter~0 45)} is VALID [2022-04-28 07:42:37,363 INFO L272 TraceCheckUtils]: 0: Hoare triple {4514#true} call ULTIMATE.init(); {4514#true} is VALID [2022-04-28 07:42:37,363 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 07:42:37,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:42:37,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729636755] [2022-04-28 07:42:37,364 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:42:37,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264346825] [2022-04-28 07:42:37,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264346825] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:42:37,364 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:42:37,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-28 07:42:37,364 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:42:37,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [488222401] [2022-04-28 07:42:37,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [488222401] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:42:37,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:42:37,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 07:42:37,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565607818] [2022-04-28 07:42:37,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:42:37,365 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 07:42:37,365 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:42:37,365 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 07:42:37,400 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 07:42:37,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 07:42:37,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:37,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 07:42:37,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-28 07:42:37,401 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 07:42:37,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:37,571 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2022-04-28 07:42:37,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 07:42:37,571 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 07:42:37,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:42:37,571 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 07:42:37,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 66 transitions. [2022-04-28 07:42:37,572 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 07:42:37,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 66 transitions. [2022-04-28 07:42:37,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 66 transitions. [2022-04-28 07:42:37,632 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 07:42:37,632 INFO L225 Difference]: With dead ends: 66 [2022-04-28 07:42:37,632 INFO L226 Difference]: Without dead ends: 61 [2022-04-28 07:42:37,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=249, Unknown=0, NotChecked=0, Total=420 [2022-04-28 07:42:37,633 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 07:42:37,633 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 07:42:37,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-28 07:42:37,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-28 07:42:37,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:42:37,673 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 07:42:37,673 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 07:42:37,674 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 07:42:37,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:37,674 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2022-04-28 07:42:37,674 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2022-04-28 07:42:37,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:37,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:37,675 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 07:42:37,675 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 07:42:37,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:37,676 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2022-04-28 07:42:37,676 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2022-04-28 07:42:37,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:37,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:37,676 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:42:37,676 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:42:37,676 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 07:42:37,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2022-04-28 07:42:37,677 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 52 [2022-04-28 07:42:37,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:42:37,677 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2022-04-28 07:42:37,677 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 07:42:37,677 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 62 transitions. [2022-04-28 07:42:37,724 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 07:42:37,724 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2022-04-28 07:42:37,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-28 07:42:37,724 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:42:37,724 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 07:42:37,732 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 07:42:37,925 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 07:42:37,925 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:42:37,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:42:37,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1795671114, now seen corresponding path program 9 times [2022-04-28 07:42:37,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:37,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [214226692] [2022-04-28 07:42:38,004 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:42:38,004 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:42:38,004 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:42:38,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1795671114, now seen corresponding path program 10 times [2022-04-28 07:42:38,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:42:38,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636511374] [2022-04-28 07:42:38,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:42:38,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:42:38,013 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:42:38,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1294552955] [2022-04-28 07:42:38,013 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:42:38,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:42:38,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:42:38,014 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 07:42:38,019 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 07:42:38,298 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:42:38,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:42:38,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 07:42:38,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:42:38,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:42:38,692 INFO L272 TraceCheckUtils]: 0: Hoare triple {5227#true} call ULTIMATE.init(); {5227#true} is VALID [2022-04-28 07:42:38,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {5227#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; {5227#true} is VALID [2022-04-28 07:42:38,692 INFO L290 TraceCheckUtils]: 2: Hoare triple {5227#true} assume true; {5227#true} is VALID [2022-04-28 07:42:38,693 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5227#true} {5227#true} #57#return; {5227#true} is VALID [2022-04-28 07:42:38,693 INFO L272 TraceCheckUtils]: 4: Hoare triple {5227#true} call #t~ret6 := main(); {5227#true} is VALID [2022-04-28 07:42:38,693 INFO L290 TraceCheckUtils]: 5: Hoare triple {5227#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; {5247#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:42:38,693 INFO L290 TraceCheckUtils]: 6: Hoare triple {5247#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5247#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:42:38,694 INFO L290 TraceCheckUtils]: 7: Hoare triple {5247#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {5247#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:42:38,694 INFO L272 TraceCheckUtils]: 8: Hoare triple {5247#(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)); {5227#true} is VALID [2022-04-28 07:42:38,694 INFO L290 TraceCheckUtils]: 9: Hoare triple {5227#true} ~cond := #in~cond; {5227#true} is VALID [2022-04-28 07:42:38,694 INFO L290 TraceCheckUtils]: 10: Hoare triple {5227#true} assume !(0 == ~cond); {5227#true} is VALID [2022-04-28 07:42:38,694 INFO L290 TraceCheckUtils]: 11: Hoare triple {5227#true} assume true; {5227#true} is VALID [2022-04-28 07:42:38,695 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5227#true} {5247#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {5247#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:42:38,695 INFO L290 TraceCheckUtils]: 13: Hoare triple {5247#(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; {5272#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:42:38,695 INFO L290 TraceCheckUtils]: 14: Hoare triple {5272#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5272#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:42:38,696 INFO L290 TraceCheckUtils]: 15: Hoare triple {5272#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 50);havoc #t~post5; {5272#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:42:38,696 INFO L272 TraceCheckUtils]: 16: Hoare triple {5272#(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)); {5227#true} is VALID [2022-04-28 07:42:38,696 INFO L290 TraceCheckUtils]: 17: Hoare triple {5227#true} ~cond := #in~cond; {5227#true} is VALID [2022-04-28 07:42:38,696 INFO L290 TraceCheckUtils]: 18: Hoare triple {5227#true} assume !(0 == ~cond); {5227#true} is VALID [2022-04-28 07:42:38,696 INFO L290 TraceCheckUtils]: 19: Hoare triple {5227#true} assume true; {5227#true} is VALID [2022-04-28 07:42:38,697 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {5227#true} {5272#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #51#return; {5272#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 07:42:38,697 INFO L290 TraceCheckUtils]: 21: Hoare triple {5272#(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; {5297#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:42:38,697 INFO L290 TraceCheckUtils]: 22: Hoare triple {5297#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5297#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:42:38,698 INFO L290 TraceCheckUtils]: 23: Hoare triple {5297#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 50);havoc #t~post5; {5297#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:42:38,698 INFO L272 TraceCheckUtils]: 24: Hoare triple {5297#(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)); {5227#true} is VALID [2022-04-28 07:42:38,698 INFO L290 TraceCheckUtils]: 25: Hoare triple {5227#true} ~cond := #in~cond; {5227#true} is VALID [2022-04-28 07:42:38,698 INFO L290 TraceCheckUtils]: 26: Hoare triple {5227#true} assume !(0 == ~cond); {5227#true} is VALID [2022-04-28 07:42:38,698 INFO L290 TraceCheckUtils]: 27: Hoare triple {5227#true} assume true; {5227#true} is VALID [2022-04-28 07:42:38,699 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5227#true} {5297#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #51#return; {5297#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:42:38,699 INFO L290 TraceCheckUtils]: 29: Hoare triple {5297#(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; {5322#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-28 07:42:38,700 INFO L290 TraceCheckUtils]: 30: Hoare triple {5322#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5322#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-28 07:42:38,700 INFO L290 TraceCheckUtils]: 31: Hoare triple {5322#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !!(#t~post5 < 50);havoc #t~post5; {5322#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-28 07:42:38,700 INFO L272 TraceCheckUtils]: 32: Hoare triple {5322#(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)); {5227#true} is VALID [2022-04-28 07:42:38,700 INFO L290 TraceCheckUtils]: 33: Hoare triple {5227#true} ~cond := #in~cond; {5227#true} is VALID [2022-04-28 07:42:38,700 INFO L290 TraceCheckUtils]: 34: Hoare triple {5227#true} assume !(0 == ~cond); {5227#true} is VALID [2022-04-28 07:42:38,700 INFO L290 TraceCheckUtils]: 35: Hoare triple {5227#true} assume true; {5227#true} is VALID [2022-04-28 07:42:38,701 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5227#true} {5322#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} #51#return; {5322#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-28 07:42:38,701 INFO L290 TraceCheckUtils]: 37: Hoare triple {5322#(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; {5347#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-28 07:42:38,701 INFO L290 TraceCheckUtils]: 38: Hoare triple {5347#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5347#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-28 07:42:38,702 INFO L290 TraceCheckUtils]: 39: Hoare triple {5347#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} assume !!(#t~post5 < 50);havoc #t~post5; {5347#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-28 07:42:38,702 INFO L272 TraceCheckUtils]: 40: Hoare triple {5347#(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)); {5227#true} is VALID [2022-04-28 07:42:38,702 INFO L290 TraceCheckUtils]: 41: Hoare triple {5227#true} ~cond := #in~cond; {5227#true} is VALID [2022-04-28 07:42:38,702 INFO L290 TraceCheckUtils]: 42: Hoare triple {5227#true} assume !(0 == ~cond); {5227#true} is VALID [2022-04-28 07:42:38,702 INFO L290 TraceCheckUtils]: 43: Hoare triple {5227#true} assume true; {5227#true} is VALID [2022-04-28 07:42:38,703 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5227#true} {5347#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} #51#return; {5347#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-28 07:42:38,703 INFO L290 TraceCheckUtils]: 45: Hoare triple {5347#(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; {5372#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-28 07:42:38,703 INFO L290 TraceCheckUtils]: 46: Hoare triple {5372#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5372#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-28 07:42:38,704 INFO L290 TraceCheckUtils]: 47: Hoare triple {5372#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} assume !!(#t~post5 < 50);havoc #t~post5; {5372#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-28 07:42:38,704 INFO L272 TraceCheckUtils]: 48: Hoare triple {5372#(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)); {5227#true} is VALID [2022-04-28 07:42:38,704 INFO L290 TraceCheckUtils]: 49: Hoare triple {5227#true} ~cond := #in~cond; {5227#true} is VALID [2022-04-28 07:42:38,704 INFO L290 TraceCheckUtils]: 50: Hoare triple {5227#true} assume !(0 == ~cond); {5227#true} is VALID [2022-04-28 07:42:38,704 INFO L290 TraceCheckUtils]: 51: Hoare triple {5227#true} assume true; {5227#true} is VALID [2022-04-28 07:42:38,705 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5227#true} {5372#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} #51#return; {5372#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-28 07:42:38,705 INFO L290 TraceCheckUtils]: 53: Hoare triple {5372#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {5397#(and (<= main_~k~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-28 07:42:38,706 INFO L272 TraceCheckUtils]: 54: Hoare triple {5397#(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)); {5401#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:42:38,706 INFO L290 TraceCheckUtils]: 55: Hoare triple {5401#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5405#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:42:38,706 INFO L290 TraceCheckUtils]: 56: Hoare triple {5405#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5228#false} is VALID [2022-04-28 07:42:38,706 INFO L290 TraceCheckUtils]: 57: Hoare triple {5228#false} assume !false; {5228#false} is VALID [2022-04-28 07:42:38,707 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 07:42:38,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:42:38,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:42:38,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636511374] [2022-04-28 07:42:38,936 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:42:38,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294552955] [2022-04-28 07:42:38,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294552955] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:42:38,936 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:42:38,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-28 07:42:38,937 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:42:38,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [214226692] [2022-04-28 07:42:38,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [214226692] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:42:38,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:42:38,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 07:42:38,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596925370] [2022-04-28 07:42:38,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:42:38,937 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 07:42:38,937 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:42:38,938 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 07:42:38,964 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 07:42:38,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 07:42:38,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:38,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 07:42:38,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-28 07:42:38,965 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 07:42:39,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:39,461 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2022-04-28 07:42:39,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 07:42:39,461 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 07:42:39,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:42:39,462 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 07:42:39,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 54 transitions. [2022-04-28 07:42:39,462 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 07:42:39,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 54 transitions. [2022-04-28 07:42:39,463 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 54 transitions. [2022-04-28 07:42:39,499 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 07:42:39,500 INFO L225 Difference]: With dead ends: 68 [2022-04-28 07:42:39,500 INFO L226 Difference]: Without dead ends: 63 [2022-04-28 07:42:39,500 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 07:42:39,500 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 07:42:39,501 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 07:42:39,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-28 07:42:39,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-04-28 07:42:39,546 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:42:39,547 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 07:42:39,547 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 07:42:39,547 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 07:42:39,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:39,548 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2022-04-28 07:42:39,548 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2022-04-28 07:42:39,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:39,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:39,548 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 07:42:39,549 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 07:42:39,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:39,550 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2022-04-28 07:42:39,550 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2022-04-28 07:42:39,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:39,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:39,550 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:42:39,550 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:42:39,550 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 07:42:39,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2022-04-28 07:42:39,551 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 58 [2022-04-28 07:42:39,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:42:39,551 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2022-04-28 07:42:39,551 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 07:42:39,551 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 65 transitions. [2022-04-28 07:42:39,616 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 07:42:39,616 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2022-04-28 07:42:39,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-28 07:42:39,616 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:42:39,616 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 07:42:39,621 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 07:42:39,821 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 07:42:39,821 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:42:39,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:42:39,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1633541723, now seen corresponding path program 11 times [2022-04-28 07:42:39,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:39,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1695624282] [2022-04-28 07:42:39,900 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:42:39,900 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:42:39,900 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:42:39,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1633541723, now seen corresponding path program 12 times [2022-04-28 07:42:39,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:42:39,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899775052] [2022-04-28 07:42:39,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:42:39,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:42:39,922 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:42:39,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1041475419] [2022-04-28 07:42:39,923 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:42:39,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:42:39,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:42:39,927 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 07:42:39,928 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 07:42:40,102 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 07:42:40,102 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:42:40,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 07:42:40,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:42:40,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:42:40,346 INFO L272 TraceCheckUtils]: 0: Hoare triple {5848#true} call ULTIMATE.init(); {5848#true} is VALID [2022-04-28 07:42:40,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {5848#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; {5856#(<= ~counter~0 0)} is VALID [2022-04-28 07:42:40,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {5856#(<= ~counter~0 0)} assume true; {5856#(<= ~counter~0 0)} is VALID [2022-04-28 07:42:40,363 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5856#(<= ~counter~0 0)} {5848#true} #57#return; {5856#(<= ~counter~0 0)} is VALID [2022-04-28 07:42:40,363 INFO L272 TraceCheckUtils]: 4: Hoare triple {5856#(<= ~counter~0 0)} call #t~ret6 := main(); {5856#(<= ~counter~0 0)} is VALID [2022-04-28 07:42:40,363 INFO L290 TraceCheckUtils]: 5: Hoare triple {5856#(<= ~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; {5856#(<= ~counter~0 0)} is VALID [2022-04-28 07:42:40,364 INFO L290 TraceCheckUtils]: 6: Hoare triple {5856#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5872#(<= ~counter~0 1)} is VALID [2022-04-28 07:42:40,364 INFO L290 TraceCheckUtils]: 7: Hoare triple {5872#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {5872#(<= ~counter~0 1)} is VALID [2022-04-28 07:42:40,364 INFO L272 TraceCheckUtils]: 8: Hoare triple {5872#(<= ~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)); {5872#(<= ~counter~0 1)} is VALID [2022-04-28 07:42:40,365 INFO L290 TraceCheckUtils]: 9: Hoare triple {5872#(<= ~counter~0 1)} ~cond := #in~cond; {5872#(<= ~counter~0 1)} is VALID [2022-04-28 07:42:40,365 INFO L290 TraceCheckUtils]: 10: Hoare triple {5872#(<= ~counter~0 1)} assume !(0 == ~cond); {5872#(<= ~counter~0 1)} is VALID [2022-04-28 07:42:40,365 INFO L290 TraceCheckUtils]: 11: Hoare triple {5872#(<= ~counter~0 1)} assume true; {5872#(<= ~counter~0 1)} is VALID [2022-04-28 07:42:40,365 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5872#(<= ~counter~0 1)} {5872#(<= ~counter~0 1)} #51#return; {5872#(<= ~counter~0 1)} is VALID [2022-04-28 07:42:40,367 INFO L290 TraceCheckUtils]: 13: Hoare triple {5872#(<= ~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; {5872#(<= ~counter~0 1)} is VALID [2022-04-28 07:42:40,368 INFO L290 TraceCheckUtils]: 14: Hoare triple {5872#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5897#(<= ~counter~0 2)} is VALID [2022-04-28 07:42:40,368 INFO L290 TraceCheckUtils]: 15: Hoare triple {5897#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {5897#(<= ~counter~0 2)} is VALID [2022-04-28 07:42:40,369 INFO L272 TraceCheckUtils]: 16: Hoare triple {5897#(<= ~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)); {5897#(<= ~counter~0 2)} is VALID [2022-04-28 07:42:40,369 INFO L290 TraceCheckUtils]: 17: Hoare triple {5897#(<= ~counter~0 2)} ~cond := #in~cond; {5897#(<= ~counter~0 2)} is VALID [2022-04-28 07:42:40,369 INFO L290 TraceCheckUtils]: 18: Hoare triple {5897#(<= ~counter~0 2)} assume !(0 == ~cond); {5897#(<= ~counter~0 2)} is VALID [2022-04-28 07:42:40,370 INFO L290 TraceCheckUtils]: 19: Hoare triple {5897#(<= ~counter~0 2)} assume true; {5897#(<= ~counter~0 2)} is VALID [2022-04-28 07:42:40,370 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {5897#(<= ~counter~0 2)} {5897#(<= ~counter~0 2)} #51#return; {5897#(<= ~counter~0 2)} is VALID [2022-04-28 07:42:40,370 INFO L290 TraceCheckUtils]: 21: Hoare triple {5897#(<= ~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; {5897#(<= ~counter~0 2)} is VALID [2022-04-28 07:42:40,371 INFO L290 TraceCheckUtils]: 22: Hoare triple {5897#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5922#(<= ~counter~0 3)} is VALID [2022-04-28 07:42:40,371 INFO L290 TraceCheckUtils]: 23: Hoare triple {5922#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {5922#(<= ~counter~0 3)} is VALID [2022-04-28 07:42:40,372 INFO L272 TraceCheckUtils]: 24: Hoare triple {5922#(<= ~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)); {5922#(<= ~counter~0 3)} is VALID [2022-04-28 07:42:40,372 INFO L290 TraceCheckUtils]: 25: Hoare triple {5922#(<= ~counter~0 3)} ~cond := #in~cond; {5922#(<= ~counter~0 3)} is VALID [2022-04-28 07:42:40,372 INFO L290 TraceCheckUtils]: 26: Hoare triple {5922#(<= ~counter~0 3)} assume !(0 == ~cond); {5922#(<= ~counter~0 3)} is VALID [2022-04-28 07:42:40,373 INFO L290 TraceCheckUtils]: 27: Hoare triple {5922#(<= ~counter~0 3)} assume true; {5922#(<= ~counter~0 3)} is VALID [2022-04-28 07:42:40,373 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5922#(<= ~counter~0 3)} {5922#(<= ~counter~0 3)} #51#return; {5922#(<= ~counter~0 3)} is VALID [2022-04-28 07:42:40,373 INFO L290 TraceCheckUtils]: 29: Hoare triple {5922#(<= ~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; {5922#(<= ~counter~0 3)} is VALID [2022-04-28 07:42:40,374 INFO L290 TraceCheckUtils]: 30: Hoare triple {5922#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5947#(<= ~counter~0 4)} is VALID [2022-04-28 07:42:40,374 INFO L290 TraceCheckUtils]: 31: Hoare triple {5947#(<= ~counter~0 4)} assume !!(#t~post5 < 50);havoc #t~post5; {5947#(<= ~counter~0 4)} is VALID [2022-04-28 07:42:40,375 INFO L272 TraceCheckUtils]: 32: Hoare triple {5947#(<= ~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)); {5947#(<= ~counter~0 4)} is VALID [2022-04-28 07:42:40,375 INFO L290 TraceCheckUtils]: 33: Hoare triple {5947#(<= ~counter~0 4)} ~cond := #in~cond; {5947#(<= ~counter~0 4)} is VALID [2022-04-28 07:42:40,375 INFO L290 TraceCheckUtils]: 34: Hoare triple {5947#(<= ~counter~0 4)} assume !(0 == ~cond); {5947#(<= ~counter~0 4)} is VALID [2022-04-28 07:42:40,376 INFO L290 TraceCheckUtils]: 35: Hoare triple {5947#(<= ~counter~0 4)} assume true; {5947#(<= ~counter~0 4)} is VALID [2022-04-28 07:42:40,376 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5947#(<= ~counter~0 4)} {5947#(<= ~counter~0 4)} #51#return; {5947#(<= ~counter~0 4)} is VALID [2022-04-28 07:42:40,376 INFO L290 TraceCheckUtils]: 37: Hoare triple {5947#(<= ~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; {5947#(<= ~counter~0 4)} is VALID [2022-04-28 07:42:40,377 INFO L290 TraceCheckUtils]: 38: Hoare triple {5947#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5972#(<= ~counter~0 5)} is VALID [2022-04-28 07:42:40,377 INFO L290 TraceCheckUtils]: 39: Hoare triple {5972#(<= ~counter~0 5)} assume !!(#t~post5 < 50);havoc #t~post5; {5972#(<= ~counter~0 5)} is VALID [2022-04-28 07:42:40,377 INFO L272 TraceCheckUtils]: 40: Hoare triple {5972#(<= ~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)); {5972#(<= ~counter~0 5)} is VALID [2022-04-28 07:42:40,378 INFO L290 TraceCheckUtils]: 41: Hoare triple {5972#(<= ~counter~0 5)} ~cond := #in~cond; {5972#(<= ~counter~0 5)} is VALID [2022-04-28 07:42:40,378 INFO L290 TraceCheckUtils]: 42: Hoare triple {5972#(<= ~counter~0 5)} assume !(0 == ~cond); {5972#(<= ~counter~0 5)} is VALID [2022-04-28 07:42:40,378 INFO L290 TraceCheckUtils]: 43: Hoare triple {5972#(<= ~counter~0 5)} assume true; {5972#(<= ~counter~0 5)} is VALID [2022-04-28 07:42:40,379 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5972#(<= ~counter~0 5)} {5972#(<= ~counter~0 5)} #51#return; {5972#(<= ~counter~0 5)} is VALID [2022-04-28 07:42:40,379 INFO L290 TraceCheckUtils]: 45: Hoare triple {5972#(<= ~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; {5972#(<= ~counter~0 5)} is VALID [2022-04-28 07:42:40,379 INFO L290 TraceCheckUtils]: 46: Hoare triple {5972#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5997#(<= ~counter~0 6)} is VALID [2022-04-28 07:42:40,380 INFO L290 TraceCheckUtils]: 47: Hoare triple {5997#(<= ~counter~0 6)} assume !!(#t~post5 < 50);havoc #t~post5; {5997#(<= ~counter~0 6)} is VALID [2022-04-28 07:42:40,380 INFO L272 TraceCheckUtils]: 48: Hoare triple {5997#(<= ~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)); {5997#(<= ~counter~0 6)} is VALID [2022-04-28 07:42:40,380 INFO L290 TraceCheckUtils]: 49: Hoare triple {5997#(<= ~counter~0 6)} ~cond := #in~cond; {5997#(<= ~counter~0 6)} is VALID [2022-04-28 07:42:40,381 INFO L290 TraceCheckUtils]: 50: Hoare triple {5997#(<= ~counter~0 6)} assume !(0 == ~cond); {5997#(<= ~counter~0 6)} is VALID [2022-04-28 07:42:40,381 INFO L290 TraceCheckUtils]: 51: Hoare triple {5997#(<= ~counter~0 6)} assume true; {5997#(<= ~counter~0 6)} is VALID [2022-04-28 07:42:40,381 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5997#(<= ~counter~0 6)} {5997#(<= ~counter~0 6)} #51#return; {5997#(<= ~counter~0 6)} is VALID [2022-04-28 07:42:40,382 INFO L290 TraceCheckUtils]: 53: Hoare triple {5997#(<= ~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; {5997#(<= ~counter~0 6)} is VALID [2022-04-28 07:42:40,382 INFO L290 TraceCheckUtils]: 54: Hoare triple {5997#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6022#(<= |main_#t~post5| 6)} is VALID [2022-04-28 07:42:40,382 INFO L290 TraceCheckUtils]: 55: Hoare triple {6022#(<= |main_#t~post5| 6)} assume !(#t~post5 < 50);havoc #t~post5; {5849#false} is VALID [2022-04-28 07:42:40,383 INFO L272 TraceCheckUtils]: 56: Hoare triple {5849#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5849#false} is VALID [2022-04-28 07:42:40,383 INFO L290 TraceCheckUtils]: 57: Hoare triple {5849#false} ~cond := #in~cond; {5849#false} is VALID [2022-04-28 07:42:40,383 INFO L290 TraceCheckUtils]: 58: Hoare triple {5849#false} assume 0 == ~cond; {5849#false} is VALID [2022-04-28 07:42:40,383 INFO L290 TraceCheckUtils]: 59: Hoare triple {5849#false} assume !false; {5849#false} is VALID [2022-04-28 07:42:40,383 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 07:42:40,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:42:40,697 INFO L290 TraceCheckUtils]: 59: Hoare triple {5849#false} assume !false; {5849#false} is VALID [2022-04-28 07:42:40,697 INFO L290 TraceCheckUtils]: 58: Hoare triple {5849#false} assume 0 == ~cond; {5849#false} is VALID [2022-04-28 07:42:40,697 INFO L290 TraceCheckUtils]: 57: Hoare triple {5849#false} ~cond := #in~cond; {5849#false} is VALID [2022-04-28 07:42:40,697 INFO L272 TraceCheckUtils]: 56: Hoare triple {5849#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5849#false} is VALID [2022-04-28 07:42:40,697 INFO L290 TraceCheckUtils]: 55: Hoare triple {6050#(< |main_#t~post5| 50)} assume !(#t~post5 < 50);havoc #t~post5; {5849#false} is VALID [2022-04-28 07:42:40,698 INFO L290 TraceCheckUtils]: 54: Hoare triple {6054#(< ~counter~0 50)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6050#(< |main_#t~post5| 50)} is VALID [2022-04-28 07:42:40,698 INFO L290 TraceCheckUtils]: 53: Hoare triple {6054#(< ~counter~0 50)} 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; {6054#(< ~counter~0 50)} is VALID [2022-04-28 07:42:40,698 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5848#true} {6054#(< ~counter~0 50)} #51#return; {6054#(< ~counter~0 50)} is VALID [2022-04-28 07:42:40,698 INFO L290 TraceCheckUtils]: 51: Hoare triple {5848#true} assume true; {5848#true} is VALID [2022-04-28 07:42:40,699 INFO L290 TraceCheckUtils]: 50: Hoare triple {5848#true} assume !(0 == ~cond); {5848#true} is VALID [2022-04-28 07:42:40,699 INFO L290 TraceCheckUtils]: 49: Hoare triple {5848#true} ~cond := #in~cond; {5848#true} is VALID [2022-04-28 07:42:40,699 INFO L272 TraceCheckUtils]: 48: Hoare triple {6054#(< ~counter~0 50)} 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)); {5848#true} is VALID [2022-04-28 07:42:40,699 INFO L290 TraceCheckUtils]: 47: Hoare triple {6054#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {6054#(< ~counter~0 50)} is VALID [2022-04-28 07:42:40,700 INFO L290 TraceCheckUtils]: 46: Hoare triple {6079#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6054#(< ~counter~0 50)} is VALID [2022-04-28 07:42:40,700 INFO L290 TraceCheckUtils]: 45: Hoare triple {6079#(< ~counter~0 49)} 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; {6079#(< ~counter~0 49)} is VALID [2022-04-28 07:42:40,700 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5848#true} {6079#(< ~counter~0 49)} #51#return; {6079#(< ~counter~0 49)} is VALID [2022-04-28 07:42:40,700 INFO L290 TraceCheckUtils]: 43: Hoare triple {5848#true} assume true; {5848#true} is VALID [2022-04-28 07:42:40,700 INFO L290 TraceCheckUtils]: 42: Hoare triple {5848#true} assume !(0 == ~cond); {5848#true} is VALID [2022-04-28 07:42:40,701 INFO L290 TraceCheckUtils]: 41: Hoare triple {5848#true} ~cond := #in~cond; {5848#true} is VALID [2022-04-28 07:42:40,701 INFO L272 TraceCheckUtils]: 40: Hoare triple {6079#(< ~counter~0 49)} 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)); {5848#true} is VALID [2022-04-28 07:42:40,701 INFO L290 TraceCheckUtils]: 39: Hoare triple {6079#(< ~counter~0 49)} assume !!(#t~post5 < 50);havoc #t~post5; {6079#(< ~counter~0 49)} is VALID [2022-04-28 07:42:40,701 INFO L290 TraceCheckUtils]: 38: Hoare triple {6104#(< ~counter~0 48)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6079#(< ~counter~0 49)} is VALID [2022-04-28 07:42:40,702 INFO L290 TraceCheckUtils]: 37: Hoare triple {6104#(< ~counter~0 48)} 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; {6104#(< ~counter~0 48)} is VALID [2022-04-28 07:42:40,702 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5848#true} {6104#(< ~counter~0 48)} #51#return; {6104#(< ~counter~0 48)} is VALID [2022-04-28 07:42:40,702 INFO L290 TraceCheckUtils]: 35: Hoare triple {5848#true} assume true; {5848#true} is VALID [2022-04-28 07:42:40,702 INFO L290 TraceCheckUtils]: 34: Hoare triple {5848#true} assume !(0 == ~cond); {5848#true} is VALID [2022-04-28 07:42:40,702 INFO L290 TraceCheckUtils]: 33: Hoare triple {5848#true} ~cond := #in~cond; {5848#true} is VALID [2022-04-28 07:42:40,702 INFO L272 TraceCheckUtils]: 32: Hoare triple {6104#(< ~counter~0 48)} 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)); {5848#true} is VALID [2022-04-28 07:42:40,703 INFO L290 TraceCheckUtils]: 31: Hoare triple {6104#(< ~counter~0 48)} assume !!(#t~post5 < 50);havoc #t~post5; {6104#(< ~counter~0 48)} is VALID [2022-04-28 07:42:40,703 INFO L290 TraceCheckUtils]: 30: Hoare triple {6129#(< ~counter~0 47)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6104#(< ~counter~0 48)} is VALID [2022-04-28 07:42:40,703 INFO L290 TraceCheckUtils]: 29: Hoare triple {6129#(< ~counter~0 47)} 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; {6129#(< ~counter~0 47)} is VALID [2022-04-28 07:42:40,704 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5848#true} {6129#(< ~counter~0 47)} #51#return; {6129#(< ~counter~0 47)} is VALID [2022-04-28 07:42:40,704 INFO L290 TraceCheckUtils]: 27: Hoare triple {5848#true} assume true; {5848#true} is VALID [2022-04-28 07:42:40,704 INFO L290 TraceCheckUtils]: 26: Hoare triple {5848#true} assume !(0 == ~cond); {5848#true} is VALID [2022-04-28 07:42:40,704 INFO L290 TraceCheckUtils]: 25: Hoare triple {5848#true} ~cond := #in~cond; {5848#true} is VALID [2022-04-28 07:42:40,704 INFO L272 TraceCheckUtils]: 24: Hoare triple {6129#(< ~counter~0 47)} 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)); {5848#true} is VALID [2022-04-28 07:42:40,704 INFO L290 TraceCheckUtils]: 23: Hoare triple {6129#(< ~counter~0 47)} assume !!(#t~post5 < 50);havoc #t~post5; {6129#(< ~counter~0 47)} is VALID [2022-04-28 07:42:40,705 INFO L290 TraceCheckUtils]: 22: Hoare triple {6154#(< ~counter~0 46)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6129#(< ~counter~0 47)} is VALID [2022-04-28 07:42:40,705 INFO L290 TraceCheckUtils]: 21: Hoare triple {6154#(< ~counter~0 46)} 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; {6154#(< ~counter~0 46)} is VALID [2022-04-28 07:42:40,706 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {5848#true} {6154#(< ~counter~0 46)} #51#return; {6154#(< ~counter~0 46)} is VALID [2022-04-28 07:42:40,706 INFO L290 TraceCheckUtils]: 19: Hoare triple {5848#true} assume true; {5848#true} is VALID [2022-04-28 07:42:40,706 INFO L290 TraceCheckUtils]: 18: Hoare triple {5848#true} assume !(0 == ~cond); {5848#true} is VALID [2022-04-28 07:42:40,706 INFO L290 TraceCheckUtils]: 17: Hoare triple {5848#true} ~cond := #in~cond; {5848#true} is VALID [2022-04-28 07:42:40,706 INFO L272 TraceCheckUtils]: 16: Hoare triple {6154#(< ~counter~0 46)} 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)); {5848#true} is VALID [2022-04-28 07:42:40,706 INFO L290 TraceCheckUtils]: 15: Hoare triple {6154#(< ~counter~0 46)} assume !!(#t~post5 < 50);havoc #t~post5; {6154#(< ~counter~0 46)} is VALID [2022-04-28 07:42:40,707 INFO L290 TraceCheckUtils]: 14: Hoare triple {6179#(< ~counter~0 45)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6154#(< ~counter~0 46)} is VALID [2022-04-28 07:42:40,707 INFO L290 TraceCheckUtils]: 13: Hoare triple {6179#(< ~counter~0 45)} 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; {6179#(< ~counter~0 45)} is VALID [2022-04-28 07:42:40,707 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5848#true} {6179#(< ~counter~0 45)} #51#return; {6179#(< ~counter~0 45)} is VALID [2022-04-28 07:42:40,707 INFO L290 TraceCheckUtils]: 11: Hoare triple {5848#true} assume true; {5848#true} is VALID [2022-04-28 07:42:40,708 INFO L290 TraceCheckUtils]: 10: Hoare triple {5848#true} assume !(0 == ~cond); {5848#true} is VALID [2022-04-28 07:42:40,708 INFO L290 TraceCheckUtils]: 9: Hoare triple {5848#true} ~cond := #in~cond; {5848#true} is VALID [2022-04-28 07:42:40,708 INFO L272 TraceCheckUtils]: 8: Hoare triple {6179#(< ~counter~0 45)} 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)); {5848#true} is VALID [2022-04-28 07:42:40,708 INFO L290 TraceCheckUtils]: 7: Hoare triple {6179#(< ~counter~0 45)} assume !!(#t~post5 < 50);havoc #t~post5; {6179#(< ~counter~0 45)} is VALID [2022-04-28 07:42:40,708 INFO L290 TraceCheckUtils]: 6: Hoare triple {6204#(< ~counter~0 44)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6179#(< ~counter~0 45)} is VALID [2022-04-28 07:42:40,709 INFO L290 TraceCheckUtils]: 5: Hoare triple {6204#(< ~counter~0 44)} 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; {6204#(< ~counter~0 44)} is VALID [2022-04-28 07:42:40,709 INFO L272 TraceCheckUtils]: 4: Hoare triple {6204#(< ~counter~0 44)} call #t~ret6 := main(); {6204#(< ~counter~0 44)} is VALID [2022-04-28 07:42:40,709 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6204#(< ~counter~0 44)} {5848#true} #57#return; {6204#(< ~counter~0 44)} is VALID [2022-04-28 07:42:40,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {6204#(< ~counter~0 44)} assume true; {6204#(< ~counter~0 44)} is VALID [2022-04-28 07:42:40,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {5848#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; {6204#(< ~counter~0 44)} is VALID [2022-04-28 07:42:40,710 INFO L272 TraceCheckUtils]: 0: Hoare triple {5848#true} call ULTIMATE.init(); {5848#true} is VALID [2022-04-28 07:42:40,710 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 07:42:40,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:42:40,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899775052] [2022-04-28 07:42:40,711 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:42:40,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041475419] [2022-04-28 07:42:40,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041475419] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:42:40,711 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:42:40,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-28 07:42:40,711 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:42:40,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1695624282] [2022-04-28 07:42:40,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1695624282] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:42:40,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:42:40,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 07:42:40,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690189221] [2022-04-28 07:42:40,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:42:40,712 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 07:42:40,712 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:42:40,712 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 07:42:40,751 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 07:42:40,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 07:42:40,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:40,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 07:42:40,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-28 07:42:40,752 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 07:42:40,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:40,957 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2022-04-28 07:42:40,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 07:42:40,957 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 07:42:40,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:42:40,957 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 07:42:40,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 74 transitions. [2022-04-28 07:42:40,958 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 07:42:40,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 74 transitions. [2022-04-28 07:42:40,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 74 transitions. [2022-04-28 07:42:40,989 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 07:42:40,990 INFO L225 Difference]: With dead ends: 74 [2022-04-28 07:42:40,990 INFO L226 Difference]: Without dead ends: 69 [2022-04-28 07:42:40,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=227, Invalid=325, Unknown=0, NotChecked=0, Total=552 [2022-04-28 07:42:40,990 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 4 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 102 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 07:42:40,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 102 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:42:40,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-28 07:42:41,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-04-28 07:42:41,038 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:42:41,038 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 07:42:41,038 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 07:42:41,038 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 07:42:41,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:41,039 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2022-04-28 07:42:41,039 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2022-04-28 07:42:41,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:41,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:41,040 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 07:42:41,040 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 07:42:41,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:41,041 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2022-04-28 07:42:41,041 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2022-04-28 07:42:41,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:41,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:41,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:42:41,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:42:41,041 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 07:42:41,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2022-04-28 07:42:41,045 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 60 [2022-04-28 07:42:41,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:42:41,046 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2022-04-28 07:42:41,046 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 07:42:41,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 70 transitions. [2022-04-28 07:42:41,115 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 07:42:41,115 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2022-04-28 07:42:41,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 07:42:41,116 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:42:41,116 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 07:42:41,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-04-28 07:42:41,316 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 07:42:41,317 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:42:41,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:42:41,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1180930233, now seen corresponding path program 11 times [2022-04-28 07:42:41,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:41,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1208608232] [2022-04-28 07:42:41,391 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:42:41,391 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:42:41,391 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:42:41,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1180930233, now seen corresponding path program 12 times [2022-04-28 07:42:41,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:42:41,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314649816] [2022-04-28 07:42:41,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:42:41,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:42:41,412 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:42:41,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1606297053] [2022-04-28 07:42:41,412 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:42:41,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:42:41,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:42:41,413 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 07:42:41,413 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 07:42:41,735 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 07:42:41,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:42:41,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 07:42:41,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:42:41,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:42:42,039 INFO L272 TraceCheckUtils]: 0: Hoare triple {6661#true} call ULTIMATE.init(); {6661#true} is VALID [2022-04-28 07:42:42,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {6661#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; {6661#true} is VALID [2022-04-28 07:42:42,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {6661#true} assume true; {6661#true} is VALID [2022-04-28 07:42:42,039 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6661#true} {6661#true} #57#return; {6661#true} is VALID [2022-04-28 07:42:42,039 INFO L272 TraceCheckUtils]: 4: Hoare triple {6661#true} call #t~ret6 := main(); {6661#true} is VALID [2022-04-28 07:42:42,049 INFO L290 TraceCheckUtils]: 5: Hoare triple {6661#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; {6681#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:42:42,049 INFO L290 TraceCheckUtils]: 6: Hoare triple {6681#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6681#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:42:42,050 INFO L290 TraceCheckUtils]: 7: Hoare triple {6681#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {6681#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:42:42,050 INFO L272 TraceCheckUtils]: 8: Hoare triple {6681#(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)); {6661#true} is VALID [2022-04-28 07:42:42,050 INFO L290 TraceCheckUtils]: 9: Hoare triple {6661#true} ~cond := #in~cond; {6661#true} is VALID [2022-04-28 07:42:42,050 INFO L290 TraceCheckUtils]: 10: Hoare triple {6661#true} assume !(0 == ~cond); {6661#true} is VALID [2022-04-28 07:42:42,050 INFO L290 TraceCheckUtils]: 11: Hoare triple {6661#true} assume true; {6661#true} is VALID [2022-04-28 07:42:42,050 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6661#true} {6681#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {6681#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:42:42,051 INFO L290 TraceCheckUtils]: 13: Hoare triple {6681#(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; {6706#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:42:42,051 INFO L290 TraceCheckUtils]: 14: Hoare triple {6706#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6706#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:42:42,051 INFO L290 TraceCheckUtils]: 15: Hoare triple {6706#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {6706#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:42:42,051 INFO L272 TraceCheckUtils]: 16: Hoare triple {6706#(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)); {6661#true} is VALID [2022-04-28 07:42:42,051 INFO L290 TraceCheckUtils]: 17: Hoare triple {6661#true} ~cond := #in~cond; {6661#true} is VALID [2022-04-28 07:42:42,051 INFO L290 TraceCheckUtils]: 18: Hoare triple {6661#true} assume !(0 == ~cond); {6661#true} is VALID [2022-04-28 07:42:42,051 INFO L290 TraceCheckUtils]: 19: Hoare triple {6661#true} assume true; {6661#true} is VALID [2022-04-28 07:42:42,052 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {6661#true} {6706#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #51#return; {6706#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:42:42,052 INFO L290 TraceCheckUtils]: 21: Hoare triple {6706#(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; {6731#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 07:42:42,053 INFO L290 TraceCheckUtils]: 22: Hoare triple {6731#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6731#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 07:42:42,053 INFO L290 TraceCheckUtils]: 23: Hoare triple {6731#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(#t~post5 < 50);havoc #t~post5; {6731#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 07:42:42,053 INFO L272 TraceCheckUtils]: 24: Hoare triple {6731#(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)); {6661#true} is VALID [2022-04-28 07:42:42,053 INFO L290 TraceCheckUtils]: 25: Hoare triple {6661#true} ~cond := #in~cond; {6661#true} is VALID [2022-04-28 07:42:42,053 INFO L290 TraceCheckUtils]: 26: Hoare triple {6661#true} assume !(0 == ~cond); {6661#true} is VALID [2022-04-28 07:42:42,053 INFO L290 TraceCheckUtils]: 27: Hoare triple {6661#true} assume true; {6661#true} is VALID [2022-04-28 07:42:42,053 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6661#true} {6731#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #51#return; {6731#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 07:42:42,054 INFO L290 TraceCheckUtils]: 29: Hoare triple {6731#(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; {6756#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 07:42:42,054 INFO L290 TraceCheckUtils]: 30: Hoare triple {6756#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6756#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 07:42:42,054 INFO L290 TraceCheckUtils]: 31: Hoare triple {6756#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(#t~post5 < 50);havoc #t~post5; {6756#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 07:42:42,054 INFO L272 TraceCheckUtils]: 32: Hoare triple {6756#(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)); {6661#true} is VALID [2022-04-28 07:42:42,054 INFO L290 TraceCheckUtils]: 33: Hoare triple {6661#true} ~cond := #in~cond; {6661#true} is VALID [2022-04-28 07:42:42,054 INFO L290 TraceCheckUtils]: 34: Hoare triple {6661#true} assume !(0 == ~cond); {6661#true} is VALID [2022-04-28 07:42:42,054 INFO L290 TraceCheckUtils]: 35: Hoare triple {6661#true} assume true; {6661#true} is VALID [2022-04-28 07:42:42,055 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6661#true} {6756#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #51#return; {6756#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 07:42:42,055 INFO L290 TraceCheckUtils]: 37: Hoare triple {6756#(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; {6781#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:42:42,055 INFO L290 TraceCheckUtils]: 38: Hoare triple {6781#(and (= main_~y~0 4) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6781#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:42:42,056 INFO L290 TraceCheckUtils]: 39: Hoare triple {6781#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(#t~post5 < 50);havoc #t~post5; {6781#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:42:42,056 INFO L272 TraceCheckUtils]: 40: Hoare triple {6781#(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)); {6661#true} is VALID [2022-04-28 07:42:42,056 INFO L290 TraceCheckUtils]: 41: Hoare triple {6661#true} ~cond := #in~cond; {6661#true} is VALID [2022-04-28 07:42:42,056 INFO L290 TraceCheckUtils]: 42: Hoare triple {6661#true} assume !(0 == ~cond); {6661#true} is VALID [2022-04-28 07:42:42,056 INFO L290 TraceCheckUtils]: 43: Hoare triple {6661#true} assume true; {6661#true} is VALID [2022-04-28 07:42:42,056 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {6661#true} {6781#(and (= main_~y~0 4) (= main_~c~0 4))} #51#return; {6781#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 07:42:42,057 INFO L290 TraceCheckUtils]: 45: Hoare triple {6781#(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; {6806#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 07:42:42,057 INFO L290 TraceCheckUtils]: 46: Hoare triple {6806#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6806#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 07:42:42,057 INFO L290 TraceCheckUtils]: 47: Hoare triple {6806#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} assume !!(#t~post5 < 50);havoc #t~post5; {6806#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 07:42:42,057 INFO L272 TraceCheckUtils]: 48: Hoare triple {6806#(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)); {6661#true} is VALID [2022-04-28 07:42:42,057 INFO L290 TraceCheckUtils]: 49: Hoare triple {6661#true} ~cond := #in~cond; {6661#true} is VALID [2022-04-28 07:42:42,057 INFO L290 TraceCheckUtils]: 50: Hoare triple {6661#true} assume !(0 == ~cond); {6661#true} is VALID [2022-04-28 07:42:42,057 INFO L290 TraceCheckUtils]: 51: Hoare triple {6661#true} assume true; {6661#true} is VALID [2022-04-28 07:42:42,058 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6661#true} {6806#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} #51#return; {6806#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 07:42:42,058 INFO L290 TraceCheckUtils]: 53: Hoare triple {6806#(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; {6831#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-28 07:42:42,058 INFO L290 TraceCheckUtils]: 54: Hoare triple {6831#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6831#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-28 07:42:42,058 INFO L290 TraceCheckUtils]: 55: Hoare triple {6831#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !!(#t~post5 < 50);havoc #t~post5; {6831#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-28 07:42:42,058 INFO L272 TraceCheckUtils]: 56: Hoare triple {6831#(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)); {6661#true} is VALID [2022-04-28 07:42:42,059 INFO L290 TraceCheckUtils]: 57: Hoare triple {6661#true} ~cond := #in~cond; {6661#true} is VALID [2022-04-28 07:42:42,059 INFO L290 TraceCheckUtils]: 58: Hoare triple {6661#true} assume !(0 == ~cond); {6661#true} is VALID [2022-04-28 07:42:42,059 INFO L290 TraceCheckUtils]: 59: Hoare triple {6661#true} assume true; {6661#true} is VALID [2022-04-28 07:42:42,059 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {6661#true} {6831#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #51#return; {6831#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-28 07:42:42,059 INFO L290 TraceCheckUtils]: 61: Hoare triple {6831#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !(~c~0 < ~k~0); {6856#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-28 07:42:42,060 INFO L272 TraceCheckUtils]: 62: Hoare triple {6856#(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)); {6860#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:42:42,060 INFO L290 TraceCheckUtils]: 63: Hoare triple {6860#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6864#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:42:42,060 INFO L290 TraceCheckUtils]: 64: Hoare triple {6864#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6662#false} is VALID [2022-04-28 07:42:42,060 INFO L290 TraceCheckUtils]: 65: Hoare triple {6662#false} assume !false; {6662#false} is VALID [2022-04-28 07:42:42,061 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 07:42:42,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:42:42,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:42:42,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314649816] [2022-04-28 07:42:42,216 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:42:42,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606297053] [2022-04-28 07:42:42,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606297053] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:42:42,217 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:42:42,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-28 07:42:42,217 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:42:42,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1208608232] [2022-04-28 07:42:42,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1208608232] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:42:42,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:42:42,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 07:42:42,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813121624] [2022-04-28 07:42:42,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:42:42,217 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 07:42:42,218 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:42:42,218 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 07:42:42,251 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 07:42:42,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 07:42:42,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:42,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 07:42:42,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-28 07:42:42,251 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 07:42:42,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:42,737 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2022-04-28 07:42:42,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 07:42:42,737 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 07:42:42,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:42:42,737 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 07:42:42,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 59 transitions. [2022-04-28 07:42:42,741 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 07:42:42,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 59 transitions. [2022-04-28 07:42:42,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 59 transitions. [2022-04-28 07:42:42,769 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 07:42:42,770 INFO L225 Difference]: With dead ends: 76 [2022-04-28 07:42:42,770 INFO L226 Difference]: Without dead ends: 71 [2022-04-28 07:42:42,770 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 07:42:42,771 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 07:42:42,771 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 07:42:42,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-28 07:42:42,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-04-28 07:42:42,860 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:42:42,861 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 07:42:42,861 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 07:42:42,861 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 07:42:42,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:42,862 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2022-04-28 07:42:42,862 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2022-04-28 07:42:42,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:42,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:42,863 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 07:42:42,863 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 07:42:42,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:42,864 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2022-04-28 07:42:42,864 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2022-04-28 07:42:42,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:42,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:42,864 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:42:42,864 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:42:42,864 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 07:42:42,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2022-04-28 07:42:42,865 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 66 [2022-04-28 07:42:42,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:42:42,865 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2022-04-28 07:42:42,866 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 07:42:42,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 73 transitions. [2022-04-28 07:42:42,941 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 07:42:42,941 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2022-04-28 07:42:42,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-28 07:42:42,942 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:42:42,942 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 07:42:42,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-04-28 07:42:43,142 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 07:42:43,143 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:42:43,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:42:43,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1699217054, now seen corresponding path program 13 times [2022-04-28 07:42:43,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:43,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1474338830] [2022-04-28 07:42:43,226 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:42:43,227 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:42:43,227 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:42:43,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1699217054, now seen corresponding path program 14 times [2022-04-28 07:42:43,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:42:43,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708008902] [2022-04-28 07:42:43,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:42:43,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:42:43,235 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:42:43,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [725272288] [2022-04-28 07:42:43,235 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:42:43,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:42:43,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:42:43,236 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 07:42:43,237 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 07:42:43,281 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:42:43,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:42:43,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 07:42:43,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:42:43,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:42:43,522 INFO L272 TraceCheckUtils]: 0: Hoare triple {7355#true} call ULTIMATE.init(); {7355#true} is VALID [2022-04-28 07:42:43,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {7355#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; {7363#(<= ~counter~0 0)} is VALID [2022-04-28 07:42:43,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {7363#(<= ~counter~0 0)} assume true; {7363#(<= ~counter~0 0)} is VALID [2022-04-28 07:42:43,523 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7363#(<= ~counter~0 0)} {7355#true} #57#return; {7363#(<= ~counter~0 0)} is VALID [2022-04-28 07:42:43,523 INFO L272 TraceCheckUtils]: 4: Hoare triple {7363#(<= ~counter~0 0)} call #t~ret6 := main(); {7363#(<= ~counter~0 0)} is VALID [2022-04-28 07:42:43,523 INFO L290 TraceCheckUtils]: 5: Hoare triple {7363#(<= ~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; {7363#(<= ~counter~0 0)} is VALID [2022-04-28 07:42:43,524 INFO L290 TraceCheckUtils]: 6: Hoare triple {7363#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7379#(<= ~counter~0 1)} is VALID [2022-04-28 07:42:43,524 INFO L290 TraceCheckUtils]: 7: Hoare triple {7379#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {7379#(<= ~counter~0 1)} is VALID [2022-04-28 07:42:43,547 INFO L272 TraceCheckUtils]: 8: Hoare triple {7379#(<= ~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)); {7379#(<= ~counter~0 1)} is VALID [2022-04-28 07:42:43,547 INFO L290 TraceCheckUtils]: 9: Hoare triple {7379#(<= ~counter~0 1)} ~cond := #in~cond; {7379#(<= ~counter~0 1)} is VALID [2022-04-28 07:42:43,548 INFO L290 TraceCheckUtils]: 10: Hoare triple {7379#(<= ~counter~0 1)} assume !(0 == ~cond); {7379#(<= ~counter~0 1)} is VALID [2022-04-28 07:42:43,548 INFO L290 TraceCheckUtils]: 11: Hoare triple {7379#(<= ~counter~0 1)} assume true; {7379#(<= ~counter~0 1)} is VALID [2022-04-28 07:42:43,548 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7379#(<= ~counter~0 1)} {7379#(<= ~counter~0 1)} #51#return; {7379#(<= ~counter~0 1)} is VALID [2022-04-28 07:42:43,548 INFO L290 TraceCheckUtils]: 13: Hoare triple {7379#(<= ~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; {7379#(<= ~counter~0 1)} is VALID [2022-04-28 07:42:43,549 INFO L290 TraceCheckUtils]: 14: Hoare triple {7379#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7404#(<= ~counter~0 2)} is VALID [2022-04-28 07:42:43,549 INFO L290 TraceCheckUtils]: 15: Hoare triple {7404#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {7404#(<= ~counter~0 2)} is VALID [2022-04-28 07:42:43,549 INFO L272 TraceCheckUtils]: 16: Hoare triple {7404#(<= ~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)); {7404#(<= ~counter~0 2)} is VALID [2022-04-28 07:42:43,550 INFO L290 TraceCheckUtils]: 17: Hoare triple {7404#(<= ~counter~0 2)} ~cond := #in~cond; {7404#(<= ~counter~0 2)} is VALID [2022-04-28 07:42:43,550 INFO L290 TraceCheckUtils]: 18: Hoare triple {7404#(<= ~counter~0 2)} assume !(0 == ~cond); {7404#(<= ~counter~0 2)} is VALID [2022-04-28 07:42:43,550 INFO L290 TraceCheckUtils]: 19: Hoare triple {7404#(<= ~counter~0 2)} assume true; {7404#(<= ~counter~0 2)} is VALID [2022-04-28 07:42:43,550 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7404#(<= ~counter~0 2)} {7404#(<= ~counter~0 2)} #51#return; {7404#(<= ~counter~0 2)} is VALID [2022-04-28 07:42:43,550 INFO L290 TraceCheckUtils]: 21: Hoare triple {7404#(<= ~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; {7404#(<= ~counter~0 2)} is VALID [2022-04-28 07:42:43,551 INFO L290 TraceCheckUtils]: 22: Hoare triple {7404#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7429#(<= ~counter~0 3)} is VALID [2022-04-28 07:42:43,551 INFO L290 TraceCheckUtils]: 23: Hoare triple {7429#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {7429#(<= ~counter~0 3)} is VALID [2022-04-28 07:42:43,551 INFO L272 TraceCheckUtils]: 24: Hoare triple {7429#(<= ~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)); {7429#(<= ~counter~0 3)} is VALID [2022-04-28 07:42:43,551 INFO L290 TraceCheckUtils]: 25: Hoare triple {7429#(<= ~counter~0 3)} ~cond := #in~cond; {7429#(<= ~counter~0 3)} is VALID [2022-04-28 07:42:43,552 INFO L290 TraceCheckUtils]: 26: Hoare triple {7429#(<= ~counter~0 3)} assume !(0 == ~cond); {7429#(<= ~counter~0 3)} is VALID [2022-04-28 07:42:43,552 INFO L290 TraceCheckUtils]: 27: Hoare triple {7429#(<= ~counter~0 3)} assume true; {7429#(<= ~counter~0 3)} is VALID [2022-04-28 07:42:43,552 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7429#(<= ~counter~0 3)} {7429#(<= ~counter~0 3)} #51#return; {7429#(<= ~counter~0 3)} is VALID [2022-04-28 07:42:43,552 INFO L290 TraceCheckUtils]: 29: Hoare triple {7429#(<= ~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; {7429#(<= ~counter~0 3)} is VALID [2022-04-28 07:42:43,553 INFO L290 TraceCheckUtils]: 30: Hoare triple {7429#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7454#(<= ~counter~0 4)} is VALID [2022-04-28 07:42:43,553 INFO L290 TraceCheckUtils]: 31: Hoare triple {7454#(<= ~counter~0 4)} assume !!(#t~post5 < 50);havoc #t~post5; {7454#(<= ~counter~0 4)} is VALID [2022-04-28 07:42:43,553 INFO L272 TraceCheckUtils]: 32: Hoare triple {7454#(<= ~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)); {7454#(<= ~counter~0 4)} is VALID [2022-04-28 07:42:43,553 INFO L290 TraceCheckUtils]: 33: Hoare triple {7454#(<= ~counter~0 4)} ~cond := #in~cond; {7454#(<= ~counter~0 4)} is VALID [2022-04-28 07:42:43,553 INFO L290 TraceCheckUtils]: 34: Hoare triple {7454#(<= ~counter~0 4)} assume !(0 == ~cond); {7454#(<= ~counter~0 4)} is VALID [2022-04-28 07:42:43,554 INFO L290 TraceCheckUtils]: 35: Hoare triple {7454#(<= ~counter~0 4)} assume true; {7454#(<= ~counter~0 4)} is VALID [2022-04-28 07:42:43,554 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7454#(<= ~counter~0 4)} {7454#(<= ~counter~0 4)} #51#return; {7454#(<= ~counter~0 4)} is VALID [2022-04-28 07:42:43,554 INFO L290 TraceCheckUtils]: 37: Hoare triple {7454#(<= ~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; {7454#(<= ~counter~0 4)} is VALID [2022-04-28 07:42:43,554 INFO L290 TraceCheckUtils]: 38: Hoare triple {7454#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7479#(<= ~counter~0 5)} is VALID [2022-04-28 07:42:43,554 INFO L290 TraceCheckUtils]: 39: Hoare triple {7479#(<= ~counter~0 5)} assume !!(#t~post5 < 50);havoc #t~post5; {7479#(<= ~counter~0 5)} is VALID [2022-04-28 07:42:43,555 INFO L272 TraceCheckUtils]: 40: Hoare triple {7479#(<= ~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)); {7479#(<= ~counter~0 5)} is VALID [2022-04-28 07:42:43,555 INFO L290 TraceCheckUtils]: 41: Hoare triple {7479#(<= ~counter~0 5)} ~cond := #in~cond; {7479#(<= ~counter~0 5)} is VALID [2022-04-28 07:42:43,555 INFO L290 TraceCheckUtils]: 42: Hoare triple {7479#(<= ~counter~0 5)} assume !(0 == ~cond); {7479#(<= ~counter~0 5)} is VALID [2022-04-28 07:42:43,555 INFO L290 TraceCheckUtils]: 43: Hoare triple {7479#(<= ~counter~0 5)} assume true; {7479#(<= ~counter~0 5)} is VALID [2022-04-28 07:42:43,556 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7479#(<= ~counter~0 5)} {7479#(<= ~counter~0 5)} #51#return; {7479#(<= ~counter~0 5)} is VALID [2022-04-28 07:42:43,556 INFO L290 TraceCheckUtils]: 45: Hoare triple {7479#(<= ~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; {7479#(<= ~counter~0 5)} is VALID [2022-04-28 07:42:43,556 INFO L290 TraceCheckUtils]: 46: Hoare triple {7479#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7504#(<= ~counter~0 6)} is VALID [2022-04-28 07:42:43,556 INFO L290 TraceCheckUtils]: 47: Hoare triple {7504#(<= ~counter~0 6)} assume !!(#t~post5 < 50);havoc #t~post5; {7504#(<= ~counter~0 6)} is VALID [2022-04-28 07:42:43,557 INFO L272 TraceCheckUtils]: 48: Hoare triple {7504#(<= ~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)); {7504#(<= ~counter~0 6)} is VALID [2022-04-28 07:42:43,557 INFO L290 TraceCheckUtils]: 49: Hoare triple {7504#(<= ~counter~0 6)} ~cond := #in~cond; {7504#(<= ~counter~0 6)} is VALID [2022-04-28 07:42:43,557 INFO L290 TraceCheckUtils]: 50: Hoare triple {7504#(<= ~counter~0 6)} assume !(0 == ~cond); {7504#(<= ~counter~0 6)} is VALID [2022-04-28 07:42:43,557 INFO L290 TraceCheckUtils]: 51: Hoare triple {7504#(<= ~counter~0 6)} assume true; {7504#(<= ~counter~0 6)} is VALID [2022-04-28 07:42:43,557 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7504#(<= ~counter~0 6)} {7504#(<= ~counter~0 6)} #51#return; {7504#(<= ~counter~0 6)} is VALID [2022-04-28 07:42:43,558 INFO L290 TraceCheckUtils]: 53: Hoare triple {7504#(<= ~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; {7504#(<= ~counter~0 6)} is VALID [2022-04-28 07:42:43,558 INFO L290 TraceCheckUtils]: 54: Hoare triple {7504#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7529#(<= ~counter~0 7)} is VALID [2022-04-28 07:42:43,558 INFO L290 TraceCheckUtils]: 55: Hoare triple {7529#(<= ~counter~0 7)} assume !!(#t~post5 < 50);havoc #t~post5; {7529#(<= ~counter~0 7)} is VALID [2022-04-28 07:42:43,558 INFO L272 TraceCheckUtils]: 56: Hoare triple {7529#(<= ~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)); {7529#(<= ~counter~0 7)} is VALID [2022-04-28 07:42:43,559 INFO L290 TraceCheckUtils]: 57: Hoare triple {7529#(<= ~counter~0 7)} ~cond := #in~cond; {7529#(<= ~counter~0 7)} is VALID [2022-04-28 07:42:43,559 INFO L290 TraceCheckUtils]: 58: Hoare triple {7529#(<= ~counter~0 7)} assume !(0 == ~cond); {7529#(<= ~counter~0 7)} is VALID [2022-04-28 07:42:43,559 INFO L290 TraceCheckUtils]: 59: Hoare triple {7529#(<= ~counter~0 7)} assume true; {7529#(<= ~counter~0 7)} is VALID [2022-04-28 07:42:43,559 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7529#(<= ~counter~0 7)} {7529#(<= ~counter~0 7)} #51#return; {7529#(<= ~counter~0 7)} is VALID [2022-04-28 07:42:43,559 INFO L290 TraceCheckUtils]: 61: Hoare triple {7529#(<= ~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; {7529#(<= ~counter~0 7)} is VALID [2022-04-28 07:42:43,560 INFO L290 TraceCheckUtils]: 62: Hoare triple {7529#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7554#(<= |main_#t~post5| 7)} is VALID [2022-04-28 07:42:43,560 INFO L290 TraceCheckUtils]: 63: Hoare triple {7554#(<= |main_#t~post5| 7)} assume !(#t~post5 < 50);havoc #t~post5; {7356#false} is VALID [2022-04-28 07:42:43,560 INFO L272 TraceCheckUtils]: 64: Hoare triple {7356#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7356#false} is VALID [2022-04-28 07:42:43,560 INFO L290 TraceCheckUtils]: 65: Hoare triple {7356#false} ~cond := #in~cond; {7356#false} is VALID [2022-04-28 07:42:43,560 INFO L290 TraceCheckUtils]: 66: Hoare triple {7356#false} assume 0 == ~cond; {7356#false} is VALID [2022-04-28 07:42:43,560 INFO L290 TraceCheckUtils]: 67: Hoare triple {7356#false} assume !false; {7356#false} is VALID [2022-04-28 07:42:43,560 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 07:42:43,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:42:43,773 INFO L290 TraceCheckUtils]: 67: Hoare triple {7356#false} assume !false; {7356#false} is VALID [2022-04-28 07:42:43,774 INFO L290 TraceCheckUtils]: 66: Hoare triple {7356#false} assume 0 == ~cond; {7356#false} is VALID [2022-04-28 07:42:43,774 INFO L290 TraceCheckUtils]: 65: Hoare triple {7356#false} ~cond := #in~cond; {7356#false} is VALID [2022-04-28 07:42:43,774 INFO L272 TraceCheckUtils]: 64: Hoare triple {7356#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7356#false} is VALID [2022-04-28 07:42:43,774 INFO L290 TraceCheckUtils]: 63: Hoare triple {7582#(< |main_#t~post5| 50)} assume !(#t~post5 < 50);havoc #t~post5; {7356#false} is VALID [2022-04-28 07:42:43,774 INFO L290 TraceCheckUtils]: 62: Hoare triple {7586#(< ~counter~0 50)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7582#(< |main_#t~post5| 50)} is VALID [2022-04-28 07:42:43,774 INFO L290 TraceCheckUtils]: 61: Hoare triple {7586#(< ~counter~0 50)} 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; {7586#(< ~counter~0 50)} is VALID [2022-04-28 07:42:43,775 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7355#true} {7586#(< ~counter~0 50)} #51#return; {7586#(< ~counter~0 50)} is VALID [2022-04-28 07:42:43,775 INFO L290 TraceCheckUtils]: 59: Hoare triple {7355#true} assume true; {7355#true} is VALID [2022-04-28 07:42:43,775 INFO L290 TraceCheckUtils]: 58: Hoare triple {7355#true} assume !(0 == ~cond); {7355#true} is VALID [2022-04-28 07:42:43,775 INFO L290 TraceCheckUtils]: 57: Hoare triple {7355#true} ~cond := #in~cond; {7355#true} is VALID [2022-04-28 07:42:43,775 INFO L272 TraceCheckUtils]: 56: Hoare triple {7586#(< ~counter~0 50)} 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)); {7355#true} is VALID [2022-04-28 07:42:43,775 INFO L290 TraceCheckUtils]: 55: Hoare triple {7586#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {7586#(< ~counter~0 50)} is VALID [2022-04-28 07:42:43,776 INFO L290 TraceCheckUtils]: 54: Hoare triple {7611#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7586#(< ~counter~0 50)} is VALID [2022-04-28 07:42:43,776 INFO L290 TraceCheckUtils]: 53: Hoare triple {7611#(< ~counter~0 49)} 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; {7611#(< ~counter~0 49)} is VALID [2022-04-28 07:42:43,776 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7355#true} {7611#(< ~counter~0 49)} #51#return; {7611#(< ~counter~0 49)} is VALID [2022-04-28 07:42:43,776 INFO L290 TraceCheckUtils]: 51: Hoare triple {7355#true} assume true; {7355#true} is VALID [2022-04-28 07:42:43,776 INFO L290 TraceCheckUtils]: 50: Hoare triple {7355#true} assume !(0 == ~cond); {7355#true} is VALID [2022-04-28 07:42:43,776 INFO L290 TraceCheckUtils]: 49: Hoare triple {7355#true} ~cond := #in~cond; {7355#true} is VALID [2022-04-28 07:42:43,776 INFO L272 TraceCheckUtils]: 48: Hoare triple {7611#(< ~counter~0 49)} 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)); {7355#true} is VALID [2022-04-28 07:42:43,777 INFO L290 TraceCheckUtils]: 47: Hoare triple {7611#(< ~counter~0 49)} assume !!(#t~post5 < 50);havoc #t~post5; {7611#(< ~counter~0 49)} is VALID [2022-04-28 07:42:43,777 INFO L290 TraceCheckUtils]: 46: Hoare triple {7636#(< ~counter~0 48)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7611#(< ~counter~0 49)} is VALID [2022-04-28 07:42:43,777 INFO L290 TraceCheckUtils]: 45: Hoare triple {7636#(< ~counter~0 48)} 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; {7636#(< ~counter~0 48)} is VALID [2022-04-28 07:42:43,777 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7355#true} {7636#(< ~counter~0 48)} #51#return; {7636#(< ~counter~0 48)} is VALID [2022-04-28 07:42:43,777 INFO L290 TraceCheckUtils]: 43: Hoare triple {7355#true} assume true; {7355#true} is VALID [2022-04-28 07:42:43,778 INFO L290 TraceCheckUtils]: 42: Hoare triple {7355#true} assume !(0 == ~cond); {7355#true} is VALID [2022-04-28 07:42:43,778 INFO L290 TraceCheckUtils]: 41: Hoare triple {7355#true} ~cond := #in~cond; {7355#true} is VALID [2022-04-28 07:42:43,778 INFO L272 TraceCheckUtils]: 40: Hoare triple {7636#(< ~counter~0 48)} 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)); {7355#true} is VALID [2022-04-28 07:42:43,778 INFO L290 TraceCheckUtils]: 39: Hoare triple {7636#(< ~counter~0 48)} assume !!(#t~post5 < 50);havoc #t~post5; {7636#(< ~counter~0 48)} is VALID [2022-04-28 07:42:43,778 INFO L290 TraceCheckUtils]: 38: Hoare triple {7661#(< ~counter~0 47)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7636#(< ~counter~0 48)} is VALID [2022-04-28 07:42:43,778 INFO L290 TraceCheckUtils]: 37: Hoare triple {7661#(< ~counter~0 47)} 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; {7661#(< ~counter~0 47)} is VALID [2022-04-28 07:42:43,779 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7355#true} {7661#(< ~counter~0 47)} #51#return; {7661#(< ~counter~0 47)} is VALID [2022-04-28 07:42:43,779 INFO L290 TraceCheckUtils]: 35: Hoare triple {7355#true} assume true; {7355#true} is VALID [2022-04-28 07:42:43,779 INFO L290 TraceCheckUtils]: 34: Hoare triple {7355#true} assume !(0 == ~cond); {7355#true} is VALID [2022-04-28 07:42:43,779 INFO L290 TraceCheckUtils]: 33: Hoare triple {7355#true} ~cond := #in~cond; {7355#true} is VALID [2022-04-28 07:42:43,779 INFO L272 TraceCheckUtils]: 32: Hoare triple {7661#(< ~counter~0 47)} 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)); {7355#true} is VALID [2022-04-28 07:42:43,779 INFO L290 TraceCheckUtils]: 31: Hoare triple {7661#(< ~counter~0 47)} assume !!(#t~post5 < 50);havoc #t~post5; {7661#(< ~counter~0 47)} is VALID [2022-04-28 07:42:43,779 INFO L290 TraceCheckUtils]: 30: Hoare triple {7686#(< ~counter~0 46)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7661#(< ~counter~0 47)} is VALID [2022-04-28 07:42:43,780 INFO L290 TraceCheckUtils]: 29: Hoare triple {7686#(< ~counter~0 46)} 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; {7686#(< ~counter~0 46)} is VALID [2022-04-28 07:42:43,780 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7355#true} {7686#(< ~counter~0 46)} #51#return; {7686#(< ~counter~0 46)} is VALID [2022-04-28 07:42:43,780 INFO L290 TraceCheckUtils]: 27: Hoare triple {7355#true} assume true; {7355#true} is VALID [2022-04-28 07:42:43,780 INFO L290 TraceCheckUtils]: 26: Hoare triple {7355#true} assume !(0 == ~cond); {7355#true} is VALID [2022-04-28 07:42:43,780 INFO L290 TraceCheckUtils]: 25: Hoare triple {7355#true} ~cond := #in~cond; {7355#true} is VALID [2022-04-28 07:42:43,780 INFO L272 TraceCheckUtils]: 24: Hoare triple {7686#(< ~counter~0 46)} 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)); {7355#true} is VALID [2022-04-28 07:42:43,780 INFO L290 TraceCheckUtils]: 23: Hoare triple {7686#(< ~counter~0 46)} assume !!(#t~post5 < 50);havoc #t~post5; {7686#(< ~counter~0 46)} is VALID [2022-04-28 07:42:43,781 INFO L290 TraceCheckUtils]: 22: Hoare triple {7711#(< ~counter~0 45)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7686#(< ~counter~0 46)} is VALID [2022-04-28 07:42:43,781 INFO L290 TraceCheckUtils]: 21: Hoare triple {7711#(< ~counter~0 45)} 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; {7711#(< ~counter~0 45)} is VALID [2022-04-28 07:42:43,781 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7355#true} {7711#(< ~counter~0 45)} #51#return; {7711#(< ~counter~0 45)} is VALID [2022-04-28 07:42:43,781 INFO L290 TraceCheckUtils]: 19: Hoare triple {7355#true} assume true; {7355#true} is VALID [2022-04-28 07:42:43,781 INFO L290 TraceCheckUtils]: 18: Hoare triple {7355#true} assume !(0 == ~cond); {7355#true} is VALID [2022-04-28 07:42:43,781 INFO L290 TraceCheckUtils]: 17: Hoare triple {7355#true} ~cond := #in~cond; {7355#true} is VALID [2022-04-28 07:42:43,781 INFO L272 TraceCheckUtils]: 16: Hoare triple {7711#(< ~counter~0 45)} 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)); {7355#true} is VALID [2022-04-28 07:42:43,782 INFO L290 TraceCheckUtils]: 15: Hoare triple {7711#(< ~counter~0 45)} assume !!(#t~post5 < 50);havoc #t~post5; {7711#(< ~counter~0 45)} is VALID [2022-04-28 07:42:43,782 INFO L290 TraceCheckUtils]: 14: Hoare triple {7736#(< ~counter~0 44)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7711#(< ~counter~0 45)} is VALID [2022-04-28 07:42:43,782 INFO L290 TraceCheckUtils]: 13: Hoare triple {7736#(< ~counter~0 44)} 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; {7736#(< ~counter~0 44)} is VALID [2022-04-28 07:42:43,782 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7355#true} {7736#(< ~counter~0 44)} #51#return; {7736#(< ~counter~0 44)} is VALID [2022-04-28 07:42:43,782 INFO L290 TraceCheckUtils]: 11: Hoare triple {7355#true} assume true; {7355#true} is VALID [2022-04-28 07:42:43,782 INFO L290 TraceCheckUtils]: 10: Hoare triple {7355#true} assume !(0 == ~cond); {7355#true} is VALID [2022-04-28 07:42:43,783 INFO L290 TraceCheckUtils]: 9: Hoare triple {7355#true} ~cond := #in~cond; {7355#true} is VALID [2022-04-28 07:42:43,783 INFO L272 TraceCheckUtils]: 8: Hoare triple {7736#(< ~counter~0 44)} 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)); {7355#true} is VALID [2022-04-28 07:42:43,783 INFO L290 TraceCheckUtils]: 7: Hoare triple {7736#(< ~counter~0 44)} assume !!(#t~post5 < 50);havoc #t~post5; {7736#(< ~counter~0 44)} is VALID [2022-04-28 07:42:43,783 INFO L290 TraceCheckUtils]: 6: Hoare triple {7761#(< ~counter~0 43)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7736#(< ~counter~0 44)} is VALID [2022-04-28 07:42:43,783 INFO L290 TraceCheckUtils]: 5: Hoare triple {7761#(< ~counter~0 43)} 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; {7761#(< ~counter~0 43)} is VALID [2022-04-28 07:42:43,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {7761#(< ~counter~0 43)} call #t~ret6 := main(); {7761#(< ~counter~0 43)} is VALID [2022-04-28 07:42:43,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7761#(< ~counter~0 43)} {7355#true} #57#return; {7761#(< ~counter~0 43)} is VALID [2022-04-28 07:42:43,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {7761#(< ~counter~0 43)} assume true; {7761#(< ~counter~0 43)} is VALID [2022-04-28 07:42:43,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {7355#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; {7761#(< ~counter~0 43)} is VALID [2022-04-28 07:42:43,784 INFO L272 TraceCheckUtils]: 0: Hoare triple {7355#true} call ULTIMATE.init(); {7355#true} is VALID [2022-04-28 07:42:43,785 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 07:42:43,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:42:43,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708008902] [2022-04-28 07:42:43,785 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:42:43,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725272288] [2022-04-28 07:42:43,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725272288] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:42:43,785 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:42:43,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-28 07:42:43,786 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:42:43,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1474338830] [2022-04-28 07:42:43,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1474338830] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:42:43,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:42:43,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 07:42:43,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951700923] [2022-04-28 07:42:43,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:42:43,789 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 07:42:43,789 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:42:43,789 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 07:42:43,822 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 07:42:43,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 07:42:43,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:43,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 07:42:43,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-28 07:42:43,823 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 07:42:44,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:44,043 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2022-04-28 07:42:44,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 07:42:44,043 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 07:42:44,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:42:44,044 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 07:42:44,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 82 transitions. [2022-04-28 07:42:44,045 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 07:42:44,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 82 transitions. [2022-04-28 07:42:44,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 82 transitions. [2022-04-28 07:42:44,102 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 07:42:44,103 INFO L225 Difference]: With dead ends: 82 [2022-04-28 07:42:44,103 INFO L226 Difference]: Without dead ends: 77 [2022-04-28 07:42:44,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=291, Invalid=411, Unknown=0, NotChecked=0, Total=702 [2022-04-28 07:42:44,104 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:42:44,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 101 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:42:44,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-28 07:42:44,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-04-28 07:42:44,154 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:42:44,154 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 07:42:44,154 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 07:42:44,155 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 07:42:44,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:44,157 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2022-04-28 07:42:44,157 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2022-04-28 07:42:44,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:44,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:44,157 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 07:42:44,157 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 07:42:44,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:44,161 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2022-04-28 07:42:44,161 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2022-04-28 07:42:44,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:44,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:44,161 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:42:44,161 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:42:44,161 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 07:42:44,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2022-04-28 07:42:44,162 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 68 [2022-04-28 07:42:44,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:42:44,162 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2022-04-28 07:42:44,162 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 07:42:44,162 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 78 transitions. [2022-04-28 07:42:44,244 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 07:42:44,244 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2022-04-28 07:42:44,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-28 07:42:44,244 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:42:44,244 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 07:42:44,260 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 07:42:44,445 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 07:42:44,445 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:42:44,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:42:44,445 INFO L85 PathProgramCache]: Analyzing trace with hash -763940164, now seen corresponding path program 13 times [2022-04-28 07:42:44,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:44,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [97124325] [2022-04-28 07:42:44,523 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:42:44,523 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:42:44,524 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:42:44,524 INFO L85 PathProgramCache]: Analyzing trace with hash -763940164, now seen corresponding path program 14 times [2022-04-28 07:42:44,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:42:44,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76554645] [2022-04-28 07:42:44,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:42:44,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:42:44,539 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:42:44,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2005115634] [2022-04-28 07:42:44,539 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:42:44,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:42:44,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:42:44,540 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 07:42:44,541 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 07:42:44,943 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:42:44,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:42:44,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-28 07:42:44,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:42:44,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:42:45,342 INFO L272 TraceCheckUtils]: 0: Hoare triple {8268#true} call ULTIMATE.init(); {8268#true} is VALID [2022-04-28 07:42:45,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {8268#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; {8268#true} is VALID [2022-04-28 07:42:45,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {8268#true} assume true; {8268#true} is VALID [2022-04-28 07:42:45,342 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8268#true} {8268#true} #57#return; {8268#true} is VALID [2022-04-28 07:42:45,342 INFO L272 TraceCheckUtils]: 4: Hoare triple {8268#true} call #t~ret6 := main(); {8268#true} is VALID [2022-04-28 07:42:45,343 INFO L290 TraceCheckUtils]: 5: Hoare triple {8268#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; {8288#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:42:45,343 INFO L290 TraceCheckUtils]: 6: Hoare triple {8288#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8288#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:42:45,348 INFO L290 TraceCheckUtils]: 7: Hoare triple {8288#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {8288#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:42:45,348 INFO L272 TraceCheckUtils]: 8: Hoare triple {8288#(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)); {8268#true} is VALID [2022-04-28 07:42:45,349 INFO L290 TraceCheckUtils]: 9: Hoare triple {8268#true} ~cond := #in~cond; {8268#true} is VALID [2022-04-28 07:42:45,349 INFO L290 TraceCheckUtils]: 10: Hoare triple {8268#true} assume !(0 == ~cond); {8268#true} is VALID [2022-04-28 07:42:45,349 INFO L290 TraceCheckUtils]: 11: Hoare triple {8268#true} assume true; {8268#true} is VALID [2022-04-28 07:42:45,349 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {8268#true} {8288#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {8288#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:42:45,349 INFO L290 TraceCheckUtils]: 13: Hoare triple {8288#(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; {8313#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:42:45,350 INFO L290 TraceCheckUtils]: 14: Hoare triple {8313#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8313#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:42:45,350 INFO L290 TraceCheckUtils]: 15: Hoare triple {8313#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {8313#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:42:45,350 INFO L272 TraceCheckUtils]: 16: Hoare triple {8313#(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)); {8268#true} is VALID [2022-04-28 07:42:45,350 INFO L290 TraceCheckUtils]: 17: Hoare triple {8268#true} ~cond := #in~cond; {8268#true} is VALID [2022-04-28 07:42:45,350 INFO L290 TraceCheckUtils]: 18: Hoare triple {8268#true} assume !(0 == ~cond); {8268#true} is VALID [2022-04-28 07:42:45,350 INFO L290 TraceCheckUtils]: 19: Hoare triple {8268#true} assume true; {8268#true} is VALID [2022-04-28 07:42:45,351 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {8268#true} {8313#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #51#return; {8313#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:42:45,351 INFO L290 TraceCheckUtils]: 21: Hoare triple {8313#(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; {8338#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:42:45,351 INFO L290 TraceCheckUtils]: 22: Hoare triple {8338#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8338#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:42:45,352 INFO L290 TraceCheckUtils]: 23: Hoare triple {8338#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 50);havoc #t~post5; {8338#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:42:45,352 INFO L272 TraceCheckUtils]: 24: Hoare triple {8338#(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)); {8268#true} is VALID [2022-04-28 07:42:45,352 INFO L290 TraceCheckUtils]: 25: Hoare triple {8268#true} ~cond := #in~cond; {8268#true} is VALID [2022-04-28 07:42:45,352 INFO L290 TraceCheckUtils]: 26: Hoare triple {8268#true} assume !(0 == ~cond); {8268#true} is VALID [2022-04-28 07:42:45,352 INFO L290 TraceCheckUtils]: 27: Hoare triple {8268#true} assume true; {8268#true} is VALID [2022-04-28 07:42:45,352 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {8268#true} {8338#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #51#return; {8338#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:42:45,353 INFO L290 TraceCheckUtils]: 29: Hoare triple {8338#(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; {8363#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-28 07:42:45,353 INFO L290 TraceCheckUtils]: 30: Hoare triple {8363#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8363#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-28 07:42:45,353 INFO L290 TraceCheckUtils]: 31: Hoare triple {8363#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} assume !!(#t~post5 < 50);havoc #t~post5; {8363#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-28 07:42:45,353 INFO L272 TraceCheckUtils]: 32: Hoare triple {8363#(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)); {8268#true} is VALID [2022-04-28 07:42:45,353 INFO L290 TraceCheckUtils]: 33: Hoare triple {8268#true} ~cond := #in~cond; {8268#true} is VALID [2022-04-28 07:42:45,354 INFO L290 TraceCheckUtils]: 34: Hoare triple {8268#true} assume !(0 == ~cond); {8268#true} is VALID [2022-04-28 07:42:45,354 INFO L290 TraceCheckUtils]: 35: Hoare triple {8268#true} assume true; {8268#true} is VALID [2022-04-28 07:42:45,354 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8268#true} {8363#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} #51#return; {8363#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-28 07:42:45,354 INFO L290 TraceCheckUtils]: 37: Hoare triple {8363#(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; {8388#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 07:42:45,355 INFO L290 TraceCheckUtils]: 38: Hoare triple {8388#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8388#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 07:42:45,355 INFO L290 TraceCheckUtils]: 39: Hoare triple {8388#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !!(#t~post5 < 50);havoc #t~post5; {8388#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 07:42:45,355 INFO L272 TraceCheckUtils]: 40: Hoare triple {8388#(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)); {8268#true} is VALID [2022-04-28 07:42:45,355 INFO L290 TraceCheckUtils]: 41: Hoare triple {8268#true} ~cond := #in~cond; {8268#true} is VALID [2022-04-28 07:42:45,355 INFO L290 TraceCheckUtils]: 42: Hoare triple {8268#true} assume !(0 == ~cond); {8268#true} is VALID [2022-04-28 07:42:45,355 INFO L290 TraceCheckUtils]: 43: Hoare triple {8268#true} assume true; {8268#true} is VALID [2022-04-28 07:42:45,356 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {8268#true} {8388#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} #51#return; {8388#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 07:42:45,356 INFO L290 TraceCheckUtils]: 45: Hoare triple {8388#(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; {8413#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:42:45,356 INFO L290 TraceCheckUtils]: 46: Hoare triple {8413#(and (= 5 main_~c~0) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8413#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:42:45,357 INFO L290 TraceCheckUtils]: 47: Hoare triple {8413#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(#t~post5 < 50);havoc #t~post5; {8413#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:42:45,357 INFO L272 TraceCheckUtils]: 48: Hoare triple {8413#(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)); {8268#true} is VALID [2022-04-28 07:42:45,357 INFO L290 TraceCheckUtils]: 49: Hoare triple {8268#true} ~cond := #in~cond; {8268#true} is VALID [2022-04-28 07:42:45,357 INFO L290 TraceCheckUtils]: 50: Hoare triple {8268#true} assume !(0 == ~cond); {8268#true} is VALID [2022-04-28 07:42:45,357 INFO L290 TraceCheckUtils]: 51: Hoare triple {8268#true} assume true; {8268#true} is VALID [2022-04-28 07:42:45,357 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8268#true} {8413#(and (= 5 main_~c~0) (= 5 main_~y~0))} #51#return; {8413#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:42:45,358 INFO L290 TraceCheckUtils]: 53: Hoare triple {8413#(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; {8438#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 07:42:45,358 INFO L290 TraceCheckUtils]: 54: Hoare triple {8438#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8438#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 07:42:45,358 INFO L290 TraceCheckUtils]: 55: Hoare triple {8438#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !!(#t~post5 < 50);havoc #t~post5; {8438#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 07:42:45,358 INFO L272 TraceCheckUtils]: 56: Hoare triple {8438#(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)); {8268#true} is VALID [2022-04-28 07:42:45,358 INFO L290 TraceCheckUtils]: 57: Hoare triple {8268#true} ~cond := #in~cond; {8268#true} is VALID [2022-04-28 07:42:45,358 INFO L290 TraceCheckUtils]: 58: Hoare triple {8268#true} assume !(0 == ~cond); {8268#true} is VALID [2022-04-28 07:42:45,359 INFO L290 TraceCheckUtils]: 59: Hoare triple {8268#true} assume true; {8268#true} is VALID [2022-04-28 07:42:45,359 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8268#true} {8438#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #51#return; {8438#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 07:42:45,359 INFO L290 TraceCheckUtils]: 61: Hoare triple {8438#(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; {8463#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-28 07:42:45,360 INFO L290 TraceCheckUtils]: 62: Hoare triple {8463#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8463#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-28 07:42:45,360 INFO L290 TraceCheckUtils]: 63: Hoare triple {8463#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !!(#t~post5 < 50);havoc #t~post5; {8463#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-28 07:42:45,360 INFO L272 TraceCheckUtils]: 64: Hoare triple {8463#(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)); {8268#true} is VALID [2022-04-28 07:42:45,360 INFO L290 TraceCheckUtils]: 65: Hoare triple {8268#true} ~cond := #in~cond; {8268#true} is VALID [2022-04-28 07:42:45,360 INFO L290 TraceCheckUtils]: 66: Hoare triple {8268#true} assume !(0 == ~cond); {8268#true} is VALID [2022-04-28 07:42:45,360 INFO L290 TraceCheckUtils]: 67: Hoare triple {8268#true} assume true; {8268#true} is VALID [2022-04-28 07:42:45,361 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {8268#true} {8463#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #51#return; {8463#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-28 07:42:45,361 INFO L290 TraceCheckUtils]: 69: Hoare triple {8463#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {8488#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-28 07:42:45,362 INFO L272 TraceCheckUtils]: 70: Hoare triple {8488#(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)); {8492#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:42:45,362 INFO L290 TraceCheckUtils]: 71: Hoare triple {8492#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8496#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:42:45,362 INFO L290 TraceCheckUtils]: 72: Hoare triple {8496#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8269#false} is VALID [2022-04-28 07:42:45,362 INFO L290 TraceCheckUtils]: 73: Hoare triple {8269#false} assume !false; {8269#false} is VALID [2022-04-28 07:42:45,362 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 07:42:45,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:42:45,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:42:45,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76554645] [2022-04-28 07:42:45,654 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:42:45,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005115634] [2022-04-28 07:42:45,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005115634] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:42:45,654 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:42:45,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-28 07:42:45,655 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:42:45,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [97124325] [2022-04-28 07:42:45,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [97124325] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:42:45,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:42:45,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 07:42:45,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174827951] [2022-04-28 07:42:45,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:42:45,655 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 07:42:45,655 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:42:45,655 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 07:42:45,691 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 07:42:45,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 07:42:45,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:45,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 07:42:45,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-28 07:42:45,692 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 07:42:46,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:46,393 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2022-04-28 07:42:46,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 07:42:46,393 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 07:42:46,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:42:46,394 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 07:42:46,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 64 transitions. [2022-04-28 07:42:46,396 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 07:42:46,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 64 transitions. [2022-04-28 07:42:46,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 64 transitions. [2022-04-28 07:42:46,438 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 07:42:46,439 INFO L225 Difference]: With dead ends: 84 [2022-04-28 07:42:46,439 INFO L226 Difference]: Without dead ends: 79 [2022-04-28 07:42:46,439 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 07:42:46,440 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 07:42:46,440 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 07:42:46,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-28 07:42:46,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-04-28 07:42:46,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:42:46,527 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 07:42:46,527 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 07:42:46,527 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 07:42:46,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:46,528 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2022-04-28 07:42:46,528 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2022-04-28 07:42:46,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:46,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:46,528 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 07:42:46,529 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 07:42:46,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:46,530 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2022-04-28 07:42:46,530 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2022-04-28 07:42:46,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:46,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:46,530 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:42:46,530 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:42:46,530 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 07:42:46,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2022-04-28 07:42:46,531 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 74 [2022-04-28 07:42:46,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:42:46,531 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2022-04-28 07:42:46,531 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 07:42:46,532 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 81 transitions. [2022-04-28 07:42:46,617 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 07:42:46,617 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2022-04-28 07:42:46,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-28 07:42:46,617 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:42:46,617 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 07:42:46,624 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 07:42:46,818 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 07:42:46,818 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:42:46,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:42:46,819 INFO L85 PathProgramCache]: Analyzing trace with hash 989539297, now seen corresponding path program 15 times [2022-04-28 07:42:46,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:46,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [377450870] [2022-04-28 07:42:46,889 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:42:46,889 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:42:46,889 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:42:46,889 INFO L85 PathProgramCache]: Analyzing trace with hash 989539297, now seen corresponding path program 16 times [2022-04-28 07:42:46,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:42:46,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023620564] [2022-04-28 07:42:46,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:42:46,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:42:46,904 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:42:46,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [122379634] [2022-04-28 07:42:46,904 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:42:46,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:42:46,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:42:46,906 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 07:42:46,907 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 07:42:47,433 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:42:47,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:42:47,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 07:42:47,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:42:47,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:42:47,736 INFO L272 TraceCheckUtils]: 0: Hoare triple {9035#true} call ULTIMATE.init(); {9035#true} is VALID [2022-04-28 07:42:47,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {9035#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; {9043#(<= ~counter~0 0)} is VALID [2022-04-28 07:42:47,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {9043#(<= ~counter~0 0)} assume true; {9043#(<= ~counter~0 0)} is VALID [2022-04-28 07:42:47,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9043#(<= ~counter~0 0)} {9035#true} #57#return; {9043#(<= ~counter~0 0)} is VALID [2022-04-28 07:42:47,737 INFO L272 TraceCheckUtils]: 4: Hoare triple {9043#(<= ~counter~0 0)} call #t~ret6 := main(); {9043#(<= ~counter~0 0)} is VALID [2022-04-28 07:42:47,737 INFO L290 TraceCheckUtils]: 5: Hoare triple {9043#(<= ~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; {9043#(<= ~counter~0 0)} is VALID [2022-04-28 07:42:47,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {9043#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9059#(<= ~counter~0 1)} is VALID [2022-04-28 07:42:47,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {9059#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {9059#(<= ~counter~0 1)} is VALID [2022-04-28 07:42:47,738 INFO L272 TraceCheckUtils]: 8: Hoare triple {9059#(<= ~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)); {9059#(<= ~counter~0 1)} is VALID [2022-04-28 07:42:47,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {9059#(<= ~counter~0 1)} ~cond := #in~cond; {9059#(<= ~counter~0 1)} is VALID [2022-04-28 07:42:47,739 INFO L290 TraceCheckUtils]: 10: Hoare triple {9059#(<= ~counter~0 1)} assume !(0 == ~cond); {9059#(<= ~counter~0 1)} is VALID [2022-04-28 07:42:47,739 INFO L290 TraceCheckUtils]: 11: Hoare triple {9059#(<= ~counter~0 1)} assume true; {9059#(<= ~counter~0 1)} is VALID [2022-04-28 07:42:47,739 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {9059#(<= ~counter~0 1)} {9059#(<= ~counter~0 1)} #51#return; {9059#(<= ~counter~0 1)} is VALID [2022-04-28 07:42:47,739 INFO L290 TraceCheckUtils]: 13: Hoare triple {9059#(<= ~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; {9059#(<= ~counter~0 1)} is VALID [2022-04-28 07:42:47,740 INFO L290 TraceCheckUtils]: 14: Hoare triple {9059#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9084#(<= ~counter~0 2)} is VALID [2022-04-28 07:42:47,740 INFO L290 TraceCheckUtils]: 15: Hoare triple {9084#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {9084#(<= ~counter~0 2)} is VALID [2022-04-28 07:42:47,740 INFO L272 TraceCheckUtils]: 16: Hoare triple {9084#(<= ~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)); {9084#(<= ~counter~0 2)} is VALID [2022-04-28 07:42:47,740 INFO L290 TraceCheckUtils]: 17: Hoare triple {9084#(<= ~counter~0 2)} ~cond := #in~cond; {9084#(<= ~counter~0 2)} is VALID [2022-04-28 07:42:47,741 INFO L290 TraceCheckUtils]: 18: Hoare triple {9084#(<= ~counter~0 2)} assume !(0 == ~cond); {9084#(<= ~counter~0 2)} is VALID [2022-04-28 07:42:47,741 INFO L290 TraceCheckUtils]: 19: Hoare triple {9084#(<= ~counter~0 2)} assume true; {9084#(<= ~counter~0 2)} is VALID [2022-04-28 07:42:47,741 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {9084#(<= ~counter~0 2)} {9084#(<= ~counter~0 2)} #51#return; {9084#(<= ~counter~0 2)} is VALID [2022-04-28 07:42:47,741 INFO L290 TraceCheckUtils]: 21: Hoare triple {9084#(<= ~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; {9084#(<= ~counter~0 2)} is VALID [2022-04-28 07:42:47,741 INFO L290 TraceCheckUtils]: 22: Hoare triple {9084#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9109#(<= ~counter~0 3)} is VALID [2022-04-28 07:42:47,742 INFO L290 TraceCheckUtils]: 23: Hoare triple {9109#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {9109#(<= ~counter~0 3)} is VALID [2022-04-28 07:42:47,742 INFO L272 TraceCheckUtils]: 24: Hoare triple {9109#(<= ~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)); {9109#(<= ~counter~0 3)} is VALID [2022-04-28 07:42:47,742 INFO L290 TraceCheckUtils]: 25: Hoare triple {9109#(<= ~counter~0 3)} ~cond := #in~cond; {9109#(<= ~counter~0 3)} is VALID [2022-04-28 07:42:47,742 INFO L290 TraceCheckUtils]: 26: Hoare triple {9109#(<= ~counter~0 3)} assume !(0 == ~cond); {9109#(<= ~counter~0 3)} is VALID [2022-04-28 07:42:47,743 INFO L290 TraceCheckUtils]: 27: Hoare triple {9109#(<= ~counter~0 3)} assume true; {9109#(<= ~counter~0 3)} is VALID [2022-04-28 07:42:47,743 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {9109#(<= ~counter~0 3)} {9109#(<= ~counter~0 3)} #51#return; {9109#(<= ~counter~0 3)} is VALID [2022-04-28 07:42:47,743 INFO L290 TraceCheckUtils]: 29: Hoare triple {9109#(<= ~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; {9109#(<= ~counter~0 3)} is VALID [2022-04-28 07:42:47,743 INFO L290 TraceCheckUtils]: 30: Hoare triple {9109#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9134#(<= ~counter~0 4)} is VALID [2022-04-28 07:42:47,744 INFO L290 TraceCheckUtils]: 31: Hoare triple {9134#(<= ~counter~0 4)} assume !!(#t~post5 < 50);havoc #t~post5; {9134#(<= ~counter~0 4)} is VALID [2022-04-28 07:42:47,744 INFO L272 TraceCheckUtils]: 32: Hoare triple {9134#(<= ~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)); {9134#(<= ~counter~0 4)} is VALID [2022-04-28 07:42:47,744 INFO L290 TraceCheckUtils]: 33: Hoare triple {9134#(<= ~counter~0 4)} ~cond := #in~cond; {9134#(<= ~counter~0 4)} is VALID [2022-04-28 07:42:47,744 INFO L290 TraceCheckUtils]: 34: Hoare triple {9134#(<= ~counter~0 4)} assume !(0 == ~cond); {9134#(<= ~counter~0 4)} is VALID [2022-04-28 07:42:47,744 INFO L290 TraceCheckUtils]: 35: Hoare triple {9134#(<= ~counter~0 4)} assume true; {9134#(<= ~counter~0 4)} is VALID [2022-04-28 07:42:47,745 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {9134#(<= ~counter~0 4)} {9134#(<= ~counter~0 4)} #51#return; {9134#(<= ~counter~0 4)} is VALID [2022-04-28 07:42:47,745 INFO L290 TraceCheckUtils]: 37: Hoare triple {9134#(<= ~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; {9134#(<= ~counter~0 4)} is VALID [2022-04-28 07:42:47,746 INFO L290 TraceCheckUtils]: 38: Hoare triple {9134#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9159#(<= ~counter~0 5)} is VALID [2022-04-28 07:42:47,746 INFO L290 TraceCheckUtils]: 39: Hoare triple {9159#(<= ~counter~0 5)} assume !!(#t~post5 < 50);havoc #t~post5; {9159#(<= ~counter~0 5)} is VALID [2022-04-28 07:42:47,746 INFO L272 TraceCheckUtils]: 40: Hoare triple {9159#(<= ~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)); {9159#(<= ~counter~0 5)} is VALID [2022-04-28 07:42:47,746 INFO L290 TraceCheckUtils]: 41: Hoare triple {9159#(<= ~counter~0 5)} ~cond := #in~cond; {9159#(<= ~counter~0 5)} is VALID [2022-04-28 07:42:47,746 INFO L290 TraceCheckUtils]: 42: Hoare triple {9159#(<= ~counter~0 5)} assume !(0 == ~cond); {9159#(<= ~counter~0 5)} is VALID [2022-04-28 07:42:47,747 INFO L290 TraceCheckUtils]: 43: Hoare triple {9159#(<= ~counter~0 5)} assume true; {9159#(<= ~counter~0 5)} is VALID [2022-04-28 07:42:47,747 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {9159#(<= ~counter~0 5)} {9159#(<= ~counter~0 5)} #51#return; {9159#(<= ~counter~0 5)} is VALID [2022-04-28 07:42:47,747 INFO L290 TraceCheckUtils]: 45: Hoare triple {9159#(<= ~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; {9159#(<= ~counter~0 5)} is VALID [2022-04-28 07:42:47,747 INFO L290 TraceCheckUtils]: 46: Hoare triple {9159#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9184#(<= ~counter~0 6)} is VALID [2022-04-28 07:42:47,748 INFO L290 TraceCheckUtils]: 47: Hoare triple {9184#(<= ~counter~0 6)} assume !!(#t~post5 < 50);havoc #t~post5; {9184#(<= ~counter~0 6)} is VALID [2022-04-28 07:42:47,748 INFO L272 TraceCheckUtils]: 48: Hoare triple {9184#(<= ~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)); {9184#(<= ~counter~0 6)} is VALID [2022-04-28 07:42:47,748 INFO L290 TraceCheckUtils]: 49: Hoare triple {9184#(<= ~counter~0 6)} ~cond := #in~cond; {9184#(<= ~counter~0 6)} is VALID [2022-04-28 07:42:47,748 INFO L290 TraceCheckUtils]: 50: Hoare triple {9184#(<= ~counter~0 6)} assume !(0 == ~cond); {9184#(<= ~counter~0 6)} is VALID [2022-04-28 07:42:47,748 INFO L290 TraceCheckUtils]: 51: Hoare triple {9184#(<= ~counter~0 6)} assume true; {9184#(<= ~counter~0 6)} is VALID [2022-04-28 07:42:47,749 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {9184#(<= ~counter~0 6)} {9184#(<= ~counter~0 6)} #51#return; {9184#(<= ~counter~0 6)} is VALID [2022-04-28 07:42:47,749 INFO L290 TraceCheckUtils]: 53: Hoare triple {9184#(<= ~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; {9184#(<= ~counter~0 6)} is VALID [2022-04-28 07:42:47,750 INFO L290 TraceCheckUtils]: 54: Hoare triple {9184#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9209#(<= ~counter~0 7)} is VALID [2022-04-28 07:42:47,750 INFO L290 TraceCheckUtils]: 55: Hoare triple {9209#(<= ~counter~0 7)} assume !!(#t~post5 < 50);havoc #t~post5; {9209#(<= ~counter~0 7)} is VALID [2022-04-28 07:42:47,750 INFO L272 TraceCheckUtils]: 56: Hoare triple {9209#(<= ~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)); {9209#(<= ~counter~0 7)} is VALID [2022-04-28 07:42:47,750 INFO L290 TraceCheckUtils]: 57: Hoare triple {9209#(<= ~counter~0 7)} ~cond := #in~cond; {9209#(<= ~counter~0 7)} is VALID [2022-04-28 07:42:47,751 INFO L290 TraceCheckUtils]: 58: Hoare triple {9209#(<= ~counter~0 7)} assume !(0 == ~cond); {9209#(<= ~counter~0 7)} is VALID [2022-04-28 07:42:47,751 INFO L290 TraceCheckUtils]: 59: Hoare triple {9209#(<= ~counter~0 7)} assume true; {9209#(<= ~counter~0 7)} is VALID [2022-04-28 07:42:47,751 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {9209#(<= ~counter~0 7)} {9209#(<= ~counter~0 7)} #51#return; {9209#(<= ~counter~0 7)} is VALID [2022-04-28 07:42:47,751 INFO L290 TraceCheckUtils]: 61: Hoare triple {9209#(<= ~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; {9209#(<= ~counter~0 7)} is VALID [2022-04-28 07:42:47,751 INFO L290 TraceCheckUtils]: 62: Hoare triple {9209#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9234#(<= ~counter~0 8)} is VALID [2022-04-28 07:42:47,752 INFO L290 TraceCheckUtils]: 63: Hoare triple {9234#(<= ~counter~0 8)} assume !!(#t~post5 < 50);havoc #t~post5; {9234#(<= ~counter~0 8)} is VALID [2022-04-28 07:42:47,752 INFO L272 TraceCheckUtils]: 64: Hoare triple {9234#(<= ~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)); {9234#(<= ~counter~0 8)} is VALID [2022-04-28 07:42:47,752 INFO L290 TraceCheckUtils]: 65: Hoare triple {9234#(<= ~counter~0 8)} ~cond := #in~cond; {9234#(<= ~counter~0 8)} is VALID [2022-04-28 07:42:47,752 INFO L290 TraceCheckUtils]: 66: Hoare triple {9234#(<= ~counter~0 8)} assume !(0 == ~cond); {9234#(<= ~counter~0 8)} is VALID [2022-04-28 07:42:47,752 INFO L290 TraceCheckUtils]: 67: Hoare triple {9234#(<= ~counter~0 8)} assume true; {9234#(<= ~counter~0 8)} is VALID [2022-04-28 07:42:47,753 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {9234#(<= ~counter~0 8)} {9234#(<= ~counter~0 8)} #51#return; {9234#(<= ~counter~0 8)} is VALID [2022-04-28 07:42:47,753 INFO L290 TraceCheckUtils]: 69: Hoare triple {9234#(<= ~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; {9234#(<= ~counter~0 8)} is VALID [2022-04-28 07:42:47,753 INFO L290 TraceCheckUtils]: 70: Hoare triple {9234#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9259#(<= |main_#t~post5| 8)} is VALID [2022-04-28 07:42:47,753 INFO L290 TraceCheckUtils]: 71: Hoare triple {9259#(<= |main_#t~post5| 8)} assume !(#t~post5 < 50);havoc #t~post5; {9036#false} is VALID [2022-04-28 07:42:47,753 INFO L272 TraceCheckUtils]: 72: Hoare triple {9036#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9036#false} is VALID [2022-04-28 07:42:47,754 INFO L290 TraceCheckUtils]: 73: Hoare triple {9036#false} ~cond := #in~cond; {9036#false} is VALID [2022-04-28 07:42:47,754 INFO L290 TraceCheckUtils]: 74: Hoare triple {9036#false} assume 0 == ~cond; {9036#false} is VALID [2022-04-28 07:42:47,754 INFO L290 TraceCheckUtils]: 75: Hoare triple {9036#false} assume !false; {9036#false} is VALID [2022-04-28 07:42:47,754 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 07:42:47,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:42:48,007 INFO L290 TraceCheckUtils]: 75: Hoare triple {9036#false} assume !false; {9036#false} is VALID [2022-04-28 07:42:48,007 INFO L290 TraceCheckUtils]: 74: Hoare triple {9036#false} assume 0 == ~cond; {9036#false} is VALID [2022-04-28 07:42:48,007 INFO L290 TraceCheckUtils]: 73: Hoare triple {9036#false} ~cond := #in~cond; {9036#false} is VALID [2022-04-28 07:42:48,007 INFO L272 TraceCheckUtils]: 72: Hoare triple {9036#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9036#false} is VALID [2022-04-28 07:42:48,008 INFO L290 TraceCheckUtils]: 71: Hoare triple {9287#(< |main_#t~post5| 50)} assume !(#t~post5 < 50);havoc #t~post5; {9036#false} is VALID [2022-04-28 07:42:48,008 INFO L290 TraceCheckUtils]: 70: Hoare triple {9291#(< ~counter~0 50)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9287#(< |main_#t~post5| 50)} is VALID [2022-04-28 07:42:48,008 INFO L290 TraceCheckUtils]: 69: Hoare triple {9291#(< ~counter~0 50)} 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; {9291#(< ~counter~0 50)} is VALID [2022-04-28 07:42:48,008 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {9035#true} {9291#(< ~counter~0 50)} #51#return; {9291#(< ~counter~0 50)} is VALID [2022-04-28 07:42:48,009 INFO L290 TraceCheckUtils]: 67: Hoare triple {9035#true} assume true; {9035#true} is VALID [2022-04-28 07:42:48,009 INFO L290 TraceCheckUtils]: 66: Hoare triple {9035#true} assume !(0 == ~cond); {9035#true} is VALID [2022-04-28 07:42:48,009 INFO L290 TraceCheckUtils]: 65: Hoare triple {9035#true} ~cond := #in~cond; {9035#true} is VALID [2022-04-28 07:42:48,009 INFO L272 TraceCheckUtils]: 64: Hoare triple {9291#(< ~counter~0 50)} 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)); {9035#true} is VALID [2022-04-28 07:42:48,009 INFO L290 TraceCheckUtils]: 63: Hoare triple {9291#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {9291#(< ~counter~0 50)} is VALID [2022-04-28 07:42:48,009 INFO L290 TraceCheckUtils]: 62: Hoare triple {9316#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9291#(< ~counter~0 50)} is VALID [2022-04-28 07:42:48,010 INFO L290 TraceCheckUtils]: 61: Hoare triple {9316#(< ~counter~0 49)} 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; {9316#(< ~counter~0 49)} is VALID [2022-04-28 07:42:48,010 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {9035#true} {9316#(< ~counter~0 49)} #51#return; {9316#(< ~counter~0 49)} is VALID [2022-04-28 07:42:48,010 INFO L290 TraceCheckUtils]: 59: Hoare triple {9035#true} assume true; {9035#true} is VALID [2022-04-28 07:42:48,010 INFO L290 TraceCheckUtils]: 58: Hoare triple {9035#true} assume !(0 == ~cond); {9035#true} is VALID [2022-04-28 07:42:48,010 INFO L290 TraceCheckUtils]: 57: Hoare triple {9035#true} ~cond := #in~cond; {9035#true} is VALID [2022-04-28 07:42:48,010 INFO L272 TraceCheckUtils]: 56: Hoare triple {9316#(< ~counter~0 49)} 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)); {9035#true} is VALID [2022-04-28 07:42:48,010 INFO L290 TraceCheckUtils]: 55: Hoare triple {9316#(< ~counter~0 49)} assume !!(#t~post5 < 50);havoc #t~post5; {9316#(< ~counter~0 49)} is VALID [2022-04-28 07:42:48,011 INFO L290 TraceCheckUtils]: 54: Hoare triple {9341#(< ~counter~0 48)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9316#(< ~counter~0 49)} is VALID [2022-04-28 07:42:48,011 INFO L290 TraceCheckUtils]: 53: Hoare triple {9341#(< ~counter~0 48)} 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; {9341#(< ~counter~0 48)} is VALID [2022-04-28 07:42:48,011 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {9035#true} {9341#(< ~counter~0 48)} #51#return; {9341#(< ~counter~0 48)} is VALID [2022-04-28 07:42:48,011 INFO L290 TraceCheckUtils]: 51: Hoare triple {9035#true} assume true; {9035#true} is VALID [2022-04-28 07:42:48,011 INFO L290 TraceCheckUtils]: 50: Hoare triple {9035#true} assume !(0 == ~cond); {9035#true} is VALID [2022-04-28 07:42:48,011 INFO L290 TraceCheckUtils]: 49: Hoare triple {9035#true} ~cond := #in~cond; {9035#true} is VALID [2022-04-28 07:42:48,012 INFO L272 TraceCheckUtils]: 48: Hoare triple {9341#(< ~counter~0 48)} 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)); {9035#true} is VALID [2022-04-28 07:42:48,012 INFO L290 TraceCheckUtils]: 47: Hoare triple {9341#(< ~counter~0 48)} assume !!(#t~post5 < 50);havoc #t~post5; {9341#(< ~counter~0 48)} is VALID [2022-04-28 07:42:48,012 INFO L290 TraceCheckUtils]: 46: Hoare triple {9366#(< ~counter~0 47)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9341#(< ~counter~0 48)} is VALID [2022-04-28 07:42:48,012 INFO L290 TraceCheckUtils]: 45: Hoare triple {9366#(< ~counter~0 47)} 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; {9366#(< ~counter~0 47)} is VALID [2022-04-28 07:42:48,013 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {9035#true} {9366#(< ~counter~0 47)} #51#return; {9366#(< ~counter~0 47)} is VALID [2022-04-28 07:42:48,013 INFO L290 TraceCheckUtils]: 43: Hoare triple {9035#true} assume true; {9035#true} is VALID [2022-04-28 07:42:48,013 INFO L290 TraceCheckUtils]: 42: Hoare triple {9035#true} assume !(0 == ~cond); {9035#true} is VALID [2022-04-28 07:42:48,013 INFO L290 TraceCheckUtils]: 41: Hoare triple {9035#true} ~cond := #in~cond; {9035#true} is VALID [2022-04-28 07:42:48,013 INFO L272 TraceCheckUtils]: 40: Hoare triple {9366#(< ~counter~0 47)} 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)); {9035#true} is VALID [2022-04-28 07:42:48,013 INFO L290 TraceCheckUtils]: 39: Hoare triple {9366#(< ~counter~0 47)} assume !!(#t~post5 < 50);havoc #t~post5; {9366#(< ~counter~0 47)} is VALID [2022-04-28 07:42:48,013 INFO L290 TraceCheckUtils]: 38: Hoare triple {9391#(< ~counter~0 46)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9366#(< ~counter~0 47)} is VALID [2022-04-28 07:42:48,014 INFO L290 TraceCheckUtils]: 37: Hoare triple {9391#(< ~counter~0 46)} 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; {9391#(< ~counter~0 46)} is VALID [2022-04-28 07:42:48,014 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {9035#true} {9391#(< ~counter~0 46)} #51#return; {9391#(< ~counter~0 46)} is VALID [2022-04-28 07:42:48,014 INFO L290 TraceCheckUtils]: 35: Hoare triple {9035#true} assume true; {9035#true} is VALID [2022-04-28 07:42:48,014 INFO L290 TraceCheckUtils]: 34: Hoare triple {9035#true} assume !(0 == ~cond); {9035#true} is VALID [2022-04-28 07:42:48,014 INFO L290 TraceCheckUtils]: 33: Hoare triple {9035#true} ~cond := #in~cond; {9035#true} is VALID [2022-04-28 07:42:48,014 INFO L272 TraceCheckUtils]: 32: Hoare triple {9391#(< ~counter~0 46)} 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)); {9035#true} is VALID [2022-04-28 07:42:48,014 INFO L290 TraceCheckUtils]: 31: Hoare triple {9391#(< ~counter~0 46)} assume !!(#t~post5 < 50);havoc #t~post5; {9391#(< ~counter~0 46)} is VALID [2022-04-28 07:42:48,015 INFO L290 TraceCheckUtils]: 30: Hoare triple {9416#(< ~counter~0 45)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9391#(< ~counter~0 46)} is VALID [2022-04-28 07:42:48,015 INFO L290 TraceCheckUtils]: 29: Hoare triple {9416#(< ~counter~0 45)} 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; {9416#(< ~counter~0 45)} is VALID [2022-04-28 07:42:48,015 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {9035#true} {9416#(< ~counter~0 45)} #51#return; {9416#(< ~counter~0 45)} is VALID [2022-04-28 07:42:48,015 INFO L290 TraceCheckUtils]: 27: Hoare triple {9035#true} assume true; {9035#true} is VALID [2022-04-28 07:42:48,015 INFO L290 TraceCheckUtils]: 26: Hoare triple {9035#true} assume !(0 == ~cond); {9035#true} is VALID [2022-04-28 07:42:48,015 INFO L290 TraceCheckUtils]: 25: Hoare triple {9035#true} ~cond := #in~cond; {9035#true} is VALID [2022-04-28 07:42:48,016 INFO L272 TraceCheckUtils]: 24: Hoare triple {9416#(< ~counter~0 45)} 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)); {9035#true} is VALID [2022-04-28 07:42:48,016 INFO L290 TraceCheckUtils]: 23: Hoare triple {9416#(< ~counter~0 45)} assume !!(#t~post5 < 50);havoc #t~post5; {9416#(< ~counter~0 45)} is VALID [2022-04-28 07:42:48,016 INFO L290 TraceCheckUtils]: 22: Hoare triple {9441#(< ~counter~0 44)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9416#(< ~counter~0 45)} is VALID [2022-04-28 07:42:48,016 INFO L290 TraceCheckUtils]: 21: Hoare triple {9441#(< ~counter~0 44)} 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; {9441#(< ~counter~0 44)} is VALID [2022-04-28 07:42:48,017 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {9035#true} {9441#(< ~counter~0 44)} #51#return; {9441#(< ~counter~0 44)} is VALID [2022-04-28 07:42:48,017 INFO L290 TraceCheckUtils]: 19: Hoare triple {9035#true} assume true; {9035#true} is VALID [2022-04-28 07:42:48,017 INFO L290 TraceCheckUtils]: 18: Hoare triple {9035#true} assume !(0 == ~cond); {9035#true} is VALID [2022-04-28 07:42:48,017 INFO L290 TraceCheckUtils]: 17: Hoare triple {9035#true} ~cond := #in~cond; {9035#true} is VALID [2022-04-28 07:42:48,017 INFO L272 TraceCheckUtils]: 16: Hoare triple {9441#(< ~counter~0 44)} 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)); {9035#true} is VALID [2022-04-28 07:42:48,017 INFO L290 TraceCheckUtils]: 15: Hoare triple {9441#(< ~counter~0 44)} assume !!(#t~post5 < 50);havoc #t~post5; {9441#(< ~counter~0 44)} is VALID [2022-04-28 07:42:48,017 INFO L290 TraceCheckUtils]: 14: Hoare triple {9466#(< ~counter~0 43)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9441#(< ~counter~0 44)} is VALID [2022-04-28 07:42:48,018 INFO L290 TraceCheckUtils]: 13: Hoare triple {9466#(< ~counter~0 43)} 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; {9466#(< ~counter~0 43)} is VALID [2022-04-28 07:42:48,018 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {9035#true} {9466#(< ~counter~0 43)} #51#return; {9466#(< ~counter~0 43)} is VALID [2022-04-28 07:42:48,018 INFO L290 TraceCheckUtils]: 11: Hoare triple {9035#true} assume true; {9035#true} is VALID [2022-04-28 07:42:48,018 INFO L290 TraceCheckUtils]: 10: Hoare triple {9035#true} assume !(0 == ~cond); {9035#true} is VALID [2022-04-28 07:42:48,018 INFO L290 TraceCheckUtils]: 9: Hoare triple {9035#true} ~cond := #in~cond; {9035#true} is VALID [2022-04-28 07:42:48,018 INFO L272 TraceCheckUtils]: 8: Hoare triple {9466#(< ~counter~0 43)} 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)); {9035#true} is VALID [2022-04-28 07:42:48,018 INFO L290 TraceCheckUtils]: 7: Hoare triple {9466#(< ~counter~0 43)} assume !!(#t~post5 < 50);havoc #t~post5; {9466#(< ~counter~0 43)} is VALID [2022-04-28 07:42:48,019 INFO L290 TraceCheckUtils]: 6: Hoare triple {9491#(< ~counter~0 42)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9466#(< ~counter~0 43)} is VALID [2022-04-28 07:42:48,019 INFO L290 TraceCheckUtils]: 5: Hoare triple {9491#(< ~counter~0 42)} 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; {9491#(< ~counter~0 42)} is VALID [2022-04-28 07:42:48,019 INFO L272 TraceCheckUtils]: 4: Hoare triple {9491#(< ~counter~0 42)} call #t~ret6 := main(); {9491#(< ~counter~0 42)} is VALID [2022-04-28 07:42:48,019 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9491#(< ~counter~0 42)} {9035#true} #57#return; {9491#(< ~counter~0 42)} is VALID [2022-04-28 07:42:48,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {9491#(< ~counter~0 42)} assume true; {9491#(< ~counter~0 42)} is VALID [2022-04-28 07:42:48,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {9035#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; {9491#(< ~counter~0 42)} is VALID [2022-04-28 07:42:48,020 INFO L272 TraceCheckUtils]: 0: Hoare triple {9035#true} call ULTIMATE.init(); {9035#true} is VALID [2022-04-28 07:42:48,021 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 07:42:48,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:42:48,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023620564] [2022-04-28 07:42:48,021 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:42:48,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122379634] [2022-04-28 07:42:48,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122379634] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:42:48,021 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:42:48,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-04-28 07:42:48,021 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:42:48,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [377450870] [2022-04-28 07:42:48,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [377450870] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:42:48,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:42:48,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 07:42:48,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011612250] [2022-04-28 07:42:48,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:42:48,022 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 07:42:48,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:42:48,022 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 07:42:48,053 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 07:42:48,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 07:42:48,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:48,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 07:42:48,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2022-04-28 07:42:48,055 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 07:42:48,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:48,243 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2022-04-28 07:42:48,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 07:42:48,244 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 07:42:48,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:42:48,244 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 07:42:48,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 90 transitions. [2022-04-28 07:42:48,258 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 07:42:48,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 90 transitions. [2022-04-28 07:42:48,263 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 90 transitions. [2022-04-28 07:42:48,300 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 07:42:48,301 INFO L225 Difference]: With dead ends: 90 [2022-04-28 07:42:48,301 INFO L226 Difference]: Without dead ends: 85 [2022-04-28 07:42:48,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=363, Invalid=507, Unknown=0, NotChecked=0, Total=870 [2022-04-28 07:42:48,302 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 4 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:42:48,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 107 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:42:48,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-28 07:42:48,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-04-28 07:42:48,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:42:48,362 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 07:42:48,362 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 07:42:48,362 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 07:42:48,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:48,363 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2022-04-28 07:42:48,363 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2022-04-28 07:42:48,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:48,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:48,364 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 07:42:48,364 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 07:42:48,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:48,365 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2022-04-28 07:42:48,365 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2022-04-28 07:42:48,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:48,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:48,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:42:48,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:42:48,365 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 07:42:48,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2022-04-28 07:42:48,366 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 76 [2022-04-28 07:42:48,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:42:48,366 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2022-04-28 07:42:48,367 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 07:42:48,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 86 transitions. [2022-04-28 07:42:48,467 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 07:42:48,468 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2022-04-28 07:42:48,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-28 07:42:48,468 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:42:48,468 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 07:42:48,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-04-28 07:42:48,668 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 07:42:48,669 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:42:48,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:42:48,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1500110401, now seen corresponding path program 15 times [2022-04-28 07:42:48,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:48,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1174108546] [2022-04-28 07:42:48,733 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:42:48,733 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:42:48,734 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:42:48,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1500110401, now seen corresponding path program 16 times [2022-04-28 07:42:48,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:42:48,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158932537] [2022-04-28 07:42:48,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:42:48,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:42:48,742 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:42:48,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [486245230] [2022-04-28 07:42:48,743 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:42:48,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:42:48,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:42:48,743 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 07:42:48,744 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 07:42:49,353 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:42:49,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:42:49,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-28 07:42:49,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:42:49,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:42:49,699 INFO L272 TraceCheckUtils]: 0: Hoare triple {10048#true} call ULTIMATE.init(); {10048#true} is VALID [2022-04-28 07:42:49,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {10048#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; {10048#true} is VALID [2022-04-28 07:42:49,700 INFO L290 TraceCheckUtils]: 2: Hoare triple {10048#true} assume true; {10048#true} is VALID [2022-04-28 07:42:49,700 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10048#true} {10048#true} #57#return; {10048#true} is VALID [2022-04-28 07:42:49,700 INFO L272 TraceCheckUtils]: 4: Hoare triple {10048#true} call #t~ret6 := main(); {10048#true} is VALID [2022-04-28 07:42:49,700 INFO L290 TraceCheckUtils]: 5: Hoare triple {10048#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; {10068#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:42:49,700 INFO L290 TraceCheckUtils]: 6: Hoare triple {10068#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10068#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:42:49,701 INFO L290 TraceCheckUtils]: 7: Hoare triple {10068#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {10068#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:42:49,701 INFO L272 TraceCheckUtils]: 8: Hoare triple {10068#(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)); {10048#true} is VALID [2022-04-28 07:42:49,701 INFO L290 TraceCheckUtils]: 9: Hoare triple {10048#true} ~cond := #in~cond; {10048#true} is VALID [2022-04-28 07:42:49,701 INFO L290 TraceCheckUtils]: 10: Hoare triple {10048#true} assume !(0 == ~cond); {10048#true} is VALID [2022-04-28 07:42:49,701 INFO L290 TraceCheckUtils]: 11: Hoare triple {10048#true} assume true; {10048#true} is VALID [2022-04-28 07:42:49,701 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10048#true} {10068#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {10068#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:42:49,702 INFO L290 TraceCheckUtils]: 13: Hoare triple {10068#(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; {10093#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:42:49,702 INFO L290 TraceCheckUtils]: 14: Hoare triple {10093#(and (= main_~y~0 1) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10093#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:42:49,702 INFO L290 TraceCheckUtils]: 15: Hoare triple {10093#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {10093#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:42:49,702 INFO L272 TraceCheckUtils]: 16: Hoare triple {10093#(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)); {10048#true} is VALID [2022-04-28 07:42:49,702 INFO L290 TraceCheckUtils]: 17: Hoare triple {10048#true} ~cond := #in~cond; {10048#true} is VALID [2022-04-28 07:42:49,702 INFO L290 TraceCheckUtils]: 18: Hoare triple {10048#true} assume !(0 == ~cond); {10048#true} is VALID [2022-04-28 07:42:49,702 INFO L290 TraceCheckUtils]: 19: Hoare triple {10048#true} assume true; {10048#true} is VALID [2022-04-28 07:42:49,703 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {10048#true} {10093#(and (= main_~y~0 1) (= main_~c~0 1))} #51#return; {10093#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:42:49,703 INFO L290 TraceCheckUtils]: 21: Hoare triple {10093#(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; {10118#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 07:42:49,703 INFO L290 TraceCheckUtils]: 22: Hoare triple {10118#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10118#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 07:42:49,704 INFO L290 TraceCheckUtils]: 23: Hoare triple {10118#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(#t~post5 < 50);havoc #t~post5; {10118#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 07:42:49,704 INFO L272 TraceCheckUtils]: 24: Hoare triple {10118#(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)); {10048#true} is VALID [2022-04-28 07:42:49,704 INFO L290 TraceCheckUtils]: 25: Hoare triple {10048#true} ~cond := #in~cond; {10048#true} is VALID [2022-04-28 07:42:49,704 INFO L290 TraceCheckUtils]: 26: Hoare triple {10048#true} assume !(0 == ~cond); {10048#true} is VALID [2022-04-28 07:42:49,704 INFO L290 TraceCheckUtils]: 27: Hoare triple {10048#true} assume true; {10048#true} is VALID [2022-04-28 07:42:49,704 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {10048#true} {10118#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #51#return; {10118#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 07:42:49,705 INFO L290 TraceCheckUtils]: 29: Hoare triple {10118#(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; {10143#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 07:42:49,705 INFO L290 TraceCheckUtils]: 30: Hoare triple {10143#(and (= main_~y~0 3) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10143#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 07:42:49,705 INFO L290 TraceCheckUtils]: 31: Hoare triple {10143#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(#t~post5 < 50);havoc #t~post5; {10143#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 07:42:49,705 INFO L272 TraceCheckUtils]: 32: Hoare triple {10143#(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)); {10048#true} is VALID [2022-04-28 07:42:49,705 INFO L290 TraceCheckUtils]: 33: Hoare triple {10048#true} ~cond := #in~cond; {10048#true} is VALID [2022-04-28 07:42:49,705 INFO L290 TraceCheckUtils]: 34: Hoare triple {10048#true} assume !(0 == ~cond); {10048#true} is VALID [2022-04-28 07:42:49,705 INFO L290 TraceCheckUtils]: 35: Hoare triple {10048#true} assume true; {10048#true} is VALID [2022-04-28 07:42:49,706 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {10048#true} {10143#(and (= main_~y~0 3) (= main_~c~0 3))} #51#return; {10143#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 07:42:49,706 INFO L290 TraceCheckUtils]: 37: Hoare triple {10143#(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; {10168#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-28 07:42:49,706 INFO L290 TraceCheckUtils]: 38: Hoare triple {10168#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10168#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-28 07:42:49,706 INFO L290 TraceCheckUtils]: 39: Hoare triple {10168#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !!(#t~post5 < 50);havoc #t~post5; {10168#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-28 07:42:49,706 INFO L272 TraceCheckUtils]: 40: Hoare triple {10168#(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)); {10048#true} is VALID [2022-04-28 07:42:49,707 INFO L290 TraceCheckUtils]: 41: Hoare triple {10048#true} ~cond := #in~cond; {10048#true} is VALID [2022-04-28 07:42:49,707 INFO L290 TraceCheckUtils]: 42: Hoare triple {10048#true} assume !(0 == ~cond); {10048#true} is VALID [2022-04-28 07:42:49,707 INFO L290 TraceCheckUtils]: 43: Hoare triple {10048#true} assume true; {10048#true} is VALID [2022-04-28 07:42:49,707 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {10048#true} {10168#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #51#return; {10168#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-28 07:42:49,707 INFO L290 TraceCheckUtils]: 45: Hoare triple {10168#(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; {10193#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:42:49,708 INFO L290 TraceCheckUtils]: 46: Hoare triple {10193#(and (= 5 main_~c~0) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10193#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:42:49,708 INFO L290 TraceCheckUtils]: 47: Hoare triple {10193#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(#t~post5 < 50);havoc #t~post5; {10193#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:42:49,708 INFO L272 TraceCheckUtils]: 48: Hoare triple {10193#(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)); {10048#true} is VALID [2022-04-28 07:42:49,708 INFO L290 TraceCheckUtils]: 49: Hoare triple {10048#true} ~cond := #in~cond; {10048#true} is VALID [2022-04-28 07:42:49,708 INFO L290 TraceCheckUtils]: 50: Hoare triple {10048#true} assume !(0 == ~cond); {10048#true} is VALID [2022-04-28 07:42:49,708 INFO L290 TraceCheckUtils]: 51: Hoare triple {10048#true} assume true; {10048#true} is VALID [2022-04-28 07:42:49,708 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10048#true} {10193#(and (= 5 main_~c~0) (= 5 main_~y~0))} #51#return; {10193#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 07:42:49,717 INFO L290 TraceCheckUtils]: 53: Hoare triple {10193#(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; {10218#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 07:42:49,717 INFO L290 TraceCheckUtils]: 54: Hoare triple {10218#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10218#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 07:42:49,717 INFO L290 TraceCheckUtils]: 55: Hoare triple {10218#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !!(#t~post5 < 50);havoc #t~post5; {10218#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 07:42:49,717 INFO L272 TraceCheckUtils]: 56: Hoare triple {10218#(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)); {10048#true} is VALID [2022-04-28 07:42:49,717 INFO L290 TraceCheckUtils]: 57: Hoare triple {10048#true} ~cond := #in~cond; {10048#true} is VALID [2022-04-28 07:42:49,718 INFO L290 TraceCheckUtils]: 58: Hoare triple {10048#true} assume !(0 == ~cond); {10048#true} is VALID [2022-04-28 07:42:49,718 INFO L290 TraceCheckUtils]: 59: Hoare triple {10048#true} assume true; {10048#true} is VALID [2022-04-28 07:42:49,718 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {10048#true} {10218#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #51#return; {10218#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 07:42:49,719 INFO L290 TraceCheckUtils]: 61: Hoare triple {10218#(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; {10243#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:42:49,719 INFO L290 TraceCheckUtils]: 62: Hoare triple {10243#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10243#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:42:49,719 INFO L290 TraceCheckUtils]: 63: Hoare triple {10243#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 50);havoc #t~post5; {10243#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:42:49,719 INFO L272 TraceCheckUtils]: 64: Hoare triple {10243#(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)); {10048#true} is VALID [2022-04-28 07:42:49,720 INFO L290 TraceCheckUtils]: 65: Hoare triple {10048#true} ~cond := #in~cond; {10048#true} is VALID [2022-04-28 07:42:49,720 INFO L290 TraceCheckUtils]: 66: Hoare triple {10048#true} assume !(0 == ~cond); {10048#true} is VALID [2022-04-28 07:42:49,720 INFO L290 TraceCheckUtils]: 67: Hoare triple {10048#true} assume true; {10048#true} is VALID [2022-04-28 07:42:49,720 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10048#true} {10243#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} #51#return; {10243#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 07:42:49,721 INFO L290 TraceCheckUtils]: 69: Hoare triple {10243#(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; {10268#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} is VALID [2022-04-28 07:42:49,721 INFO L290 TraceCheckUtils]: 70: Hoare triple {10268#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10268#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} is VALID [2022-04-28 07:42:49,721 INFO L290 TraceCheckUtils]: 71: Hoare triple {10268#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} assume !!(#t~post5 < 50);havoc #t~post5; {10268#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} is VALID [2022-04-28 07:42:49,721 INFO L272 TraceCheckUtils]: 72: Hoare triple {10268#(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)); {10048#true} is VALID [2022-04-28 07:42:49,722 INFO L290 TraceCheckUtils]: 73: Hoare triple {10048#true} ~cond := #in~cond; {10048#true} is VALID [2022-04-28 07:42:49,722 INFO L290 TraceCheckUtils]: 74: Hoare triple {10048#true} assume !(0 == ~cond); {10048#true} is VALID [2022-04-28 07:42:49,722 INFO L290 TraceCheckUtils]: 75: Hoare triple {10048#true} assume true; {10048#true} is VALID [2022-04-28 07:42:49,722 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {10048#true} {10268#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} #51#return; {10268#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} is VALID [2022-04-28 07:42:49,723 INFO L290 TraceCheckUtils]: 77: Hoare triple {10268#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} assume !(~c~0 < ~k~0); {10293#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~k~0 8))} is VALID [2022-04-28 07:42:49,724 INFO L272 TraceCheckUtils]: 78: Hoare triple {10293#(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)); {10297#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:42:49,724 INFO L290 TraceCheckUtils]: 79: Hoare triple {10297#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10301#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:42:49,724 INFO L290 TraceCheckUtils]: 80: Hoare triple {10301#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10049#false} is VALID [2022-04-28 07:42:49,724 INFO L290 TraceCheckUtils]: 81: Hoare triple {10049#false} assume !false; {10049#false} is VALID [2022-04-28 07:42:49,725 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 07:42:49,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:42:50,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:42:50,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158932537] [2022-04-28 07:42:50,067 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:42:50,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486245230] [2022-04-28 07:42:50,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486245230] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:42:50,067 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:42:50,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-28 07:42:50,068 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:42:50,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1174108546] [2022-04-28 07:42:50,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1174108546] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:42:50,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:42:50,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 07:42:50,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953384159] [2022-04-28 07:42:50,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:42:50,068 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 07:42:50,068 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:42:50,069 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 07:42:50,108 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 07:42:50,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 07:42:50,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:50,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 07:42:50,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-28 07:42:50,109 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 07:42:50,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:50,931 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2022-04-28 07:42:50,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 07:42:50,931 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 07:42:50,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:42:50,932 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 07:42:50,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 69 transitions. [2022-04-28 07:42:50,933 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 07:42:50,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 69 transitions. [2022-04-28 07:42:50,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 69 transitions. [2022-04-28 07:42:50,981 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 07:42:50,982 INFO L225 Difference]: With dead ends: 92 [2022-04-28 07:42:50,982 INFO L226 Difference]: Without dead ends: 87 [2022-04-28 07:42:50,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-04-28 07:42:50,982 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 07:42:50,984 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 07:42:50,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-04-28 07:42:51,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-04-28 07:42:51,084 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:42:51,084 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 07:42:51,084 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 07:42:51,085 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 07:42:51,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:51,086 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2022-04-28 07:42:51,086 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2022-04-28 07:42:51,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:51,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:51,086 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 07:42:51,086 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 07:42:51,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:42:51,087 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2022-04-28 07:42:51,087 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2022-04-28 07:42:51,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:42:51,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:42:51,088 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:42:51,088 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:42:51,088 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 07:42:51,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2022-04-28 07:42:51,089 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 82 [2022-04-28 07:42:51,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:42:51,089 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2022-04-28 07:42:51,089 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 07:42:51,089 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 89 transitions. [2022-04-28 07:42:51,185 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 07:42:51,186 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2022-04-28 07:42:51,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-28 07:42:51,186 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:42:51,186 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 07:42:51,191 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 07:42:51,386 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 07:42:51,387 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:42:51,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:42:51,387 INFO L85 PathProgramCache]: Analyzing trace with hash -2095421916, now seen corresponding path program 17 times [2022-04-28 07:42:51,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:42:51,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1030548883] [2022-04-28 07:42:51,462 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:42:51,462 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:42:51,462 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:42:51,462 INFO L85 PathProgramCache]: Analyzing trace with hash -2095421916, now seen corresponding path program 18 times [2022-04-28 07:42:51,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:42:51,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918887714] [2022-04-28 07:42:51,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:42:51,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:42:51,472 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:42:51,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1226860570] [2022-04-28 07:42:51,472 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:42:51,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:42:51,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:42:51,473 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 07:42:51,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process