/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_valuebound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 10:49:06,224 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 10:49:06,226 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 10:49:06,258 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 10:49:06,258 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 10:49:06,259 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 10:49:06,261 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 10:49:06,262 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 10:49:06,264 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 10:49:06,268 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 10:49:06,269 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 10:49:06,269 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 10:49:06,270 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 10:49:06,271 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 10:49:06,272 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 10:49:06,274 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 10:49:06,275 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 10:49:06,275 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 10:49:06,276 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 10:49:06,281 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 10:49:06,283 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 10:49:06,283 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 10:49:06,284 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 10:49:06,284 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 10:49:06,285 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 10:49:06,290 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 10:49:06,290 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 10:49:06,290 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 10:49:06,290 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 10:49:06,291 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 10:49:06,292 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 10:49:06,292 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 10:49:06,293 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 10:49:06,293 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 10:49:06,294 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 10:49:06,294 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 10:49:06,294 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 10:49:06,294 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 10:49:06,295 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 10:49:06,295 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 10:49:06,295 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 10:49:06,296 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 10:49:06,297 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 10:49:06,303 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 10:49:06,303 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 10:49:06,304 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 10:49:06,304 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 10:49:06,304 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 10:49:06,304 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 10:49:06,304 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 10:49:06,305 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 10:49:06,305 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 10:49:06,305 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 10:49:06,305 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 10:49:06,305 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 10:49:06,305 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 10:49:06,306 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 10:49:06,306 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 10:49:06,306 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 10:49:06,306 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 10:49:06,306 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 10:49:06,306 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 10:49:06,306 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 10:49:06,306 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 10:49:06,306 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 10:49:06,306 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 10:49:06,306 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 10:49:06,306 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 10:49:06,307 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-15 10:49:06,479 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 10:49:06,495 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 10:49:06,497 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 10:49:06,498 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 10:49:06,499 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 10:49:06,500 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_valuebound20.c [2022-04-15 10:49:06,563 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e00a4d5e1/eb65b94dfe7142ab9c0a0c9fb0c27b93/FLAG5f94d8703 [2022-04-15 10:49:06,912 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 10:49:06,913 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_valuebound20.c [2022-04-15 10:49:06,920 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e00a4d5e1/eb65b94dfe7142ab9c0a0c9fb0c27b93/FLAG5f94d8703 [2022-04-15 10:49:06,927 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e00a4d5e1/eb65b94dfe7142ab9c0a0c9fb0c27b93 [2022-04-15 10:49:06,929 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 10:49:06,930 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 10:49:06,931 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 10:49:06,931 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 10:49:06,934 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 10:49:06,934 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 10:49:06" (1/1) ... [2022-04-15 10:49:06,935 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34b78a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:49:06, skipping insertion in model container [2022-04-15 10:49:06,935 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 10:49:06" (1/1) ... [2022-04-15 10:49:06,951 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 10:49:06,961 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 10:49:07,053 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_valuebound20.c[458,471] [2022-04-15 10:49:07,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 10:49:07,098 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 10:49:07,121 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_valuebound20.c[458,471] [2022-04-15 10:49:07,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 10:49:07,143 INFO L208 MainTranslator]: Completed translation [2022-04-15 10:49:07,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:49:07 WrapperNode [2022-04-15 10:49:07,144 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 10:49:07,145 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 10:49:07,145 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 10:49:07,145 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 10:49:07,153 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:49:07" (1/1) ... [2022-04-15 10:49:07,154 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:49:07" (1/1) ... [2022-04-15 10:49:07,158 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:49:07" (1/1) ... [2022-04-15 10:49:07,159 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:49:07" (1/1) ... [2022-04-15 10:49:07,172 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:49:07" (1/1) ... [2022-04-15 10:49:07,177 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:49:07" (1/1) ... [2022-04-15 10:49:07,178 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:49:07" (1/1) ... [2022-04-15 10:49:07,183 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 10:49:07,184 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 10:49:07,184 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 10:49:07,184 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 10:49:07,185 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:49:07" (1/1) ... [2022-04-15 10:49:07,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 10:49:07,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:49:07,205 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-15 10:49:07,227 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-15 10:49:07,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 10:49:07,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 10:49:07,238 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 10:49:07,238 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 10:49:07,239 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 10:49:07,239 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 10:49:07,239 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 10:49:07,239 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 10:49:07,239 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 10:49:07,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 10:49:07,239 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-15 10:49:07,240 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 10:49:07,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 10:49:07,241 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 10:49:07,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 10:49:07,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 10:49:07,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 10:49:07,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 10:49:07,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 10:49:07,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 10:49:07,287 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 10:49:07,289 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 10:49:07,428 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 10:49:07,433 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 10:49:07,433 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 10:49:07,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 10:49:07 BoogieIcfgContainer [2022-04-15 10:49:07,438 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 10:49:07,440 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 10:49:07,440 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 10:49:07,444 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 10:49:07,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 10:49:06" (1/3) ... [2022-04-15 10:49:07,445 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73b26af5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 10:49:07, skipping insertion in model container [2022-04-15 10:49:07,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:49:07" (2/3) ... [2022-04-15 10:49:07,445 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73b26af5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 10:49:07, skipping insertion in model container [2022-04-15 10:49:07,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 10:49:07" (3/3) ... [2022-04-15 10:49:07,446 INFO L111 eAbstractionObserver]: Analyzing ICFG ps5-ll_valuebound20.c [2022-04-15 10:49:07,449 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 10:49:07,449 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 10:49:07,474 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 10:49:07,478 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-15 10:49:07,479 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 10:49:07,490 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-15 10:49:07,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 10:49:07,494 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:49:07,495 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-15 10:49:07,495 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:49:07,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:49:07,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1098891495, now seen corresponding path program 1 times [2022-04-15 10:49:07,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:49:07,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [53375200] [2022-04-15 10:49:07,510 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:49:07,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1098891495, now seen corresponding path program 2 times [2022-04-15 10:49:07,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:49:07,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996988970] [2022-04-15 10:49:07,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:49:07,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:49:07,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:49:07,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 10:49:07,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:49:07,636 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-15 10:49:07,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-15 10:49:07,637 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #63#return; {32#true} is VALID [2022-04-15 10:49:07,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 10:49:07,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:49:07,653 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-15 10:49:07,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-15 10:49:07,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-15 10:49:07,655 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-15 10:49:07,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 10:49:07,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:49:07,677 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-15 10:49:07,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-15 10:49:07,678 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-15 10:49:07,678 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID [2022-04-15 10:49:07,679 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-15 10:49:07,679 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-15 10:49:07,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-15 10:49:07,680 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #63#return; {32#true} is VALID [2022-04-15 10:49:07,680 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret5 := main(); {32#true} is VALID [2022-04-15 10:49:07,680 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-15 10:49:07,680 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {32#true} is VALID [2022-04-15 10:49:07,680 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-15 10:49:07,681 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-15 10:49:07,681 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-15 10:49:07,681 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-15 10:49:07,681 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-15 10:49:07,682 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-15 10:49:07,682 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-15 10:49:07,682 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-15 10:49:07,682 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID [2022-04-15 10:49:07,683 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {33#false} is VALID [2022-04-15 10:49:07,683 INFO L290 TraceCheckUtils]: 17: Hoare triple {33#false} assume false; {33#false} is VALID [2022-04-15 10:49:07,683 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-15 10:49:07,683 INFO L290 TraceCheckUtils]: 19: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-15 10:49:07,683 INFO L290 TraceCheckUtils]: 20: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-15 10:49:07,683 INFO L290 TraceCheckUtils]: 21: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-15 10:49:07,684 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-15 10:49:07,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:49:07,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996988970] [2022-04-15 10:49:07,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996988970] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:49:07,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:49:07,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 10:49:07,687 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:49:07,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [53375200] [2022-04-15 10:49:07,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [53375200] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:49:07,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:49:07,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 10:49:07,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074049633] [2022-04-15 10:49:07,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:49:07,696 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-15 10:49:07,697 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:49:07,699 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-15 10:49:07,736 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-15 10:49:07,737 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 10:49:07,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:49:07,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 10:49:07,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 10:49:07,755 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-15 10:49:07,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:49:07,874 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-15 10:49:07,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 10:49:07,874 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-15 10:49:07,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:49:07,877 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-15 10:49:07,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-04-15 10:49:07,884 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-15 10:49:07,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-04-15 10:49:07,887 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 69 transitions. [2022-04-15 10:49:07,960 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-15 10:49:07,965 INFO L225 Difference]: With dead ends: 51 [2022-04-15 10:49:07,965 INFO L226 Difference]: Without dead ends: 24 [2022-04-15 10:49:07,967 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-15 10:49:07,970 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-15 10:49:07,970 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-15 10:49:07,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-15 10:49:07,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-15 10:49:07,990 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:49:07,990 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-15 10:49:07,991 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-15 10:49:07,991 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-15 10:49:07,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:49:07,995 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-15 10:49:07,995 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-15 10:49:07,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:49:07,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:49:07,996 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-15 10:49:07,996 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-15 10:49:07,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:49:07,998 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-15 10:49:07,998 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-15 10:49:07,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:49:07,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:49:07,999 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:49:07,999 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:49:07,999 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-15 10:49:08,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-15 10:49:08,002 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 22 [2022-04-15 10:49:08,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:49:08,002 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-15 10:49:08,002 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-15 10:49:08,003 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 27 transitions. [2022-04-15 10:49:08,030 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-15 10:49:08,031 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-15 10:49:08,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 10:49:08,031 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:49:08,031 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-15 10:49:08,032 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 10:49:08,032 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:49:08,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:49:08,033 INFO L85 PathProgramCache]: Analyzing trace with hash 769620075, now seen corresponding path program 1 times [2022-04-15 10:49:08,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:49:08,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [581090617] [2022-04-15 10:49:08,033 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:49:08,033 INFO L85 PathProgramCache]: Analyzing trace with hash 769620075, now seen corresponding path program 2 times [2022-04-15 10:49:08,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:49:08,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352020310] [2022-04-15 10:49:08,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:49:08,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:49:08,059 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:49:08,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1943051164] [2022-04-15 10:49:08,059 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 10:49:08,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:49:08,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:49:08,065 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-15 10:49:08,066 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-15 10:49:08,100 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 10:49:08,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:49:08,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 10:49:08,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:49:08,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:49:08,235 INFO L272 TraceCheckUtils]: 0: Hoare triple {246#true} call ULTIMATE.init(); {246#true} is VALID [2022-04-15 10:49:08,235 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-15 10:49:08,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-15 10:49:08,235 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {246#true} {246#true} #63#return; {246#true} is VALID [2022-04-15 10:49:08,236 INFO L272 TraceCheckUtils]: 4: Hoare triple {246#true} call #t~ret5 := main(); {246#true} is VALID [2022-04-15 10:49:08,236 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-15 10:49:08,236 INFO L272 TraceCheckUtils]: 6: Hoare triple {246#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {246#true} is VALID [2022-04-15 10:49:08,236 INFO L290 TraceCheckUtils]: 7: Hoare triple {246#true} ~cond := #in~cond; {246#true} is VALID [2022-04-15 10:49:08,236 INFO L290 TraceCheckUtils]: 8: Hoare triple {246#true} assume !(0 == ~cond); {246#true} is VALID [2022-04-15 10:49:08,236 INFO L290 TraceCheckUtils]: 9: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-15 10:49:08,236 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {246#true} {246#true} #53#return; {246#true} is VALID [2022-04-15 10:49:08,237 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-15 10:49:08,237 INFO L290 TraceCheckUtils]: 12: Hoare triple {246#true} ~cond := #in~cond; {246#true} is VALID [2022-04-15 10:49:08,237 INFO L290 TraceCheckUtils]: 13: Hoare triple {246#true} assume !(0 == ~cond); {246#true} is VALID [2022-04-15 10:49:08,237 INFO L290 TraceCheckUtils]: 14: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-15 10:49:08,237 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {246#true} {246#true} #55#return; {246#true} is VALID [2022-04-15 10:49:08,238 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-15 10:49:08,238 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-15 10:49:08,239 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-15 10:49:08,239 INFO L290 TraceCheckUtils]: 19: Hoare triple {306#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {310#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:49:08,240 INFO L290 TraceCheckUtils]: 20: Hoare triple {310#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {247#false} is VALID [2022-04-15 10:49:08,240 INFO L290 TraceCheckUtils]: 21: Hoare triple {247#false} assume !false; {247#false} is VALID [2022-04-15 10:49:08,240 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-15 10:49:08,240 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 10:49:08,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:49:08,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352020310] [2022-04-15 10:49:08,249 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:49:08,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943051164] [2022-04-15 10:49:08,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943051164] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:49:08,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:49:08,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 10:49:08,250 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:49:08,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [581090617] [2022-04-15 10:49:08,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [581090617] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:49:08,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:49:08,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 10:49:08,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543362795] [2022-04-15 10:49:08,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:49:08,251 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-15 10:49:08,251 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:49:08,251 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-15 10:49:08,288 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-15 10:49:08,288 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 10:49:08,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:49:08,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 10:49:08,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 10:49:08,289 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-15 10:49:08,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:49:08,416 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-15 10:49:08,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 10:49:08,417 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-15 10:49:08,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:49:08,418 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-15 10:49:08,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-15 10:49:08,427 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-15 10:49:08,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-15 10:49:08,431 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-15 10:49:08,460 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-15 10:49:08,463 INFO L225 Difference]: With dead ends: 35 [2022-04-15 10:49:08,463 INFO L226 Difference]: Without dead ends: 31 [2022-04-15 10:49:08,465 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-15 10:49:08,466 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-15 10:49:08,466 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-15 10:49:08,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-15 10:49:08,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-15 10:49:08,474 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:49:08,474 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-15 10:49:08,474 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-15 10:49:08,475 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-15 10:49:08,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:49:08,476 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-15 10:49:08,476 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-15 10:49:08,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:49:08,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:49:08,477 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-15 10:49:08,477 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-15 10:49:08,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:49:08,479 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-15 10:49:08,479 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-15 10:49:08,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:49:08,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:49:08,479 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:49:08,479 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:49:08,480 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-15 10:49:08,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-04-15 10:49:08,481 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 22 [2022-04-15 10:49:08,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:49:08,481 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-04-15 10:49:08,481 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-15 10:49:08,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 34 transitions. [2022-04-15 10:49:08,511 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-15 10:49:08,512 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-15 10:49:08,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 10:49:08,516 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:49:08,516 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-15 10:49:08,535 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-15 10:49:08,721 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-15 10:49:08,722 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:49:08,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:49:08,722 INFO L85 PathProgramCache]: Analyzing trace with hash 645812411, now seen corresponding path program 1 times [2022-04-15 10:49:08,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:49:08,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2050283755] [2022-04-15 10:49:08,723 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:49:08,723 INFO L85 PathProgramCache]: Analyzing trace with hash 645812411, now seen corresponding path program 2 times [2022-04-15 10:49:08,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:49:08,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485538566] [2022-04-15 10:49:08,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:49:08,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:49:08,737 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:49:08,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [180690133] [2022-04-15 10:49:08,738 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 10:49:08,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:49:08,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:49:08,748 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-15 10:49:08,768 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-15 10:49:08,791 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 10:49:08,791 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:49:08,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 10:49:08,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:49:08,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:49:08,958 INFO L272 TraceCheckUtils]: 0: Hoare triple {512#true} call ULTIMATE.init(); {512#true} is VALID [2022-04-15 10:49:08,958 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-15 10:49:08,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-15 10:49:08,958 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {512#true} {512#true} #63#return; {512#true} is VALID [2022-04-15 10:49:08,958 INFO L272 TraceCheckUtils]: 4: Hoare triple {512#true} call #t~ret5 := main(); {512#true} is VALID [2022-04-15 10:49:08,959 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-15 10:49:08,959 INFO L272 TraceCheckUtils]: 6: Hoare triple {512#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {512#true} is VALID [2022-04-15 10:49:08,959 INFO L290 TraceCheckUtils]: 7: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-15 10:49:08,960 INFO L290 TraceCheckUtils]: 8: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-15 10:49:08,960 INFO L290 TraceCheckUtils]: 9: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-15 10:49:08,960 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {512#true} {512#true} #53#return; {512#true} is VALID [2022-04-15 10:49:08,960 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-15 10:49:08,960 INFO L290 TraceCheckUtils]: 12: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-15 10:49:08,960 INFO L290 TraceCheckUtils]: 13: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-15 10:49:08,961 INFO L290 TraceCheckUtils]: 14: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-15 10:49:08,961 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {512#true} {512#true} #55#return; {512#true} is VALID [2022-04-15 10:49:08,961 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-15 10:49:08,962 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-15 10:49:08,962 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-15 10:49:08,962 INFO L290 TraceCheckUtils]: 19: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-15 10:49:08,962 INFO L290 TraceCheckUtils]: 20: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-15 10:49:08,962 INFO L290 TraceCheckUtils]: 21: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-15 10:49:08,963 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-15 10:49:08,963 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-15 10:49:08,964 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-15 10:49:08,964 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-15 10:49:08,965 INFO L290 TraceCheckUtils]: 26: Hoare triple {594#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {598#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:49:08,965 INFO L290 TraceCheckUtils]: 27: Hoare triple {598#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {513#false} is VALID [2022-04-15 10:49:08,966 INFO L290 TraceCheckUtils]: 28: Hoare triple {513#false} assume !false; {513#false} is VALID [2022-04-15 10:49:08,966 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-15 10:49:08,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:49:11,373 INFO L290 TraceCheckUtils]: 28: Hoare triple {513#false} assume !false; {513#false} is VALID [2022-04-15 10:49:11,374 INFO L290 TraceCheckUtils]: 27: Hoare triple {598#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {513#false} is VALID [2022-04-15 10:49:11,375 INFO L290 TraceCheckUtils]: 26: Hoare triple {594#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {598#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:49:11,375 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-15 10:49:11,376 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-15 10:49:11,931 INFO 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 VALID [2022-04-15 10:49:11,932 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-15 10:49:11,932 INFO L290 TraceCheckUtils]: 21: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-15 10:49:11,933 INFO L290 TraceCheckUtils]: 20: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-15 10:49:11,933 INFO L290 TraceCheckUtils]: 19: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-15 10:49:11,933 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-15 10:49:11,933 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-15 10:49:11,934 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-15 10:49:11,934 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {512#true} {512#true} #55#return; {512#true} is VALID [2022-04-15 10:49:11,934 INFO L290 TraceCheckUtils]: 14: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-15 10:49:11,935 INFO L290 TraceCheckUtils]: 13: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-15 10:49:11,935 INFO L290 TraceCheckUtils]: 12: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-15 10:49:11,935 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-15 10:49:11,935 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {512#true} {512#true} #53#return; {512#true} is VALID [2022-04-15 10:49:11,935 INFO L290 TraceCheckUtils]: 9: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-15 10:49:11,935 INFO L290 TraceCheckUtils]: 8: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-15 10:49:11,935 INFO L290 TraceCheckUtils]: 7: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-15 10:49:11,935 INFO L272 TraceCheckUtils]: 6: Hoare triple {512#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {512#true} is VALID [2022-04-15 10:49:11,935 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-15 10:49:11,936 INFO L272 TraceCheckUtils]: 4: Hoare triple {512#true} call #t~ret5 := main(); {512#true} is VALID [2022-04-15 10:49:11,936 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {512#true} {512#true} #63#return; {512#true} is VALID [2022-04-15 10:49:11,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-15 10:49:11,936 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-15 10:49:11,936 INFO L272 TraceCheckUtils]: 0: Hoare triple {512#true} call ULTIMATE.init(); {512#true} is VALID [2022-04-15 10:49:11,936 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-15 10:49:11,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:49:11,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485538566] [2022-04-15 10:49:11,937 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:49:11,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180690133] [2022-04-15 10:49:11,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180690133] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 10:49:11,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 10:49:11,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-15 10:49:11,937 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:49:11,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2050283755] [2022-04-15 10:49:11,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2050283755] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:49:11,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:49:11,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 10:49:11,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738241727] [2022-04-15 10:49:11,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:49:11,938 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-15 10:49:11,938 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:49:11,939 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-15 10:49:12,965 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-15 10:49:12,965 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 10:49:12,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:49:12,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 10:49:12,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-15 10:49:12,966 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-15 10:49:13,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:49:13,092 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-15 10:49:13,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 10:49:13,093 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-15 10:49:13,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:49:13,093 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-15 10:49:13,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-15 10:49:13,094 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-15 10:49:13,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-15 10:49:13,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-15 10:49:13,688 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-15 10:49:13,689 INFO L225 Difference]: With dead ends: 37 [2022-04-15 10:49:13,689 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 10:49:13,690 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-15 10:49:13,691 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-15 10:49:13,691 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-15 10:49:13,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 10:49:13,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-15 10:49:13,702 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:49:13,702 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-15 10:49:13,702 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-15 10:49:13,703 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-15 10:49:13,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:49:13,704 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-15 10:49:13,704 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-15 10:49:13,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:49:13,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:49:13,705 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-15 10:49:13,705 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-15 10:49:13,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:49:13,706 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-15 10:49:13,706 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-15 10:49:13,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:49:13,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:49:13,707 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:49:13,707 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:49:13,707 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-15 10:49:13,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-04-15 10:49:13,708 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 29 [2022-04-15 10:49:13,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:49:13,709 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-04-15 10:49:13,709 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-15 10:49:13,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 35 transitions. [2022-04-15 10:49:15,741 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 34 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 10:49:15,741 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-15 10:49:15,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-15 10:49:15,743 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:49:15,743 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-15 10:49:15,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-15 10:49:15,943 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-15 10:49:15,944 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:49:15,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:49:15,944 INFO L85 PathProgramCache]: Analyzing trace with hash 463554397, now seen corresponding path program 1 times [2022-04-15 10:49:15,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:49:15,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [575991279] [2022-04-15 10:49:15,945 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:49:15,945 INFO L85 PathProgramCache]: Analyzing trace with hash 463554397, now seen corresponding path program 2 times [2022-04-15 10:49:15,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:49:15,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018440191] [2022-04-15 10:49:15,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:49:15,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:49:15,960 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:49:15,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1188625764] [2022-04-15 10:49:15,961 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 10:49:15,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:49:15,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:49:15,968 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-15 10:49:15,969 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-15 10:49:16,009 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 10:49:16,009 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:49:16,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 10:49:16,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:49:16,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:49:16,316 INFO L272 TraceCheckUtils]: 0: Hoare triple {900#true} call ULTIMATE.init(); {900#true} is VALID [2022-04-15 10:49:16,316 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-15 10:49:16,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-15 10:49:16,316 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {900#true} {900#true} #63#return; {900#true} is VALID [2022-04-15 10:49:16,317 INFO L272 TraceCheckUtils]: 4: Hoare triple {900#true} call #t~ret5 := main(); {900#true} is VALID [2022-04-15 10:49:16,317 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-15 10:49:16,317 INFO L272 TraceCheckUtils]: 6: Hoare triple {900#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {900#true} is VALID [2022-04-15 10:49:16,317 INFO L290 TraceCheckUtils]: 7: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-15 10:49:16,317 INFO L290 TraceCheckUtils]: 8: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-15 10:49:16,317 INFO L290 TraceCheckUtils]: 9: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-15 10:49:16,317 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {900#true} {900#true} #53#return; {900#true} is VALID [2022-04-15 10:49:16,317 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-15 10:49:16,318 INFO L290 TraceCheckUtils]: 12: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-15 10:49:16,318 INFO L290 TraceCheckUtils]: 13: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-15 10:49:16,318 INFO L290 TraceCheckUtils]: 14: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-15 10:49:16,318 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {900#true} {900#true} #55#return; {900#true} is VALID [2022-04-15 10:49:16,327 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-15 10:49:16,327 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-15 10:49:16,327 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-15 10:49:16,327 INFO L290 TraceCheckUtils]: 19: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-15 10:49:16,328 INFO L290 TraceCheckUtils]: 20: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-15 10:49:16,328 INFO L290 TraceCheckUtils]: 21: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-15 10:49:16,328 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-15 10:49:16,329 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-15 10:49:16,329 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-15 10:49:16,329 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-15 10:49:16,329 INFO L290 TraceCheckUtils]: 26: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-15 10:49:16,329 INFO L290 TraceCheckUtils]: 27: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-15 10:49:16,330 INFO L290 TraceCheckUtils]: 28: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-15 10:49:16,330 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-15 10:49:16,331 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-15 10:49:16,331 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-15 10:49:16,331 INFO L290 TraceCheckUtils]: 32: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-15 10:49:16,331 INFO L290 TraceCheckUtils]: 33: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-15 10:49:16,331 INFO L290 TraceCheckUtils]: 34: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-15 10:49:16,332 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-15 10:49:16,332 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-15 10:49:16,333 INFO L290 TraceCheckUtils]: 37: Hoare triple {1016#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1020#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:49:16,333 INFO L290 TraceCheckUtils]: 38: Hoare triple {1020#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {901#false} is VALID [2022-04-15 10:49:16,333 INFO L290 TraceCheckUtils]: 39: Hoare triple {901#false} assume !false; {901#false} is VALID [2022-04-15 10:49:16,333 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-15 10:49:16,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:49:16,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:49:16,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018440191] [2022-04-15 10:49:16,586 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:49:16,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188625764] [2022-04-15 10:49:16,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188625764] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 10:49:16,587 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 10:49:16,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-15 10:49:16,587 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:49:16,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [575991279] [2022-04-15 10:49:16,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [575991279] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:49:16,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:49:16,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 10:49:16,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446669660] [2022-04-15 10:49:16,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:49:16,588 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-15 10:49:16,588 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:49:16,588 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-15 10:49:16,616 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-15 10:49:16,616 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 10:49:16,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:49:16,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 10:49:16,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-15 10:49:16,617 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-15 10:49:16,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:49:16,795 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-15 10:49:16,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 10:49:16,796 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-15 10:49:16,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:49:16,796 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-15 10:49:16,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-15 10:49:16,797 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-15 10:49:16,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-15 10:49:16,798 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 42 transitions. [2022-04-15 10:49:16,829 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-15 10:49:16,831 INFO L225 Difference]: With dead ends: 42 [2022-04-15 10:49:16,831 INFO L226 Difference]: Without dead ends: 36 [2022-04-15 10:49:16,833 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-15 10:49:16,833 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-15 10:49:16,833 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.0s Time] [2022-04-15 10:49:16,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-15 10:49:16,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-15 10:49:16,851 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:49:16,851 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-15 10:49:16,851 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-15 10:49:16,852 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-15 10:49:16,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:49:16,854 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-15 10:49:16,854 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-15 10:49:16,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:49:16,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:49:16,855 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-15 10:49:16,856 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-15 10:49:16,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:49:16,858 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-15 10:49:16,858 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-15 10:49:16,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:49:16,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:49:16,858 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:49:16,858 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:49:16,858 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-15 10:49:16,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-04-15 10:49:16,859 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 40 [2022-04-15 10:49:16,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:49:16,860 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-04-15 10:49:16,860 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-15 10:49:16,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 39 transitions. [2022-04-15 10:49:17,161 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-15 10:49:17,162 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-15 10:49:17,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 10:49:17,162 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:49:17,162 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-15 10:49:17,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 10:49:17,367 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-15 10:49:17,367 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:49:17,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:49:17,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1886956461, now seen corresponding path program 3 times [2022-04-15 10:49:17,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:49:17,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [960610650] [2022-04-15 10:49:17,368 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:49:17,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1886956461, now seen corresponding path program 4 times [2022-04-15 10:49:17,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:49:17,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718940446] [2022-04-15 10:49:17,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:49:17,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:49:17,379 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:49:17,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1163533452] [2022-04-15 10:49:17,380 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 10:49:17,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:49:17,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:49:17,381 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-15 10:49:17,382 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-15 10:49:17,411 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 10:49:17,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:49:17,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 10:49:17,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:49:17,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:49:17,659 INFO L272 TraceCheckUtils]: 0: Hoare triple {1315#true} call ULTIMATE.init(); {1315#true} is VALID [2022-04-15 10:49:17,660 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-15 10:49:17,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-15 10:49:17,660 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1315#true} {1315#true} #63#return; {1315#true} is VALID [2022-04-15 10:49:17,660 INFO L272 TraceCheckUtils]: 4: Hoare triple {1315#true} call #t~ret5 := main(); {1315#true} is VALID [2022-04-15 10:49:17,660 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-15 10:49:17,660 INFO L272 TraceCheckUtils]: 6: Hoare triple {1315#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {1315#true} is VALID [2022-04-15 10:49:17,660 INFO L290 TraceCheckUtils]: 7: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-15 10:49:17,660 INFO L290 TraceCheckUtils]: 8: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-15 10:49:17,661 INFO L290 TraceCheckUtils]: 9: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-15 10:49:17,661 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1315#true} {1315#true} #53#return; {1315#true} is VALID [2022-04-15 10:49:17,661 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-15 10:49:17,661 INFO L290 TraceCheckUtils]: 12: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-15 10:49:17,661 INFO L290 TraceCheckUtils]: 13: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-15 10:49:17,661 INFO L290 TraceCheckUtils]: 14: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-15 10:49:17,661 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1315#true} {1315#true} #55#return; {1315#true} is VALID [2022-04-15 10:49:17,662 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-15 10:49:17,662 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-15 10:49:17,662 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-15 10:49:17,662 INFO L290 TraceCheckUtils]: 19: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-15 10:49:17,662 INFO L290 TraceCheckUtils]: 20: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-15 10:49:17,663 INFO L290 TraceCheckUtils]: 21: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-15 10:49:17,663 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-15 10:49:17,664 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) (= main_~c~0 1))} is VALID [2022-04-15 10:49:17,664 INFO L290 TraceCheckUtils]: 24: Hoare triple {1390#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {1390#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-15 10:49:17,665 INFO L272 TraceCheckUtils]: 25: Hoare triple {1390#(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)); {1315#true} is VALID [2022-04-15 10:49:17,665 INFO L290 TraceCheckUtils]: 26: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-15 10:49:17,665 INFO L290 TraceCheckUtils]: 27: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-15 10:49:17,665 INFO L290 TraceCheckUtils]: 28: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-15 10:49:17,671 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1315#true} {1390#(and (= main_~y~0 1) (= main_~c~0 1))} #57#return; {1390#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-15 10:49:17,672 INFO L290 TraceCheckUtils]: 30: Hoare triple {1390#(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; {1412#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-15 10:49:17,674 INFO L290 TraceCheckUtils]: 31: Hoare triple {1412#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} assume !false; {1412#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-15 10:49:17,675 INFO L272 TraceCheckUtils]: 32: Hoare triple {1412#(and (< 1 main_~k~0) (= (+ (- 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)); {1315#true} is VALID [2022-04-15 10:49:17,675 INFO L290 TraceCheckUtils]: 33: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-15 10:49:17,675 INFO L290 TraceCheckUtils]: 34: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-15 10:49:17,675 INFO L290 TraceCheckUtils]: 35: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-15 10:49:17,676 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1315#true} {1412#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} #57#return; {1412#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-15 10:49:17,676 INFO L290 TraceCheckUtils]: 37: Hoare triple {1412#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {1434#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} is VALID [2022-04-15 10:49:17,676 INFO L272 TraceCheckUtils]: 38: Hoare triple {1434#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= 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-15 10:49:17,677 INFO L290 TraceCheckUtils]: 39: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-15 10:49:17,677 INFO L290 TraceCheckUtils]: 40: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-15 10:49:17,677 INFO L290 TraceCheckUtils]: 41: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-15 10:49:17,677 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1315#true} {1434#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} #59#return; {1434#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} is VALID [2022-04-15 10:49:17,678 INFO L272 TraceCheckUtils]: 43: Hoare triple {1434#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= 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-15 10:49:17,678 INFO L290 TraceCheckUtils]: 44: Hoare triple {1453#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1457#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:49:17,681 INFO L290 TraceCheckUtils]: 45: Hoare triple {1457#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1316#false} is VALID [2022-04-15 10:49:17,682 INFO L290 TraceCheckUtils]: 46: Hoare triple {1316#false} assume !false; {1316#false} is VALID [2022-04-15 10:49:17,682 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-15 10:49:17,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:49:17,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:49:17,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718940446] [2022-04-15 10:49:17,953 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:49:17,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163533452] [2022-04-15 10:49:17,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163533452] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 10:49:17,953 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 10:49:17,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-15 10:49:17,954 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:49:17,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [960610650] [2022-04-15 10:49:17,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [960610650] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:49:17,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:49:17,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 10:49:17,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580414094] [2022-04-15 10:49:17,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:49:17,954 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-15 10:49:17,955 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:49:17,955 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-15 10:49:17,979 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-15 10:49:17,980 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 10:49:17,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:49:17,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 10:49:17,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-15 10:49:17,980 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-15 10:49:18,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:49:18,201 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-15 10:49:18,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 10:49:18,201 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-15 10:49:18,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:49:18,202 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-15 10:49:18,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-15 10:49:18,203 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-15 10:49:18,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-15 10:49:18,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 46 transitions. [2022-04-15 10:49:18,237 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-15 10:49:18,238 INFO L225 Difference]: With dead ends: 45 [2022-04-15 10:49:18,238 INFO L226 Difference]: Without dead ends: 39 [2022-04-15 10:49:18,238 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-15 10:49:18,238 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 2 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 10:49:18,239 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 166 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 10:49:18,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-15 10:49:18,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-15 10:49:18,255 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:49:18,255 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-15 10:49:18,256 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-15 10:49:18,256 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-15 10:49:18,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:49:18,257 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-15 10:49:18,257 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-15 10:49:18,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:49:18,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:49:18,257 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-15 10:49:18,258 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-15 10:49:18,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:49:18,259 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-15 10:49:18,259 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-15 10:49:18,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:49:18,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:49:18,259 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:49:18,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:49:18,259 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-15 10:49:18,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-04-15 10:49:18,260 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 47 [2022-04-15 10:49:18,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:49:18,261 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-04-15 10:49:18,261 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-15 10:49:18,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 43 transitions. [2022-04-15 10:49:18,615 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-15 10:49:18,616 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-15 10:49:18,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-15 10:49:18,616 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:49:18,616 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-15 10:49:18,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 10:49:18,816 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-15 10:49:18,817 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:49:18,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:49:18,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1213805219, now seen corresponding path program 5 times [2022-04-15 10:49:18,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:49:18,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [560018006] [2022-04-15 10:49:18,818 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:49:18,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1213805219, now seen corresponding path program 6 times [2022-04-15 10:49:18,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:49:18,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477028285] [2022-04-15 10:49:18,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:49:18,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:49:18,828 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:49:18,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [440977241] [2022-04-15 10:49:18,828 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 10:49:18,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:49:18,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:49:18,829 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-15 10:49:18,830 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-15 10:49:19,131 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-15 10:49:19,131 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:49:19,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 10:49:19,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:49:19,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:49:19,424 INFO L272 TraceCheckUtils]: 0: Hoare triple {1770#true} call ULTIMATE.init(); {1770#true} is VALID [2022-04-15 10:49:19,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {1770#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); {1770#true} is VALID [2022-04-15 10:49:19,424 INFO L290 TraceCheckUtils]: 2: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-15 10:49:19,424 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1770#true} {1770#true} #63#return; {1770#true} is VALID [2022-04-15 10:49:19,425 INFO L272 TraceCheckUtils]: 4: Hoare triple {1770#true} call #t~ret5 := main(); {1770#true} is VALID [2022-04-15 10:49:19,425 INFO L290 TraceCheckUtils]: 5: Hoare triple {1770#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; {1770#true} is VALID [2022-04-15 10:49:19,425 INFO L272 TraceCheckUtils]: 6: Hoare triple {1770#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {1770#true} is VALID [2022-04-15 10:49:19,425 INFO L290 TraceCheckUtils]: 7: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID [2022-04-15 10:49:19,425 INFO L290 TraceCheckUtils]: 8: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID [2022-04-15 10:49:19,425 INFO L290 TraceCheckUtils]: 9: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-15 10:49:19,425 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1770#true} {1770#true} #53#return; {1770#true} is VALID [2022-04-15 10:49:19,425 INFO L272 TraceCheckUtils]: 11: Hoare triple {1770#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1770#true} is VALID [2022-04-15 10:49:19,425 INFO L290 TraceCheckUtils]: 12: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID [2022-04-15 10:49:19,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID [2022-04-15 10:49:19,425 INFO L290 TraceCheckUtils]: 14: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-15 10:49:19,426 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1770#true} {1770#true} #55#return; {1770#true} is VALID [2022-04-15 10:49:19,426 INFO L290 TraceCheckUtils]: 16: Hoare triple {1770#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1823#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:49:19,426 INFO L290 TraceCheckUtils]: 17: Hoare triple {1823#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1823#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:49:19,426 INFO L272 TraceCheckUtils]: 18: Hoare triple {1823#(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)); {1770#true} is VALID [2022-04-15 10:49:19,427 INFO L290 TraceCheckUtils]: 19: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID [2022-04-15 10:49:19,427 INFO L290 TraceCheckUtils]: 20: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID [2022-04-15 10:49:19,427 INFO L290 TraceCheckUtils]: 21: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-15 10:49:19,427 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1770#true} {1823#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {1823#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:49:19,428 INFO L290 TraceCheckUtils]: 23: Hoare triple {1823#(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; {1845#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-15 10:49:19,428 INFO L290 TraceCheckUtils]: 24: Hoare triple {1845#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {1845#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-15 10:49:19,428 INFO L272 TraceCheckUtils]: 25: Hoare triple {1845#(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)); {1770#true} is VALID [2022-04-15 10:49:19,428 INFO L290 TraceCheckUtils]: 26: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID [2022-04-15 10:49:19,428 INFO L290 TraceCheckUtils]: 27: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID [2022-04-15 10:49:19,428 INFO L290 TraceCheckUtils]: 28: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-15 10:49:19,429 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1770#true} {1845#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #57#return; {1845#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-15 10:49:19,429 INFO L290 TraceCheckUtils]: 30: Hoare triple {1845#(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; {1867#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-15 10:49:19,430 INFO L290 TraceCheckUtils]: 31: Hoare triple {1867#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !false; {1867#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-15 10:49:19,430 INFO L272 TraceCheckUtils]: 32: Hoare triple {1867#(and (= (+ (- 2) main_~y~0) 0) (= 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)); {1770#true} is VALID [2022-04-15 10:49:19,430 INFO L290 TraceCheckUtils]: 33: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID [2022-04-15 10:49:19,430 INFO L290 TraceCheckUtils]: 34: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID [2022-04-15 10:49:19,430 INFO L290 TraceCheckUtils]: 35: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-15 10:49:19,431 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1770#true} {1867#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #57#return; {1867#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-15 10:49:19,431 INFO L290 TraceCheckUtils]: 37: Hoare triple {1867#(and (= (+ (- 2) main_~y~0) 0) (= 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; {1889#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-15 10:49:19,431 INFO L290 TraceCheckUtils]: 38: Hoare triple {1889#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} assume !false; {1889#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-15 10:49:19,432 INFO L272 TraceCheckUtils]: 39: Hoare triple {1889#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 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)); {1770#true} is VALID [2022-04-15 10:49:19,432 INFO L290 TraceCheckUtils]: 40: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID [2022-04-15 10:49:19,432 INFO L290 TraceCheckUtils]: 41: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID [2022-04-15 10:49:19,432 INFO L290 TraceCheckUtils]: 42: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-15 10:49:19,437 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1770#true} {1889#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} #57#return; {1889#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-15 10:49:19,437 INFO L290 TraceCheckUtils]: 44: Hoare triple {1889#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {1911#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-15 10:49:19,437 INFO L272 TraceCheckUtils]: 45: Hoare triple {1911#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 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)); {1770#true} is VALID [2022-04-15 10:49:19,437 INFO L290 TraceCheckUtils]: 46: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID [2022-04-15 10:49:19,437 INFO L290 TraceCheckUtils]: 47: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID [2022-04-15 10:49:19,437 INFO L290 TraceCheckUtils]: 48: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-15 10:49:19,438 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {1770#true} {1911#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} #59#return; {1911#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-15 10:49:19,439 INFO L272 TraceCheckUtils]: 50: Hoare triple {1911#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1930#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:49:19,439 INFO L290 TraceCheckUtils]: 51: Hoare triple {1930#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1934#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:49:19,440 INFO L290 TraceCheckUtils]: 52: Hoare triple {1934#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1771#false} is VALID [2022-04-15 10:49:19,440 INFO L290 TraceCheckUtils]: 53: Hoare triple {1771#false} assume !false; {1771#false} is VALID [2022-04-15 10:49:19,440 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-15 10:49:19,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:49:19,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:49:19,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477028285] [2022-04-15 10:49:19,671 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:49:19,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440977241] [2022-04-15 10:49:19,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440977241] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 10:49:19,672 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 10:49:19,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-15 10:49:19,672 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:49:19,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [560018006] [2022-04-15 10:49:19,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [560018006] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:49:19,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:49:19,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 10:49:19,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703789436] [2022-04-15 10:49:19,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:49:19,673 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-15 10:49:19,673 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:49:19,673 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-15 10:49:19,701 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-15 10:49:19,701 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 10:49:19,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:49:19,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 10:49:19,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-15 10:49:19,702 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-15 10:49:20,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:49:20,075 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-04-15 10:49:20,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 10:49:20,075 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-15 10:49:20,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:49:20,076 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-15 10:49:20,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-15 10:49:20,077 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-15 10:49:20,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-15 10:49:20,078 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2022-04-15 10:49:20,110 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-15 10:49:20,111 INFO L225 Difference]: With dead ends: 48 [2022-04-15 10:49:20,111 INFO L226 Difference]: Without dead ends: 42 [2022-04-15 10:49:20,111 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-15 10:49:20,112 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-15 10:49:20,112 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.1s Time] [2022-04-15 10:49:20,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-15 10:49:20,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-15 10:49:20,134 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:49:20,134 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-15 10:49:20,135 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-15 10:49:20,135 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-15 10:49:20,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:49:20,136 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-15 10:49:20,136 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-15 10:49:20,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:49:20,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:49:20,137 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-15 10:49:20,137 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-15 10:49:20,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:49:20,138 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-15 10:49:20,138 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-15 10:49:20,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:49:20,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:49:20,139 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:49:20,139 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:49:20,139 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-15 10:49:20,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-04-15 10:49:20,140 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 54 [2022-04-15 10:49:20,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:49:20,140 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-04-15 10:49:20,141 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-15 10:49:20,141 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 47 transitions. [2022-04-15 10:49:20,514 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-15 10:49:20,514 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-15 10:49:20,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-15 10:49:20,515 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:49:20,515 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-15 10:49:20,521 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-15 10:49:20,715 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-15 10:49:20,716 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:49:20,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:49:20,716 INFO L85 PathProgramCache]: Analyzing trace with hash 307258797, now seen corresponding path program 7 times [2022-04-15 10:49:20,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:49:20,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [332976569] [2022-04-15 10:49:20,717 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:49:20,717 INFO L85 PathProgramCache]: Analyzing trace with hash 307258797, now seen corresponding path program 8 times [2022-04-15 10:49:20,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:49:20,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201254847] [2022-04-15 10:49:20,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:49:20,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:49:20,730 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:49:20,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1409582445] [2022-04-15 10:49:20,731 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 10:49:20,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:49:20,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:49:20,732 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-15 10:49:20,733 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-15 10:49:21,516 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 10:49:21,517 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:49:21,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 10:49:21,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:49:21,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:49:21,896 INFO L272 TraceCheckUtils]: 0: Hoare triple {2265#true} call ULTIMATE.init(); {2265#true} is VALID [2022-04-15 10:49:21,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {2265#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); {2265#true} is VALID [2022-04-15 10:49:21,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {2265#true} assume true; {2265#true} is VALID [2022-04-15 10:49:21,896 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2265#true} {2265#true} #63#return; {2265#true} is VALID [2022-04-15 10:49:21,897 INFO L272 TraceCheckUtils]: 4: Hoare triple {2265#true} call #t~ret5 := main(); {2265#true} is VALID [2022-04-15 10:49:21,897 INFO L290 TraceCheckUtils]: 5: Hoare triple {2265#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; {2265#true} is VALID [2022-04-15 10:49:21,897 INFO L272 TraceCheckUtils]: 6: Hoare triple {2265#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {2265#true} is VALID [2022-04-15 10:49:21,897 INFO L290 TraceCheckUtils]: 7: Hoare triple {2265#true} ~cond := #in~cond; {2265#true} is VALID [2022-04-15 10:49:21,897 INFO L290 TraceCheckUtils]: 8: Hoare triple {2265#true} assume !(0 == ~cond); {2265#true} is VALID [2022-04-15 10:49:21,897 INFO L290 TraceCheckUtils]: 9: Hoare triple {2265#true} assume true; {2265#true} is VALID [2022-04-15 10:49:21,897 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2265#true} {2265#true} #53#return; {2265#true} is VALID [2022-04-15 10:49:21,897 INFO L272 TraceCheckUtils]: 11: Hoare triple {2265#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2265#true} is VALID [2022-04-15 10:49:21,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {2265#true} ~cond := #in~cond; {2265#true} is VALID [2022-04-15 10:49:21,897 INFO L290 TraceCheckUtils]: 13: Hoare triple {2265#true} assume !(0 == ~cond); {2265#true} is VALID [2022-04-15 10:49:21,897 INFO L290 TraceCheckUtils]: 14: Hoare triple {2265#true} assume true; {2265#true} is VALID [2022-04-15 10:49:21,898 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2265#true} {2265#true} #55#return; {2265#true} is VALID [2022-04-15 10:49:21,898 INFO L290 TraceCheckUtils]: 16: Hoare triple {2265#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2318#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:49:21,899 INFO L290 TraceCheckUtils]: 17: Hoare triple {2318#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2318#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:49:21,899 INFO L272 TraceCheckUtils]: 18: Hoare triple {2318#(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)); {2265#true} is VALID [2022-04-15 10:49:21,899 INFO L290 TraceCheckUtils]: 19: Hoare triple {2265#true} ~cond := #in~cond; {2265#true} is VALID [2022-04-15 10:49:21,899 INFO L290 TraceCheckUtils]: 20: Hoare triple {2265#true} assume !(0 == ~cond); {2265#true} is VALID [2022-04-15 10:49:21,899 INFO L290 TraceCheckUtils]: 21: Hoare triple {2265#true} assume true; {2265#true} is VALID [2022-04-15 10:49:21,900 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2265#true} {2318#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {2318#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:49:21,900 INFO L290 TraceCheckUtils]: 23: Hoare triple {2318#(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; {2340#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-15 10:49:21,901 INFO L290 TraceCheckUtils]: 24: Hoare triple {2340#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {2340#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-15 10:49:21,901 INFO L272 TraceCheckUtils]: 25: Hoare triple {2340#(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)); {2265#true} is VALID [2022-04-15 10:49:21,901 INFO L290 TraceCheckUtils]: 26: Hoare triple {2265#true} ~cond := #in~cond; {2265#true} is VALID [2022-04-15 10:49:21,901 INFO L290 TraceCheckUtils]: 27: Hoare triple {2265#true} assume !(0 == ~cond); {2265#true} is VALID [2022-04-15 10:49:21,901 INFO L290 TraceCheckUtils]: 28: Hoare triple {2265#true} assume true; {2265#true} is VALID [2022-04-15 10:49:21,901 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2265#true} {2340#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #57#return; {2340#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-15 10:49:21,902 INFO L290 TraceCheckUtils]: 30: Hoare triple {2340#(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; {2362#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-15 10:49:21,902 INFO L290 TraceCheckUtils]: 31: Hoare triple {2362#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !false; {2362#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-15 10:49:21,902 INFO L272 TraceCheckUtils]: 32: Hoare triple {2362#(and (= (+ (- 1) main_~y~0) 1) (= 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)); {2265#true} is VALID [2022-04-15 10:49:21,903 INFO L290 TraceCheckUtils]: 33: Hoare triple {2265#true} ~cond := #in~cond; {2265#true} is VALID [2022-04-15 10:49:21,903 INFO L290 TraceCheckUtils]: 34: Hoare triple {2265#true} assume !(0 == ~cond); {2265#true} is VALID [2022-04-15 10:49:21,903 INFO L290 TraceCheckUtils]: 35: Hoare triple {2265#true} assume true; {2265#true} is VALID [2022-04-15 10:49:21,903 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2265#true} {2362#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #57#return; {2362#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-15 10:49:21,904 INFO L290 TraceCheckUtils]: 37: Hoare triple {2362#(and (= (+ (- 1) main_~y~0) 1) (= 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; {2384#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-15 10:49:21,904 INFO L290 TraceCheckUtils]: 38: Hoare triple {2384#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} assume !false; {2384#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-15 10:49:21,904 INFO L272 TraceCheckUtils]: 39: Hoare triple {2384#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 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)); {2265#true} is VALID [2022-04-15 10:49:21,904 INFO L290 TraceCheckUtils]: 40: Hoare triple {2265#true} ~cond := #in~cond; {2265#true} is VALID [2022-04-15 10:49:21,904 INFO L290 TraceCheckUtils]: 41: Hoare triple {2265#true} assume !(0 == ~cond); {2265#true} is VALID [2022-04-15 10:49:21,904 INFO L290 TraceCheckUtils]: 42: Hoare triple {2265#true} assume true; {2265#true} is VALID [2022-04-15 10:49:21,905 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2265#true} {2384#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} #57#return; {2384#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-15 10:49:21,905 INFO L290 TraceCheckUtils]: 44: Hoare triple {2384#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2406#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-15 10:49:21,906 INFO L290 TraceCheckUtils]: 45: Hoare triple {2406#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !false; {2406#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-15 10:49:21,906 INFO L272 TraceCheckUtils]: 46: Hoare triple {2406#(and (= main_~y~0 4) (< 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)); {2265#true} is VALID [2022-04-15 10:49:21,906 INFO L290 TraceCheckUtils]: 47: Hoare triple {2265#true} ~cond := #in~cond; {2265#true} is VALID [2022-04-15 10:49:21,906 INFO L290 TraceCheckUtils]: 48: Hoare triple {2265#true} assume !(0 == ~cond); {2265#true} is VALID [2022-04-15 10:49:21,906 INFO L290 TraceCheckUtils]: 49: Hoare triple {2265#true} assume true; {2265#true} is VALID [2022-04-15 10:49:21,907 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2265#true} {2406#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} #57#return; {2406#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-15 10:49:21,907 INFO L290 TraceCheckUtils]: 51: Hoare triple {2406#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {2428#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 10:49:21,907 INFO L272 TraceCheckUtils]: 52: Hoare triple {2428#(and (= main_~y~0 4) (< 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)); {2265#true} is VALID [2022-04-15 10:49:21,907 INFO L290 TraceCheckUtils]: 53: Hoare triple {2265#true} ~cond := #in~cond; {2265#true} is VALID [2022-04-15 10:49:21,908 INFO L290 TraceCheckUtils]: 54: Hoare triple {2265#true} assume !(0 == ~cond); {2265#true} is VALID [2022-04-15 10:49:21,908 INFO L290 TraceCheckUtils]: 55: Hoare triple {2265#true} assume true; {2265#true} is VALID [2022-04-15 10:49:21,908 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {2265#true} {2428#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} #59#return; {2428#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 10:49:21,909 INFO L272 TraceCheckUtils]: 57: Hoare triple {2428#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2447#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:49:21,909 INFO L290 TraceCheckUtils]: 58: Hoare triple {2447#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2451#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:49:21,910 INFO L290 TraceCheckUtils]: 59: Hoare triple {2451#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2266#false} is VALID [2022-04-15 10:49:21,910 INFO L290 TraceCheckUtils]: 60: Hoare triple {2266#false} assume !false; {2266#false} is VALID [2022-04-15 10:49:21,910 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-15 10:49:21,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:49:22,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:49:22,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201254847] [2022-04-15 10:49:22,170 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:49:22,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409582445] [2022-04-15 10:49:22,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409582445] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 10:49:22,170 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 10:49:22,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-15 10:49:22,171 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:49:22,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [332976569] [2022-04-15 10:49:22,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [332976569] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:49:22,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:49:22,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 10:49:22,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754074077] [2022-04-15 10:49:22,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:49:22,173 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-15 10:49:22,173 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:49:22,173 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-15 10:49:22,203 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-15 10:49:22,203 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 10:49:22,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:49:22,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 10:49:22,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-15 10:49:22,204 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-15 10:49:22,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:49:22,616 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2022-04-15 10:49:22,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 10:49:22,616 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-15 10:49:22,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:49:22,616 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-15 10:49:22,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-15 10:49:22,617 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-15 10:49:22,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-15 10:49:22,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 54 transitions. [2022-04-15 10:49:22,653 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-15 10:49:22,654 INFO L225 Difference]: With dead ends: 51 [2022-04-15 10:49:22,654 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 10:49:22,654 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-04-15 10:49:22,655 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 2 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-15 10:49:22,655 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-15 10:49:22,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 10:49:22,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-15 10:49:22,680 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:49:22,680 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-15 10:49:22,680 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-15 10:49:22,681 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-15 10:49:22,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:49:22,682 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-15 10:49:22,682 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-15 10:49:22,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:49:22,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:49:22,682 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-15 10:49:22,682 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-15 10:49:22,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:49:22,685 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-15 10:49:22,685 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-15 10:49:22,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:49:22,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:49:22,685 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:49:22,685 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:49:22,685 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-15 10:49:22,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2022-04-15 10:49:22,687 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 61 [2022-04-15 10:49:22,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:49:22,687 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2022-04-15 10:49:22,688 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-15 10:49:22,688 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 51 transitions. [2022-04-15 10:49:22,951 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-15 10:49:22,951 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-15 10:49:22,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-15 10:49:22,952 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:49:22,952 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-15 10:49:22,959 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-15 10:49:23,157 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-15 10:49:23,157 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:49:23,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:49:23,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1082774365, now seen corresponding path program 9 times [2022-04-15 10:49:23,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:49:23,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [830872417] [2022-04-15 10:49:23,158 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:49:23,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1082774365, now seen corresponding path program 10 times [2022-04-15 10:49:23,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:49:23,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254219767] [2022-04-15 10:49:23,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:49:23,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:49:23,191 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:49:23,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [350765180] [2022-04-15 10:49:23,197 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 10:49:23,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:49:23,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:49:23,199 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-15 10:49:23,200 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-15 10:49:23,233 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 10:49:23,234 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:49:23,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-15 10:49:23,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:49:23,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:49:23,592 INFO L272 TraceCheckUtils]: 0: Hoare triple {2800#true} call ULTIMATE.init(); {2800#true} is VALID [2022-04-15 10:49:23,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {2800#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); {2800#true} is VALID [2022-04-15 10:49:23,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-15 10:49:23,592 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2800#true} {2800#true} #63#return; {2800#true} is VALID [2022-04-15 10:49:23,593 INFO L272 TraceCheckUtils]: 4: Hoare triple {2800#true} call #t~ret5 := main(); {2800#true} is VALID [2022-04-15 10:49:23,593 INFO L290 TraceCheckUtils]: 5: Hoare triple {2800#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; {2800#true} is VALID [2022-04-15 10:49:23,593 INFO L272 TraceCheckUtils]: 6: Hoare triple {2800#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {2800#true} is VALID [2022-04-15 10:49:23,593 INFO L290 TraceCheckUtils]: 7: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID [2022-04-15 10:49:23,593 INFO L290 TraceCheckUtils]: 8: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID [2022-04-15 10:49:23,593 INFO L290 TraceCheckUtils]: 9: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-15 10:49:23,593 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2800#true} {2800#true} #53#return; {2800#true} is VALID [2022-04-15 10:49:23,593 INFO L272 TraceCheckUtils]: 11: Hoare triple {2800#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2800#true} is VALID [2022-04-15 10:49:23,593 INFO L290 TraceCheckUtils]: 12: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID [2022-04-15 10:49:23,593 INFO L290 TraceCheckUtils]: 13: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID [2022-04-15 10:49:23,593 INFO L290 TraceCheckUtils]: 14: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-15 10:49:23,593 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2800#true} {2800#true} #55#return; {2800#true} is VALID [2022-04-15 10:49:23,595 INFO L290 TraceCheckUtils]: 16: Hoare triple {2800#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2853#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:49:23,595 INFO L290 TraceCheckUtils]: 17: Hoare triple {2853#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2853#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:49:23,595 INFO L272 TraceCheckUtils]: 18: Hoare triple {2853#(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)); {2800#true} is VALID [2022-04-15 10:49:23,595 INFO L290 TraceCheckUtils]: 19: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID [2022-04-15 10:49:23,595 INFO L290 TraceCheckUtils]: 20: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID [2022-04-15 10:49:23,595 INFO L290 TraceCheckUtils]: 21: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-15 10:49:23,599 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2800#true} {2853#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {2853#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:49:23,600 INFO L290 TraceCheckUtils]: 23: Hoare triple {2853#(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; {2875#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-15 10:49:23,600 INFO L290 TraceCheckUtils]: 24: Hoare triple {2875#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {2875#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-15 10:49:23,600 INFO L272 TraceCheckUtils]: 25: Hoare triple {2875#(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)); {2800#true} is VALID [2022-04-15 10:49:23,600 INFO L290 TraceCheckUtils]: 26: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID [2022-04-15 10:49:23,601 INFO L290 TraceCheckUtils]: 27: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID [2022-04-15 10:49:23,601 INFO L290 TraceCheckUtils]: 28: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-15 10:49:23,601 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2800#true} {2875#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #57#return; {2875#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-15 10:49:23,601 INFO L290 TraceCheckUtils]: 30: Hoare triple {2875#(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; {2897#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-15 10:49:23,602 INFO L290 TraceCheckUtils]: 31: Hoare triple {2897#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {2897#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-15 10:49:23,602 INFO L272 TraceCheckUtils]: 32: Hoare triple {2897#(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)); {2800#true} is VALID [2022-04-15 10:49:23,602 INFO L290 TraceCheckUtils]: 33: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID [2022-04-15 10:49:23,602 INFO L290 TraceCheckUtils]: 34: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID [2022-04-15 10:49:23,602 INFO L290 TraceCheckUtils]: 35: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-15 10:49:23,603 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2800#true} {2897#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #57#return; {2897#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-15 10:49:23,603 INFO L290 TraceCheckUtils]: 37: Hoare triple {2897#(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; {2919#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-15 10:49:23,603 INFO L290 TraceCheckUtils]: 38: Hoare triple {2919#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !false; {2919#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-15 10:49:23,603 INFO L272 TraceCheckUtils]: 39: Hoare triple {2919#(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)); {2800#true} is VALID [2022-04-15 10:49:23,603 INFO L290 TraceCheckUtils]: 40: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID [2022-04-15 10:49:23,604 INFO L290 TraceCheckUtils]: 41: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID [2022-04-15 10:49:23,604 INFO L290 TraceCheckUtils]: 42: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-15 10:49:23,604 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2800#true} {2919#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #57#return; {2919#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-15 10:49:23,604 INFO L290 TraceCheckUtils]: 44: Hoare triple {2919#(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; {2941#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 10:49:23,605 INFO L290 TraceCheckUtils]: 45: Hoare triple {2941#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !false; {2941#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 10:49:23,605 INFO L272 TraceCheckUtils]: 46: Hoare triple {2941#(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)); {2800#true} is VALID [2022-04-15 10:49:23,605 INFO L290 TraceCheckUtils]: 47: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID [2022-04-15 10:49:23,605 INFO L290 TraceCheckUtils]: 48: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID [2022-04-15 10:49:23,605 INFO L290 TraceCheckUtils]: 49: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-15 10:49:23,605 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2800#true} {2941#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} #57#return; {2941#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 10:49:23,606 INFO L290 TraceCheckUtils]: 51: Hoare triple {2941#(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; {2963#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-15 10:49:23,606 INFO L290 TraceCheckUtils]: 52: Hoare triple {2963#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} assume !false; {2963#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-15 10:49:23,606 INFO L272 TraceCheckUtils]: 53: Hoare triple {2963#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 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)); {2800#true} is VALID [2022-04-15 10:49:23,606 INFO L290 TraceCheckUtils]: 54: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID [2022-04-15 10:49:23,607 INFO L290 TraceCheckUtils]: 55: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID [2022-04-15 10:49:23,607 INFO L290 TraceCheckUtils]: 56: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-15 10:49:23,608 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {2800#true} {2963#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} #57#return; {2963#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-15 10:49:23,608 INFO L290 TraceCheckUtils]: 58: Hoare triple {2963#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {2985#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-15 10:49:23,611 INFO L272 TraceCheckUtils]: 59: Hoare triple {2985#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 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)); {2800#true} is VALID [2022-04-15 10:49:23,612 INFO L290 TraceCheckUtils]: 60: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID [2022-04-15 10:49:23,612 INFO L290 TraceCheckUtils]: 61: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID [2022-04-15 10:49:23,612 INFO L290 TraceCheckUtils]: 62: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-15 10:49:23,613 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {2800#true} {2985#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} #59#return; {2985#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-15 10:49:23,613 INFO L272 TraceCheckUtils]: 64: Hoare triple {2985#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {3004#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:49:23,614 INFO L290 TraceCheckUtils]: 65: Hoare triple {3004#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3008#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:49:23,614 INFO L290 TraceCheckUtils]: 66: Hoare triple {3008#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2801#false} is VALID [2022-04-15 10:49:23,614 INFO L290 TraceCheckUtils]: 67: Hoare triple {2801#false} assume !false; {2801#false} is VALID [2022-04-15 10:49:23,614 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-15 10:49:23,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:49:23,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:49:23,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254219767] [2022-04-15 10:49:23,858 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:49:23,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350765180] [2022-04-15 10:49:23,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350765180] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 10:49:23,858 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 10:49:23,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-15 10:49:23,858 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:49:23,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [830872417] [2022-04-15 10:49:23,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [830872417] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:49:23,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:49:23,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 10:49:23,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344572380] [2022-04-15 10:49:23,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:49:23,859 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-15 10:49:23,859 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:49:23,859 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-15 10:49:23,891 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-15 10:49:23,891 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 10:49:23,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:49:23,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 10:49:23,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-15 10:49:23,892 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-15 10:49:24,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:49:24,387 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-15 10:49:24,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 10:49:24,387 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-15 10:49:24,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:49:24,388 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-15 10:49:24,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-15 10:49:24,389 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-15 10:49:24,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-15 10:49:24,390 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 58 transitions. [2022-04-15 10:49:24,442 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-15 10:49:24,443 INFO L225 Difference]: With dead ends: 54 [2022-04-15 10:49:24,443 INFO L226 Difference]: Without dead ends: 48 [2022-04-15 10:49:24,443 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-15 10:49:24,444 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-15 10:49:24,444 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-15 10:49:24,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-15 10:49:24,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-15 10:49:24,466 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:49:24,466 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-15 10:49:24,466 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-15 10:49:24,466 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-15 10:49:24,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:49:24,468 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-15 10:49:24,468 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-15 10:49:24,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:49:24,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:49:24,468 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-15 10:49:24,468 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-15 10:49:24,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:49:24,470 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-15 10:49:24,470 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-15 10:49:24,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:49:24,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:49:24,470 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:49:24,470 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:49:24,470 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-15 10:49:24,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2022-04-15 10:49:24,471 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 68 [2022-04-15 10:49:24,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:49:24,472 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2022-04-15 10:49:24,472 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-15 10:49:24,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 55 transitions. [2022-04-15 10:49:24,777 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-15 10:49:24,778 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-15 10:49:24,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-15 10:49:24,778 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:49:24,778 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-15 10:49:24,796 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-15 10:49:24,983 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-15 10:49:24,983 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:49:24,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:49:24,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1692754003, now seen corresponding path program 11 times [2022-04-15 10:49:24,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:49:24,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1762837989] [2022-04-15 10:49:24,984 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:49:24,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1692754003, now seen corresponding path program 12 times [2022-04-15 10:49:24,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:49:24,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279342996] [2022-04-15 10:49:24,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:49:24,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:49:25,001 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:49:25,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1529420271] [2022-04-15 10:49:25,002 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 10:49:25,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:49:25,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:49:25,003 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-15 10:49:25,011 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-15 10:49:36,935 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 10:49:36,935 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:49:36,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-15 10:49:36,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:49:36,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:49:37,359 INFO L272 TraceCheckUtils]: 0: Hoare triple {3375#true} call ULTIMATE.init(); {3375#true} is VALID [2022-04-15 10:49:37,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {3375#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); {3375#true} is VALID [2022-04-15 10:49:37,359 INFO L290 TraceCheckUtils]: 2: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-15 10:49:37,359 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3375#true} {3375#true} #63#return; {3375#true} is VALID [2022-04-15 10:49:37,359 INFO L272 TraceCheckUtils]: 4: Hoare triple {3375#true} call #t~ret5 := main(); {3375#true} is VALID [2022-04-15 10:49:37,360 INFO L290 TraceCheckUtils]: 5: Hoare triple {3375#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; {3375#true} is VALID [2022-04-15 10:49:37,360 INFO L272 TraceCheckUtils]: 6: Hoare triple {3375#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {3375#true} is VALID [2022-04-15 10:49:37,360 INFO L290 TraceCheckUtils]: 7: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-15 10:49:37,360 INFO L290 TraceCheckUtils]: 8: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-15 10:49:37,360 INFO L290 TraceCheckUtils]: 9: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-15 10:49:37,360 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3375#true} {3375#true} #53#return; {3375#true} is VALID [2022-04-15 10:49:37,360 INFO L272 TraceCheckUtils]: 11: Hoare triple {3375#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3375#true} is VALID [2022-04-15 10:49:37,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-15 10:49:37,360 INFO L290 TraceCheckUtils]: 13: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-15 10:49:37,360 INFO L290 TraceCheckUtils]: 14: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-15 10:49:37,360 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3375#true} {3375#true} #55#return; {3375#true} is VALID [2022-04-15 10:49:37,361 INFO L290 TraceCheckUtils]: 16: Hoare triple {3375#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3428#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:49:37,361 INFO L290 TraceCheckUtils]: 17: Hoare triple {3428#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {3428#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:49:37,361 INFO L272 TraceCheckUtils]: 18: Hoare triple {3428#(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)); {3375#true} is VALID [2022-04-15 10:49:37,361 INFO L290 TraceCheckUtils]: 19: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-15 10:49:37,361 INFO L290 TraceCheckUtils]: 20: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-15 10:49:37,361 INFO L290 TraceCheckUtils]: 21: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-15 10:49:37,362 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3375#true} {3428#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {3428#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:49:37,362 INFO L290 TraceCheckUtils]: 23: Hoare triple {3428#(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; {3450#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-15 10:49:37,362 INFO L290 TraceCheckUtils]: 24: Hoare triple {3450#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {3450#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-15 10:49:37,363 INFO L272 TraceCheckUtils]: 25: Hoare triple {3450#(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)); {3375#true} is VALID [2022-04-15 10:49:37,363 INFO L290 TraceCheckUtils]: 26: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-15 10:49:37,363 INFO L290 TraceCheckUtils]: 27: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-15 10:49:37,363 INFO L290 TraceCheckUtils]: 28: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-15 10:49:37,363 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3375#true} {3450#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #57#return; {3450#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-15 10:49:37,364 INFO L290 TraceCheckUtils]: 30: Hoare triple {3450#(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; {3472#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-15 10:49:37,364 INFO L290 TraceCheckUtils]: 31: Hoare triple {3472#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {3472#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-15 10:49:37,364 INFO L272 TraceCheckUtils]: 32: Hoare triple {3472#(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)); {3375#true} is VALID [2022-04-15 10:49:37,364 INFO L290 TraceCheckUtils]: 33: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-15 10:49:37,364 INFO L290 TraceCheckUtils]: 34: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-15 10:49:37,364 INFO L290 TraceCheckUtils]: 35: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-15 10:49:37,365 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3375#true} {3472#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #57#return; {3472#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-15 10:49:37,365 INFO L290 TraceCheckUtils]: 37: Hoare triple {3472#(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; {3494#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-15 10:49:37,365 INFO L290 TraceCheckUtils]: 38: Hoare triple {3494#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !false; {3494#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-15 10:49:37,365 INFO L272 TraceCheckUtils]: 39: Hoare triple {3494#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~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)); {3375#true} is VALID [2022-04-15 10:49:37,366 INFO L290 TraceCheckUtils]: 40: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-15 10:49:37,366 INFO L290 TraceCheckUtils]: 41: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-15 10:49:37,366 INFO L290 TraceCheckUtils]: 42: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-15 10:49:37,366 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3375#true} {3494#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #57#return; {3494#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-15 10:49:37,367 INFO L290 TraceCheckUtils]: 44: Hoare triple {3494#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3516#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-15 10:49:37,367 INFO L290 TraceCheckUtils]: 45: Hoare triple {3516#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {3516#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-15 10:49:37,367 INFO L272 TraceCheckUtils]: 46: Hoare triple {3516#(and (= main_~y~0 4) (= 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)); {3375#true} is VALID [2022-04-15 10:49:37,367 INFO L290 TraceCheckUtils]: 47: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-15 10:49:37,367 INFO L290 TraceCheckUtils]: 48: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-15 10:49:37,367 INFO L290 TraceCheckUtils]: 49: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-15 10:49:37,368 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3375#true} {3516#(and (= main_~y~0 4) (= main_~c~0 4))} #57#return; {3516#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-15 10:49:37,372 INFO L290 TraceCheckUtils]: 51: Hoare triple {3516#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3538#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-15 10:49:37,372 INFO L290 TraceCheckUtils]: 52: Hoare triple {3538#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {3538#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-15 10:49:37,372 INFO L272 TraceCheckUtils]: 53: Hoare triple {3538#(and (= 5 main_~c~0) (= 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)); {3375#true} is VALID [2022-04-15 10:49:37,373 INFO L290 TraceCheckUtils]: 54: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-15 10:49:37,373 INFO L290 TraceCheckUtils]: 55: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-15 10:49:37,373 INFO L290 TraceCheckUtils]: 56: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-15 10:49:37,373 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {3375#true} {3538#(and (= 5 main_~c~0) (= 5 main_~y~0))} #57#return; {3538#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-15 10:49:37,374 INFO L290 TraceCheckUtils]: 58: Hoare triple {3538#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3560#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-15 10:49:37,374 INFO L290 TraceCheckUtils]: 59: Hoare triple {3560#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !false; {3560#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-15 10:49:37,374 INFO L272 TraceCheckUtils]: 60: Hoare triple {3560#(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)); {3375#true} is VALID [2022-04-15 10:49:37,374 INFO L290 TraceCheckUtils]: 61: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-15 10:49:37,374 INFO L290 TraceCheckUtils]: 62: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-15 10:49:37,374 INFO L290 TraceCheckUtils]: 63: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-15 10:49:37,375 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3375#true} {3560#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #57#return; {3560#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-15 10:49:37,375 INFO L290 TraceCheckUtils]: 65: Hoare triple {3560#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !(~c~0 < ~k~0); {3582#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-15 10:49:37,375 INFO L272 TraceCheckUtils]: 66: Hoare triple {3582#(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)); {3375#true} is VALID [2022-04-15 10:49:37,375 INFO L290 TraceCheckUtils]: 67: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-15 10:49:37,375 INFO L290 TraceCheckUtils]: 68: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-15 10:49:37,375 INFO L290 TraceCheckUtils]: 69: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-15 10:49:37,376 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {3375#true} {3582#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} #59#return; {3582#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-15 10:49:37,376 INFO L272 TraceCheckUtils]: 71: Hoare triple {3582#(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)); {3601#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:49:37,377 INFO L290 TraceCheckUtils]: 72: Hoare triple {3601#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3605#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:49:37,377 INFO L290 TraceCheckUtils]: 73: Hoare triple {3605#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3376#false} is VALID [2022-04-15 10:49:37,377 INFO L290 TraceCheckUtils]: 74: Hoare triple {3376#false} assume !false; {3376#false} is VALID [2022-04-15 10:49:37,377 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-15 10:49:37,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:49:37,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:49:37,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279342996] [2022-04-15 10:49:37,617 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:49:37,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529420271] [2022-04-15 10:49:37,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529420271] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 10:49:37,618 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 10:49:37,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-15 10:49:37,618 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:49:37,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1762837989] [2022-04-15 10:49:37,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1762837989] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:49:37,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:49:37,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 10:49:37,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564091641] [2022-04-15 10:49:37,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:49:37,619 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-15 10:49:37,619 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:49:37,619 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-15 10:49:37,652 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-15 10:49:37,652 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 10:49:37,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:49:37,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 10:49:37,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-15 10:49:37,653 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-15 10:49:38,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:49:38,240 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2022-04-15 10:49:38,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 10:49:38,240 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-15 10:49:38,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:49:38,241 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-15 10:49:38,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 62 transitions. [2022-04-15 10:49:38,242 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-15 10:49:38,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 62 transitions. [2022-04-15 10:49:38,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 62 transitions. [2022-04-15 10:49:38,284 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-15 10:49:38,285 INFO L225 Difference]: With dead ends: 57 [2022-04-15 10:49:38,285 INFO L226 Difference]: Without dead ends: 51 [2022-04-15 10:49:38,286 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-04-15 10:49:38,286 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 2 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 10:49:38,286 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 310 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 10:49:38,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-15 10:49:38,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-15 10:49:38,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:49:38,313 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-15 10:49:38,313 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-15 10:49:38,313 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-15 10:49:38,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:49:38,315 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-15 10:49:38,315 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-15 10:49:38,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:49:38,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:49:38,315 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-15 10:49:38,315 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-15 10:49:38,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:49:38,317 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-15 10:49:38,317 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-15 10:49:38,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:49:38,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:49:38,317 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:49:38,317 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:49:38,317 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-15 10:49:38,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2022-04-15 10:49:38,318 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 75 [2022-04-15 10:49:38,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:49:38,319 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2022-04-15 10:49:38,319 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-15 10:49:38,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 59 transitions. [2022-04-15 10:49:39,007 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-15 10:49:39,008 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-15 10:49:39,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-15 10:49:39,008 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:49:39,008 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-15 10:49:39,017 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-15 10:49:39,211 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-15 10:49:39,211 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:49:39,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:49:39,212 INFO L85 PathProgramCache]: Analyzing trace with hash 615143773, now seen corresponding path program 13 times [2022-04-15 10:49:39,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:49:39,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2116012026] [2022-04-15 10:49:39,212 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:49:39,212 INFO L85 PathProgramCache]: Analyzing trace with hash 615143773, now seen corresponding path program 14 times [2022-04-15 10:49:39,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:49:39,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107558383] [2022-04-15 10:49:39,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:49:39,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:49:39,230 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:49:39,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2078581579] [2022-04-15 10:49:39,230 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 10:49:39,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:49:39,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:49:39,236 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-15 10:49:39,236 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-15 10:49:46,859 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 10:49:46,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:49:46,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-15 10:49:46,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:49:46,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:49:47,310 INFO L272 TraceCheckUtils]: 0: Hoare triple {3990#true} call ULTIMATE.init(); {3990#true} is VALID [2022-04-15 10:49:47,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {3990#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); {3990#true} is VALID [2022-04-15 10:49:47,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {3990#true} assume true; {3990#true} is VALID [2022-04-15 10:49:47,310 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3990#true} {3990#true} #63#return; {3990#true} is VALID [2022-04-15 10:49:47,310 INFO L272 TraceCheckUtils]: 4: Hoare triple {3990#true} call #t~ret5 := main(); {3990#true} is VALID [2022-04-15 10:49:47,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {3990#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; {3990#true} is VALID [2022-04-15 10:49:47,311 INFO L272 TraceCheckUtils]: 6: Hoare triple {3990#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {3990#true} is VALID [2022-04-15 10:49:47,311 INFO L290 TraceCheckUtils]: 7: Hoare triple {3990#true} ~cond := #in~cond; {3990#true} is VALID [2022-04-15 10:49:47,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {3990#true} assume !(0 == ~cond); {3990#true} is VALID [2022-04-15 10:49:47,311 INFO L290 TraceCheckUtils]: 9: Hoare triple {3990#true} assume true; {3990#true} is VALID [2022-04-15 10:49:47,311 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3990#true} {3990#true} #53#return; {3990#true} is VALID [2022-04-15 10:49:47,311 INFO L272 TraceCheckUtils]: 11: Hoare triple {3990#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3990#true} is VALID [2022-04-15 10:49:47,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {3990#true} ~cond := #in~cond; {3990#true} is VALID [2022-04-15 10:49:47,311 INFO L290 TraceCheckUtils]: 13: Hoare triple {3990#true} assume !(0 == ~cond); {3990#true} is VALID [2022-04-15 10:49:47,311 INFO L290 TraceCheckUtils]: 14: Hoare triple {3990#true} assume true; {3990#true} is VALID [2022-04-15 10:49:47,311 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3990#true} {3990#true} #55#return; {3990#true} is VALID [2022-04-15 10:49:47,312 INFO L290 TraceCheckUtils]: 16: Hoare triple {3990#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4043#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:49:47,312 INFO L290 TraceCheckUtils]: 17: Hoare triple {4043#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {4043#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:49:47,312 INFO L272 TraceCheckUtils]: 18: Hoare triple {4043#(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)); {3990#true} is VALID [2022-04-15 10:49:47,312 INFO L290 TraceCheckUtils]: 19: Hoare triple {3990#true} ~cond := #in~cond; {3990#true} is VALID [2022-04-15 10:49:47,312 INFO L290 TraceCheckUtils]: 20: Hoare triple {3990#true} assume !(0 == ~cond); {3990#true} is VALID [2022-04-15 10:49:47,312 INFO L290 TraceCheckUtils]: 21: Hoare triple {3990#true} assume true; {3990#true} is VALID [2022-04-15 10:49:47,313 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3990#true} {4043#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {4043#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:49:47,313 INFO L290 TraceCheckUtils]: 23: Hoare triple {4043#(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; {4065#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-15 10:49:47,313 INFO L290 TraceCheckUtils]: 24: Hoare triple {4065#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {4065#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-15 10:49:47,314 INFO L272 TraceCheckUtils]: 25: Hoare triple {4065#(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)); {3990#true} is VALID [2022-04-15 10:49:47,314 INFO L290 TraceCheckUtils]: 26: Hoare triple {3990#true} ~cond := #in~cond; {3990#true} is VALID [2022-04-15 10:49:47,314 INFO L290 TraceCheckUtils]: 27: Hoare triple {3990#true} assume !(0 == ~cond); {3990#true} is VALID [2022-04-15 10:49:47,314 INFO L290 TraceCheckUtils]: 28: Hoare triple {3990#true} assume true; {3990#true} is VALID [2022-04-15 10:49:47,314 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3990#true} {4065#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #57#return; {4065#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-15 10:49:47,315 INFO L290 TraceCheckUtils]: 30: Hoare triple {4065#(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; {4087#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-15 10:49:47,315 INFO L290 TraceCheckUtils]: 31: Hoare triple {4087#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !false; {4087#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-15 10:49:47,315 INFO L272 TraceCheckUtils]: 32: Hoare triple {4087#(and (= (+ (- 1) main_~y~0) 1) (= 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)); {3990#true} is VALID [2022-04-15 10:49:47,315 INFO L290 TraceCheckUtils]: 33: Hoare triple {3990#true} ~cond := #in~cond; {3990#true} is VALID [2022-04-15 10:49:47,315 INFO L290 TraceCheckUtils]: 34: Hoare triple {3990#true} assume !(0 == ~cond); {3990#true} is VALID [2022-04-15 10:49:47,315 INFO L290 TraceCheckUtils]: 35: Hoare triple {3990#true} assume true; {3990#true} is VALID [2022-04-15 10:49:47,316 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3990#true} {4087#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #57#return; {4087#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-15 10:49:47,316 INFO L290 TraceCheckUtils]: 37: Hoare triple {4087#(and (= (+ (- 1) main_~y~0) 1) (= 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; {4109#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-15 10:49:47,316 INFO L290 TraceCheckUtils]: 38: Hoare triple {4109#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {4109#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-15 10:49:47,316 INFO L272 TraceCheckUtils]: 39: Hoare triple {4109#(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)); {3990#true} is VALID [2022-04-15 10:49:47,317 INFO L290 TraceCheckUtils]: 40: Hoare triple {3990#true} ~cond := #in~cond; {3990#true} is VALID [2022-04-15 10:49:47,317 INFO L290 TraceCheckUtils]: 41: Hoare triple {3990#true} assume !(0 == ~cond); {3990#true} is VALID [2022-04-15 10:49:47,317 INFO L290 TraceCheckUtils]: 42: Hoare triple {3990#true} assume true; {3990#true} is VALID [2022-04-15 10:49:47,317 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3990#true} {4109#(and (= main_~y~0 3) (= main_~c~0 3))} #57#return; {4109#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-15 10:49:47,320 INFO L290 TraceCheckUtils]: 44: Hoare triple {4109#(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; {4131#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-15 10:49:47,320 INFO L290 TraceCheckUtils]: 45: Hoare triple {4131#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !false; {4131#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-15 10:49:47,320 INFO L272 TraceCheckUtils]: 46: Hoare triple {4131#(and (= 3 (+ (- 1) main_~y~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)); {3990#true} is VALID [2022-04-15 10:49:47,320 INFO L290 TraceCheckUtils]: 47: Hoare triple {3990#true} ~cond := #in~cond; {3990#true} is VALID [2022-04-15 10:49:47,320 INFO L290 TraceCheckUtils]: 48: Hoare triple {3990#true} assume !(0 == ~cond); {3990#true} is VALID [2022-04-15 10:49:47,320 INFO L290 TraceCheckUtils]: 49: Hoare triple {3990#true} assume true; {3990#true} is VALID [2022-04-15 10:49:47,321 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3990#true} {4131#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #57#return; {4131#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-15 10:49:47,321 INFO L290 TraceCheckUtils]: 51: Hoare triple {4131#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4153#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-15 10:49:47,321 INFO L290 TraceCheckUtils]: 52: Hoare triple {4153#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !false; {4153#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-15 10:49:47,321 INFO L272 TraceCheckUtils]: 53: Hoare triple {4153#(and (= (+ (- 1) main_~c~0) 4) (= 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)); {3990#true} is VALID [2022-04-15 10:49:47,322 INFO L290 TraceCheckUtils]: 54: Hoare triple {3990#true} ~cond := #in~cond; {3990#true} is VALID [2022-04-15 10:49:47,322 INFO L290 TraceCheckUtils]: 55: Hoare triple {3990#true} assume !(0 == ~cond); {3990#true} is VALID [2022-04-15 10:49:47,322 INFO L290 TraceCheckUtils]: 56: Hoare triple {3990#true} assume true; {3990#true} is VALID [2022-04-15 10:49:47,322 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {3990#true} {4153#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #57#return; {4153#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-15 10:49:47,323 INFO L290 TraceCheckUtils]: 58: Hoare triple {4153#(and (= (+ (- 1) main_~c~0) 4) (= 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; {4175#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 10:49:47,323 INFO L290 TraceCheckUtils]: 59: Hoare triple {4175#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !false; {4175#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 10:49:47,323 INFO L272 TraceCheckUtils]: 60: Hoare triple {4175#(and (= main_~c~0 6) (= 5 (+ (- 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)); {3990#true} is VALID [2022-04-15 10:49:47,323 INFO L290 TraceCheckUtils]: 61: Hoare triple {3990#true} ~cond := #in~cond; {3990#true} is VALID [2022-04-15 10:49:47,323 INFO L290 TraceCheckUtils]: 62: Hoare triple {3990#true} assume !(0 == ~cond); {3990#true} is VALID [2022-04-15 10:49:47,323 INFO L290 TraceCheckUtils]: 63: Hoare triple {3990#true} assume true; {3990#true} is VALID [2022-04-15 10:49:47,324 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3990#true} {4175#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #57#return; {4175#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 10:49:47,324 INFO L290 TraceCheckUtils]: 65: Hoare triple {4175#(and (= main_~c~0 6) (= 5 (+ (- 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; {4197#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} is VALID [2022-04-15 10:49:47,324 INFO L290 TraceCheckUtils]: 66: Hoare triple {4197#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} assume !false; {4197#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} is VALID [2022-04-15 10:49:47,325 INFO L272 TraceCheckUtils]: 67: Hoare triple {4197#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 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)); {3990#true} is VALID [2022-04-15 10:49:47,325 INFO L290 TraceCheckUtils]: 68: Hoare triple {3990#true} ~cond := #in~cond; {3990#true} is VALID [2022-04-15 10:49:47,325 INFO L290 TraceCheckUtils]: 69: Hoare triple {3990#true} assume !(0 == ~cond); {3990#true} is VALID [2022-04-15 10:49:47,325 INFO L290 TraceCheckUtils]: 70: Hoare triple {3990#true} assume true; {3990#true} is VALID [2022-04-15 10:49:47,325 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {3990#true} {4197#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} #57#return; {4197#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} is VALID [2022-04-15 10:49:47,326 INFO L290 TraceCheckUtils]: 72: Hoare triple {4197#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {4219#(and (<= main_~k~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} is VALID [2022-04-15 10:49:47,326 INFO L272 TraceCheckUtils]: 73: Hoare triple {4219#(and (<= main_~k~0 7) (= (+ (- 2) main_~y~0) 5) (< 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)); {3990#true} is VALID [2022-04-15 10:49:47,326 INFO L290 TraceCheckUtils]: 74: Hoare triple {3990#true} ~cond := #in~cond; {3990#true} is VALID [2022-04-15 10:49:47,326 INFO L290 TraceCheckUtils]: 75: Hoare triple {3990#true} assume !(0 == ~cond); {3990#true} is VALID [2022-04-15 10:49:47,326 INFO L290 TraceCheckUtils]: 76: Hoare triple {3990#true} assume true; {3990#true} is VALID [2022-04-15 10:49:47,327 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {3990#true} {4219#(and (<= main_~k~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} #59#return; {4219#(and (<= main_~k~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} is VALID [2022-04-15 10:49:47,327 INFO L272 TraceCheckUtils]: 78: Hoare triple {4219#(and (<= main_~k~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {4238#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:49:47,327 INFO L290 TraceCheckUtils]: 79: Hoare triple {4238#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4242#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:49:47,328 INFO L290 TraceCheckUtils]: 80: Hoare triple {4242#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3991#false} is VALID [2022-04-15 10:49:47,328 INFO L290 TraceCheckUtils]: 81: Hoare triple {3991#false} assume !false; {3991#false} is VALID [2022-04-15 10:49:47,328 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-15 10:49:47,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:49:47,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:49:47,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107558383] [2022-04-15 10:49:47,580 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:49:47,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078581579] [2022-04-15 10:49:47,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078581579] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 10:49:47,580 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 10:49:47,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-15 10:49:47,580 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:49:47,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2116012026] [2022-04-15 10:49:47,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2116012026] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:49:47,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:49:47,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 10:49:47,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360030665] [2022-04-15 10:49:47,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:49:47,581 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-15 10:49:47,581 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:49:47,581 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-15 10:49:47,617 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-15 10:49:47,618 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 10:49:47,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:49:47,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 10:49:47,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-15 10:49:47,618 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-15 10:49:48,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:49:48,309 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-04-15 10:49:48,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 10:49:48,309 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-15 10:49:48,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:49:48,310 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-15 10:49:48,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2022-04-15 10:49:48,311 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-15 10:49:48,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2022-04-15 10:49:48,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 66 transitions. [2022-04-15 10:49:48,367 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-15 10:49:48,368 INFO L225 Difference]: With dead ends: 60 [2022-04-15 10:49:48,368 INFO L226 Difference]: Without dead ends: 54 [2022-04-15 10:49:48,368 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-04-15 10:49:48,369 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 2 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-15 10:49:48,369 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.3s Time] [2022-04-15 10:49:48,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-15 10:49:48,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-15 10:49:48,400 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:49:48,400 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-15 10:49:48,400 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-15 10:49:48,400 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-15 10:49:48,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:49:48,402 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-04-15 10:49:48,402 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-15 10:49:48,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:49:48,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:49:48,402 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-15 10:49:48,402 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-15 10:49:48,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:49:48,404 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-04-15 10:49:48,404 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-15 10:49:48,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:49:48,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:49:48,404 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:49:48,404 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:49:48,404 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-15 10:49:48,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-04-15 10:49:48,405 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 82 [2022-04-15 10:49:48,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:49:48,406 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-04-15 10:49:48,406 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-15 10:49:48,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 63 transitions. [2022-04-15 10:49:48,849 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-15 10:49:48,850 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-15 10:49:48,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-15 10:49:48,851 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:49:48,851 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-15 10:49:48,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-15 10:49:49,051 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-15 10:49:49,051 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:49:49,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:49:49,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1334355539, now seen corresponding path program 15 times [2022-04-15 10:49:49,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:49:49,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1358178571] [2022-04-15 10:49:49,052 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:49:49,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1334355539, now seen corresponding path program 16 times [2022-04-15 10:49:49,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:49:49,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755901134] [2022-04-15 10:49:49,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:49:49,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:49:49,065 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:49:49,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [188928956] [2022-04-15 10:49:49,065 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 10:49:49,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:49:49,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:49:49,066 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-15 10:49:49,067 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-15 10:49:49,108 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 10:49:49,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:49:49,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-15 10:49:49,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:49:49,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:49:49,555 INFO L272 TraceCheckUtils]: 0: Hoare triple {4645#true} call ULTIMATE.init(); {4645#true} is VALID [2022-04-15 10:49:49,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {4645#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); {4645#true} is VALID [2022-04-15 10:49:49,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {4645#true} assume true; {4645#true} is VALID [2022-04-15 10:49:49,555 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4645#true} {4645#true} #63#return; {4645#true} is VALID [2022-04-15 10:49:49,555 INFO L272 TraceCheckUtils]: 4: Hoare triple {4645#true} call #t~ret5 := main(); {4645#true} is VALID [2022-04-15 10:49:49,556 INFO L290 TraceCheckUtils]: 5: Hoare triple {4645#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; {4645#true} is VALID [2022-04-15 10:49:49,556 INFO L272 TraceCheckUtils]: 6: Hoare triple {4645#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {4645#true} is VALID [2022-04-15 10:49:49,556 INFO L290 TraceCheckUtils]: 7: Hoare triple {4645#true} ~cond := #in~cond; {4645#true} is VALID [2022-04-15 10:49:49,556 INFO L290 TraceCheckUtils]: 8: Hoare triple {4645#true} assume !(0 == ~cond); {4645#true} is VALID [2022-04-15 10:49:49,556 INFO L290 TraceCheckUtils]: 9: Hoare triple {4645#true} assume true; {4645#true} is VALID [2022-04-15 10:49:49,556 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4645#true} {4645#true} #53#return; {4645#true} is VALID [2022-04-15 10:49:49,556 INFO L272 TraceCheckUtils]: 11: Hoare triple {4645#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4645#true} is VALID [2022-04-15 10:49:49,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {4645#true} ~cond := #in~cond; {4645#true} is VALID [2022-04-15 10:49:49,556 INFO L290 TraceCheckUtils]: 13: Hoare triple {4645#true} assume !(0 == ~cond); {4645#true} is VALID [2022-04-15 10:49:49,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {4645#true} assume true; {4645#true} is VALID [2022-04-15 10:49:49,556 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4645#true} {4645#true} #55#return; {4645#true} is VALID [2022-04-15 10:49:49,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {4645#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4698#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:49:49,557 INFO L290 TraceCheckUtils]: 17: Hoare triple {4698#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {4698#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:49:49,557 INFO L272 TraceCheckUtils]: 18: Hoare triple {4698#(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)); {4645#true} is VALID [2022-04-15 10:49:49,557 INFO L290 TraceCheckUtils]: 19: Hoare triple {4645#true} ~cond := #in~cond; {4645#true} is VALID [2022-04-15 10:49:49,557 INFO L290 TraceCheckUtils]: 20: Hoare triple {4645#true} assume !(0 == ~cond); {4645#true} is VALID [2022-04-15 10:49:49,557 INFO L290 TraceCheckUtils]: 21: Hoare triple {4645#true} assume true; {4645#true} is VALID [2022-04-15 10:49:49,558 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4645#true} {4698#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {4698#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:49:49,558 INFO L290 TraceCheckUtils]: 23: Hoare triple {4698#(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; {4720#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-15 10:49:49,558 INFO L290 TraceCheckUtils]: 24: Hoare triple {4720#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {4720#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-15 10:49:49,558 INFO L272 TraceCheckUtils]: 25: Hoare triple {4720#(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)); {4645#true} is VALID [2022-04-15 10:49:49,558 INFO L290 TraceCheckUtils]: 26: Hoare triple {4645#true} ~cond := #in~cond; {4645#true} is VALID [2022-04-15 10:49:49,558 INFO L290 TraceCheckUtils]: 27: Hoare triple {4645#true} assume !(0 == ~cond); {4645#true} is VALID [2022-04-15 10:49:49,559 INFO L290 TraceCheckUtils]: 28: Hoare triple {4645#true} assume true; {4645#true} is VALID [2022-04-15 10:49:49,559 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {4645#true} {4720#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #57#return; {4720#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-15 10:49:49,559 INFO L290 TraceCheckUtils]: 30: Hoare triple {4720#(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; {4742#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-15 10:49:49,560 INFO L290 TraceCheckUtils]: 31: Hoare triple {4742#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !false; {4742#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-15 10:49:49,560 INFO L272 TraceCheckUtils]: 32: Hoare triple {4742#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) 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)); {4645#true} is VALID [2022-04-15 10:49:49,560 INFO L290 TraceCheckUtils]: 33: Hoare triple {4645#true} ~cond := #in~cond; {4645#true} is VALID [2022-04-15 10:49:49,560 INFO L290 TraceCheckUtils]: 34: Hoare triple {4645#true} assume !(0 == ~cond); {4645#true} is VALID [2022-04-15 10:49:49,560 INFO L290 TraceCheckUtils]: 35: Hoare triple {4645#true} assume true; {4645#true} is VALID [2022-04-15 10:49:49,561 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4645#true} {4742#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} #57#return; {4742#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-15 10:49:49,562 INFO L290 TraceCheckUtils]: 37: Hoare triple {4742#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) 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; {4764#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-15 10:49:49,562 INFO L290 TraceCheckUtils]: 38: Hoare triple {4764#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {4764#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-15 10:49:49,562 INFO L272 TraceCheckUtils]: 39: Hoare triple {4764#(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)); {4645#true} is VALID [2022-04-15 10:49:49,562 INFO L290 TraceCheckUtils]: 40: Hoare triple {4645#true} ~cond := #in~cond; {4645#true} is VALID [2022-04-15 10:49:49,562 INFO L290 TraceCheckUtils]: 41: Hoare triple {4645#true} assume !(0 == ~cond); {4645#true} is VALID [2022-04-15 10:49:49,562 INFO L290 TraceCheckUtils]: 42: Hoare triple {4645#true} assume true; {4645#true} is VALID [2022-04-15 10:49:49,563 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4645#true} {4764#(and (= main_~y~0 3) (= main_~c~0 3))} #57#return; {4764#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-15 10:49:49,563 INFO L290 TraceCheckUtils]: 44: Hoare triple {4764#(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; {4786#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 10:49:49,563 INFO L290 TraceCheckUtils]: 45: Hoare triple {4786#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !false; {4786#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 10:49:49,563 INFO L272 TraceCheckUtils]: 46: Hoare triple {4786#(and (= (+ (- 1) main_~c~0) 3) (= 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)); {4645#true} is VALID [2022-04-15 10:49:49,564 INFO L290 TraceCheckUtils]: 47: Hoare triple {4645#true} ~cond := #in~cond; {4645#true} is VALID [2022-04-15 10:49:49,564 INFO L290 TraceCheckUtils]: 48: Hoare triple {4645#true} assume !(0 == ~cond); {4645#true} is VALID [2022-04-15 10:49:49,564 INFO L290 TraceCheckUtils]: 49: Hoare triple {4645#true} assume true; {4645#true} is VALID [2022-04-15 10:49:49,564 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4645#true} {4786#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} #57#return; {4786#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 10:49:49,564 INFO L290 TraceCheckUtils]: 51: Hoare triple {4786#(and (= (+ (- 1) main_~c~0) 3) (= 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; {4808#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-15 10:49:49,565 INFO L290 TraceCheckUtils]: 52: Hoare triple {4808#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {4808#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-15 10:49:49,565 INFO L272 TraceCheckUtils]: 53: Hoare triple {4808#(and (= 5 main_~c~0) (= 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)); {4645#true} is VALID [2022-04-15 10:49:49,565 INFO L290 TraceCheckUtils]: 54: Hoare triple {4645#true} ~cond := #in~cond; {4645#true} is VALID [2022-04-15 10:49:49,565 INFO L290 TraceCheckUtils]: 55: Hoare triple {4645#true} assume !(0 == ~cond); {4645#true} is VALID [2022-04-15 10:49:49,565 INFO L290 TraceCheckUtils]: 56: Hoare triple {4645#true} assume true; {4645#true} is VALID [2022-04-15 10:49:49,565 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {4645#true} {4808#(and (= 5 main_~c~0) (= 5 main_~y~0))} #57#return; {4808#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-15 10:49:49,566 INFO L290 TraceCheckUtils]: 58: Hoare triple {4808#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4830#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-15 10:49:49,566 INFO L290 TraceCheckUtils]: 59: Hoare triple {4830#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !false; {4830#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-15 10:49:49,566 INFO L272 TraceCheckUtils]: 60: Hoare triple {4830#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} 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)); {4645#true} is VALID [2022-04-15 10:49:49,566 INFO L290 TraceCheckUtils]: 61: Hoare triple {4645#true} ~cond := #in~cond; {4645#true} is VALID [2022-04-15 10:49:49,566 INFO L290 TraceCheckUtils]: 62: Hoare triple {4645#true} assume !(0 == ~cond); {4645#true} is VALID [2022-04-15 10:49:49,566 INFO L290 TraceCheckUtils]: 63: Hoare triple {4645#true} assume true; {4645#true} is VALID [2022-04-15 10:49:49,567 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {4645#true} {4830#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #57#return; {4830#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-15 10:49:49,567 INFO L290 TraceCheckUtils]: 65: Hoare triple {4830#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4852#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-15 10:49:49,568 INFO L290 TraceCheckUtils]: 66: Hoare triple {4852#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} assume !false; {4852#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-15 10:49:49,568 INFO L272 TraceCheckUtils]: 67: Hoare triple {4852#(and (= 7 main_~y~0) (= 5 (+ (- 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)); {4645#true} is VALID [2022-04-15 10:49:49,568 INFO L290 TraceCheckUtils]: 68: Hoare triple {4645#true} ~cond := #in~cond; {4645#true} is VALID [2022-04-15 10:49:49,568 INFO L290 TraceCheckUtils]: 69: Hoare triple {4645#true} assume !(0 == ~cond); {4645#true} is VALID [2022-04-15 10:49:49,568 INFO L290 TraceCheckUtils]: 70: Hoare triple {4645#true} assume true; {4645#true} is VALID [2022-04-15 10:49:49,568 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {4645#true} {4852#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} #57#return; {4852#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-15 10:49:49,569 INFO L290 TraceCheckUtils]: 72: Hoare triple {4852#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4874#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-15 10:49:49,571 INFO L290 TraceCheckUtils]: 73: Hoare triple {4874#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !false; {4874#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-15 10:49:49,571 INFO L272 TraceCheckUtils]: 74: Hoare triple {4874#(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)); {4645#true} is VALID [2022-04-15 10:49:49,571 INFO L290 TraceCheckUtils]: 75: Hoare triple {4645#true} ~cond := #in~cond; {4645#true} is VALID [2022-04-15 10:49:49,571 INFO L290 TraceCheckUtils]: 76: Hoare triple {4645#true} assume !(0 == ~cond); {4645#true} is VALID [2022-04-15 10:49:49,571 INFO L290 TraceCheckUtils]: 77: Hoare triple {4645#true} assume true; {4645#true} is VALID [2022-04-15 10:49:49,572 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {4645#true} {4874#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} #57#return; {4874#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-15 10:49:49,573 INFO L290 TraceCheckUtils]: 79: Hoare triple {4874#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !(~c~0 < ~k~0); {4896#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-15 10:49:49,573 INFO L272 TraceCheckUtils]: 80: Hoare triple {4896#(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)); {4645#true} is VALID [2022-04-15 10:49:49,573 INFO L290 TraceCheckUtils]: 81: Hoare triple {4645#true} ~cond := #in~cond; {4645#true} is VALID [2022-04-15 10:49:49,573 INFO L290 TraceCheckUtils]: 82: Hoare triple {4645#true} assume !(0 == ~cond); {4645#true} is VALID [2022-04-15 10:49:49,573 INFO L290 TraceCheckUtils]: 83: Hoare triple {4645#true} assume true; {4645#true} is VALID [2022-04-15 10:49:49,573 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {4645#true} {4896#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} #59#return; {4896#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-15 10:49:49,574 INFO L272 TraceCheckUtils]: 85: Hoare triple {4896#(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)); {4915#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:49:49,574 INFO L290 TraceCheckUtils]: 86: Hoare triple {4915#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4919#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:49:49,575 INFO L290 TraceCheckUtils]: 87: Hoare triple {4919#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4646#false} is VALID [2022-04-15 10:49:49,575 INFO L290 TraceCheckUtils]: 88: Hoare triple {4646#false} assume !false; {4646#false} is VALID [2022-04-15 10:49:49,575 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-15 10:49:49,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:49:49,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:49:49,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755901134] [2022-04-15 10:49:49,822 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:49:49,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188928956] [2022-04-15 10:49:49,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188928956] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 10:49:49,822 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 10:49:49,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-15 10:49:49,822 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:49:49,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1358178571] [2022-04-15 10:49:49,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1358178571] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:49:49,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:49:49,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 10:49:49,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809593540] [2022-04-15 10:49:49,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:49:49,823 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-15 10:49:49,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:49:49,823 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-15 10:49:49,871 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-15 10:49:49,871 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 10:49:49,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:49:49,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 10:49:49,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-15 10:49:49,871 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-15 10:49:50,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:49:50,689 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2022-04-15 10:49:50,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 10:49:50,689 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-15 10:49:50,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:49:50,689 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-15 10:49:50,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 70 transitions. [2022-04-15 10:49:50,691 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-15 10:49:50,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 70 transitions. [2022-04-15 10:49:50,692 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 70 transitions. [2022-04-15 10:49:50,765 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-15 10:49:50,766 INFO L225 Difference]: With dead ends: 63 [2022-04-15 10:49:50,766 INFO L226 Difference]: Without dead ends: 57 [2022-04-15 10:49:50,766 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-15 10:49:50,769 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 2 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-15 10:49:50,770 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.3s Time] [2022-04-15 10:49:50,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-15 10:49:50,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-15 10:49:50,798 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:49:50,798 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-15 10:49:50,799 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-15 10:49:50,800 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-15 10:49:50,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:49:50,801 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-15 10:49:50,801 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-15 10:49:50,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:49:50,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:49:50,803 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-15 10:49:50,803 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-15 10:49:50,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:49:50,804 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-15 10:49:50,804 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-15 10:49:50,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:49:50,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:49:50,805 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:49:50,805 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:49:50,805 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-15 10:49:50,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2022-04-15 10:49:50,807 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 89 [2022-04-15 10:49:50,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:49:50,807 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2022-04-15 10:49:50,807 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-15 10:49:50,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 67 transitions. [2022-04-15 10:49:51,280 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-15 10:49:51,280 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-15 10:49:51,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-04-15 10:49:51,281 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:49:51,281 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-15 10:49:51,297 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-15 10:49:51,484 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-15 10:49:51,484 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:49:51,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:49:51,485 INFO L85 PathProgramCache]: Analyzing trace with hash 711483229, now seen corresponding path program 17 times [2022-04-15 10:49:51,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:49:51,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1866486937] [2022-04-15 10:49:51,485 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:49:51,485 INFO L85 PathProgramCache]: Analyzing trace with hash 711483229, now seen corresponding path program 18 times [2022-04-15 10:49:51,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:49:51,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007780750] [2022-04-15 10:49:51,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:49:51,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:49:51,495 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:49:51,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [57020779] [2022-04-15 10:49:51,496 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 10:49:51,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:49:51,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:49:51,496 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-15 10:49:51,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-15 10:52:38,372 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-15 10:52:38,373 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:52:38,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-15 10:52:38,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:52:38,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:52:38,876 INFO L272 TraceCheckUtils]: 0: Hoare triple {5340#true} call ULTIMATE.init(); {5340#true} is VALID [2022-04-15 10:52:38,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {5340#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); {5340#true} is VALID [2022-04-15 10:52:38,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {5340#true} assume true; {5340#true} is VALID [2022-04-15 10:52:38,876 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5340#true} {5340#true} #63#return; {5340#true} is VALID [2022-04-15 10:52:38,876 INFO L272 TraceCheckUtils]: 4: Hoare triple {5340#true} call #t~ret5 := main(); {5340#true} is VALID [2022-04-15 10:52:38,876 INFO L290 TraceCheckUtils]: 5: Hoare triple {5340#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; {5340#true} is VALID [2022-04-15 10:52:38,876 INFO L272 TraceCheckUtils]: 6: Hoare triple {5340#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {5340#true} is VALID [2022-04-15 10:52:38,876 INFO L290 TraceCheckUtils]: 7: Hoare triple {5340#true} ~cond := #in~cond; {5340#true} is VALID [2022-04-15 10:52:38,876 INFO L290 TraceCheckUtils]: 8: Hoare triple {5340#true} assume !(0 == ~cond); {5340#true} is VALID [2022-04-15 10:52:38,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {5340#true} assume true; {5340#true} is VALID [2022-04-15 10:52:38,876 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5340#true} {5340#true} #53#return; {5340#true} is VALID [2022-04-15 10:52:38,877 INFO L272 TraceCheckUtils]: 11: Hoare triple {5340#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {5340#true} is VALID [2022-04-15 10:52:38,877 INFO L290 TraceCheckUtils]: 12: Hoare triple {5340#true} ~cond := #in~cond; {5340#true} is VALID [2022-04-15 10:52:38,877 INFO L290 TraceCheckUtils]: 13: Hoare triple {5340#true} assume !(0 == ~cond); {5340#true} is VALID [2022-04-15 10:52:38,877 INFO L290 TraceCheckUtils]: 14: Hoare triple {5340#true} assume true; {5340#true} is VALID [2022-04-15 10:52:38,877 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5340#true} {5340#true} #55#return; {5340#true} is VALID [2022-04-15 10:52:38,877 INFO L290 TraceCheckUtils]: 16: Hoare triple {5340#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {5393#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:52:38,878 INFO L290 TraceCheckUtils]: 17: Hoare triple {5393#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {5393#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:52:38,878 INFO L272 TraceCheckUtils]: 18: Hoare triple {5393#(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)); {5340#true} is VALID [2022-04-15 10:52:38,878 INFO L290 TraceCheckUtils]: 19: Hoare triple {5340#true} ~cond := #in~cond; {5340#true} is VALID [2022-04-15 10:52:38,878 INFO L290 TraceCheckUtils]: 20: Hoare triple {5340#true} assume !(0 == ~cond); {5340#true} is VALID [2022-04-15 10:52:38,878 INFO L290 TraceCheckUtils]: 21: Hoare triple {5340#true} assume true; {5340#true} is VALID [2022-04-15 10:52:38,883 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5340#true} {5393#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {5393#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:52:38,884 INFO L290 TraceCheckUtils]: 23: Hoare triple {5393#(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; {5415#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-15 10:52:38,884 INFO L290 TraceCheckUtils]: 24: Hoare triple {5415#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {5415#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-15 10:52:38,884 INFO L272 TraceCheckUtils]: 25: Hoare triple {5415#(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)); {5340#true} is VALID [2022-04-15 10:52:38,884 INFO L290 TraceCheckUtils]: 26: Hoare triple {5340#true} ~cond := #in~cond; {5340#true} is VALID [2022-04-15 10:52:38,885 INFO L290 TraceCheckUtils]: 27: Hoare triple {5340#true} assume !(0 == ~cond); {5340#true} is VALID [2022-04-15 10:52:38,885 INFO L290 TraceCheckUtils]: 28: Hoare triple {5340#true} assume true; {5340#true} is VALID [2022-04-15 10:52:38,885 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {5340#true} {5415#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #57#return; {5415#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-15 10:52:38,886 INFO L290 TraceCheckUtils]: 30: Hoare triple {5415#(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; {5437#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-15 10:52:38,886 INFO L290 TraceCheckUtils]: 31: Hoare triple {5437#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {5437#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-15 10:52:38,886 INFO L272 TraceCheckUtils]: 32: Hoare triple {5437#(and (= main_~y~0 2) (= 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)); {5340#true} is VALID [2022-04-15 10:52:38,886 INFO L290 TraceCheckUtils]: 33: Hoare triple {5340#true} ~cond := #in~cond; {5340#true} is VALID [2022-04-15 10:52:38,886 INFO L290 TraceCheckUtils]: 34: Hoare triple {5340#true} assume !(0 == ~cond); {5340#true} is VALID [2022-04-15 10:52:38,886 INFO L290 TraceCheckUtils]: 35: Hoare triple {5340#true} assume true; {5340#true} is VALID [2022-04-15 10:52:38,887 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5340#true} {5437#(and (= main_~y~0 2) (= main_~c~0 2))} #57#return; {5437#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-15 10:52:38,887 INFO L290 TraceCheckUtils]: 37: Hoare triple {5437#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5459#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-15 10:52:38,888 INFO L290 TraceCheckUtils]: 38: Hoare triple {5459#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !false; {5459#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-15 10:52:38,888 INFO L272 TraceCheckUtils]: 39: Hoare triple {5459#(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)); {5340#true} is VALID [2022-04-15 10:52:38,888 INFO L290 TraceCheckUtils]: 40: Hoare triple {5340#true} ~cond := #in~cond; {5340#true} is VALID [2022-04-15 10:52:38,888 INFO L290 TraceCheckUtils]: 41: Hoare triple {5340#true} assume !(0 == ~cond); {5340#true} is VALID [2022-04-15 10:52:38,888 INFO L290 TraceCheckUtils]: 42: Hoare triple {5340#true} assume true; {5340#true} is VALID [2022-04-15 10:52:38,888 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {5340#true} {5459#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #57#return; {5459#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-15 10:52:38,889 INFO L290 TraceCheckUtils]: 44: Hoare triple {5459#(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; {5481#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-15 10:52:38,889 INFO L290 TraceCheckUtils]: 45: Hoare triple {5481#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} assume !false; {5481#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-15 10:52:38,889 INFO L272 TraceCheckUtils]: 46: Hoare triple {5481#(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)); {5340#true} is VALID [2022-04-15 10:52:38,889 INFO L290 TraceCheckUtils]: 47: Hoare triple {5340#true} ~cond := #in~cond; {5340#true} is VALID [2022-04-15 10:52:38,889 INFO L290 TraceCheckUtils]: 48: Hoare triple {5340#true} assume !(0 == ~cond); {5340#true} is VALID [2022-04-15 10:52:38,890 INFO L290 TraceCheckUtils]: 49: Hoare triple {5340#true} assume true; {5340#true} is VALID [2022-04-15 10:52:38,890 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5340#true} {5481#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} #57#return; {5481#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-15 10:52:38,890 INFO L290 TraceCheckUtils]: 51: Hoare triple {5481#(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; {5503#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-15 10:52:38,891 INFO L290 TraceCheckUtils]: 52: Hoare triple {5503#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {5503#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-15 10:52:38,891 INFO L272 TraceCheckUtils]: 53: Hoare triple {5503#(and (= 5 main_~c~0) (= 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)); {5340#true} is VALID [2022-04-15 10:52:38,891 INFO L290 TraceCheckUtils]: 54: Hoare triple {5340#true} ~cond := #in~cond; {5340#true} is VALID [2022-04-15 10:52:38,891 INFO L290 TraceCheckUtils]: 55: Hoare triple {5340#true} assume !(0 == ~cond); {5340#true} is VALID [2022-04-15 10:52:38,891 INFO L290 TraceCheckUtils]: 56: Hoare triple {5340#true} assume true; {5340#true} is VALID [2022-04-15 10:52:38,892 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {5340#true} {5503#(and (= 5 main_~c~0) (= 5 main_~y~0))} #57#return; {5503#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-15 10:52:38,892 INFO L290 TraceCheckUtils]: 58: Hoare triple {5503#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5525#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-15 10:52:38,892 INFO L290 TraceCheckUtils]: 59: Hoare triple {5525#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {5525#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-15 10:52:38,893 INFO L272 TraceCheckUtils]: 60: Hoare triple {5525#(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)); {5340#true} is VALID [2022-04-15 10:52:38,893 INFO L290 TraceCheckUtils]: 61: Hoare triple {5340#true} ~cond := #in~cond; {5340#true} is VALID [2022-04-15 10:52:38,893 INFO L290 TraceCheckUtils]: 62: Hoare triple {5340#true} assume !(0 == ~cond); {5340#true} is VALID [2022-04-15 10:52:38,893 INFO L290 TraceCheckUtils]: 63: Hoare triple {5340#true} assume true; {5340#true} is VALID [2022-04-15 10:52:38,893 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {5340#true} {5525#(and (= main_~y~0 6) (= main_~c~0 6))} #57#return; {5525#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-15 10:52:38,894 INFO L290 TraceCheckUtils]: 65: Hoare triple {5525#(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; {5547#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-15 10:52:38,894 INFO L290 TraceCheckUtils]: 66: Hoare triple {5547#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !false; {5547#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-15 10:52:38,894 INFO L272 TraceCheckUtils]: 67: Hoare triple {5547#(and (= 7 main_~y~0) (= (+ (- 1) 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)); {5340#true} is VALID [2022-04-15 10:52:38,894 INFO L290 TraceCheckUtils]: 68: Hoare triple {5340#true} ~cond := #in~cond; {5340#true} is VALID [2022-04-15 10:52:38,894 INFO L290 TraceCheckUtils]: 69: Hoare triple {5340#true} assume !(0 == ~cond); {5340#true} is VALID [2022-04-15 10:52:38,894 INFO L290 TraceCheckUtils]: 70: Hoare triple {5340#true} assume true; {5340#true} is VALID [2022-04-15 10:52:38,895 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {5340#true} {5547#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #57#return; {5547#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-15 10:52:38,895 INFO L290 TraceCheckUtils]: 72: Hoare triple {5547#(and (= 7 main_~y~0) (= (+ (- 1) 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; {5569#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 10:52:38,896 INFO L290 TraceCheckUtils]: 73: Hoare triple {5569#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} assume !false; {5569#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 10:52:38,896 INFO L272 TraceCheckUtils]: 74: Hoare triple {5569#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 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)); {5340#true} is VALID [2022-04-15 10:52:38,896 INFO L290 TraceCheckUtils]: 75: Hoare triple {5340#true} ~cond := #in~cond; {5340#true} is VALID [2022-04-15 10:52:38,896 INFO L290 TraceCheckUtils]: 76: Hoare triple {5340#true} assume !(0 == ~cond); {5340#true} is VALID [2022-04-15 10:52:38,896 INFO L290 TraceCheckUtils]: 77: Hoare triple {5340#true} assume true; {5340#true} is VALID [2022-04-15 10:52:38,896 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {5340#true} {5569#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} #57#return; {5569#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 10:52:38,897 INFO L290 TraceCheckUtils]: 79: Hoare triple {5569#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 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; {5591#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-15 10:52:38,897 INFO L290 TraceCheckUtils]: 80: Hoare triple {5591#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !false; {5591#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-15 10:52:38,897 INFO L272 TraceCheckUtils]: 81: Hoare triple {5591#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} 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)); {5340#true} is VALID [2022-04-15 10:52:38,897 INFO L290 TraceCheckUtils]: 82: Hoare triple {5340#true} ~cond := #in~cond; {5340#true} is VALID [2022-04-15 10:52:38,897 INFO L290 TraceCheckUtils]: 83: Hoare triple {5340#true} assume !(0 == ~cond); {5340#true} is VALID [2022-04-15 10:52:38,897 INFO L290 TraceCheckUtils]: 84: Hoare triple {5340#true} assume true; {5340#true} is VALID [2022-04-15 10:52:38,898 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {5340#true} {5591#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} #57#return; {5591#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-15 10:52:38,899 INFO L290 TraceCheckUtils]: 86: Hoare triple {5591#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !(~c~0 < ~k~0); {5613#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-15 10:52:38,899 INFO L272 TraceCheckUtils]: 87: Hoare triple {5613#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 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)); {5340#true} is VALID [2022-04-15 10:52:38,899 INFO L290 TraceCheckUtils]: 88: Hoare triple {5340#true} ~cond := #in~cond; {5340#true} is VALID [2022-04-15 10:52:38,899 INFO L290 TraceCheckUtils]: 89: Hoare triple {5340#true} assume !(0 == ~cond); {5340#true} is VALID [2022-04-15 10:52:38,899 INFO L290 TraceCheckUtils]: 90: Hoare triple {5340#true} assume true; {5340#true} is VALID [2022-04-15 10:52:38,899 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {5340#true} {5613#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} #59#return; {5613#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-15 10:52:38,900 INFO L272 TraceCheckUtils]: 92: Hoare triple {5613#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {5632#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:52:38,900 INFO L290 TraceCheckUtils]: 93: Hoare triple {5632#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5636#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:52:38,900 INFO L290 TraceCheckUtils]: 94: Hoare triple {5636#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5341#false} is VALID [2022-04-15 10:52:38,901 INFO L290 TraceCheckUtils]: 95: Hoare triple {5341#false} assume !false; {5341#false} is VALID [2022-04-15 10:52:38,901 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 22 proven. 135 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-15 10:52:38,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:52:39,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:52:39,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007780750] [2022-04-15 10:52:39,169 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:52:39,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57020779] [2022-04-15 10:52:39,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57020779] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 10:52:39,170 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 10:52:39,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-04-15 10:52:39,170 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:52:39,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1866486937] [2022-04-15 10:52:39,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1866486937] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:52:39,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:52:39,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 10:52:39,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076009426] [2022-04-15 10:52:39,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:52:39,171 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) Word has length 96 [2022-04-15 10:52:39,171 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:52:39,171 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-15 10:52:39,211 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-15 10:52:39,211 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 10:52:39,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:52:39,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 10:52:39,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-04-15 10:52:39,212 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-15 10:52:40,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:52:40,204 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2022-04-15 10:52:40,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 10:52:40,204 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) Word has length 96 [2022-04-15 10:52:40,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:52:40,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-15 10:52:40,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 74 transitions. [2022-04-15 10:52:40,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-15 10:52:40,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 74 transitions. [2022-04-15 10:52:40,208 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 74 transitions. [2022-04-15 10:52:40,259 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:52:40,260 INFO L225 Difference]: With dead ends: 66 [2022-04-15 10:52:40,260 INFO L226 Difference]: Without dead ends: 60 [2022-04-15 10:52:40,260 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2022-04-15 10:52:40,261 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 2 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 10:52:40,261 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 439 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 10:52:40,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-15 10:52:40,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-04-15 10:52:40,297 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:52:40,297 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 60 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 10:52:40,297 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 60 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 10:52:40,297 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 60 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 10:52:40,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:52:40,298 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-15 10:52:40,298 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-15 10:52:40,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:52:40,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:52:40,299 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 60 states. [2022-04-15 10:52:40,299 INFO L87 Difference]: Start difference. First operand has 60 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 60 states. [2022-04-15 10:52:40,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:52:40,300 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-15 10:52:40,300 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-15 10:52:40,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:52:40,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:52:40,301 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:52:40,301 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:52:40,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 10:52:40,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2022-04-15 10:52:40,302 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 96 [2022-04-15 10:52:40,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:52:40,302 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2022-04-15 10:52:40,303 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-15 10:52:40,303 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 71 transitions. [2022-04-15 10:52:40,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:52:40,682 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-15 10:52:40,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-15 10:52:40,682 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:52:40,682 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 11, 11, 11, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:52:40,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-15 10:52:40,895 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-15 10:52:40,895 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:52:40,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:52:40,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1610181715, now seen corresponding path program 19 times [2022-04-15 10:52:40,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:52:40,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1457699667] [2022-04-15 10:52:40,896 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:52:40,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1610181715, now seen corresponding path program 20 times [2022-04-15 10:52:40,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:52:40,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179364408] [2022-04-15 10:52:40,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:52:40,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:52:40,908 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:52:40,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [312221850] [2022-04-15 10:52:40,908 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 10:52:40,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:52:40,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:52:40,909 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 10:52:40,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-15 10:54:55,860 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 10:54:55,860 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:54:55,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-15 10:54:55,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:54:55,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:54:56,533 INFO L272 TraceCheckUtils]: 0: Hoare triple {6075#true} call ULTIMATE.init(); {6075#true} is VALID [2022-04-15 10:54:56,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {6075#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); {6075#true} is VALID [2022-04-15 10:54:56,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {6075#true} assume true; {6075#true} is VALID [2022-04-15 10:54:56,534 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6075#true} {6075#true} #63#return; {6075#true} is VALID [2022-04-15 10:54:56,534 INFO L272 TraceCheckUtils]: 4: Hoare triple {6075#true} call #t~ret5 := main(); {6075#true} is VALID [2022-04-15 10:54:56,534 INFO L290 TraceCheckUtils]: 5: Hoare triple {6075#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; {6075#true} is VALID [2022-04-15 10:54:56,534 INFO L272 TraceCheckUtils]: 6: Hoare triple {6075#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {6075#true} is VALID [2022-04-15 10:54:56,534 INFO L290 TraceCheckUtils]: 7: Hoare triple {6075#true} ~cond := #in~cond; {6075#true} is VALID [2022-04-15 10:54:56,534 INFO L290 TraceCheckUtils]: 8: Hoare triple {6075#true} assume !(0 == ~cond); {6075#true} is VALID [2022-04-15 10:54:56,534 INFO L290 TraceCheckUtils]: 9: Hoare triple {6075#true} assume true; {6075#true} is VALID [2022-04-15 10:54:56,534 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6075#true} {6075#true} #53#return; {6075#true} is VALID [2022-04-15 10:54:56,535 INFO L272 TraceCheckUtils]: 11: Hoare triple {6075#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {6075#true} is VALID [2022-04-15 10:54:56,535 INFO L290 TraceCheckUtils]: 12: Hoare triple {6075#true} ~cond := #in~cond; {6075#true} is VALID [2022-04-15 10:54:56,535 INFO L290 TraceCheckUtils]: 13: Hoare triple {6075#true} assume !(0 == ~cond); {6075#true} is VALID [2022-04-15 10:54:56,535 INFO L290 TraceCheckUtils]: 14: Hoare triple {6075#true} assume true; {6075#true} is VALID [2022-04-15 10:54:56,535 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6075#true} {6075#true} #55#return; {6075#true} is VALID [2022-04-15 10:54:56,535 INFO L290 TraceCheckUtils]: 16: Hoare triple {6075#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {6128#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:54:56,535 INFO L290 TraceCheckUtils]: 17: Hoare triple {6128#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {6128#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:54:56,536 INFO L272 TraceCheckUtils]: 18: Hoare triple {6128#(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)); {6075#true} is VALID [2022-04-15 10:54:56,536 INFO L290 TraceCheckUtils]: 19: Hoare triple {6075#true} ~cond := #in~cond; {6075#true} is VALID [2022-04-15 10:54:56,536 INFO L290 TraceCheckUtils]: 20: Hoare triple {6075#true} assume !(0 == ~cond); {6075#true} is VALID [2022-04-15 10:54:56,536 INFO L290 TraceCheckUtils]: 21: Hoare triple {6075#true} assume true; {6075#true} is VALID [2022-04-15 10:54:56,536 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6075#true} {6128#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {6128#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:54:56,537 INFO L290 TraceCheckUtils]: 23: Hoare triple {6128#(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; {6150#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-15 10:54:56,537 INFO L290 TraceCheckUtils]: 24: Hoare triple {6150#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} assume !false; {6150#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-15 10:54:56,537 INFO L272 TraceCheckUtils]: 25: Hoare triple {6150#(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)); {6075#true} is VALID [2022-04-15 10:54:56,537 INFO L290 TraceCheckUtils]: 26: Hoare triple {6075#true} ~cond := #in~cond; {6075#true} is VALID [2022-04-15 10:54:56,537 INFO L290 TraceCheckUtils]: 27: Hoare triple {6075#true} assume !(0 == ~cond); {6075#true} is VALID [2022-04-15 10:54:56,537 INFO L290 TraceCheckUtils]: 28: Hoare triple {6075#true} assume true; {6075#true} is VALID [2022-04-15 10:54:56,538 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {6075#true} {6150#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} #57#return; {6150#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-15 10:54:56,538 INFO L290 TraceCheckUtils]: 30: Hoare triple {6150#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6172#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-15 10:54:56,538 INFO L290 TraceCheckUtils]: 31: Hoare triple {6172#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} assume !false; {6172#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-15 10:54:56,539 INFO L272 TraceCheckUtils]: 32: Hoare triple {6172#(and (= main_~y~0 2) (= main_~c~0 2) (< 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)); {6075#true} is VALID [2022-04-15 10:54:56,539 INFO L290 TraceCheckUtils]: 33: Hoare triple {6075#true} ~cond := #in~cond; {6075#true} is VALID [2022-04-15 10:54:56,539 INFO L290 TraceCheckUtils]: 34: Hoare triple {6075#true} assume !(0 == ~cond); {6075#true} is VALID [2022-04-15 10:54:56,539 INFO L290 TraceCheckUtils]: 35: Hoare triple {6075#true} assume true; {6075#true} is VALID [2022-04-15 10:54:56,543 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6075#true} {6172#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} #57#return; {6172#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-15 10:54:56,544 INFO L290 TraceCheckUtils]: 37: Hoare triple {6172#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~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; {6194#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-15 10:54:56,544 INFO L290 TraceCheckUtils]: 38: Hoare triple {6194#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} assume !false; {6194#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-15 10:54:56,544 INFO L272 TraceCheckUtils]: 39: Hoare triple {6194#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2) (< 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)); {6075#true} is VALID [2022-04-15 10:54:56,544 INFO L290 TraceCheckUtils]: 40: Hoare triple {6075#true} ~cond := #in~cond; {6075#true} is VALID [2022-04-15 10:54:56,544 INFO L290 TraceCheckUtils]: 41: Hoare triple {6075#true} assume !(0 == ~cond); {6075#true} is VALID [2022-04-15 10:54:56,545 INFO L290 TraceCheckUtils]: 42: Hoare triple {6075#true} assume true; {6075#true} is VALID [2022-04-15 10:54:56,545 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {6075#true} {6194#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} #57#return; {6194#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-15 10:54:56,546 INFO L290 TraceCheckUtils]: 44: Hoare triple {6194#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~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; {6216#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-15 10:54:56,546 INFO L290 TraceCheckUtils]: 45: Hoare triple {6216#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} assume !false; {6216#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-15 10:54:56,546 INFO L272 TraceCheckUtils]: 46: Hoare triple {6216#(and (= main_~y~0 4) (= main_~c~0 4) (< 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)); {6075#true} is VALID [2022-04-15 10:54:56,546 INFO L290 TraceCheckUtils]: 47: Hoare triple {6075#true} ~cond := #in~cond; {6075#true} is VALID [2022-04-15 10:54:56,546 INFO L290 TraceCheckUtils]: 48: Hoare triple {6075#true} assume !(0 == ~cond); {6075#true} is VALID [2022-04-15 10:54:56,546 INFO L290 TraceCheckUtils]: 49: Hoare triple {6075#true} assume true; {6075#true} is VALID [2022-04-15 10:54:56,547 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6075#true} {6216#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} #57#return; {6216#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-15 10:54:56,547 INFO L290 TraceCheckUtils]: 51: Hoare triple {6216#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~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; {6238#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4) (< 0 main_~k~0))} is VALID [2022-04-15 10:54:56,548 INFO L290 TraceCheckUtils]: 52: Hoare triple {6238#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4) (< 0 main_~k~0))} assume !false; {6238#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4) (< 0 main_~k~0))} is VALID [2022-04-15 10:54:56,548 INFO L272 TraceCheckUtils]: 53: Hoare triple {6238#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4) (< 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)); {6075#true} is VALID [2022-04-15 10:54:56,548 INFO L290 TraceCheckUtils]: 54: Hoare triple {6075#true} ~cond := #in~cond; {6075#true} is VALID [2022-04-15 10:54:56,548 INFO L290 TraceCheckUtils]: 55: Hoare triple {6075#true} assume !(0 == ~cond); {6075#true} is VALID [2022-04-15 10:54:56,548 INFO L290 TraceCheckUtils]: 56: Hoare triple {6075#true} assume true; {6075#true} is VALID [2022-04-15 10:54:56,549 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {6075#true} {6238#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4) (< 0 main_~k~0))} #57#return; {6238#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4) (< 0 main_~k~0))} is VALID [2022-04-15 10:54:56,549 INFO L290 TraceCheckUtils]: 58: Hoare triple {6238#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4) (< 0 main_~k~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; {6260#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} is VALID [2022-04-15 10:54:56,550 INFO L290 TraceCheckUtils]: 59: Hoare triple {6260#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} assume !false; {6260#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} is VALID [2022-04-15 10:54:56,550 INFO L272 TraceCheckUtils]: 60: Hoare triple {6260#(and (= main_~y~0 6) (= main_~c~0 6) (< 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)); {6075#true} is VALID [2022-04-15 10:54:56,550 INFO L290 TraceCheckUtils]: 61: Hoare triple {6075#true} ~cond := #in~cond; {6075#true} is VALID [2022-04-15 10:54:56,550 INFO L290 TraceCheckUtils]: 62: Hoare triple {6075#true} assume !(0 == ~cond); {6075#true} is VALID [2022-04-15 10:54:56,550 INFO L290 TraceCheckUtils]: 63: Hoare triple {6075#true} assume true; {6075#true} is VALID [2022-04-15 10:54:56,551 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {6075#true} {6260#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} #57#return; {6260#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} is VALID [2022-04-15 10:54:56,551 INFO L290 TraceCheckUtils]: 65: Hoare triple {6260#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~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; {6282#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-15 10:54:56,551 INFO L290 TraceCheckUtils]: 66: Hoare triple {6282#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 0 main_~k~0))} assume !false; {6282#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-15 10:54:56,551 INFO L272 TraceCheckUtils]: 67: Hoare triple {6282#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 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)); {6075#true} is VALID [2022-04-15 10:54:56,552 INFO L290 TraceCheckUtils]: 68: Hoare triple {6075#true} ~cond := #in~cond; {6075#true} is VALID [2022-04-15 10:54:56,552 INFO L290 TraceCheckUtils]: 69: Hoare triple {6075#true} assume !(0 == ~cond); {6075#true} is VALID [2022-04-15 10:54:56,552 INFO L290 TraceCheckUtils]: 70: Hoare triple {6075#true} assume true; {6075#true} is VALID [2022-04-15 10:54:56,552 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {6075#true} {6282#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 0 main_~k~0))} #57#return; {6282#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-15 10:54:56,553 INFO L290 TraceCheckUtils]: 72: Hoare triple {6282#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 0 main_~k~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; {6304#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-15 10:54:56,553 INFO L290 TraceCheckUtils]: 73: Hoare triple {6304#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)) (< 0 main_~k~0))} assume !false; {6304#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-15 10:54:56,553 INFO L272 TraceCheckUtils]: 74: Hoare triple {6304#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)) (< 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)); {6075#true} is VALID [2022-04-15 10:54:56,553 INFO L290 TraceCheckUtils]: 75: Hoare triple {6075#true} ~cond := #in~cond; {6075#true} is VALID [2022-04-15 10:54:56,553 INFO L290 TraceCheckUtils]: 76: Hoare triple {6075#true} assume !(0 == ~cond); {6075#true} is VALID [2022-04-15 10:54:56,553 INFO L290 TraceCheckUtils]: 77: Hoare triple {6075#true} assume true; {6075#true} is VALID [2022-04-15 10:54:56,554 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {6075#true} {6304#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)) (< 0 main_~k~0))} #57#return; {6304#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-15 10:54:56,554 INFO L290 TraceCheckUtils]: 79: Hoare triple {6304#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)) (< 0 main_~k~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; {6326#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-15 10:54:56,555 INFO L290 TraceCheckUtils]: 80: Hoare triple {6326#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} assume !false; {6326#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-15 10:54:56,555 INFO L272 TraceCheckUtils]: 81: Hoare triple {6326#(and (= main_~y~0 9) (= main_~c~0 9) (< 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)); {6075#true} is VALID [2022-04-15 10:54:56,555 INFO L290 TraceCheckUtils]: 82: Hoare triple {6075#true} ~cond := #in~cond; {6075#true} is VALID [2022-04-15 10:54:56,555 INFO L290 TraceCheckUtils]: 83: Hoare triple {6075#true} assume !(0 == ~cond); {6075#true} is VALID [2022-04-15 10:54:56,555 INFO L290 TraceCheckUtils]: 84: Hoare triple {6075#true} assume true; {6075#true} is VALID [2022-04-15 10:54:56,556 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {6075#true} {6326#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} #57#return; {6326#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-15 10:54:56,556 INFO L290 TraceCheckUtils]: 86: Hoare triple {6326#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~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; {6348#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-15 10:54:56,556 INFO L290 TraceCheckUtils]: 87: Hoare triple {6348#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} assume !false; {6348#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-15 10:54:56,556 INFO L272 TraceCheckUtils]: 88: Hoare triple {6348#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 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)); {6075#true} is VALID [2022-04-15 10:54:56,557 INFO L290 TraceCheckUtils]: 89: Hoare triple {6075#true} ~cond := #in~cond; {6075#true} is VALID [2022-04-15 10:54:56,557 INFO L290 TraceCheckUtils]: 90: Hoare triple {6075#true} assume !(0 == ~cond); {6075#true} is VALID [2022-04-15 10:54:56,557 INFO L290 TraceCheckUtils]: 91: Hoare triple {6075#true} assume true; {6075#true} is VALID [2022-04-15 10:54:56,557 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {6075#true} {6348#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} #57#return; {6348#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-15 10:54:56,558 INFO L290 TraceCheckUtils]: 93: Hoare triple {6348#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} assume !(~c~0 < ~k~0); {6370#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} is VALID [2022-04-15 10:54:56,558 INFO L272 TraceCheckUtils]: 94: Hoare triple {6370#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 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)); {6075#true} is VALID [2022-04-15 10:54:56,558 INFO L290 TraceCheckUtils]: 95: Hoare triple {6075#true} ~cond := #in~cond; {6075#true} is VALID [2022-04-15 10:54:56,558 INFO L290 TraceCheckUtils]: 96: Hoare triple {6075#true} assume !(0 == ~cond); {6075#true} is VALID [2022-04-15 10:54:56,558 INFO L290 TraceCheckUtils]: 97: Hoare triple {6075#true} assume true; {6075#true} is VALID [2022-04-15 10:54:56,559 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {6075#true} {6370#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} #59#return; {6370#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} is VALID [2022-04-15 10:54:56,559 INFO L272 TraceCheckUtils]: 99: Hoare triple {6370#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {6389#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:54:56,560 INFO L290 TraceCheckUtils]: 100: Hoare triple {6389#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6393#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:54:56,560 INFO L290 TraceCheckUtils]: 101: Hoare triple {6393#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6076#false} is VALID [2022-04-15 10:54:56,560 INFO L290 TraceCheckUtils]: 102: Hoare triple {6076#false} assume !false; {6076#false} is VALID [2022-04-15 10:54:56,560 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 24 proven. 165 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-04-15 10:54:56,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:54:57,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:54:57,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179364408] [2022-04-15 10:54:57,484 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:54:57,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312221850] [2022-04-15 10:54:57,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312221850] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 10:54:57,484 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 10:54:57,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-04-15 10:54:57,485 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:54:57,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1457699667] [2022-04-15 10:54:57,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1457699667] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:54:57,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:54:57,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 10:54:57,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5412013] [2022-04-15 10:54:57,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:54:57,485 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) Word has length 103 [2022-04-15 10:54:57,486 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:54:57,486 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-04-15 10:54:57,529 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-15 10:54:57,530 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 10:54:57,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:54:57,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 10:54:57,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2022-04-15 10:54:57,530 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-04-15 10:54:58,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:54:58,698 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2022-04-15 10:54:58,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 10:54:58,699 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) Word has length 103 [2022-04-15 10:54:58,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:54:58,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-04-15 10:54:58,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 78 transitions. [2022-04-15 10:54:58,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-04-15 10:54:58,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 78 transitions. [2022-04-15 10:54:58,701 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 78 transitions. [2022-04-15 10:54:58,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:54:58,764 INFO L225 Difference]: With dead ends: 69 [2022-04-15 10:54:58,764 INFO L226 Difference]: Without dead ends: 63 [2022-04-15 10:54:58,765 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=170, Invalid=700, Unknown=0, NotChecked=0, Total=870 [2022-04-15 10:54:58,765 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 2 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 10:54:58,765 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 468 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 10:54:58,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-15 10:54:58,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-04-15 10:54:58,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:54:58,809 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 63 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 10:54:58,810 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 63 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 10:54:58,810 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 63 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 10:54:58,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:54:58,811 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2022-04-15 10:54:58,811 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2022-04-15 10:54:58,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:54:58,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:54:58,812 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 63 states. [2022-04-15 10:54:58,812 INFO L87 Difference]: Start difference. First operand has 63 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 63 states. [2022-04-15 10:54:58,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:54:58,813 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2022-04-15 10:54:58,813 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2022-04-15 10:54:58,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:54:58,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:54:58,813 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:54:58,813 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:54:58,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 10:54:58,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2022-04-15 10:54:58,814 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 103 [2022-04-15 10:54:58,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:54:58,815 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2022-04-15 10:54:58,815 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-04-15 10:54:58,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 75 transitions. [2022-04-15 10:54:59,175 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:54:59,175 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2022-04-15 10:54:59,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-15 10:54:59,176 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:54:59,176 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 12, 12, 12, 11, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:54:59,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-04-15 10:54:59,377 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-15 10:54:59,377 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:54:59,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:54:59,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1881400669, now seen corresponding path program 21 times [2022-04-15 10:54:59,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:54:59,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [344048900] [2022-04-15 10:54:59,378 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:54:59,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1881400669, now seen corresponding path program 22 times [2022-04-15 10:54:59,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:54:59,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779498917] [2022-04-15 10:54:59,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:54:59,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:54:59,389 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:54:59,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1109949382] [2022-04-15 10:54:59,390 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 10:54:59,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:54:59,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:54:59,391 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 10:54:59,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-15 10:54:59,435 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 10:54:59,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:54:59,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-15 10:54:59,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:54:59,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:54:59,959 INFO L272 TraceCheckUtils]: 0: Hoare triple {7048#true} call ULTIMATE.init(); {7048#true} is VALID [2022-04-15 10:54:59,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {7048#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); {7048#true} is VALID [2022-04-15 10:54:59,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {7048#true} assume true; {7048#true} is VALID [2022-04-15 10:54:59,960 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7048#true} {7048#true} #63#return; {7048#true} is VALID [2022-04-15 10:54:59,960 INFO L272 TraceCheckUtils]: 4: Hoare triple {7048#true} call #t~ret5 := main(); {7048#true} is VALID [2022-04-15 10:54:59,960 INFO L290 TraceCheckUtils]: 5: Hoare triple {7048#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; {7048#true} is VALID [2022-04-15 10:54:59,960 INFO L272 TraceCheckUtils]: 6: Hoare triple {7048#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {7048#true} is VALID [2022-04-15 10:54:59,960 INFO L290 TraceCheckUtils]: 7: Hoare triple {7048#true} ~cond := #in~cond; {7048#true} is VALID [2022-04-15 10:54:59,960 INFO L290 TraceCheckUtils]: 8: Hoare triple {7048#true} assume !(0 == ~cond); {7048#true} is VALID [2022-04-15 10:54:59,960 INFO L290 TraceCheckUtils]: 9: Hoare triple {7048#true} assume true; {7048#true} is VALID [2022-04-15 10:54:59,960 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7048#true} {7048#true} #53#return; {7048#true} is VALID [2022-04-15 10:54:59,960 INFO L272 TraceCheckUtils]: 11: Hoare triple {7048#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {7048#true} is VALID [2022-04-15 10:54:59,960 INFO L290 TraceCheckUtils]: 12: Hoare triple {7048#true} ~cond := #in~cond; {7048#true} is VALID [2022-04-15 10:54:59,960 INFO L290 TraceCheckUtils]: 13: Hoare triple {7048#true} assume !(0 == ~cond); {7048#true} is VALID [2022-04-15 10:54:59,960 INFO L290 TraceCheckUtils]: 14: Hoare triple {7048#true} assume true; {7048#true} is VALID [2022-04-15 10:54:59,961 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7048#true} {7048#true} #55#return; {7048#true} is VALID [2022-04-15 10:54:59,961 INFO L290 TraceCheckUtils]: 16: Hoare triple {7048#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {7101#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:54:59,961 INFO L290 TraceCheckUtils]: 17: Hoare triple {7101#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {7101#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:54:59,961 INFO L272 TraceCheckUtils]: 18: Hoare triple {7101#(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)); {7048#true} is VALID [2022-04-15 10:54:59,961 INFO L290 TraceCheckUtils]: 19: Hoare triple {7048#true} ~cond := #in~cond; {7048#true} is VALID [2022-04-15 10:54:59,961 INFO L290 TraceCheckUtils]: 20: Hoare triple {7048#true} assume !(0 == ~cond); {7048#true} is VALID [2022-04-15 10:54:59,961 INFO L290 TraceCheckUtils]: 21: Hoare triple {7048#true} assume true; {7048#true} is VALID [2022-04-15 10:54:59,962 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7048#true} {7101#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {7101#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:54:59,962 INFO L290 TraceCheckUtils]: 23: Hoare triple {7101#(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; {7123#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-15 10:54:59,963 INFO L290 TraceCheckUtils]: 24: Hoare triple {7123#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {7123#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-15 10:54:59,963 INFO L272 TraceCheckUtils]: 25: Hoare triple {7123#(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)); {7048#true} is VALID [2022-04-15 10:54:59,963 INFO L290 TraceCheckUtils]: 26: Hoare triple {7048#true} ~cond := #in~cond; {7048#true} is VALID [2022-04-15 10:54:59,963 INFO L290 TraceCheckUtils]: 27: Hoare triple {7048#true} assume !(0 == ~cond); {7048#true} is VALID [2022-04-15 10:54:59,963 INFO L290 TraceCheckUtils]: 28: Hoare triple {7048#true} assume true; {7048#true} is VALID [2022-04-15 10:54:59,964 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {7048#true} {7123#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #57#return; {7123#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-15 10:54:59,964 INFO L290 TraceCheckUtils]: 30: Hoare triple {7123#(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; {7145#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-15 10:54:59,964 INFO L290 TraceCheckUtils]: 31: Hoare triple {7145#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !false; {7145#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-15 10:54:59,964 INFO L272 TraceCheckUtils]: 32: Hoare triple {7145#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) 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)); {7048#true} is VALID [2022-04-15 10:54:59,964 INFO L290 TraceCheckUtils]: 33: Hoare triple {7048#true} ~cond := #in~cond; {7048#true} is VALID [2022-04-15 10:54:59,965 INFO L290 TraceCheckUtils]: 34: Hoare triple {7048#true} assume !(0 == ~cond); {7048#true} is VALID [2022-04-15 10:54:59,965 INFO L290 TraceCheckUtils]: 35: Hoare triple {7048#true} assume true; {7048#true} is VALID [2022-04-15 10:54:59,965 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7048#true} {7145#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} #57#return; {7145#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-15 10:54:59,965 INFO L290 TraceCheckUtils]: 37: Hoare triple {7145#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) 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; {7167#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-15 10:54:59,966 INFO L290 TraceCheckUtils]: 38: Hoare triple {7167#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !false; {7167#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-15 10:54:59,966 INFO L272 TraceCheckUtils]: 39: Hoare triple {7167#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~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)); {7048#true} is VALID [2022-04-15 10:54:59,966 INFO L290 TraceCheckUtils]: 40: Hoare triple {7048#true} ~cond := #in~cond; {7048#true} is VALID [2022-04-15 10:54:59,966 INFO L290 TraceCheckUtils]: 41: Hoare triple {7048#true} assume !(0 == ~cond); {7048#true} is VALID [2022-04-15 10:54:59,966 INFO L290 TraceCheckUtils]: 42: Hoare triple {7048#true} assume true; {7048#true} is VALID [2022-04-15 10:54:59,966 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {7048#true} {7167#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #57#return; {7167#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-15 10:54:59,967 INFO L290 TraceCheckUtils]: 44: Hoare triple {7167#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7189#(and (= (+ main_~c~0 (- 3)) 1) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 10:54:59,967 INFO L290 TraceCheckUtils]: 45: Hoare triple {7189#(and (= (+ main_~c~0 (- 3)) 1) (= 3 (+ (- 1) main_~y~0)))} assume !false; {7189#(and (= (+ main_~c~0 (- 3)) 1) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 10:54:59,967 INFO L272 TraceCheckUtils]: 46: Hoare triple {7189#(and (= (+ main_~c~0 (- 3)) 1) (= 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)); {7048#true} is VALID [2022-04-15 10:54:59,967 INFO L290 TraceCheckUtils]: 47: Hoare triple {7048#true} ~cond := #in~cond; {7048#true} is VALID [2022-04-15 10:54:59,967 INFO L290 TraceCheckUtils]: 48: Hoare triple {7048#true} assume !(0 == ~cond); {7048#true} is VALID [2022-04-15 10:54:59,968 INFO L290 TraceCheckUtils]: 49: Hoare triple {7048#true} assume true; {7048#true} is VALID [2022-04-15 10:54:59,968 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7048#true} {7189#(and (= (+ main_~c~0 (- 3)) 1) (= 3 (+ (- 1) main_~y~0)))} #57#return; {7189#(and (= (+ main_~c~0 (- 3)) 1) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 10:54:59,968 INFO L290 TraceCheckUtils]: 51: Hoare triple {7189#(and (= (+ main_~c~0 (- 3)) 1) (= 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; {7211#(and (= (+ (- 2) main_~y~0) 3) (= (+ main_~c~0 (- 4)) 1))} is VALID [2022-04-15 10:54:59,969 INFO L290 TraceCheckUtils]: 52: Hoare triple {7211#(and (= (+ (- 2) main_~y~0) 3) (= (+ main_~c~0 (- 4)) 1))} assume !false; {7211#(and (= (+ (- 2) main_~y~0) 3) (= (+ main_~c~0 (- 4)) 1))} is VALID [2022-04-15 10:54:59,969 INFO L272 TraceCheckUtils]: 53: Hoare triple {7211#(and (= (+ (- 2) main_~y~0) 3) (= (+ main_~c~0 (- 4)) 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)); {7048#true} is VALID [2022-04-15 10:54:59,969 INFO L290 TraceCheckUtils]: 54: Hoare triple {7048#true} ~cond := #in~cond; {7048#true} is VALID [2022-04-15 10:54:59,969 INFO L290 TraceCheckUtils]: 55: Hoare triple {7048#true} assume !(0 == ~cond); {7048#true} is VALID [2022-04-15 10:54:59,969 INFO L290 TraceCheckUtils]: 56: Hoare triple {7048#true} assume true; {7048#true} is VALID [2022-04-15 10:54:59,969 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {7048#true} {7211#(and (= (+ (- 2) main_~y~0) 3) (= (+ main_~c~0 (- 4)) 1))} #57#return; {7211#(and (= (+ (- 2) main_~y~0) 3) (= (+ main_~c~0 (- 4)) 1))} is VALID [2022-04-15 10:54:59,970 INFO L290 TraceCheckUtils]: 58: Hoare triple {7211#(and (= (+ (- 2) main_~y~0) 3) (= (+ main_~c~0 (- 4)) 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; {7233#(and (= (+ main_~c~0 (- 5)) 1) (= (+ main_~y~0 (- 3)) 3))} is VALID [2022-04-15 10:54:59,970 INFO L290 TraceCheckUtils]: 59: Hoare triple {7233#(and (= (+ main_~c~0 (- 5)) 1) (= (+ main_~y~0 (- 3)) 3))} assume !false; {7233#(and (= (+ main_~c~0 (- 5)) 1) (= (+ main_~y~0 (- 3)) 3))} is VALID [2022-04-15 10:54:59,970 INFO L272 TraceCheckUtils]: 60: Hoare triple {7233#(and (= (+ main_~c~0 (- 5)) 1) (= (+ main_~y~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)); {7048#true} is VALID [2022-04-15 10:54:59,970 INFO L290 TraceCheckUtils]: 61: Hoare triple {7048#true} ~cond := #in~cond; {7048#true} is VALID [2022-04-15 10:54:59,970 INFO L290 TraceCheckUtils]: 62: Hoare triple {7048#true} assume !(0 == ~cond); {7048#true} is VALID [2022-04-15 10:54:59,970 INFO L290 TraceCheckUtils]: 63: Hoare triple {7048#true} assume true; {7048#true} is VALID [2022-04-15 10:54:59,971 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {7048#true} {7233#(and (= (+ main_~c~0 (- 5)) 1) (= (+ main_~y~0 (- 3)) 3))} #57#return; {7233#(and (= (+ main_~c~0 (- 5)) 1) (= (+ main_~y~0 (- 3)) 3))} is VALID [2022-04-15 10:54:59,971 INFO L290 TraceCheckUtils]: 65: Hoare triple {7233#(and (= (+ main_~c~0 (- 5)) 1) (= (+ main_~y~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; {7255#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} is VALID [2022-04-15 10:54:59,971 INFO L290 TraceCheckUtils]: 66: Hoare triple {7255#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} assume !false; {7255#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} is VALID [2022-04-15 10:54:59,971 INFO L272 TraceCheckUtils]: 67: Hoare triple {7255#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 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)); {7048#true} is VALID [2022-04-15 10:54:59,971 INFO L290 TraceCheckUtils]: 68: Hoare triple {7048#true} ~cond := #in~cond; {7048#true} is VALID [2022-04-15 10:54:59,972 INFO L290 TraceCheckUtils]: 69: Hoare triple {7048#true} assume !(0 == ~cond); {7048#true} is VALID [2022-04-15 10:54:59,972 INFO L290 TraceCheckUtils]: 70: Hoare triple {7048#true} assume true; {7048#true} is VALID [2022-04-15 10:54:59,972 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {7048#true} {7255#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} #57#return; {7255#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} is VALID [2022-04-15 10:54:59,972 INFO L290 TraceCheckUtils]: 72: Hoare triple {7255#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 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; {7277#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-15 10:54:59,973 INFO L290 TraceCheckUtils]: 73: Hoare triple {7277#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} assume !false; {7277#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-15 10:54:59,973 INFO L272 TraceCheckUtils]: 74: Hoare triple {7277#(and (= main_~y~0 8) (= 7 (+ (- 1) 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)); {7048#true} is VALID [2022-04-15 10:54:59,973 INFO L290 TraceCheckUtils]: 75: Hoare triple {7048#true} ~cond := #in~cond; {7048#true} is VALID [2022-04-15 10:54:59,973 INFO L290 TraceCheckUtils]: 76: Hoare triple {7048#true} assume !(0 == ~cond); {7048#true} is VALID [2022-04-15 10:54:59,973 INFO L290 TraceCheckUtils]: 77: Hoare triple {7048#true} assume true; {7048#true} is VALID [2022-04-15 10:54:59,973 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {7048#true} {7277#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} #57#return; {7277#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-15 10:54:59,974 INFO L290 TraceCheckUtils]: 79: Hoare triple {7277#(and (= main_~y~0 8) (= 7 (+ (- 1) 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; {7299#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-15 10:54:59,974 INFO L290 TraceCheckUtils]: 80: Hoare triple {7299#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} assume !false; {7299#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-15 10:54:59,974 INFO L272 TraceCheckUtils]: 81: Hoare triple {7299#(and (= main_~y~0 9) (= 7 (+ (- 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)); {7048#true} is VALID [2022-04-15 10:54:59,974 INFO L290 TraceCheckUtils]: 82: Hoare triple {7048#true} ~cond := #in~cond; {7048#true} is VALID [2022-04-15 10:54:59,974 INFO L290 TraceCheckUtils]: 83: Hoare triple {7048#true} assume !(0 == ~cond); {7048#true} is VALID [2022-04-15 10:54:59,974 INFO L290 TraceCheckUtils]: 84: Hoare triple {7048#true} assume true; {7048#true} is VALID [2022-04-15 10:54:59,975 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {7048#true} {7299#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} #57#return; {7299#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-15 10:54:59,975 INFO L290 TraceCheckUtils]: 86: Hoare triple {7299#(and (= main_~y~0 9) (= 7 (+ (- 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; {7321#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-15 10:54:59,975 INFO L290 TraceCheckUtils]: 87: Hoare triple {7321#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {7321#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-15 10:54:59,975 INFO L272 TraceCheckUtils]: 88: Hoare triple {7321#(and (= main_~y~0 10) (= main_~c~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)); {7048#true} is VALID [2022-04-15 10:54:59,975 INFO L290 TraceCheckUtils]: 89: Hoare triple {7048#true} ~cond := #in~cond; {7048#true} is VALID [2022-04-15 10:54:59,975 INFO L290 TraceCheckUtils]: 90: Hoare triple {7048#true} assume !(0 == ~cond); {7048#true} is VALID [2022-04-15 10:54:59,976 INFO L290 TraceCheckUtils]: 91: Hoare triple {7048#true} assume true; {7048#true} is VALID [2022-04-15 10:54:59,976 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {7048#true} {7321#(and (= main_~y~0 10) (= main_~c~0 10))} #57#return; {7321#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-15 10:54:59,976 INFO L290 TraceCheckUtils]: 93: Hoare triple {7321#(and (= main_~y~0 10) (= main_~c~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; {7343#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-15 10:54:59,977 INFO L290 TraceCheckUtils]: 94: Hoare triple {7343#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} assume !false; {7343#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-15 10:54:59,977 INFO L272 TraceCheckUtils]: 95: Hoare triple {7343#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) 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)); {7048#true} is VALID [2022-04-15 10:54:59,977 INFO L290 TraceCheckUtils]: 96: Hoare triple {7048#true} ~cond := #in~cond; {7048#true} is VALID [2022-04-15 10:54:59,977 INFO L290 TraceCheckUtils]: 97: Hoare triple {7048#true} assume !(0 == ~cond); {7048#true} is VALID [2022-04-15 10:54:59,977 INFO L290 TraceCheckUtils]: 98: Hoare triple {7048#true} assume true; {7048#true} is VALID [2022-04-15 10:54:59,977 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {7048#true} {7343#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} #57#return; {7343#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-15 10:54:59,978 INFO L290 TraceCheckUtils]: 100: Hoare triple {7343#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} assume !(~c~0 < ~k~0); {7365#(and (< 10 main_~k~0) (<= main_~k~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-15 10:54:59,978 INFO L272 TraceCheckUtils]: 101: Hoare triple {7365#(and (< 10 main_~k~0) (<= main_~k~0 11) (= (+ (- 1) 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)); {7048#true} is VALID [2022-04-15 10:54:59,978 INFO L290 TraceCheckUtils]: 102: Hoare triple {7048#true} ~cond := #in~cond; {7048#true} is VALID [2022-04-15 10:54:59,978 INFO L290 TraceCheckUtils]: 103: Hoare triple {7048#true} assume !(0 == ~cond); {7048#true} is VALID [2022-04-15 10:54:59,978 INFO L290 TraceCheckUtils]: 104: Hoare triple {7048#true} assume true; {7048#true} is VALID [2022-04-15 10:54:59,979 INFO L284 TraceCheckUtils]: 105: Hoare quadruple {7048#true} {7365#(and (< 10 main_~k~0) (<= main_~k~0 11) (= (+ (- 1) main_~y~0) 10))} #59#return; {7365#(and (< 10 main_~k~0) (<= main_~k~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-15 10:54:59,979 INFO L272 TraceCheckUtils]: 106: Hoare triple {7365#(and (< 10 main_~k~0) (<= main_~k~0 11) (= (+ (- 1) main_~y~0) 10))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {7384#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:54:59,979 INFO L290 TraceCheckUtils]: 107: Hoare triple {7384#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7388#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:54:59,980 INFO L290 TraceCheckUtils]: 108: Hoare triple {7388#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7049#false} is VALID [2022-04-15 10:54:59,980 INFO L290 TraceCheckUtils]: 109: Hoare triple {7049#false} assume !false; {7049#false} is VALID [2022-04-15 10:54:59,980 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 26 proven. 198 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2022-04-15 10:54:59,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:55:00,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:55:00,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779498917] [2022-04-15 10:55:00,230 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:55:00,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109949382] [2022-04-15 10:55:00,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109949382] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 10:55:00,230 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 10:55:00,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2022-04-15 10:55:00,230 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:55:00,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [344048900] [2022-04-15 10:55:00,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [344048900] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:55:00,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:55:00,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 10:55:00,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997350011] [2022-04-15 10:55:00,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:55:00,231 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) Word has length 110 [2022-04-15 10:55:00,231 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:55:00,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2022-04-15 10:55:00,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:55:00,277 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 10:55:00,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:55:00,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 10:55:00,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-04-15 10:55:00,278 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2022-04-15 10:55:01,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:55:01,558 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2022-04-15 10:55:01,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 10:55:01,558 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) Word has length 110 [2022-04-15 10:55:01,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:55:01,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2022-04-15 10:55:01,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 82 transitions. [2022-04-15 10:55:01,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2022-04-15 10:55:01,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 82 transitions. [2022-04-15 10:55:01,561 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 82 transitions. [2022-04-15 10:55:01,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:55:01,633 INFO L225 Difference]: With dead ends: 72 [2022-04-15 10:55:01,633 INFO L226 Difference]: Without dead ends: 66 [2022-04-15 10:55:01,634 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2022-04-15 10:55:01,635 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 2 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 10:55:01,635 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 535 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 10:55:01,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-15 10:55:01,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-04-15 10:55:01,698 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:55:01,713 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 66 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 10:55:01,714 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 66 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 10:55:01,714 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 66 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 10:55:01,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:55:01,715 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2022-04-15 10:55:01,715 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2022-04-15 10:55:01,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:55:01,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:55:01,716 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 66 states. [2022-04-15 10:55:01,716 INFO L87 Difference]: Start difference. First operand has 66 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 66 states. [2022-04-15 10:55:01,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:55:01,717 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2022-04-15 10:55:01,717 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2022-04-15 10:55:01,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:55:01,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:55:01,718 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:55:01,718 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:55:01,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 10:55:01,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 79 transitions. [2022-04-15 10:55:01,719 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 79 transitions. Word has length 110 [2022-04-15 10:55:01,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:55:01,719 INFO L478 AbstractCegarLoop]: Abstraction has 66 states and 79 transitions. [2022-04-15 10:55:01,720 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2022-04-15 10:55:01,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 79 transitions. [2022-04-15 10:55:03,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 78 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 10:55:03,967 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2022-04-15 10:55:03,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-04-15 10:55:03,968 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:55:03,968 INFO L499 BasicCegarLoop]: trace histogram [15, 14, 14, 13, 13, 13, 12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:55:03,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-04-15 10:55:04,168 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-15 10:55:04,169 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:55:04,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:55:04,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1600671149, now seen corresponding path program 23 times [2022-04-15 10:55:04,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:55:04,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [908417291] [2022-04-15 10:55:04,169 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:55:04,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1600671149, now seen corresponding path program 24 times [2022-04-15 10:55:04,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:55:04,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858785858] [2022-04-15 10:55:04,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:55:04,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:55:04,181 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:55:04,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1945781093] [2022-04-15 10:55:04,182 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 10:55:04,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:55:04,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:55:04,183 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 10:55:04,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process