/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/ps5-ll_valuebound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 07:48:21,082 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 07:48:21,084 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 07:48:21,114 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 07:48:21,114 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 07:48:21,115 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 07:48:21,117 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 07:48:21,118 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 07:48:21,120 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 07:48:21,121 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 07:48:21,121 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 07:48:21,122 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 07:48:21,123 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 07:48:21,124 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 07:48:21,125 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 07:48:21,126 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 07:48:21,126 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 07:48:21,127 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 07:48:21,128 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 07:48:21,131 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 07:48:21,134 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 07:48:21,135 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 07:48:21,135 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 07:48:21,136 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 07:48:21,137 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 07:48:21,139 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 07:48:21,139 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 07:48:21,140 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 07:48:21,140 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 07:48:21,141 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 07:48:21,141 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 07:48:21,141 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 07:48:21,142 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 07:48:21,143 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 07:48:21,143 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 07:48:21,144 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 07:48:21,144 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 07:48:21,145 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 07:48:21,145 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 07:48:21,145 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 07:48:21,146 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 07:48:21,146 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 07:48:21,147 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 07:48:21,155 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 07:48:21,155 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 07:48:21,156 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 07:48:21,156 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 07:48:21,157 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 07:48:21,157 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 07:48:21,157 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 07:48:21,157 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 07:48:21,157 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 07:48:21,157 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 07:48:21,158 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 07:48:21,158 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 07:48:21,158 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 07:48:21,158 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 07:48:21,158 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 07:48:21,159 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 07:48:21,159 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 07:48:21,159 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 07:48:21,159 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 07:48:21,159 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 07:48:21,159 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 07:48:21,160 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 07:48:21,160 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 07:48:21,160 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 07:48:21,160 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 07:48:21,160 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 07:48:21,376 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 07:48:21,404 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 07:48:21,406 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 07:48:21,407 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 07:48:21,408 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 07:48:21,409 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_valuebound10.c [2022-04-08 07:48:21,472 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a3705421/91101c388d654d84941d4084213c8cfa/FLAGbd39cb5cc [2022-04-08 07:48:21,828 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 07:48:21,831 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_valuebound10.c [2022-04-08 07:48:21,835 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a3705421/91101c388d654d84941d4084213c8cfa/FLAGbd39cb5cc [2022-04-08 07:48:22,243 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a3705421/91101c388d654d84941d4084213c8cfa [2022-04-08 07:48:22,245 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 07:48:22,246 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 07:48:22,252 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 07:48:22,252 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 07:48:22,255 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 07:48:22,256 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 07:48:22" (1/1) ... [2022-04-08 07:48:22,257 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3df9c915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:48:22, skipping insertion in model container [2022-04-08 07:48:22,258 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 07:48:22" (1/1) ... [2022-04-08 07:48:22,264 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 07:48:22,284 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 07:48:22,471 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/ps5-ll_valuebound10.c[458,471] [2022-04-08 07:48:22,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 07:48:22,495 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 07:48:22,505 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/ps5-ll_valuebound10.c[458,471] [2022-04-08 07:48:22,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 07:48:22,530 INFO L208 MainTranslator]: Completed translation [2022-04-08 07:48:22,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:48:22 WrapperNode [2022-04-08 07:48:22,531 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 07:48:22,532 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 07:48:22,532 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 07:48:22,532 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 07:48:22,543 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:48:22" (1/1) ... [2022-04-08 07:48:22,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:48:22" (1/1) ... [2022-04-08 07:48:22,550 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:48:22" (1/1) ... [2022-04-08 07:48:22,551 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:48:22" (1/1) ... [2022-04-08 07:48:22,561 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:48:22" (1/1) ... [2022-04-08 07:48:22,565 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:48:22" (1/1) ... [2022-04-08 07:48:22,566 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:48:22" (1/1) ... [2022-04-08 07:48:22,568 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 07:48:22,568 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 07:48:22,568 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 07:48:22,569 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 07:48:22,570 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:48:22" (1/1) ... [2022-04-08 07:48:22,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 07:48:22,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:48:22,596 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 07:48:22,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 07:48:22,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 07:48:22,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 07:48:22,627 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 07:48:22,627 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 07:48:22,627 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 07:48:22,627 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 07:48:22,628 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 07:48:22,628 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 07:48:22,628 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 07:48:22,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 07:48:22,628 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-08 07:48:22,628 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 07:48:22,629 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 07:48:22,629 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 07:48:22,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 07:48:22,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 07:48:22,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 07:48:22,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 07:48:22,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 07:48:22,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 07:48:22,672 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 07:48:22,673 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 07:48:22,816 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 07:48:22,837 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 07:48:22,837 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 07:48:22,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 07:48:22 BoogieIcfgContainer [2022-04-08 07:48:22,845 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 07:48:22,846 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 07:48:22,846 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 07:48:22,861 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 07:48:22,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 07:48:22" (1/3) ... [2022-04-08 07:48:22,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67e730a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 07:48:22, skipping insertion in model container [2022-04-08 07:48:22,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:48:22" (2/3) ... [2022-04-08 07:48:22,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67e730a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 07:48:22, skipping insertion in model container [2022-04-08 07:48:22,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 07:48:22" (3/3) ... [2022-04-08 07:48:22,863 INFO L111 eAbstractionObserver]: Analyzing ICFG ps5-ll_valuebound10.c [2022-04-08 07:48:22,869 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 07:48:22,869 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 07:48:22,905 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 07:48:22,911 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 07:48:22,911 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 07:48:22,927 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:48:22,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 07:48:22,933 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:48:22,933 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:48:22,934 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:48:22,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:48:22,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1098891495, now seen corresponding path program 1 times [2022-04-08 07:48:22,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:48:22,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1522606860] [2022-04-08 07:48:22,955 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:48:22,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1098891495, now seen corresponding path program 2 times [2022-04-08 07:48:22,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:48:22,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810455472] [2022-04-08 07:48:22,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:48:22,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:48:23,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:48:23,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 07:48:23,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:48:23,150 INFO L290 TraceCheckUtils]: 0: Hoare triple {45#(and (= |#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); {32#true} is VALID [2022-04-08 07:48:23,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-08 07:48:23,150 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #63#return; {32#true} is VALID [2022-04-08 07:48:23,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 07:48:23,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:48:23,167 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-08 07:48:23,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-08 07:48:23,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-08 07:48:23,170 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-08 07:48:23,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 07:48:23,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:48:23,182 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-08 07:48:23,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-08 07:48:23,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-08 07:48:23,183 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID [2022-04-08 07:48:23,185 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 07:48:23,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#(and (= |#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); {32#true} is VALID [2022-04-08 07:48:23,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-08 07:48:23,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #63#return; {32#true} is VALID [2022-04-08 07:48:23,186 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret5 := main(); {32#true} is VALID [2022-04-08 07:48:23,187 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#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; {32#true} is VALID [2022-04-08 07:48:23,187 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {32#true} is VALID [2022-04-08 07:48:23,187 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-08 07:48:23,188 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-08 07:48:23,188 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-08 07:48:23,189 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-08 07:48:23,190 INFO L272 TraceCheckUtils]: 11: Hoare triple {33#false} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {32#true} is VALID [2022-04-08 07:48:23,190 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-08 07:48:23,191 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-08 07:48:23,191 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-08 07:48:23,192 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID [2022-04-08 07:48:23,192 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {33#false} is VALID [2022-04-08 07:48:23,192 INFO L290 TraceCheckUtils]: 17: Hoare triple {33#false} assume false; {33#false} is VALID [2022-04-08 07:48:23,192 INFO L272 TraceCheckUtils]: 18: Hoare triple {33#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {33#false} is VALID [2022-04-08 07:48:23,193 INFO L290 TraceCheckUtils]: 19: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-08 07:48:23,193 INFO L290 TraceCheckUtils]: 20: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-08 07:48:23,193 INFO L290 TraceCheckUtils]: 21: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-08 07:48:23,194 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 07:48:23,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:48:23,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810455472] [2022-04-08 07:48:23,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810455472] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:48:23,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:48:23,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 07:48:23,199 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:48:23,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1522606860] [2022-04-08 07:48:23,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1522606860] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:48:23,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:48:23,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 07:48:23,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183565824] [2022-04-08 07:48:23,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:48:23,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-08 07:48:23,210 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:48:23,213 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 07:48:23,251 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:48:23,252 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 07:48:23,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:48:23,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 07:48:23,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 07:48:23,279 INFO L87 Difference]: Start difference. First operand has 29 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 07:48:23,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:48:23,430 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-08 07:48:23,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 07:48:23,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-08 07:48:23,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:48:23,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 07:48:23,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-04-08 07:48:23,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 07:48:23,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-04-08 07:48:23,447 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 69 transitions. [2022-04-08 07:48:23,523 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:48:23,530 INFO L225 Difference]: With dead ends: 51 [2022-04-08 07:48:23,531 INFO L226 Difference]: Without dead ends: 24 [2022-04-08 07:48:23,533 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 07:48:23,537 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:48:23,539 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 30 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 07:48:23,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-08 07:48:23,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-08 07:48:23,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:48:23,564 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:48:23,565 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:48:23,566 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:48:23,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:48:23,575 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-08 07:48:23,575 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-08 07:48:23,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:48:23,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:48:23,576 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 24 states. [2022-04-08 07:48:23,577 INFO L87 Difference]: Start difference. First operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 24 states. [2022-04-08 07:48:23,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:48:23,581 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-08 07:48:23,581 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-08 07:48:23,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:48:23,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:48:23,582 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:48:23,582 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:48:23,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:48:23,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-08 07:48:23,593 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 22 [2022-04-08 07:48:23,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:48:23,593 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-08 07:48:23,594 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 07:48:23,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 27 transitions. [2022-04-08 07:48:23,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:48:23,641 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-08 07:48:23,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 07:48:23,642 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:48:23,643 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:48:23,643 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 07:48:23,644 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:48:23,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:48:23,646 INFO L85 PathProgramCache]: Analyzing trace with hash 769620075, now seen corresponding path program 1 times [2022-04-08 07:48:23,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:48:23,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2050573776] [2022-04-08 07:48:23,652 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:48:23,652 INFO L85 PathProgramCache]: Analyzing trace with hash 769620075, now seen corresponding path program 2 times [2022-04-08 07:48:23,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:48:23,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735950124] [2022-04-08 07:48:23,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:48:23,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:48:23,689 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:48:23,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2081355246] [2022-04-08 07:48:23,690 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:48:23,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:48:23,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:48:23,696 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:48:23,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 07:48:23,746 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 07:48:23,746 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:48:23,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 07:48:23,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:48:23,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:48:23,964 INFO L272 TraceCheckUtils]: 0: Hoare triple {246#true} call ULTIMATE.init(); {246#true} is VALID [2022-04-08 07:48:23,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {246#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); {246#true} is VALID [2022-04-08 07:48:23,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-08 07:48:23,965 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {246#true} {246#true} #63#return; {246#true} is VALID [2022-04-08 07:48:23,966 INFO L272 TraceCheckUtils]: 4: Hoare triple {246#true} call #t~ret5 := main(); {246#true} is VALID [2022-04-08 07:48:23,966 INFO L290 TraceCheckUtils]: 5: Hoare triple {246#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; {246#true} is VALID [2022-04-08 07:48:23,967 INFO L272 TraceCheckUtils]: 6: Hoare triple {246#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {246#true} is VALID [2022-04-08 07:48:23,967 INFO L290 TraceCheckUtils]: 7: Hoare triple {246#true} ~cond := #in~cond; {246#true} is VALID [2022-04-08 07:48:23,968 INFO L290 TraceCheckUtils]: 8: Hoare triple {246#true} assume !(0 == ~cond); {246#true} is VALID [2022-04-08 07:48:23,969 INFO L290 TraceCheckUtils]: 9: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-08 07:48:23,970 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {246#true} {246#true} #53#return; {246#true} is VALID [2022-04-08 07:48:23,971 INFO L272 TraceCheckUtils]: 11: Hoare triple {246#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {246#true} is VALID [2022-04-08 07:48:23,971 INFO L290 TraceCheckUtils]: 12: Hoare triple {246#true} ~cond := #in~cond; {246#true} is VALID [2022-04-08 07:48:23,972 INFO L290 TraceCheckUtils]: 13: Hoare triple {246#true} assume !(0 == ~cond); {246#true} is VALID [2022-04-08 07:48:23,974 INFO L290 TraceCheckUtils]: 14: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-08 07:48:23,978 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {246#true} {246#true} #55#return; {246#true} is VALID [2022-04-08 07:48:23,979 INFO L290 TraceCheckUtils]: 16: Hoare triple {246#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {299#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:48:23,981 INFO L290 TraceCheckUtils]: 17: Hoare triple {299#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {299#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:48:23,983 INFO L272 TraceCheckUtils]: 18: Hoare triple {299#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {306#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:48:23,984 INFO L290 TraceCheckUtils]: 19: Hoare triple {306#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {310#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:48:23,984 INFO L290 TraceCheckUtils]: 20: Hoare triple {310#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {247#false} is VALID [2022-04-08 07:48:23,984 INFO L290 TraceCheckUtils]: 21: Hoare triple {247#false} assume !false; {247#false} is VALID [2022-04-08 07:48:23,985 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 07:48:23,985 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 07:48:23,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:48:23,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735950124] [2022-04-08 07:48:23,986 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:48:23,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081355246] [2022-04-08 07:48:23,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081355246] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:48:23,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:48:23,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 07:48:23,988 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:48:23,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2050573776] [2022-04-08 07:48:23,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2050573776] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:48:23,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:48:23,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 07:48:23,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621803393] [2022-04-08 07:48:23,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:48:23,990 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-08 07:48:23,991 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:48:23,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 07:48:24,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:48:24,008 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 07:48:24,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:48:24,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 07:48:24,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 07:48:24,009 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 07:48:24,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:48:24,173 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-08 07:48:24,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 07:48:24,174 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-08 07:48:24,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:48:24,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 07:48:24,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-08 07:48:24,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 07:48:24,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-08 07:48:24,180 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-08 07:48:24,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:48:24,219 INFO L225 Difference]: With dead ends: 35 [2022-04-08 07:48:24,219 INFO L226 Difference]: Without dead ends: 31 [2022-04-08 07:48:24,220 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 07:48:24,221 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:48:24,221 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 85 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 07:48:24,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-08 07:48:24,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-08 07:48:24,232 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:48:24,233 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:48:24,233 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:48:24,234 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:48:24,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:48:24,237 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-08 07:48:24,237 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-08 07:48:24,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:48:24,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:48:24,238 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 31 states. [2022-04-08 07:48:24,238 INFO L87 Difference]: Start difference. First operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 31 states. [2022-04-08 07:48:24,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:48:24,241 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-08 07:48:24,241 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-08 07:48:24,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:48:24,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:48:24,242 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:48:24,242 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:48:24,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:48:24,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-04-08 07:48:24,244 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 22 [2022-04-08 07:48:24,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:48:24,245 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-04-08 07:48:24,245 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 07:48:24,245 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 34 transitions. [2022-04-08 07:48:24,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:48:24,284 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-08 07:48:24,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 07:48:24,285 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:48:24,285 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:48:24,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-08 07:48:24,499 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:48:24,500 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:48:24,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:48:24,500 INFO L85 PathProgramCache]: Analyzing trace with hash 645812411, now seen corresponding path program 1 times [2022-04-08 07:48:24,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:48:24,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [315656675] [2022-04-08 07:48:24,501 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:48:24,502 INFO L85 PathProgramCache]: Analyzing trace with hash 645812411, now seen corresponding path program 2 times [2022-04-08 07:48:24,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:48:24,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315077609] [2022-04-08 07:48:24,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:48:24,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:48:24,526 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:48:24,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [552712833] [2022-04-08 07:48:24,527 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:48:24,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:48:24,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:48:24,528 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:48:24,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 07:48:24,578 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:48:24,578 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:48:24,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 07:48:24,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:48:24,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:48:24,752 INFO L272 TraceCheckUtils]: 0: Hoare triple {512#true} call ULTIMATE.init(); {512#true} is VALID [2022-04-08 07:48:24,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {512#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); {512#true} is VALID [2022-04-08 07:48:24,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-08 07:48:24,752 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {512#true} {512#true} #63#return; {512#true} is VALID [2022-04-08 07:48:24,752 INFO L272 TraceCheckUtils]: 4: Hoare triple {512#true} call #t~ret5 := main(); {512#true} is VALID [2022-04-08 07:48:24,753 INFO L290 TraceCheckUtils]: 5: Hoare triple {512#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; {512#true} is VALID [2022-04-08 07:48:24,753 INFO L272 TraceCheckUtils]: 6: Hoare triple {512#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {512#true} is VALID [2022-04-08 07:48:24,753 INFO L290 TraceCheckUtils]: 7: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-08 07:48:24,753 INFO L290 TraceCheckUtils]: 8: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-08 07:48:24,753 INFO L290 TraceCheckUtils]: 9: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-08 07:48:24,754 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {512#true} {512#true} #53#return; {512#true} is VALID [2022-04-08 07:48:24,754 INFO L272 TraceCheckUtils]: 11: Hoare triple {512#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {512#true} is VALID [2022-04-08 07:48:24,754 INFO L290 TraceCheckUtils]: 12: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-08 07:48:24,754 INFO L290 TraceCheckUtils]: 13: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-08 07:48:24,754 INFO L290 TraceCheckUtils]: 14: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-08 07:48:24,754 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {512#true} {512#true} #55#return; {512#true} is VALID [2022-04-08 07:48:24,755 INFO L290 TraceCheckUtils]: 16: Hoare triple {512#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {565#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:48:24,756 INFO L290 TraceCheckUtils]: 17: Hoare triple {565#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {565#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:48:24,756 INFO L272 TraceCheckUtils]: 18: Hoare triple {565#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {512#true} is VALID [2022-04-08 07:48:24,756 INFO L290 TraceCheckUtils]: 19: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-08 07:48:24,756 INFO L290 TraceCheckUtils]: 20: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-08 07:48:24,756 INFO L290 TraceCheckUtils]: 21: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-08 07:48:24,757 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {512#true} {565#(and (= main_~x~0 0) (= main_~y~0 0))} #57#return; {565#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:48:24,758 INFO L290 TraceCheckUtils]: 23: Hoare triple {565#(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 * ~y~0 + ~x~0; {587#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-08 07:48:24,758 INFO L290 TraceCheckUtils]: 24: Hoare triple {587#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} assume !false; {587#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-08 07:48:24,759 INFO L272 TraceCheckUtils]: 25: Hoare triple {587#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {594#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:48:24,760 INFO L290 TraceCheckUtils]: 26: Hoare triple {594#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {598#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:48:24,760 INFO L290 TraceCheckUtils]: 27: Hoare triple {598#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {513#false} is VALID [2022-04-08 07:48:24,761 INFO L290 TraceCheckUtils]: 28: Hoare triple {513#false} assume !false; {513#false} is VALID [2022-04-08 07:48:24,761 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 07:48:24,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:48:27,073 INFO L290 TraceCheckUtils]: 28: Hoare triple {513#false} assume !false; {513#false} is VALID [2022-04-08 07:48:27,074 INFO L290 TraceCheckUtils]: 27: Hoare triple {598#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {513#false} is VALID [2022-04-08 07:48:27,074 INFO L290 TraceCheckUtils]: 26: Hoare triple {594#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {598#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:48:27,075 INFO L272 TraceCheckUtils]: 25: Hoare triple {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {594#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:48:27,076 INFO L290 TraceCheckUtils]: 24: Hoare triple {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} assume !false; {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-08 07:48:29,108 WARN L290 TraceCheckUtils]: 23: Hoare triple {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is UNKNOWN [2022-04-08 07:48:29,109 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {512#true} {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} #57#return; {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-08 07:48:29,109 INFO L290 TraceCheckUtils]: 21: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-08 07:48:29,109 INFO L290 TraceCheckUtils]: 20: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-08 07:48:29,109 INFO L290 TraceCheckUtils]: 19: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-08 07:48:29,109 INFO L272 TraceCheckUtils]: 18: Hoare triple {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {512#true} is VALID [2022-04-08 07:48:29,110 INFO L290 TraceCheckUtils]: 17: Hoare triple {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} assume !false; {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-08 07:48:29,112 INFO L290 TraceCheckUtils]: 16: Hoare triple {512#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-08 07:48:29,112 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {512#true} {512#true} #55#return; {512#true} is VALID [2022-04-08 07:48:29,112 INFO L290 TraceCheckUtils]: 14: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-08 07:48:29,112 INFO L290 TraceCheckUtils]: 13: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-08 07:48:29,112 INFO L290 TraceCheckUtils]: 12: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-08 07:48:29,112 INFO L272 TraceCheckUtils]: 11: Hoare triple {512#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {512#true} is VALID [2022-04-08 07:48:29,113 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {512#true} {512#true} #53#return; {512#true} is VALID [2022-04-08 07:48:29,113 INFO L290 TraceCheckUtils]: 9: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-08 07:48:29,113 INFO L290 TraceCheckUtils]: 8: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-08 07:48:29,113 INFO L290 TraceCheckUtils]: 7: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-08 07:48:29,113 INFO L272 TraceCheckUtils]: 6: Hoare triple {512#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {512#true} is VALID [2022-04-08 07:48:29,113 INFO L290 TraceCheckUtils]: 5: Hoare triple {512#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; {512#true} is VALID [2022-04-08 07:48:29,114 INFO L272 TraceCheckUtils]: 4: Hoare triple {512#true} call #t~ret5 := main(); {512#true} is VALID [2022-04-08 07:48:29,114 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {512#true} {512#true} #63#return; {512#true} is VALID [2022-04-08 07:48:29,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-08 07:48:29,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {512#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); {512#true} is VALID [2022-04-08 07:48:29,114 INFO L272 TraceCheckUtils]: 0: Hoare triple {512#true} call ULTIMATE.init(); {512#true} is VALID [2022-04-08 07:48:29,115 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 07:48:29,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:48:29,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315077609] [2022-04-08 07:48:29,115 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:48:29,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552712833] [2022-04-08 07:48:29,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552712833] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 07:48:29,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:48:29,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-08 07:48:29,116 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:48:29,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [315656675] [2022-04-08 07:48:29,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [315656675] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:48:29,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:48:29,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 07:48:29,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7755118] [2022-04-08 07:48:29,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:48:29,117 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-08 07:48:29,117 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:48:29,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 07:48:29,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:48:29,605 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 07:48:29,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:48:29,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 07:48:29,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=28, Unknown=1, NotChecked=0, Total=42 [2022-04-08 07:48:29,606 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 07:48:29,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:48:29,775 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-08 07:48:29,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 07:48:29,775 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-08 07:48:29,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:48:29,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 07:48:29,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-08 07:48:29,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 07:48:29,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-08 07:48:29,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-08 07:48:30,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:48:30,232 INFO L225 Difference]: With dead ends: 37 [2022-04-08 07:48:30,232 INFO L226 Difference]: Without dead ends: 33 [2022-04-08 07:48:30,232 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=17, Invalid=38, Unknown=1, NotChecked=0, Total=56 [2022-04-08 07:48:30,233 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:48:30,234 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 75 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 07:48:30,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-08 07:48:30,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-08 07:48:30,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:48:30,251 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:48:30,251 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:48:30,251 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:48:30,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:48:30,253 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-08 07:48:30,253 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-08 07:48:30,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:48:30,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:48:30,254 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-04-08 07:48:30,255 INFO L87 Difference]: Start difference. First operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-04-08 07:48:30,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:48:30,256 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-08 07:48:30,257 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-08 07:48:30,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:48:30,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:48:30,257 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:48:30,257 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:48:30,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:48:30,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-04-08 07:48:30,259 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 29 [2022-04-08 07:48:30,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:48:30,260 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-04-08 07:48:30,260 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 07:48:30,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 35 transitions. [2022-04-08 07:48:30,451 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:48:30,451 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-08 07:48:30,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-08 07:48:30,452 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:48:30,452 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:48:30,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 07:48:30,655 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-08 07:48:30,656 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:48:30,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:48:30,656 INFO L85 PathProgramCache]: Analyzing trace with hash 463554397, now seen corresponding path program 1 times [2022-04-08 07:48:30,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:48:30,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1294129830] [2022-04-08 07:48:30,657 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:48:30,657 INFO L85 PathProgramCache]: Analyzing trace with hash 463554397, now seen corresponding path program 2 times [2022-04-08 07:48:30,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:48:30,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412908369] [2022-04-08 07:48:30,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:48:30,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:48:30,694 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:48:30,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [940865076] [2022-04-08 07:48:30,695 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:48:30,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:48:30,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:48:30,700 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:48:30,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 07:48:30,743 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:48:30,743 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:48:30,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 07:48:30,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:48:30,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:48:31,132 INFO L272 TraceCheckUtils]: 0: Hoare triple {900#true} call ULTIMATE.init(); {900#true} is VALID [2022-04-08 07:48:31,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {900#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); {900#true} is VALID [2022-04-08 07:48:31,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-08 07:48:31,133 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {900#true} {900#true} #63#return; {900#true} is VALID [2022-04-08 07:48:31,134 INFO L272 TraceCheckUtils]: 4: Hoare triple {900#true} call #t~ret5 := main(); {900#true} is VALID [2022-04-08 07:48:31,135 INFO L290 TraceCheckUtils]: 5: Hoare triple {900#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; {900#true} is VALID [2022-04-08 07:48:31,135 INFO L272 TraceCheckUtils]: 6: Hoare triple {900#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {900#true} is VALID [2022-04-08 07:48:31,136 INFO L290 TraceCheckUtils]: 7: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-08 07:48:31,136 INFO L290 TraceCheckUtils]: 8: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-08 07:48:31,144 INFO L290 TraceCheckUtils]: 9: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-08 07:48:31,145 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {900#true} {900#true} #53#return; {900#true} is VALID [2022-04-08 07:48:31,145 INFO L272 TraceCheckUtils]: 11: Hoare triple {900#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {900#true} is VALID [2022-04-08 07:48:31,145 INFO L290 TraceCheckUtils]: 12: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-08 07:48:31,145 INFO L290 TraceCheckUtils]: 13: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-08 07:48:31,146 INFO L290 TraceCheckUtils]: 14: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-08 07:48:31,146 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {900#true} {900#true} #55#return; {900#true} is VALID [2022-04-08 07:48:31,147 INFO L290 TraceCheckUtils]: 16: Hoare triple {900#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {953#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:48:31,147 INFO L290 TraceCheckUtils]: 17: Hoare triple {953#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {953#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:48:31,147 INFO L272 TraceCheckUtils]: 18: Hoare triple {953#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {900#true} is VALID [2022-04-08 07:48:31,147 INFO L290 TraceCheckUtils]: 19: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-08 07:48:31,148 INFO L290 TraceCheckUtils]: 20: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-08 07:48:31,148 INFO L290 TraceCheckUtils]: 21: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-08 07:48:31,148 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {900#true} {953#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {953#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:48:31,149 INFO L290 TraceCheckUtils]: 23: Hoare triple {953#(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 * ~y~0 + ~x~0; {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 07:48:31,149 INFO L290 TraceCheckUtils]: 24: Hoare triple {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !false; {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 07:48:31,150 INFO L272 TraceCheckUtils]: 25: Hoare triple {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {900#true} is VALID [2022-04-08 07:48:31,150 INFO L290 TraceCheckUtils]: 26: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-08 07:48:31,150 INFO L290 TraceCheckUtils]: 27: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-08 07:48:31,151 INFO L290 TraceCheckUtils]: 28: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-08 07:48:31,151 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {900#true} {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #57#return; {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 07:48:31,152 INFO L290 TraceCheckUtils]: 30: Hoare triple {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-08 07:48:31,152 INFO L272 TraceCheckUtils]: 31: Hoare triple {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {900#true} is VALID [2022-04-08 07:48:31,153 INFO L290 TraceCheckUtils]: 32: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-08 07:48:31,153 INFO L290 TraceCheckUtils]: 33: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-08 07:48:31,153 INFO L290 TraceCheckUtils]: 34: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-08 07:48:31,153 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {900#true} {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} #59#return; {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-08 07:48:31,154 INFO L272 TraceCheckUtils]: 36: Hoare triple {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1016#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:48:31,155 INFO L290 TraceCheckUtils]: 37: Hoare triple {1016#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1020#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:48:31,155 INFO L290 TraceCheckUtils]: 38: Hoare triple {1020#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {901#false} is VALID [2022-04-08 07:48:31,155 INFO L290 TraceCheckUtils]: 39: Hoare triple {901#false} assume !false; {901#false} is VALID [2022-04-08 07:48:31,156 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-08 07:48:31,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:48:31,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:48:31,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412908369] [2022-04-08 07:48:31,499 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:48:31,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940865076] [2022-04-08 07:48:31,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940865076] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:48:31,499 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:48:31,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-08 07:48:31,500 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:48:31,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1294129830] [2022-04-08 07:48:31,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1294129830] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:48:31,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:48:31,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 07:48:31,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005382583] [2022-04-08 07:48:31,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:48:31,504 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-04-08 07:48:31,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:48:31,506 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 07:48:31,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:48:31,541 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 07:48:31,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:48:31,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 07:48:31,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-08 07:48:31,543 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 07:48:31,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:48:31,863 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-08 07:48:31,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 07:48:31,864 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-04-08 07:48:31,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:48:31,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 07:48:31,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-08 07:48:31,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 07:48:31,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-08 07:48:31,868 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 42 transitions. [2022-04-08 07:48:31,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:48:31,911 INFO L225 Difference]: With dead ends: 42 [2022-04-08 07:48:31,911 INFO L226 Difference]: Without dead ends: 36 [2022-04-08 07:48:31,913 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-08 07:48:31,914 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 07:48:31,914 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 135 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 07:48:31,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-08 07:48:31,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-08 07:48:31,938 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:48:31,939 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:48:31,939 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:48:31,941 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:48:31,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:48:31,946 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-08 07:48:31,946 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-08 07:48:31,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:48:31,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:48:31,950 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-08 07:48:31,952 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-08 07:48:31,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:48:31,960 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-08 07:48:31,960 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-08 07:48:31,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:48:31,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:48:31,961 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:48:31,961 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:48:31,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:48:31,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-04-08 07:48:31,963 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 40 [2022-04-08 07:48:31,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:48:31,963 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-04-08 07:48:31,963 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 07:48:31,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 39 transitions. [2022-04-08 07:48:32,424 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:48:32,424 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-08 07:48:32,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-08 07:48:32,425 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:48:32,425 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:48:32,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-08 07:48:32,627 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:48:32,628 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:48:32,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:48:32,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1886956461, now seen corresponding path program 3 times [2022-04-08 07:48:32,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:48:32,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1957149796] [2022-04-08 07:48:32,629 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:48:32,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1886956461, now seen corresponding path program 4 times [2022-04-08 07:48:32,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:48:32,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276162355] [2022-04-08 07:48:32,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:48:32,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:48:32,651 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:48:32,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [541572875] [2022-04-08 07:48:32,652 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 07:48:32,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:48:32,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:48:32,657 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:48:32,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-08 07:48:32,697 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 07:48:32,697 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:48:32,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 07:48:32,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:48:32,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:48:33,137 INFO L272 TraceCheckUtils]: 0: Hoare triple {1315#true} call ULTIMATE.init(); {1315#true} is VALID [2022-04-08 07:48:33,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {1315#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); {1315#true} is VALID [2022-04-08 07:48:33,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-08 07:48:33,138 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1315#true} {1315#true} #63#return; {1315#true} is VALID [2022-04-08 07:48:33,138 INFO L272 TraceCheckUtils]: 4: Hoare triple {1315#true} call #t~ret5 := main(); {1315#true} is VALID [2022-04-08 07:48:33,138 INFO L290 TraceCheckUtils]: 5: Hoare triple {1315#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; {1315#true} is VALID [2022-04-08 07:48:33,138 INFO L272 TraceCheckUtils]: 6: Hoare triple {1315#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {1315#true} is VALID [2022-04-08 07:48:33,139 INFO L290 TraceCheckUtils]: 7: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-08 07:48:33,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-08 07:48:33,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-08 07:48:33,139 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1315#true} {1315#true} #53#return; {1315#true} is VALID [2022-04-08 07:48:33,139 INFO L272 TraceCheckUtils]: 11: Hoare triple {1315#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1315#true} is VALID [2022-04-08 07:48:33,139 INFO L290 TraceCheckUtils]: 12: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-08 07:48:33,140 INFO L290 TraceCheckUtils]: 13: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-08 07:48:33,140 INFO L290 TraceCheckUtils]: 14: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-08 07:48:33,140 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1315#true} {1315#true} #55#return; {1315#true} is VALID [2022-04-08 07:48:33,141 INFO L290 TraceCheckUtils]: 16: Hoare triple {1315#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1368#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:48:33,141 INFO L290 TraceCheckUtils]: 17: Hoare triple {1368#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1368#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:48:33,141 INFO L272 TraceCheckUtils]: 18: Hoare triple {1368#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1315#true} is VALID [2022-04-08 07:48:33,141 INFO L290 TraceCheckUtils]: 19: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-08 07:48:33,142 INFO L290 TraceCheckUtils]: 20: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-08 07:48:33,142 INFO L290 TraceCheckUtils]: 21: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-08 07:48:33,143 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1315#true} {1368#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {1368#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:48:33,144 INFO L290 TraceCheckUtils]: 23: Hoare triple {1368#(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 * ~y~0 + ~x~0; {1390#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-08 07:48:33,146 INFO L290 TraceCheckUtils]: 24: Hoare triple {1390#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} assume !false; {1390#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-08 07:48:33,146 INFO L272 TraceCheckUtils]: 25: Hoare triple {1390#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1315#true} is VALID [2022-04-08 07:48:33,147 INFO L290 TraceCheckUtils]: 26: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-08 07:48:33,147 INFO L290 TraceCheckUtils]: 27: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-08 07:48:33,147 INFO L290 TraceCheckUtils]: 28: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-08 07:48:33,148 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1315#true} {1390#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} #57#return; {1390#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-08 07:48:33,148 INFO L290 TraceCheckUtils]: 30: Hoare triple {1390#(and (= main_~y~0 1) (< 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 * ~y~0 + ~x~0; {1412#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-08 07:48:33,149 INFO L290 TraceCheckUtils]: 31: Hoare triple {1412#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !false; {1412#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-08 07:48:33,149 INFO L272 TraceCheckUtils]: 32: Hoare triple {1412#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1315#true} is VALID [2022-04-08 07:48:33,149 INFO L290 TraceCheckUtils]: 33: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-08 07:48:33,149 INFO L290 TraceCheckUtils]: 34: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-08 07:48:33,150 INFO L290 TraceCheckUtils]: 35: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-08 07:48:33,154 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1315#true} {1412#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} #57#return; {1412#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-08 07:48:33,155 INFO L290 TraceCheckUtils]: 37: Hoare triple {1412#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {1434#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-08 07:48:33,155 INFO L272 TraceCheckUtils]: 38: Hoare triple {1434#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1315#true} is VALID [2022-04-08 07:48:33,155 INFO L290 TraceCheckUtils]: 39: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-08 07:48:33,155 INFO L290 TraceCheckUtils]: 40: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-08 07:48:33,155 INFO L290 TraceCheckUtils]: 41: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-08 07:48:33,156 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1315#true} {1434#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} #59#return; {1434#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-08 07:48:33,157 INFO L272 TraceCheckUtils]: 43: Hoare triple {1434#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1453#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:48:33,158 INFO L290 TraceCheckUtils]: 44: Hoare triple {1453#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1457#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:48:33,158 INFO L290 TraceCheckUtils]: 45: Hoare triple {1457#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1316#false} is VALID [2022-04-08 07:48:33,158 INFO L290 TraceCheckUtils]: 46: Hoare triple {1316#false} assume !false; {1316#false} is VALID [2022-04-08 07:48:33,158 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 07:48:33,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:48:33,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:48:33,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276162355] [2022-04-08 07:48:33,650 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:48:33,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541572875] [2022-04-08 07:48:33,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541572875] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:48:33,650 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:48:33,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-08 07:48:33,651 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:48:33,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1957149796] [2022-04-08 07:48:33,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1957149796] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:48:33,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:48:33,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 07:48:33,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776080810] [2022-04-08 07:48:33,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:48:33,652 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 47 [2022-04-08 07:48:33,652 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:48:33,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-08 07:48:33,686 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:48:33,686 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 07:48:33,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:48:33,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 07:48:33,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-08 07:48:33,687 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-08 07:48:34,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:48:34,070 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-08 07:48:34,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 07:48:34,070 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 47 [2022-04-08 07:48:34,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:48:34,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-08 07:48:34,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-08 07:48:34,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-08 07:48:34,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-08 07:48:34,074 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 46 transitions. [2022-04-08 07:48:34,123 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:48:34,125 INFO L225 Difference]: With dead ends: 45 [2022-04-08 07:48:34,125 INFO L226 Difference]: Without dead ends: 39 [2022-04-08 07:48:34,125 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-08 07:48:34,126 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 2 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 07:48:34,126 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 164 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 07:48:34,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-08 07:48:34,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-08 07:48:34,147 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:48:34,148 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:48:34,148 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:48:34,148 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:48:34,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:48:34,150 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-08 07:48:34,150 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-08 07:48:34,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:48:34,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:48:34,151 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 39 states. [2022-04-08 07:48:34,151 INFO L87 Difference]: Start difference. First operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 39 states. [2022-04-08 07:48:34,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:48:34,153 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-08 07:48:34,153 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-08 07:48:34,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:48:34,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:48:34,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:48:34,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:48:34,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:48:34,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-04-08 07:48:34,155 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 47 [2022-04-08 07:48:34,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:48:34,156 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-04-08 07:48:34,156 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-08 07:48:34,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 43 transitions. [2022-04-08 07:48:34,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:48:34,483 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-08 07:48:34,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-08 07:48:34,486 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:48:34,486 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:48:34,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-08 07:48:34,699 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:48:34,700 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:48:34,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:48:34,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1213805219, now seen corresponding path program 5 times [2022-04-08 07:48:34,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:48:34,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [231039538] [2022-04-08 07:48:34,701 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:48:34,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1213805219, now seen corresponding path program 6 times [2022-04-08 07:48:34,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:48:34,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603985879] [2022-04-08 07:48:34,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:48:34,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:48:34,734 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:48:34,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1946879740] [2022-04-08 07:48:34,734 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 07:48:34,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:48:34,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:48:34,736 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:48:34,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-08 07:48:35,074 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 07:48:35,074 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:48:35,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-08 07:48:35,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:48:35,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:48:35,514 INFO L272 TraceCheckUtils]: 0: Hoare triple {1792#true} call ULTIMATE.init(); {1792#true} is VALID [2022-04-08 07:48:35,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {1792#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); {1792#true} is VALID [2022-04-08 07:48:35,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-04-08 07:48:35,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1792#true} {1792#true} #63#return; {1792#true} is VALID [2022-04-08 07:48:35,514 INFO L272 TraceCheckUtils]: 4: Hoare triple {1792#true} call #t~ret5 := main(); {1792#true} is VALID [2022-04-08 07:48:35,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {1792#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; {1792#true} is VALID [2022-04-08 07:48:35,514 INFO L272 TraceCheckUtils]: 6: Hoare triple {1792#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {1792#true} is VALID [2022-04-08 07:48:35,515 INFO L290 TraceCheckUtils]: 7: Hoare triple {1792#true} ~cond := #in~cond; {1792#true} is VALID [2022-04-08 07:48:35,515 INFO L290 TraceCheckUtils]: 8: Hoare triple {1792#true} assume !(0 == ~cond); {1792#true} is VALID [2022-04-08 07:48:35,515 INFO L290 TraceCheckUtils]: 9: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-04-08 07:48:35,515 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1792#true} {1792#true} #53#return; {1792#true} is VALID [2022-04-08 07:48:35,515 INFO L272 TraceCheckUtils]: 11: Hoare triple {1792#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1792#true} is VALID [2022-04-08 07:48:35,515 INFO L290 TraceCheckUtils]: 12: Hoare triple {1792#true} ~cond := #in~cond; {1792#true} is VALID [2022-04-08 07:48:35,515 INFO L290 TraceCheckUtils]: 13: Hoare triple {1792#true} assume !(0 == ~cond); {1792#true} is VALID [2022-04-08 07:48:35,515 INFO L290 TraceCheckUtils]: 14: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-04-08 07:48:35,516 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1792#true} {1792#true} #55#return; {1792#true} is VALID [2022-04-08 07:48:35,516 INFO L290 TraceCheckUtils]: 16: Hoare triple {1792#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1845#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:48:35,516 INFO L290 TraceCheckUtils]: 17: Hoare triple {1845#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1845#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:48:35,517 INFO L272 TraceCheckUtils]: 18: Hoare triple {1845#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1792#true} is VALID [2022-04-08 07:48:35,517 INFO L290 TraceCheckUtils]: 19: Hoare triple {1792#true} ~cond := #in~cond; {1792#true} is VALID [2022-04-08 07:48:35,517 INFO L290 TraceCheckUtils]: 20: Hoare triple {1792#true} assume !(0 == ~cond); {1792#true} is VALID [2022-04-08 07:48:35,517 INFO L290 TraceCheckUtils]: 21: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-04-08 07:48:35,518 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1792#true} {1845#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {1845#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:48:35,518 INFO L290 TraceCheckUtils]: 23: Hoare triple {1845#(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 * ~y~0 + ~x~0; {1867#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:48:35,519 INFO L290 TraceCheckUtils]: 24: Hoare triple {1867#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {1867#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:48:35,519 INFO L272 TraceCheckUtils]: 25: Hoare triple {1867#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1792#true} is VALID [2022-04-08 07:48:35,519 INFO L290 TraceCheckUtils]: 26: Hoare triple {1792#true} ~cond := #in~cond; {1792#true} is VALID [2022-04-08 07:48:35,519 INFO L290 TraceCheckUtils]: 27: Hoare triple {1792#true} assume !(0 == ~cond); {1792#true} is VALID [2022-04-08 07:48:35,519 INFO L290 TraceCheckUtils]: 28: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-04-08 07:48:35,520 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1792#true} {1867#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #57#return; {1867#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:48:35,521 INFO L290 TraceCheckUtils]: 30: Hoare triple {1867#(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 * ~y~0 + ~x~0; {1889#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 07:48:35,521 INFO L290 TraceCheckUtils]: 31: Hoare triple {1889#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {1889#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 07:48:35,521 INFO L272 TraceCheckUtils]: 32: Hoare triple {1889#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1792#true} is VALID [2022-04-08 07:48:35,521 INFO L290 TraceCheckUtils]: 33: Hoare triple {1792#true} ~cond := #in~cond; {1792#true} is VALID [2022-04-08 07:48:35,522 INFO L290 TraceCheckUtils]: 34: Hoare triple {1792#true} assume !(0 == ~cond); {1792#true} is VALID [2022-04-08 07:48:35,522 INFO L290 TraceCheckUtils]: 35: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-04-08 07:48:35,522 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1792#true} {1889#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #57#return; {1889#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 07:48:35,523 INFO L290 TraceCheckUtils]: 37: Hoare triple {1889#(and (= (+ (- 2) main_~y~0) 0) (= 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 * ~y~0 + ~x~0; {1911#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-08 07:48:35,524 INFO L290 TraceCheckUtils]: 38: Hoare triple {1911#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} assume !false; {1911#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-08 07:48:35,524 INFO L272 TraceCheckUtils]: 39: Hoare triple {1911#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1792#true} is VALID [2022-04-08 07:48:35,524 INFO L290 TraceCheckUtils]: 40: Hoare triple {1792#true} ~cond := #in~cond; {1792#true} is VALID [2022-04-08 07:48:35,524 INFO L290 TraceCheckUtils]: 41: Hoare triple {1792#true} assume !(0 == ~cond); {1792#true} is VALID [2022-04-08 07:48:35,524 INFO L290 TraceCheckUtils]: 42: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-04-08 07:48:35,525 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1792#true} {1911#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} #57#return; {1911#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-08 07:48:35,526 INFO L290 TraceCheckUtils]: 44: Hoare triple {1911#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {1933#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-08 07:48:35,526 INFO L272 TraceCheckUtils]: 45: Hoare triple {1933#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1792#true} is VALID [2022-04-08 07:48:35,526 INFO L290 TraceCheckUtils]: 46: Hoare triple {1792#true} ~cond := #in~cond; {1792#true} is VALID [2022-04-08 07:48:35,526 INFO L290 TraceCheckUtils]: 47: Hoare triple {1792#true} assume !(0 == ~cond); {1792#true} is VALID [2022-04-08 07:48:35,526 INFO L290 TraceCheckUtils]: 48: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-04-08 07:48:35,527 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {1792#true} {1933#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} #59#return; {1933#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-08 07:48:35,528 INFO L272 TraceCheckUtils]: 50: Hoare triple {1933#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1952#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:48:35,528 INFO L290 TraceCheckUtils]: 51: Hoare triple {1952#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1956#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:48:35,529 INFO L290 TraceCheckUtils]: 52: Hoare triple {1956#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1793#false} is VALID [2022-04-08 07:48:35,529 INFO L290 TraceCheckUtils]: 53: Hoare triple {1793#false} assume !false; {1793#false} is VALID [2022-04-08 07:48:35,529 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-08 07:48:35,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:48:35,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:48:35,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603985879] [2022-04-08 07:48:35,870 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:48:35,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946879740] [2022-04-08 07:48:35,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946879740] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:48:35,870 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:48:35,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-08 07:48:35,870 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:48:35,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [231039538] [2022-04-08 07:48:35,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [231039538] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:48:35,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:48:35,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 07:48:35,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496862838] [2022-04-08 07:48:35,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:48:35,871 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 54 [2022-04-08 07:48:35,872 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:48:35,872 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-08 07:48:35,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:48:35,907 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 07:48:35,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:48:35,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 07:48:35,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-08 07:48:35,908 INFO L87 Difference]: Start difference. First operand 39 states and 43 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-08 07:48:36,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:48:36,383 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-04-08 07:48:36,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 07:48:36,383 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 54 [2022-04-08 07:48:36,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:48:36,383 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-08 07:48:36,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-08 07:48:36,385 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-08 07:48:36,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-08 07:48:36,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2022-04-08 07:48:36,429 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:48:36,430 INFO L225 Difference]: With dead ends: 48 [2022-04-08 07:48:36,430 INFO L226 Difference]: Without dead ends: 42 [2022-04-08 07:48:36,430 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-08 07:48:36,431 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 07:48:36,431 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 199 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 07:48:36,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-08 07:48:36,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-08 07:48:36,453 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:48:36,454 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:48:36,454 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:48:36,454 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:48:36,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:48:36,456 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-08 07:48:36,456 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-08 07:48:36,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:48:36,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:48:36,457 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 42 states. [2022-04-08 07:48:36,457 INFO L87 Difference]: Start difference. First operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 42 states. [2022-04-08 07:48:36,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:48:36,459 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-08 07:48:36,459 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-08 07:48:36,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:48:36,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:48:36,459 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:48:36,459 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:48:36,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:48:36,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-04-08 07:48:36,461 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 54 [2022-04-08 07:48:36,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:48:36,462 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-04-08 07:48:36,462 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-08 07:48:36,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 47 transitions. [2022-04-08 07:48:38,013 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:48:38,014 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-08 07:48:38,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-08 07:48:38,014 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:48:38,014 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:48:38,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-08 07:48:38,220 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:48:38,220 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:48:38,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:48:38,220 INFO L85 PathProgramCache]: Analyzing trace with hash 307258797, now seen corresponding path program 7 times [2022-04-08 07:48:38,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:48:38,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1109701156] [2022-04-08 07:48:38,221 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:48:38,221 INFO L85 PathProgramCache]: Analyzing trace with hash 307258797, now seen corresponding path program 8 times [2022-04-08 07:48:38,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:48:38,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75736555] [2022-04-08 07:48:38,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:48:38,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:48:38,234 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:48:38,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1308271425] [2022-04-08 07:48:38,235 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:48:38,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:48:38,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:48:38,236 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:48:38,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-08 07:48:39,077 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:48:39,078 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:48:39,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 07:48:39,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:48:39,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:48:39,565 INFO L272 TraceCheckUtils]: 0: Hoare triple {2287#true} call ULTIMATE.init(); {2287#true} is VALID [2022-04-08 07:48:39,565 INFO L290 TraceCheckUtils]: 1: Hoare triple {2287#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); {2287#true} is VALID [2022-04-08 07:48:39,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {2287#true} assume true; {2287#true} is VALID [2022-04-08 07:48:39,565 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2287#true} {2287#true} #63#return; {2287#true} is VALID [2022-04-08 07:48:39,566 INFO L272 TraceCheckUtils]: 4: Hoare triple {2287#true} call #t~ret5 := main(); {2287#true} is VALID [2022-04-08 07:48:39,566 INFO L290 TraceCheckUtils]: 5: Hoare triple {2287#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; {2287#true} is VALID [2022-04-08 07:48:39,566 INFO L272 TraceCheckUtils]: 6: Hoare triple {2287#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {2287#true} is VALID [2022-04-08 07:48:39,566 INFO L290 TraceCheckUtils]: 7: Hoare triple {2287#true} ~cond := #in~cond; {2287#true} is VALID [2022-04-08 07:48:39,566 INFO L290 TraceCheckUtils]: 8: Hoare triple {2287#true} assume !(0 == ~cond); {2287#true} is VALID [2022-04-08 07:48:39,566 INFO L290 TraceCheckUtils]: 9: Hoare triple {2287#true} assume true; {2287#true} is VALID [2022-04-08 07:48:39,566 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2287#true} {2287#true} #53#return; {2287#true} is VALID [2022-04-08 07:48:39,567 INFO L272 TraceCheckUtils]: 11: Hoare triple {2287#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2287#true} is VALID [2022-04-08 07:48:39,567 INFO L290 TraceCheckUtils]: 12: Hoare triple {2287#true} ~cond := #in~cond; {2287#true} is VALID [2022-04-08 07:48:39,567 INFO L290 TraceCheckUtils]: 13: Hoare triple {2287#true} assume !(0 == ~cond); {2287#true} is VALID [2022-04-08 07:48:39,567 INFO L290 TraceCheckUtils]: 14: Hoare triple {2287#true} assume true; {2287#true} is VALID [2022-04-08 07:48:39,567 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2287#true} {2287#true} #55#return; {2287#true} is VALID [2022-04-08 07:48:39,569 INFO L290 TraceCheckUtils]: 16: Hoare triple {2287#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2340#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:48:39,569 INFO L290 TraceCheckUtils]: 17: Hoare triple {2340#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2340#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:48:39,570 INFO L272 TraceCheckUtils]: 18: Hoare triple {2340#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2287#true} is VALID [2022-04-08 07:48:39,570 INFO L290 TraceCheckUtils]: 19: Hoare triple {2287#true} ~cond := #in~cond; {2287#true} is VALID [2022-04-08 07:48:39,570 INFO L290 TraceCheckUtils]: 20: Hoare triple {2287#true} assume !(0 == ~cond); {2287#true} is VALID [2022-04-08 07:48:39,570 INFO L290 TraceCheckUtils]: 21: Hoare triple {2287#true} assume true; {2287#true} is VALID [2022-04-08 07:48:39,571 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2287#true} {2340#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {2340#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:48:39,571 INFO L290 TraceCheckUtils]: 23: Hoare triple {2340#(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 * ~y~0 + ~x~0; {2362#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:48:39,572 INFO L290 TraceCheckUtils]: 24: Hoare triple {2362#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {2362#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:48:39,572 INFO L272 TraceCheckUtils]: 25: Hoare triple {2362#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2287#true} is VALID [2022-04-08 07:48:39,572 INFO L290 TraceCheckUtils]: 26: Hoare triple {2287#true} ~cond := #in~cond; {2287#true} is VALID [2022-04-08 07:48:39,572 INFO L290 TraceCheckUtils]: 27: Hoare triple {2287#true} assume !(0 == ~cond); {2287#true} is VALID [2022-04-08 07:48:39,572 INFO L290 TraceCheckUtils]: 28: Hoare triple {2287#true} assume true; {2287#true} is VALID [2022-04-08 07:48:39,573 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2287#true} {2362#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #57#return; {2362#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:48:39,574 INFO L290 TraceCheckUtils]: 30: Hoare triple {2362#(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 * ~y~0 + ~x~0; {2384#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 07:48:39,574 INFO L290 TraceCheckUtils]: 31: Hoare triple {2384#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !false; {2384#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 07:48:39,574 INFO L272 TraceCheckUtils]: 32: Hoare triple {2384#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2287#true} is VALID [2022-04-08 07:48:39,574 INFO L290 TraceCheckUtils]: 33: Hoare triple {2287#true} ~cond := #in~cond; {2287#true} is VALID [2022-04-08 07:48:39,574 INFO L290 TraceCheckUtils]: 34: Hoare triple {2287#true} assume !(0 == ~cond); {2287#true} is VALID [2022-04-08 07:48:39,575 INFO L290 TraceCheckUtils]: 35: Hoare triple {2287#true} assume true; {2287#true} is VALID [2022-04-08 07:48:39,575 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2287#true} {2384#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #57#return; {2384#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 07:48:39,575 INFO L290 TraceCheckUtils]: 37: Hoare triple {2384#(and (= (+ (- 1) main_~y~0) 1) (= 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 * ~y~0 + ~x~0; {2406#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 07:48:39,576 INFO L290 TraceCheckUtils]: 38: Hoare triple {2406#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {2406#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 07:48:39,576 INFO L272 TraceCheckUtils]: 39: Hoare triple {2406#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2287#true} is VALID [2022-04-08 07:48:39,576 INFO L290 TraceCheckUtils]: 40: Hoare triple {2287#true} ~cond := #in~cond; {2287#true} is VALID [2022-04-08 07:48:39,576 INFO L290 TraceCheckUtils]: 41: Hoare triple {2287#true} assume !(0 == ~cond); {2287#true} is VALID [2022-04-08 07:48:39,576 INFO L290 TraceCheckUtils]: 42: Hoare triple {2287#true} assume true; {2287#true} is VALID [2022-04-08 07:48:39,577 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2287#true} {2406#(and (= main_~y~0 3) (= main_~c~0 3))} #57#return; {2406#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 07:48:39,577 INFO L290 TraceCheckUtils]: 44: Hoare triple {2406#(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 * ~y~0 + ~x~0; {2428#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-08 07:48:39,578 INFO L290 TraceCheckUtils]: 45: Hoare triple {2428#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} assume !false; {2428#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-08 07:48:39,578 INFO L272 TraceCheckUtils]: 46: Hoare triple {2428#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2287#true} is VALID [2022-04-08 07:48:39,578 INFO L290 TraceCheckUtils]: 47: Hoare triple {2287#true} ~cond := #in~cond; {2287#true} is VALID [2022-04-08 07:48:39,578 INFO L290 TraceCheckUtils]: 48: Hoare triple {2287#true} assume !(0 == ~cond); {2287#true} is VALID [2022-04-08 07:48:39,578 INFO L290 TraceCheckUtils]: 49: Hoare triple {2287#true} assume true; {2287#true} is VALID [2022-04-08 07:48:39,582 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2287#true} {2428#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} #57#return; {2428#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-08 07:48:39,583 INFO L290 TraceCheckUtils]: 51: Hoare triple {2428#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {2450#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-08 07:48:39,583 INFO L272 TraceCheckUtils]: 52: Hoare triple {2450#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2287#true} is VALID [2022-04-08 07:48:39,583 INFO L290 TraceCheckUtils]: 53: Hoare triple {2287#true} ~cond := #in~cond; {2287#true} is VALID [2022-04-08 07:48:39,583 INFO L290 TraceCheckUtils]: 54: Hoare triple {2287#true} assume !(0 == ~cond); {2287#true} is VALID [2022-04-08 07:48:39,583 INFO L290 TraceCheckUtils]: 55: Hoare triple {2287#true} assume true; {2287#true} is VALID [2022-04-08 07:48:39,584 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {2287#true} {2450#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} #59#return; {2450#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-08 07:48:39,585 INFO L272 TraceCheckUtils]: 57: Hoare triple {2450#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2469#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:48:39,585 INFO L290 TraceCheckUtils]: 58: Hoare triple {2469#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2473#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:48:39,586 INFO L290 TraceCheckUtils]: 59: Hoare triple {2473#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2288#false} is VALID [2022-04-08 07:48:39,586 INFO L290 TraceCheckUtils]: 60: Hoare triple {2288#false} assume !false; {2288#false} is VALID [2022-04-08 07:48:39,586 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-08 07:48:39,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:48:39,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:48:39,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75736555] [2022-04-08 07:48:39,920 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:48:39,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308271425] [2022-04-08 07:48:39,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308271425] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:48:39,920 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:48:39,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-08 07:48:39,920 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:48:39,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1109701156] [2022-04-08 07:48:39,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1109701156] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:48:39,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:48:39,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 07:48:39,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187548681] [2022-04-08 07:48:39,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:48:39,922 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 61 [2022-04-08 07:48:39,922 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:48:39,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-08 07:48:39,960 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:48:39,961 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 07:48:39,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:48:39,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 07:48:39,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-08 07:48:39,962 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-08 07:48:40,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:48:40,487 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2022-04-08 07:48:40,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 07:48:40,487 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 61 [2022-04-08 07:48:40,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:48:40,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-08 07:48:40,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-08 07:48:40,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-08 07:48:40,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-08 07:48:40,492 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 54 transitions. [2022-04-08 07:48:40,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:48:40,540 INFO L225 Difference]: With dead ends: 51 [2022-04-08 07:48:40,540 INFO L226 Difference]: Without dead ends: 45 [2022-04-08 07:48:40,541 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-04-08 07:48:40,541 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 2 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 07:48:40,541 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 234 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 07:48:40,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-08 07:48:40,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-08 07:48:40,566 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:48:40,566 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 07:48:40,567 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 07:48:40,567 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 07:48:40,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:48:40,569 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-08 07:48:40,569 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-08 07:48:40,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:48:40,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:48:40,569 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-08 07:48:40,570 INFO L87 Difference]: Start difference. First operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-08 07:48:40,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:48:40,572 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-08 07:48:40,572 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-08 07:48:40,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:48:40,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:48:40,572 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:48:40,572 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:48:40,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 07:48:40,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2022-04-08 07:48:40,574 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 61 [2022-04-08 07:48:40,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:48:40,575 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2022-04-08 07:48:40,575 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-08 07:48:40,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 51 transitions. [2022-04-08 07:48:41,175 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:48:41,176 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-08 07:48:41,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-08 07:48:41,176 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:48:41,176 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:48:41,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-08 07:48:41,379 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:48:41,380 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:48:41,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:48:41,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1082774365, now seen corresponding path program 9 times [2022-04-08 07:48:41,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:48:41,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [343875901] [2022-04-08 07:48:41,380 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:48:41,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1082774365, now seen corresponding path program 10 times [2022-04-08 07:48:41,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:48:41,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723136328] [2022-04-08 07:48:41,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:48:41,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:48:41,417 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:48:41,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [429102898] [2022-04-08 07:48:41,418 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 07:48:41,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:48:41,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:48:41,421 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:48:41,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-08 07:48:41,471 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 07:48:41,472 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:48:41,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-08 07:48:41,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:48:41,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:48:41,947 INFO L272 TraceCheckUtils]: 0: Hoare triple {2822#true} call ULTIMATE.init(); {2822#true} is VALID [2022-04-08 07:48:41,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {2822#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); {2822#true} is VALID [2022-04-08 07:48:41,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-08 07:48:41,948 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2822#true} {2822#true} #63#return; {2822#true} is VALID [2022-04-08 07:48:41,948 INFO L272 TraceCheckUtils]: 4: Hoare triple {2822#true} call #t~ret5 := main(); {2822#true} is VALID [2022-04-08 07:48:41,948 INFO L290 TraceCheckUtils]: 5: Hoare triple {2822#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; {2822#true} is VALID [2022-04-08 07:48:41,948 INFO L272 TraceCheckUtils]: 6: Hoare triple {2822#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {2822#true} is VALID [2022-04-08 07:48:41,948 INFO L290 TraceCheckUtils]: 7: Hoare triple {2822#true} ~cond := #in~cond; {2822#true} is VALID [2022-04-08 07:48:41,948 INFO L290 TraceCheckUtils]: 8: Hoare triple {2822#true} assume !(0 == ~cond); {2822#true} is VALID [2022-04-08 07:48:41,948 INFO L290 TraceCheckUtils]: 9: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-08 07:48:41,948 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2822#true} {2822#true} #53#return; {2822#true} is VALID [2022-04-08 07:48:41,948 INFO L272 TraceCheckUtils]: 11: Hoare triple {2822#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2822#true} is VALID [2022-04-08 07:48:41,949 INFO L290 TraceCheckUtils]: 12: Hoare triple {2822#true} ~cond := #in~cond; {2822#true} is VALID [2022-04-08 07:48:41,949 INFO L290 TraceCheckUtils]: 13: Hoare triple {2822#true} assume !(0 == ~cond); {2822#true} is VALID [2022-04-08 07:48:41,949 INFO L290 TraceCheckUtils]: 14: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-08 07:48:41,949 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2822#true} {2822#true} #55#return; {2822#true} is VALID [2022-04-08 07:48:41,949 INFO L290 TraceCheckUtils]: 16: Hoare triple {2822#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2875#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:48:41,950 INFO L290 TraceCheckUtils]: 17: Hoare triple {2875#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2875#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:48:41,950 INFO L272 TraceCheckUtils]: 18: Hoare triple {2875#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2822#true} is VALID [2022-04-08 07:48:41,950 INFO L290 TraceCheckUtils]: 19: Hoare triple {2822#true} ~cond := #in~cond; {2822#true} is VALID [2022-04-08 07:48:41,950 INFO L290 TraceCheckUtils]: 20: Hoare triple {2822#true} assume !(0 == ~cond); {2822#true} is VALID [2022-04-08 07:48:41,950 INFO L290 TraceCheckUtils]: 21: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-08 07:48:41,956 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2822#true} {2875#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {2875#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:48:41,957 INFO L290 TraceCheckUtils]: 23: Hoare triple {2875#(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 * ~y~0 + ~x~0; {2897#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:48:41,957 INFO L290 TraceCheckUtils]: 24: Hoare triple {2897#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {2897#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:48:41,957 INFO L272 TraceCheckUtils]: 25: Hoare triple {2897#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2822#true} is VALID [2022-04-08 07:48:41,957 INFO L290 TraceCheckUtils]: 26: Hoare triple {2822#true} ~cond := #in~cond; {2822#true} is VALID [2022-04-08 07:48:41,957 INFO L290 TraceCheckUtils]: 27: Hoare triple {2822#true} assume !(0 == ~cond); {2822#true} is VALID [2022-04-08 07:48:41,958 INFO L290 TraceCheckUtils]: 28: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-08 07:48:41,958 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2822#true} {2897#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #57#return; {2897#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:48:41,959 INFO L290 TraceCheckUtils]: 30: Hoare triple {2897#(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 * ~y~0 + ~x~0; {2919#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 07:48:41,959 INFO L290 TraceCheckUtils]: 31: Hoare triple {2919#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {2919#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 07:48:41,959 INFO L272 TraceCheckUtils]: 32: Hoare triple {2919#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2822#true} is VALID [2022-04-08 07:48:41,959 INFO L290 TraceCheckUtils]: 33: Hoare triple {2822#true} ~cond := #in~cond; {2822#true} is VALID [2022-04-08 07:48:41,959 INFO L290 TraceCheckUtils]: 34: Hoare triple {2822#true} assume !(0 == ~cond); {2822#true} is VALID [2022-04-08 07:48:41,959 INFO L290 TraceCheckUtils]: 35: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-08 07:48:41,960 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2822#true} {2919#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #57#return; {2919#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 07:48:41,961 INFO L290 TraceCheckUtils]: 37: Hoare triple {2919#(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 * ~y~0 + ~x~0; {2941#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 07:48:41,961 INFO L290 TraceCheckUtils]: 38: Hoare triple {2941#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !false; {2941#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 07:48:41,961 INFO L272 TraceCheckUtils]: 39: Hoare triple {2941#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2822#true} is VALID [2022-04-08 07:48:41,961 INFO L290 TraceCheckUtils]: 40: Hoare triple {2822#true} ~cond := #in~cond; {2822#true} is VALID [2022-04-08 07:48:41,961 INFO L290 TraceCheckUtils]: 41: Hoare triple {2822#true} assume !(0 == ~cond); {2822#true} is VALID [2022-04-08 07:48:41,962 INFO L290 TraceCheckUtils]: 42: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-08 07:48:41,962 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2822#true} {2941#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #57#return; {2941#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 07:48:41,963 INFO L290 TraceCheckUtils]: 44: Hoare triple {2941#(and (= 2 (+ (- 1) main_~y~0)) (= 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 * ~y~0 + ~x~0; {2963#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 07:48:41,963 INFO L290 TraceCheckUtils]: 45: Hoare triple {2963#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} assume !false; {2963#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 07:48:41,963 INFO L272 TraceCheckUtils]: 46: Hoare triple {2963#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2822#true} is VALID [2022-04-08 07:48:41,963 INFO L290 TraceCheckUtils]: 47: Hoare triple {2822#true} ~cond := #in~cond; {2822#true} is VALID [2022-04-08 07:48:41,963 INFO L290 TraceCheckUtils]: 48: Hoare triple {2822#true} assume !(0 == ~cond); {2822#true} is VALID [2022-04-08 07:48:41,963 INFO L290 TraceCheckUtils]: 49: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-08 07:48:41,964 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2822#true} {2963#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} #57#return; {2963#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 07:48:41,964 INFO L290 TraceCheckUtils]: 51: Hoare triple {2963#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 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 * ~y~0 + ~x~0; {2985#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-08 07:48:41,965 INFO L290 TraceCheckUtils]: 52: Hoare triple {2985#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} assume !false; {2985#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-08 07:48:41,965 INFO L272 TraceCheckUtils]: 53: Hoare triple {2985#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2822#true} is VALID [2022-04-08 07:48:41,965 INFO L290 TraceCheckUtils]: 54: Hoare triple {2822#true} ~cond := #in~cond; {2822#true} is VALID [2022-04-08 07:48:41,965 INFO L290 TraceCheckUtils]: 55: Hoare triple {2822#true} assume !(0 == ~cond); {2822#true} is VALID [2022-04-08 07:48:41,965 INFO L290 TraceCheckUtils]: 56: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-08 07:48:41,966 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {2822#true} {2985#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} #57#return; {2985#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-08 07:48:41,966 INFO L290 TraceCheckUtils]: 58: Hoare triple {2985#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {3007#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-08 07:48:41,967 INFO L272 TraceCheckUtils]: 59: Hoare triple {3007#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2822#true} is VALID [2022-04-08 07:48:41,967 INFO L290 TraceCheckUtils]: 60: Hoare triple {2822#true} ~cond := #in~cond; {2822#true} is VALID [2022-04-08 07:48:41,967 INFO L290 TraceCheckUtils]: 61: Hoare triple {2822#true} assume !(0 == ~cond); {2822#true} is VALID [2022-04-08 07:48:41,972 INFO L290 TraceCheckUtils]: 62: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-08 07:48:41,973 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {2822#true} {3007#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} #59#return; {3007#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-08 07:48:41,979 INFO L272 TraceCheckUtils]: 64: Hoare triple {3007#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {3026#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:48:41,980 INFO L290 TraceCheckUtils]: 65: Hoare triple {3026#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3030#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:48:41,981 INFO L290 TraceCheckUtils]: 66: Hoare triple {3030#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2823#false} is VALID [2022-04-08 07:48:41,981 INFO L290 TraceCheckUtils]: 67: Hoare triple {2823#false} assume !false; {2823#false} is VALID [2022-04-08 07:48:41,982 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 14 proven. 45 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-08 07:48:41,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:48:42,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:48:42,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723136328] [2022-04-08 07:48:42,302 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:48:42,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429102898] [2022-04-08 07:48:42,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429102898] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:48:42,303 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:48:42,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-08 07:48:42,303 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:48:42,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [343875901] [2022-04-08 07:48:42,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [343875901] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:48:42,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:48:42,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 07:48:42,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746380632] [2022-04-08 07:48:42,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:48:42,304 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) Word has length 68 [2022-04-08 07:48:42,304 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:48:42,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-08 07:48:42,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:48:42,340 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 07:48:42,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:48:42,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 07:48:42,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-08 07:48:42,340 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-08 07:48:42,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:48:42,961 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-08 07:48:42,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 07:48:42,961 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) Word has length 68 [2022-04-08 07:48:42,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:48:42,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-08 07:48:42,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-08 07:48:42,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-08 07:48:42,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-08 07:48:42,965 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 58 transitions. [2022-04-08 07:48:43,012 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:48:43,014 INFO L225 Difference]: With dead ends: 54 [2022-04-08 07:48:43,014 INFO L226 Difference]: Without dead ends: 48 [2022-04-08 07:48:43,014 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-08 07:48:43,015 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 2 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 07:48:43,015 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 271 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 07:48:43,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-08 07:48:43,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-08 07:48:43,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:48:43,053 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 07:48:43,053 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 07:48:43,053 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 07:48:43,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:48:43,055 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-08 07:48:43,055 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-08 07:48:43,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:48:43,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:48:43,056 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 48 states. [2022-04-08 07:48:43,056 INFO L87 Difference]: Start difference. First operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 48 states. [2022-04-08 07:48:43,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:48:43,058 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-08 07:48:43,058 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-08 07:48:43,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:48:43,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:48:43,058 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:48:43,058 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:48:43,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 07:48:43,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2022-04-08 07:48:43,060 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 68 [2022-04-08 07:48:43,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:48:43,061 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2022-04-08 07:48:43,062 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-08 07:48:43,062 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 55 transitions. [2022-04-08 07:48:43,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:48:43,568 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-08 07:48:43,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-08 07:48:43,569 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:48:43,569 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 7, 7, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:48:43,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-08 07:48:43,770 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:48:43,770 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:48:43,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:48:43,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1692754003, now seen corresponding path program 11 times [2022-04-08 07:48:43,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:48:43,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [205503370] [2022-04-08 07:48:43,771 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:48:43,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1692754003, now seen corresponding path program 12 times [2022-04-08 07:48:43,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:48:43,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510262806] [2022-04-08 07:48:43,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:48:43,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:48:43,794 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:48:43,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [634809347] [2022-04-08 07:48:43,795 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 07:48:43,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:48:43,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:48:43,805 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:48:43,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-08 07:48:45,654 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 07:48:45,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:48:45,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 07:48:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:48:45,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:48:46,219 INFO L272 TraceCheckUtils]: 0: Hoare triple {3397#true} call ULTIMATE.init(); {3397#true} is VALID [2022-04-08 07:48:46,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {3397#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); {3397#true} is VALID [2022-04-08 07:48:46,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-08 07:48:46,219 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3397#true} {3397#true} #63#return; {3397#true} is VALID [2022-04-08 07:48:46,220 INFO L272 TraceCheckUtils]: 4: Hoare triple {3397#true} call #t~ret5 := main(); {3397#true} is VALID [2022-04-08 07:48:46,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {3397#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; {3397#true} is VALID [2022-04-08 07:48:46,220 INFO L272 TraceCheckUtils]: 6: Hoare triple {3397#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {3397#true} is VALID [2022-04-08 07:48:46,220 INFO L290 TraceCheckUtils]: 7: Hoare triple {3397#true} ~cond := #in~cond; {3397#true} is VALID [2022-04-08 07:48:46,220 INFO L290 TraceCheckUtils]: 8: Hoare triple {3397#true} assume !(0 == ~cond); {3397#true} is VALID [2022-04-08 07:48:46,220 INFO L290 TraceCheckUtils]: 9: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-08 07:48:46,220 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3397#true} {3397#true} #53#return; {3397#true} is VALID [2022-04-08 07:48:46,220 INFO L272 TraceCheckUtils]: 11: Hoare triple {3397#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3397#true} is VALID [2022-04-08 07:48:46,220 INFO L290 TraceCheckUtils]: 12: Hoare triple {3397#true} ~cond := #in~cond; {3397#true} is VALID [2022-04-08 07:48:46,220 INFO L290 TraceCheckUtils]: 13: Hoare triple {3397#true} assume !(0 == ~cond); {3397#true} is VALID [2022-04-08 07:48:46,220 INFO L290 TraceCheckUtils]: 14: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-08 07:48:46,221 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3397#true} {3397#true} #55#return; {3397#true} is VALID [2022-04-08 07:48:46,221 INFO L290 TraceCheckUtils]: 16: Hoare triple {3397#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3450#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:48:46,221 INFO L290 TraceCheckUtils]: 17: Hoare triple {3450#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {3450#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:48:46,221 INFO L272 TraceCheckUtils]: 18: Hoare triple {3450#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3397#true} is VALID [2022-04-08 07:48:46,221 INFO L290 TraceCheckUtils]: 19: Hoare triple {3397#true} ~cond := #in~cond; {3397#true} is VALID [2022-04-08 07:48:46,222 INFO L290 TraceCheckUtils]: 20: Hoare triple {3397#true} assume !(0 == ~cond); {3397#true} is VALID [2022-04-08 07:48:46,222 INFO L290 TraceCheckUtils]: 21: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-08 07:48:46,222 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3397#true} {3450#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {3450#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:48:46,223 INFO L290 TraceCheckUtils]: 23: Hoare triple {3450#(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 * ~y~0 + ~x~0; {3472#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:48:46,223 INFO L290 TraceCheckUtils]: 24: Hoare triple {3472#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {3472#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:48:46,223 INFO L272 TraceCheckUtils]: 25: Hoare triple {3472#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3397#true} is VALID [2022-04-08 07:48:46,223 INFO L290 TraceCheckUtils]: 26: Hoare triple {3397#true} ~cond := #in~cond; {3397#true} is VALID [2022-04-08 07:48:46,223 INFO L290 TraceCheckUtils]: 27: Hoare triple {3397#true} assume !(0 == ~cond); {3397#true} is VALID [2022-04-08 07:48:46,223 INFO L290 TraceCheckUtils]: 28: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-08 07:48:46,224 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3397#true} {3472#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #57#return; {3472#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:48:46,224 INFO L290 TraceCheckUtils]: 30: Hoare triple {3472#(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 * ~y~0 + ~x~0; {3494#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 07:48:46,224 INFO L290 TraceCheckUtils]: 31: Hoare triple {3494#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} assume !false; {3494#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 07:48:46,225 INFO L272 TraceCheckUtils]: 32: Hoare triple {3494#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3397#true} is VALID [2022-04-08 07:48:46,225 INFO L290 TraceCheckUtils]: 33: Hoare triple {3397#true} ~cond := #in~cond; {3397#true} is VALID [2022-04-08 07:48:46,225 INFO L290 TraceCheckUtils]: 34: Hoare triple {3397#true} assume !(0 == ~cond); {3397#true} is VALID [2022-04-08 07:48:46,225 INFO L290 TraceCheckUtils]: 35: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-08 07:48:46,225 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3397#true} {3494#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} #57#return; {3494#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 07:48:46,226 INFO L290 TraceCheckUtils]: 37: Hoare triple {3494#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~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 * ~y~0 + ~x~0; {3516#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-08 07:48:46,226 INFO L290 TraceCheckUtils]: 38: Hoare triple {3516#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} assume !false; {3516#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-08 07:48:46,226 INFO L272 TraceCheckUtils]: 39: Hoare triple {3516#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3397#true} is VALID [2022-04-08 07:48:46,227 INFO L290 TraceCheckUtils]: 40: Hoare triple {3397#true} ~cond := #in~cond; {3397#true} is VALID [2022-04-08 07:48:46,227 INFO L290 TraceCheckUtils]: 41: Hoare triple {3397#true} assume !(0 == ~cond); {3397#true} is VALID [2022-04-08 07:48:46,227 INFO L290 TraceCheckUtils]: 42: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-08 07:48:46,227 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3397#true} {3516#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} #57#return; {3516#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-08 07:48:46,228 INFO L290 TraceCheckUtils]: 44: Hoare triple {3516#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~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 * ~y~0 + ~x~0; {3538#(and (< main_~c~0 (+ main_~k~0 3)) (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-08 07:48:46,228 INFO L290 TraceCheckUtils]: 45: Hoare triple {3538#(and (< main_~c~0 (+ main_~k~0 3)) (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} assume !false; {3538#(and (< main_~c~0 (+ main_~k~0 3)) (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-08 07:48:46,229 INFO L272 TraceCheckUtils]: 46: Hoare triple {3538#(and (< main_~c~0 (+ main_~k~0 3)) (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3397#true} is VALID [2022-04-08 07:48:46,229 INFO L290 TraceCheckUtils]: 47: Hoare triple {3397#true} ~cond := #in~cond; {3397#true} is VALID [2022-04-08 07:48:46,229 INFO L290 TraceCheckUtils]: 48: Hoare triple {3397#true} assume !(0 == ~cond); {3397#true} is VALID [2022-04-08 07:48:46,229 INFO L290 TraceCheckUtils]: 49: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-08 07:48:46,229 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3397#true} {3538#(and (< main_~c~0 (+ main_~k~0 3)) (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} #57#return; {3538#(and (< main_~c~0 (+ main_~k~0 3)) (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-08 07:48:46,230 INFO L290 TraceCheckUtils]: 51: Hoare triple {3538#(and (< main_~c~0 (+ main_~k~0 3)) (= 3 (+ (- 1) main_~y~0)) (= (+ 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 * ~y~0 + ~x~0; {3560#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-08 07:48:46,230 INFO L290 TraceCheckUtils]: 52: Hoare triple {3560#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} assume !false; {3560#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-08 07:48:46,230 INFO L272 TraceCheckUtils]: 53: Hoare triple {3560#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3397#true} is VALID [2022-04-08 07:48:46,230 INFO L290 TraceCheckUtils]: 54: Hoare triple {3397#true} ~cond := #in~cond; {3397#true} is VALID [2022-04-08 07:48:46,230 INFO L290 TraceCheckUtils]: 55: Hoare triple {3397#true} assume !(0 == ~cond); {3397#true} is VALID [2022-04-08 07:48:46,230 INFO L290 TraceCheckUtils]: 56: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-08 07:48:46,231 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {3397#true} {3560#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} #57#return; {3560#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-08 07:48:46,231 INFO L290 TraceCheckUtils]: 58: Hoare triple {3560#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= 5 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 * ~y~0 + ~x~0; {3582#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 07:48:46,232 INFO L290 TraceCheckUtils]: 59: Hoare triple {3582#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !false; {3582#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 07:48:46,232 INFO L272 TraceCheckUtils]: 60: Hoare triple {3582#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3397#true} is VALID [2022-04-08 07:48:46,232 INFO L290 TraceCheckUtils]: 61: Hoare triple {3397#true} ~cond := #in~cond; {3397#true} is VALID [2022-04-08 07:48:46,232 INFO L290 TraceCheckUtils]: 62: Hoare triple {3397#true} assume !(0 == ~cond); {3397#true} is VALID [2022-04-08 07:48:46,232 INFO L290 TraceCheckUtils]: 63: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-08 07:48:46,233 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3397#true} {3582#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #57#return; {3582#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 07:48:46,233 INFO L290 TraceCheckUtils]: 65: Hoare triple {3582#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !(~c~0 < ~k~0); {3604#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-08 07:48:46,233 INFO L272 TraceCheckUtils]: 66: Hoare triple {3604#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3397#true} is VALID [2022-04-08 07:48:46,233 INFO L290 TraceCheckUtils]: 67: Hoare triple {3397#true} ~cond := #in~cond; {3397#true} is VALID [2022-04-08 07:48:46,233 INFO L290 TraceCheckUtils]: 68: Hoare triple {3397#true} assume !(0 == ~cond); {3397#true} is VALID [2022-04-08 07:48:46,233 INFO L290 TraceCheckUtils]: 69: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-08 07:48:46,234 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {3397#true} {3604#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} #59#return; {3604#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-08 07:48:46,235 INFO L272 TraceCheckUtils]: 71: Hoare triple {3604#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {3623#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:48:46,235 INFO L290 TraceCheckUtils]: 72: Hoare triple {3623#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3627#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:48:46,235 INFO L290 TraceCheckUtils]: 73: Hoare triple {3627#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3398#false} is VALID [2022-04-08 07:48:46,235 INFO L290 TraceCheckUtils]: 74: Hoare triple {3398#false} assume !false; {3398#false} is VALID [2022-04-08 07:48:46,236 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 16 proven. 63 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-08 07:48:46,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:48:46,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:48:46,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510262806] [2022-04-08 07:48:46,875 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:48:46,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634809347] [2022-04-08 07:48:46,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634809347] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:48:46,876 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:48:46,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-08 07:48:46,876 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:48:46,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [205503370] [2022-04-08 07:48:46,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [205503370] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:48:46,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:48:46,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 07:48:46,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453623167] [2022-04-08 07:48:46,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:48:46,877 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) Word has length 75 [2022-04-08 07:48:46,877 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:48:46,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-08 07:48:46,960 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:48:46,961 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 07:48:46,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:48:46,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 07:48:46,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-04-08 07:48:46,962 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-08 07:48:47,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:48:47,806 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2022-04-08 07:48:47,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 07:48:47,807 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) Word has length 75 [2022-04-08 07:48:47,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:48:47,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-08 07:48:47,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 62 transitions. [2022-04-08 07:48:47,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-08 07:48:47,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 62 transitions. [2022-04-08 07:48:47,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 62 transitions. [2022-04-08 07:48:47,873 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:48:47,874 INFO L225 Difference]: With dead ends: 57 [2022-04-08 07:48:47,874 INFO L226 Difference]: Without dead ends: 51 [2022-04-08 07:48:47,874 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2022-04-08 07:48:47,875 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 2 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 07:48:47,875 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 302 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 07:48:47,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-08 07:48:47,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-08 07:48:47,913 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:48:47,914 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 07:48:47,914 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 07:48:47,914 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 07:48:47,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:48:47,916 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-08 07:48:47,916 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-08 07:48:47,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:48:47,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:48:47,917 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 51 states. [2022-04-08 07:48:47,917 INFO L87 Difference]: Start difference. First operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 51 states. [2022-04-08 07:48:47,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:48:47,919 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-08 07:48:47,919 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-08 07:48:47,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:48:47,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:48:47,920 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:48:47,920 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:48:47,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 07:48:47,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2022-04-08 07:48:47,922 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 75 [2022-04-08 07:48:47,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:48:47,922 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2022-04-08 07:48:47,922 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-08 07:48:47,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 59 transitions. [2022-04-08 07:48:48,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:48:48,179 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-08 07:48:48,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-08 07:48:48,180 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:48:48,180 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 8, 8, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:48:48,188 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-08 07:48:48,383 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-08 07:48:48,384 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:48:48,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:48:48,384 INFO L85 PathProgramCache]: Analyzing trace with hash 615143773, now seen corresponding path program 13 times [2022-04-08 07:48:48,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:48:48,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1778567651] [2022-04-08 07:48:48,384 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:48:48,384 INFO L85 PathProgramCache]: Analyzing trace with hash 615143773, now seen corresponding path program 14 times [2022-04-08 07:48:48,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:48:48,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734394694] [2022-04-08 07:48:48,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:48:48,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:48:48,396 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:48:48,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2102652087] [2022-04-08 07:48:48,396 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:48:48,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:48:48,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:48:48,397 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:48:48,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-08 07:48:56,445 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:48:56,445 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:48:56,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-08 07:48:56,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:48:56,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:48:57,039 INFO L272 TraceCheckUtils]: 0: Hoare triple {4100#true} call ULTIMATE.init(); {4100#true} is VALID [2022-04-08 07:48:57,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {4100#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); {4100#true} is VALID [2022-04-08 07:48:57,040 INFO L290 TraceCheckUtils]: 2: Hoare triple {4100#true} assume true; {4100#true} is VALID [2022-04-08 07:48:57,040 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4100#true} {4100#true} #63#return; {4100#true} is VALID [2022-04-08 07:48:57,040 INFO L272 TraceCheckUtils]: 4: Hoare triple {4100#true} call #t~ret5 := main(); {4100#true} is VALID [2022-04-08 07:48:57,040 INFO L290 TraceCheckUtils]: 5: Hoare triple {4100#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; {4100#true} is VALID [2022-04-08 07:48:57,040 INFO L272 TraceCheckUtils]: 6: Hoare triple {4100#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {4100#true} is VALID [2022-04-08 07:48:57,040 INFO L290 TraceCheckUtils]: 7: Hoare triple {4100#true} ~cond := #in~cond; {4100#true} is VALID [2022-04-08 07:48:57,040 INFO L290 TraceCheckUtils]: 8: Hoare triple {4100#true} assume !(0 == ~cond); {4100#true} is VALID [2022-04-08 07:48:57,040 INFO L290 TraceCheckUtils]: 9: Hoare triple {4100#true} assume true; {4100#true} is VALID [2022-04-08 07:48:57,040 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4100#true} {4100#true} #53#return; {4100#true} is VALID [2022-04-08 07:48:57,041 INFO L272 TraceCheckUtils]: 11: Hoare triple {4100#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4100#true} is VALID [2022-04-08 07:48:57,041 INFO L290 TraceCheckUtils]: 12: Hoare triple {4100#true} ~cond := #in~cond; {4100#true} is VALID [2022-04-08 07:48:57,041 INFO L290 TraceCheckUtils]: 13: Hoare triple {4100#true} assume !(0 == ~cond); {4100#true} is VALID [2022-04-08 07:48:57,041 INFO L290 TraceCheckUtils]: 14: Hoare triple {4100#true} assume true; {4100#true} is VALID [2022-04-08 07:48:57,041 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4100#true} {4100#true} #55#return; {4100#true} is VALID [2022-04-08 07:48:57,042 INFO L290 TraceCheckUtils]: 16: Hoare triple {4100#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4153#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:48:57,043 INFO L290 TraceCheckUtils]: 17: Hoare triple {4153#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {4153#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:48:57,043 INFO L272 TraceCheckUtils]: 18: Hoare triple {4153#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4100#true} is VALID [2022-04-08 07:48:57,043 INFO L290 TraceCheckUtils]: 19: Hoare triple {4100#true} ~cond := #in~cond; {4100#true} is VALID [2022-04-08 07:48:57,043 INFO L290 TraceCheckUtils]: 20: Hoare triple {4100#true} assume !(0 == ~cond); {4100#true} is VALID [2022-04-08 07:48:57,043 INFO L290 TraceCheckUtils]: 21: Hoare triple {4100#true} assume true; {4100#true} is VALID [2022-04-08 07:48:57,044 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4100#true} {4153#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {4153#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:48:57,044 INFO L290 TraceCheckUtils]: 23: Hoare triple {4153#(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 * ~y~0 + ~x~0; {4175#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 07:48:57,044 INFO L290 TraceCheckUtils]: 24: Hoare triple {4175#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {4175#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 07:48:57,044 INFO L272 TraceCheckUtils]: 25: Hoare triple {4175#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4100#true} is VALID [2022-04-08 07:48:57,044 INFO L290 TraceCheckUtils]: 26: Hoare triple {4100#true} ~cond := #in~cond; {4100#true} is VALID [2022-04-08 07:48:57,045 INFO L290 TraceCheckUtils]: 27: Hoare triple {4100#true} assume !(0 == ~cond); {4100#true} is VALID [2022-04-08 07:48:57,045 INFO L290 TraceCheckUtils]: 28: Hoare triple {4100#true} assume true; {4100#true} is VALID [2022-04-08 07:48:57,045 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {4100#true} {4175#(and (= main_~y~0 1) (= main_~c~0 1))} #57#return; {4175#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 07:48:57,045 INFO L290 TraceCheckUtils]: 30: Hoare triple {4175#(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 * ~y~0 + ~x~0; {4197#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 07:48:57,046 INFO L290 TraceCheckUtils]: 31: Hoare triple {4197#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !false; {4197#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 07:48:57,046 INFO L272 TraceCheckUtils]: 32: Hoare triple {4197#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4100#true} is VALID [2022-04-08 07:48:57,046 INFO L290 TraceCheckUtils]: 33: Hoare triple {4100#true} ~cond := #in~cond; {4100#true} is VALID [2022-04-08 07:48:57,046 INFO L290 TraceCheckUtils]: 34: Hoare triple {4100#true} assume !(0 == ~cond); {4100#true} is VALID [2022-04-08 07:48:57,046 INFO L290 TraceCheckUtils]: 35: Hoare triple {4100#true} assume true; {4100#true} is VALID [2022-04-08 07:48:57,047 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4100#true} {4197#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #57#return; {4197#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 07:48:57,047 INFO L290 TraceCheckUtils]: 37: Hoare triple {4197#(and (= (+ (- 1) main_~y~0) 1) (= 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 * ~y~0 + ~x~0; {4219#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 07:48:57,047 INFO L290 TraceCheckUtils]: 38: Hoare triple {4219#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !false; {4219#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 07:48:57,047 INFO L272 TraceCheckUtils]: 39: Hoare triple {4219#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4100#true} is VALID [2022-04-08 07:48:57,048 INFO L290 TraceCheckUtils]: 40: Hoare triple {4100#true} ~cond := #in~cond; {4100#true} is VALID [2022-04-08 07:48:57,048 INFO L290 TraceCheckUtils]: 41: Hoare triple {4100#true} assume !(0 == ~cond); {4100#true} is VALID [2022-04-08 07:48:57,048 INFO L290 TraceCheckUtils]: 42: Hoare triple {4100#true} assume true; {4100#true} is VALID [2022-04-08 07:48:57,048 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4100#true} {4219#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #57#return; {4219#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 07:48:57,049 INFO L290 TraceCheckUtils]: 44: Hoare triple {4219#(and (= main_~y~0 3) (= (+ (- 1) 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 * ~y~0 + ~x~0; {4241#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:48:57,049 INFO L290 TraceCheckUtils]: 45: Hoare triple {4241#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !false; {4241#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:48:57,049 INFO L272 TraceCheckUtils]: 46: Hoare triple {4241#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4100#true} is VALID [2022-04-08 07:48:57,049 INFO L290 TraceCheckUtils]: 47: Hoare triple {4100#true} ~cond := #in~cond; {4100#true} is VALID [2022-04-08 07:48:57,049 INFO L290 TraceCheckUtils]: 48: Hoare triple {4100#true} assume !(0 == ~cond); {4100#true} is VALID [2022-04-08 07:48:57,049 INFO L290 TraceCheckUtils]: 49: Hoare triple {4100#true} assume true; {4100#true} is VALID [2022-04-08 07:48:57,052 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4100#true} {4241#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} #57#return; {4241#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:48:57,052 INFO L290 TraceCheckUtils]: 51: Hoare triple {4241#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) 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 * ~y~0 + ~x~0; {4263#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-08 07:48:57,053 INFO L290 TraceCheckUtils]: 52: Hoare triple {4263#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} assume !false; {4263#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-08 07:48:57,053 INFO L272 TraceCheckUtils]: 53: Hoare triple {4263#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4100#true} is VALID [2022-04-08 07:48:57,053 INFO L290 TraceCheckUtils]: 54: Hoare triple {4100#true} ~cond := #in~cond; {4100#true} is VALID [2022-04-08 07:48:57,053 INFO L290 TraceCheckUtils]: 55: Hoare triple {4100#true} assume !(0 == ~cond); {4100#true} is VALID [2022-04-08 07:48:57,053 INFO L290 TraceCheckUtils]: 56: Hoare triple {4100#true} assume true; {4100#true} is VALID [2022-04-08 07:48:57,055 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {4100#true} {4263#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} #57#return; {4263#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-08 07:48:57,055 INFO L290 TraceCheckUtils]: 58: Hoare triple {4263#(and (= 2 (+ main_~c~0 (- 3))) (= 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 * ~y~0 + ~x~0; {4285#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 07:48:57,055 INFO L290 TraceCheckUtils]: 59: Hoare triple {4285#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {4285#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 07:48:57,056 INFO L272 TraceCheckUtils]: 60: Hoare triple {4285#(and (= main_~y~0 6) (= main_~c~0 6))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4100#true} is VALID [2022-04-08 07:48:57,056 INFO L290 TraceCheckUtils]: 61: Hoare triple {4100#true} ~cond := #in~cond; {4100#true} is VALID [2022-04-08 07:48:57,056 INFO L290 TraceCheckUtils]: 62: Hoare triple {4100#true} assume !(0 == ~cond); {4100#true} is VALID [2022-04-08 07:48:57,056 INFO L290 TraceCheckUtils]: 63: Hoare triple {4100#true} assume true; {4100#true} is VALID [2022-04-08 07:48:57,056 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {4100#true} {4285#(and (= main_~y~0 6) (= main_~c~0 6))} #57#return; {4285#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 07:48:57,057 INFO L290 TraceCheckUtils]: 65: Hoare triple {4285#(and (= main_~y~0 6) (= main_~c~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 * ~y~0 + ~x~0; {4307#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 07:48:57,057 INFO L290 TraceCheckUtils]: 66: Hoare triple {4307#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !false; {4307#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 07:48:57,057 INFO L272 TraceCheckUtils]: 67: Hoare triple {4307#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4100#true} is VALID [2022-04-08 07:48:57,057 INFO L290 TraceCheckUtils]: 68: Hoare triple {4100#true} ~cond := #in~cond; {4100#true} is VALID [2022-04-08 07:48:57,057 INFO L290 TraceCheckUtils]: 69: Hoare triple {4100#true} assume !(0 == ~cond); {4100#true} is VALID [2022-04-08 07:48:57,057 INFO L290 TraceCheckUtils]: 70: Hoare triple {4100#true} assume true; {4100#true} is VALID [2022-04-08 07:48:57,058 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {4100#true} {4307#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #57#return; {4307#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 07:48:57,058 INFO L290 TraceCheckUtils]: 72: Hoare triple {4307#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {4329#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 07:48:57,058 INFO L272 TraceCheckUtils]: 73: Hoare triple {4329#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4100#true} is VALID [2022-04-08 07:48:57,059 INFO L290 TraceCheckUtils]: 74: Hoare triple {4100#true} ~cond := #in~cond; {4100#true} is VALID [2022-04-08 07:48:57,059 INFO L290 TraceCheckUtils]: 75: Hoare triple {4100#true} assume !(0 == ~cond); {4100#true} is VALID [2022-04-08 07:48:57,059 INFO L290 TraceCheckUtils]: 76: Hoare triple {4100#true} assume true; {4100#true} is VALID [2022-04-08 07:48:57,059 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {4100#true} {4329#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #59#return; {4329#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 07:48:57,060 INFO L272 TraceCheckUtils]: 78: Hoare triple {4329#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {4348#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:48:57,060 INFO L290 TraceCheckUtils]: 79: Hoare triple {4348#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4352#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:48:57,060 INFO L290 TraceCheckUtils]: 80: Hoare triple {4352#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4101#false} is VALID [2022-04-08 07:48:57,060 INFO L290 TraceCheckUtils]: 81: Hoare triple {4101#false} assume !false; {4101#false} is VALID [2022-04-08 07:48:57,061 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 18 proven. 84 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-04-08 07:48:57,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:48:57,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:48:57,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734394694] [2022-04-08 07:48:57,396 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:48:57,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102652087] [2022-04-08 07:48:57,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102652087] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:48:57,396 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:48:57,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-08 07:48:57,396 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:48:57,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1778567651] [2022-04-08 07:48:57,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1778567651] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:48:57,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:48:57,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 07:48:57,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753407557] [2022-04-08 07:48:57,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:48:57,397 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 82 [2022-04-08 07:48:57,397 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:48:57,398 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-08 07:48:57,448 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:48:57,448 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 07:48:57,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:48:57,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 07:48:57,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-08 07:48:57,449 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-08 07:48:58,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:48:58,454 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-04-08 07:48:58,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 07:48:58,455 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 82 [2022-04-08 07:48:58,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:48:58,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-08 07:48:58,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2022-04-08 07:48:58,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-08 07:48:58,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2022-04-08 07:48:58,458 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 66 transitions. [2022-04-08 07:48:58,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:48:58,529 INFO L225 Difference]: With dead ends: 60 [2022-04-08 07:48:58,529 INFO L226 Difference]: Without dead ends: 54 [2022-04-08 07:48:58,529 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-04-08 07:48:58,530 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 2 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 07:48:58,531 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 351 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 07:48:58,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-08 07:48:58,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-08 07:48:58,579 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:48:58,580 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 07:48:58,580 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 07:48:58,580 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 07:48:58,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:48:58,582 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-04-08 07:48:58,582 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-08 07:48:58,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:48:58,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:48:58,583 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 54 states. [2022-04-08 07:48:58,583 INFO L87 Difference]: Start difference. First operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 54 states. [2022-04-08 07:48:58,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:48:58,585 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-04-08 07:48:58,585 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-08 07:48:58,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:48:58,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:48:58,586 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:48:58,586 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:48:58,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 07:48:58,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-04-08 07:48:58,588 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 82 [2022-04-08 07:48:58,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:48:58,588 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-04-08 07:48:58,588 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-08 07:48:58,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 63 transitions. [2022-04-08 07:48:59,453 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:48:59,453 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-08 07:48:59,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-08 07:48:59,454 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:48:59,454 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 9, 9, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:48:59,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-08 07:48:59,654 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-08 07:48:59,655 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:48:59,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:48:59,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1334355539, now seen corresponding path program 15 times [2022-04-08 07:48:59,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:48:59,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [627687627] [2022-04-08 07:48:59,656 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:48:59,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1334355539, now seen corresponding path program 16 times [2022-04-08 07:48:59,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:48:59,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610056937] [2022-04-08 07:48:59,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:48:59,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:48:59,667 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:48:59,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1194693851] [2022-04-08 07:48:59,667 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 07:48:59,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:48:59,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:48:59,669 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:48:59,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-08 07:48:59,712 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 07:48:59,712 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:48:59,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-08 07:48:59,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:48:59,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:49:00,298 INFO L272 TraceCheckUtils]: 0: Hoare triple {4755#true} call ULTIMATE.init(); {4755#true} is VALID [2022-04-08 07:49:00,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {4755#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); {4755#true} is VALID [2022-04-08 07:49:00,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {4755#true} assume true; {4755#true} is VALID [2022-04-08 07:49:00,299 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4755#true} {4755#true} #63#return; {4755#true} is VALID [2022-04-08 07:49:00,299 INFO L272 TraceCheckUtils]: 4: Hoare triple {4755#true} call #t~ret5 := main(); {4755#true} is VALID [2022-04-08 07:49:00,299 INFO L290 TraceCheckUtils]: 5: Hoare triple {4755#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; {4755#true} is VALID [2022-04-08 07:49:00,299 INFO L272 TraceCheckUtils]: 6: Hoare triple {4755#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {4755#true} is VALID [2022-04-08 07:49:00,299 INFO L290 TraceCheckUtils]: 7: Hoare triple {4755#true} ~cond := #in~cond; {4755#true} is VALID [2022-04-08 07:49:00,299 INFO L290 TraceCheckUtils]: 8: Hoare triple {4755#true} assume !(0 == ~cond); {4755#true} is VALID [2022-04-08 07:49:00,299 INFO L290 TraceCheckUtils]: 9: Hoare triple {4755#true} assume true; {4755#true} is VALID [2022-04-08 07:49:00,299 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4755#true} {4755#true} #53#return; {4755#true} is VALID [2022-04-08 07:49:00,299 INFO L272 TraceCheckUtils]: 11: Hoare triple {4755#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4755#true} is VALID [2022-04-08 07:49:00,299 INFO L290 TraceCheckUtils]: 12: Hoare triple {4755#true} ~cond := #in~cond; {4755#true} is VALID [2022-04-08 07:49:00,299 INFO L290 TraceCheckUtils]: 13: Hoare triple {4755#true} assume !(0 == ~cond); {4755#true} is VALID [2022-04-08 07:49:00,299 INFO L290 TraceCheckUtils]: 14: Hoare triple {4755#true} assume true; {4755#true} is VALID [2022-04-08 07:49:00,299 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4755#true} {4755#true} #55#return; {4755#true} is VALID [2022-04-08 07:49:00,300 INFO L290 TraceCheckUtils]: 16: Hoare triple {4755#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4808#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:49:00,300 INFO L290 TraceCheckUtils]: 17: Hoare triple {4808#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {4808#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:49:00,300 INFO L272 TraceCheckUtils]: 18: Hoare triple {4808#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4755#true} is VALID [2022-04-08 07:49:00,300 INFO L290 TraceCheckUtils]: 19: Hoare triple {4755#true} ~cond := #in~cond; {4755#true} is VALID [2022-04-08 07:49:00,300 INFO L290 TraceCheckUtils]: 20: Hoare triple {4755#true} assume !(0 == ~cond); {4755#true} is VALID [2022-04-08 07:49:00,300 INFO L290 TraceCheckUtils]: 21: Hoare triple {4755#true} assume true; {4755#true} is VALID [2022-04-08 07:49:00,301 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4755#true} {4808#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {4808#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:49:00,301 INFO L290 TraceCheckUtils]: 23: Hoare triple {4808#(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 * ~y~0 + ~x~0; {4830#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:49:00,302 INFO L290 TraceCheckUtils]: 24: Hoare triple {4830#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {4830#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:49:00,302 INFO L272 TraceCheckUtils]: 25: Hoare triple {4830#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4755#true} is VALID [2022-04-08 07:49:00,302 INFO L290 TraceCheckUtils]: 26: Hoare triple {4755#true} ~cond := #in~cond; {4755#true} is VALID [2022-04-08 07:49:00,302 INFO L290 TraceCheckUtils]: 27: Hoare triple {4755#true} assume !(0 == ~cond); {4755#true} is VALID [2022-04-08 07:49:00,302 INFO L290 TraceCheckUtils]: 28: Hoare triple {4755#true} assume true; {4755#true} is VALID [2022-04-08 07:49:00,302 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {4755#true} {4830#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #57#return; {4830#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:49:00,303 INFO L290 TraceCheckUtils]: 30: Hoare triple {4830#(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 * ~y~0 + ~x~0; {4852#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:49:00,303 INFO L290 TraceCheckUtils]: 31: Hoare triple {4852#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !false; {4852#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:49:00,303 INFO L272 TraceCheckUtils]: 32: Hoare triple {4852#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4755#true} is VALID [2022-04-08 07:49:00,303 INFO L290 TraceCheckUtils]: 33: Hoare triple {4755#true} ~cond := #in~cond; {4755#true} is VALID [2022-04-08 07:49:00,304 INFO L290 TraceCheckUtils]: 34: Hoare triple {4755#true} assume !(0 == ~cond); {4755#true} is VALID [2022-04-08 07:49:00,304 INFO L290 TraceCheckUtils]: 35: Hoare triple {4755#true} assume true; {4755#true} is VALID [2022-04-08 07:49:00,305 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4755#true} {4852#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #57#return; {4852#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:49:00,305 INFO L290 TraceCheckUtils]: 37: Hoare triple {4852#(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 * ~y~0 + ~x~0; {4874#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 07:49:00,306 INFO L290 TraceCheckUtils]: 38: Hoare triple {4874#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {4874#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 07:49:00,306 INFO L272 TraceCheckUtils]: 39: Hoare triple {4874#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4755#true} is VALID [2022-04-08 07:49:00,306 INFO L290 TraceCheckUtils]: 40: Hoare triple {4755#true} ~cond := #in~cond; {4755#true} is VALID [2022-04-08 07:49:00,306 INFO L290 TraceCheckUtils]: 41: Hoare triple {4755#true} assume !(0 == ~cond); {4755#true} is VALID [2022-04-08 07:49:00,306 INFO L290 TraceCheckUtils]: 42: Hoare triple {4755#true} assume true; {4755#true} is VALID [2022-04-08 07:49:00,307 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4755#true} {4874#(and (= main_~y~0 3) (= main_~c~0 3))} #57#return; {4874#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 07:49:00,307 INFO L290 TraceCheckUtils]: 44: Hoare triple {4874#(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 * ~y~0 + ~x~0; {4896#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 07:49:00,308 INFO L290 TraceCheckUtils]: 45: Hoare triple {4896#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !false; {4896#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 07:49:00,308 INFO L272 TraceCheckUtils]: 46: Hoare triple {4896#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4755#true} is VALID [2022-04-08 07:49:00,308 INFO L290 TraceCheckUtils]: 47: Hoare triple {4755#true} ~cond := #in~cond; {4755#true} is VALID [2022-04-08 07:49:00,308 INFO L290 TraceCheckUtils]: 48: Hoare triple {4755#true} assume !(0 == ~cond); {4755#true} is VALID [2022-04-08 07:49:00,308 INFO L290 TraceCheckUtils]: 49: Hoare triple {4755#true} assume true; {4755#true} is VALID [2022-04-08 07:49:00,316 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4755#true} {4896#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #57#return; {4896#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 07:49:00,316 INFO L290 TraceCheckUtils]: 51: Hoare triple {4896#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~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 * ~y~0 + ~x~0; {4918#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 07:49:00,317 INFO L290 TraceCheckUtils]: 52: Hoare triple {4918#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} assume !false; {4918#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 07:49:00,317 INFO L272 TraceCheckUtils]: 53: Hoare triple {4918#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4755#true} is VALID [2022-04-08 07:49:00,317 INFO L290 TraceCheckUtils]: 54: Hoare triple {4755#true} ~cond := #in~cond; {4755#true} is VALID [2022-04-08 07:49:00,317 INFO L290 TraceCheckUtils]: 55: Hoare triple {4755#true} assume !(0 == ~cond); {4755#true} is VALID [2022-04-08 07:49:00,317 INFO L290 TraceCheckUtils]: 56: Hoare triple {4755#true} assume true; {4755#true} is VALID [2022-04-08 07:49:00,318 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {4755#true} {4918#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} #57#return; {4918#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 07:49:00,318 INFO L290 TraceCheckUtils]: 58: Hoare triple {4918#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~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 * ~y~0 + ~x~0; {4940#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} is VALID [2022-04-08 07:49:00,319 INFO L290 TraceCheckUtils]: 59: Hoare triple {4940#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} assume !false; {4940#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} is VALID [2022-04-08 07:49:00,319 INFO L272 TraceCheckUtils]: 60: Hoare triple {4940#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4755#true} is VALID [2022-04-08 07:49:00,319 INFO L290 TraceCheckUtils]: 61: Hoare triple {4755#true} ~cond := #in~cond; {4755#true} is VALID [2022-04-08 07:49:00,319 INFO L290 TraceCheckUtils]: 62: Hoare triple {4755#true} assume !(0 == ~cond); {4755#true} is VALID [2022-04-08 07:49:00,319 INFO L290 TraceCheckUtils]: 63: Hoare triple {4755#true} assume true; {4755#true} is VALID [2022-04-08 07:49:00,319 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {4755#true} {4940#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} #57#return; {4940#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} is VALID [2022-04-08 07:49:00,320 INFO L290 TraceCheckUtils]: 65: Hoare triple {4940#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4962#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-08 07:49:00,320 INFO L290 TraceCheckUtils]: 66: Hoare triple {4962#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {4962#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-08 07:49:00,320 INFO L272 TraceCheckUtils]: 67: Hoare triple {4962#(and (= 7 main_~y~0) (= 7 main_~c~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4755#true} is VALID [2022-04-08 07:49:00,320 INFO L290 TraceCheckUtils]: 68: Hoare triple {4755#true} ~cond := #in~cond; {4755#true} is VALID [2022-04-08 07:49:00,320 INFO L290 TraceCheckUtils]: 69: Hoare triple {4755#true} assume !(0 == ~cond); {4755#true} is VALID [2022-04-08 07:49:00,321 INFO L290 TraceCheckUtils]: 70: Hoare triple {4755#true} assume true; {4755#true} is VALID [2022-04-08 07:49:00,321 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {4755#true} {4962#(and (= 7 main_~y~0) (= 7 main_~c~0))} #57#return; {4962#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-08 07:49:00,321 INFO L290 TraceCheckUtils]: 72: Hoare triple {4962#(and (= 7 main_~y~0) (= 7 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 * ~y~0 + ~x~0; {4984#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-08 07:49:00,322 INFO L290 TraceCheckUtils]: 73: Hoare triple {4984#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !false; {4984#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-08 07:49:00,322 INFO L272 TraceCheckUtils]: 74: Hoare triple {4984#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4755#true} is VALID [2022-04-08 07:49:00,322 INFO L290 TraceCheckUtils]: 75: Hoare triple {4755#true} ~cond := #in~cond; {4755#true} is VALID [2022-04-08 07:49:00,322 INFO L290 TraceCheckUtils]: 76: Hoare triple {4755#true} assume !(0 == ~cond); {4755#true} is VALID [2022-04-08 07:49:00,322 INFO L290 TraceCheckUtils]: 77: Hoare triple {4755#true} assume true; {4755#true} is VALID [2022-04-08 07:49:00,323 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {4755#true} {4984#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} #57#return; {4984#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-08 07:49:00,323 INFO L290 TraceCheckUtils]: 79: Hoare triple {4984#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !(~c~0 < ~k~0); {5006#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-08 07:49:00,323 INFO L272 TraceCheckUtils]: 80: Hoare triple {5006#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4755#true} is VALID [2022-04-08 07:49:00,323 INFO L290 TraceCheckUtils]: 81: Hoare triple {4755#true} ~cond := #in~cond; {4755#true} is VALID [2022-04-08 07:49:00,323 INFO L290 TraceCheckUtils]: 82: Hoare triple {4755#true} assume !(0 == ~cond); {4755#true} is VALID [2022-04-08 07:49:00,323 INFO L290 TraceCheckUtils]: 83: Hoare triple {4755#true} assume true; {4755#true} is VALID [2022-04-08 07:49:00,324 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {4755#true} {5006#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} #59#return; {5006#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-08 07:49:00,324 INFO L272 TraceCheckUtils]: 85: Hoare triple {5006#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {5025#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:49:00,325 INFO L290 TraceCheckUtils]: 86: Hoare triple {5025#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5029#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:49:00,325 INFO L290 TraceCheckUtils]: 87: Hoare triple {5029#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4756#false} is VALID [2022-04-08 07:49:00,325 INFO L290 TraceCheckUtils]: 88: Hoare triple {4756#false} assume !false; {4756#false} is VALID [2022-04-08 07:49:00,326 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 20 proven. 108 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-08 07:49:00,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:49:00,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:49:00,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610056937] [2022-04-08 07:49:00,621 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:49:00,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194693851] [2022-04-08 07:49:00,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194693851] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:49:00,621 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:49:00,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-08 07:49:00,621 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:49:00,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [627687627] [2022-04-08 07:49:00,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [627687627] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:49:00,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:49:00,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 07:49:00,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431911986] [2022-04-08 07:49:00,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:49:00,622 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) Word has length 89 [2022-04-08 07:49:00,622 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:49:00,623 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-08 07:49:00,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:49:00,676 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 07:49:00,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:49:00,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 07:49:00,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-08 07:49:00,677 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-08 07:49:01,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:49:01,769 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2022-04-08 07:49:01,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 07:49:01,769 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) Word has length 89 [2022-04-08 07:49:01,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:49:01,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-08 07:49:01,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 70 transitions. [2022-04-08 07:49:01,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-08 07:49:01,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 70 transitions. [2022-04-08 07:49:01,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 70 transitions. [2022-04-08 07:49:01,831 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:49:01,832 INFO L225 Difference]: With dead ends: 63 [2022-04-08 07:49:01,832 INFO L226 Difference]: Without dead ends: 57 [2022-04-08 07:49:01,833 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-04-08 07:49:01,833 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 2 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 07:49:01,833 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 394 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 07:49:01,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-08 07:49:01,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-08 07:49:01,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:49:01,884 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 07:49:01,884 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 07:49:01,884 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 07:49:01,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:49:01,886 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-08 07:49:01,886 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-08 07:49:01,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:49:01,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:49:01,886 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 57 states. [2022-04-08 07:49:01,887 INFO L87 Difference]: Start difference. First operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 57 states. [2022-04-08 07:49:01,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:49:01,888 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-08 07:49:01,888 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-08 07:49:01,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:49:01,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:49:01,889 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:49:01,889 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:49:01,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 07:49:01,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2022-04-08 07:49:01,891 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 89 [2022-04-08 07:49:01,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:49:01,891 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2022-04-08 07:49:01,891 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-08 07:49:01,891 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 67 transitions. [2022-04-08 07:49:03,159 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:49:03,159 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-08 07:49:03,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-04-08 07:49:03,161 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:49:03,161 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:49:03,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-08 07:49:03,363 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-08 07:49:03,363 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:49:03,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:49:03,364 INFO L85 PathProgramCache]: Analyzing trace with hash 711483229, now seen corresponding path program 17 times [2022-04-08 07:49:03,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:49:03,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [698377506] [2022-04-08 07:49:03,364 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:49:03,364 INFO L85 PathProgramCache]: Analyzing trace with hash 711483229, now seen corresponding path program 18 times [2022-04-08 07:49:03,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:49:03,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908612400] [2022-04-08 07:49:03,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:49:03,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:49:03,383 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:49:03,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1349591605] [2022-04-08 07:49:03,383 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 07:49:03,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:49:03,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:49:03,385 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:49:03,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process