/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_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 07:45:59,664 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 07:45:59,665 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 07:45:59,686 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 07:45:59,686 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 07:45:59,687 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 07:45:59,687 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 07:45:59,689 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 07:45:59,690 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 07:45:59,690 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 07:45:59,691 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 07:45:59,692 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 07:45:59,692 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 07:45:59,692 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 07:45:59,693 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 07:45:59,694 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 07:45:59,694 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 07:45:59,697 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 07:45:59,702 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 07:45:59,707 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 07:45:59,709 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 07:45:59,711 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 07:45:59,712 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 07:45:59,715 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 07:45:59,716 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 07:45:59,718 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 07:45:59,718 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 07:45:59,718 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 07:45:59,719 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 07:45:59,719 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 07:45:59,719 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 07:45:59,720 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 07:45:59,720 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 07:45:59,720 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 07:45:59,721 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 07:45:59,721 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 07:45:59,721 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 07:45:59,722 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 07:45:59,722 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 07:45:59,722 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 07:45:59,723 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 07:45:59,726 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 07:45:59,727 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 07:45:59,737 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 07:45:59,737 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 07:45:59,738 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 07:45:59,738 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 07:45:59,738 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 07:45:59,738 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 07:45:59,738 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 07:45:59,738 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 07:45:59,738 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 07:45:59,739 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 07:45:59,739 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 07:45:59,739 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 07:45:59,739 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 07:45:59,739 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 07:45:59,739 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 07:45:59,739 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 07:45:59,739 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 07:45:59,739 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 07:45:59,739 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 07:45:59,739 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 07:45:59,739 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 07:45:59,740 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 07:45:59,740 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 07:45:59,740 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 07:45:59,740 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 07:45:59,740 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 07:45:59,895 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 07:45:59,921 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 07:45:59,923 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 07:45:59,923 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 07:45:59,924 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 07:45:59,924 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_unwindbound10.c [2022-04-08 07:45:59,969 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/389dcb3d3/c71ef44bade048e78fac42a7d43a7164/FLAG8d52ba74b [2022-04-08 07:46:00,286 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 07:46:00,287 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_unwindbound10.c [2022-04-08 07:46:00,290 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/389dcb3d3/c71ef44bade048e78fac42a7d43a7164/FLAG8d52ba74b [2022-04-08 07:46:00,711 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/389dcb3d3/c71ef44bade048e78fac42a7d43a7164 [2022-04-08 07:46:00,726 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 07:46:00,727 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 07:46:00,728 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 07:46:00,728 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 07:46:00,730 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 07:46:00,732 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 07:46:00" (1/1) ... [2022-04-08 07:46:00,733 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a158dfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:46:00, skipping insertion in model container [2022-04-08 07:46:00,733 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 07:46:00" (1/1) ... [2022-04-08 07:46:00,738 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 07:46:00,749 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 07:46:00,872 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_unwindbound10.c[458,471] [2022-04-08 07:46:00,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 07:46:00,930 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 07:46:00,937 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_unwindbound10.c[458,471] [2022-04-08 07:46:00,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 07:46:00,949 INFO L208 MainTranslator]: Completed translation [2022-04-08 07:46:00,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:46:00 WrapperNode [2022-04-08 07:46:00,949 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 07:46:00,950 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 07:46:00,950 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 07:46:00,950 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 07:46:00,958 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:46:00" (1/1) ... [2022-04-08 07:46:00,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:46:00" (1/1) ... [2022-04-08 07:46:00,964 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:46:00" (1/1) ... [2022-04-08 07:46:00,964 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:46:00" (1/1) ... [2022-04-08 07:46:00,971 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:46:00" (1/1) ... [2022-04-08 07:46:00,974 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:46:00" (1/1) ... [2022-04-08 07:46:00,975 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:46:00" (1/1) ... [2022-04-08 07:46:00,980 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 07:46:00,984 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 07:46:00,985 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 07:46:00,985 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 07:46:00,985 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:46:00" (1/1) ... [2022-04-08 07:46:00,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 07:46:01,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:46:01,015 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 07:46:01,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 07:46:01,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 07:46:01,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 07:46:01,046 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 07:46:01,046 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 07:46:01,046 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 07:46:01,046 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 07:46:01,046 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 07:46:01,046 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 07:46:01,047 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 07:46:01,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 07:46:01,047 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-08 07:46:01,048 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 07:46:01,048 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 07:46:01,048 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 07:46:01,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 07:46:01,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 07:46:01,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 07:46:01,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 07:46:01,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 07:46:01,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 07:46:01,094 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 07:46:01,095 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 07:46:01,214 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 07:46:01,218 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 07:46:01,218 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 07:46:01,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 07:46:01 BoogieIcfgContainer [2022-04-08 07:46:01,224 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 07:46:01,225 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 07:46:01,225 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 07:46:01,241 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 07:46:01,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 07:46:00" (1/3) ... [2022-04-08 07:46:01,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18184347 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 07:46:01, skipping insertion in model container [2022-04-08 07:46:01,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:46:00" (2/3) ... [2022-04-08 07:46:01,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18184347 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 07:46:01, skipping insertion in model container [2022-04-08 07:46:01,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 07:46:01" (3/3) ... [2022-04-08 07:46:01,243 INFO L111 eAbstractionObserver]: Analyzing ICFG ps5-ll_unwindbound10.c [2022-04-08 07:46:01,247 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 07:46:01,247 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 07:46:01,273 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 07:46:01,277 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 07:46:01,278 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 07:46:01,288 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:46:01,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 07:46:01,293 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:46:01,293 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:46:01,293 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:46:01,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:46:01,296 INFO L85 PathProgramCache]: Analyzing trace with hash 21872251, now seen corresponding path program 1 times [2022-04-08 07:46:01,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:46:01,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [731980957] [2022-04-08 07:46:01,308 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:46:01,308 INFO L85 PathProgramCache]: Analyzing trace with hash 21872251, now seen corresponding path program 2 times [2022-04-08 07:46:01,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:46:01,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215814551] [2022-04-08 07:46:01,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:46:01,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:46:01,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:46:01,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 07:46:01,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:46:01,421 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {32#true} is VALID [2022-04-08 07:46:01,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-08 07:46:01,422 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID [2022-04-08 07:46:01,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 07:46:01,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:46:01,438 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-08 07:46:01,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-08 07:46:01,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-08 07:46:01,439 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-08 07:46:01,444 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {41#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 07:46:01,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {32#true} is VALID [2022-04-08 07:46:01,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-08 07:46:01,445 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID [2022-04-08 07:46:01,445 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret6 := main(); {32#true} is VALID [2022-04-08 07:46:01,445 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {32#true} is VALID [2022-04-08 07:46:01,445 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {32#true} is VALID [2022-04-08 07:46:01,446 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-08 07:46:01,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-08 07:46:01,446 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-08 07:46:01,446 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-08 07:46:01,447 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {33#false} is VALID [2022-04-08 07:46:01,447 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#false} assume !true; {33#false} is VALID [2022-04-08 07:46:01,447 INFO L272 TraceCheckUtils]: 13: Hoare triple {33#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {33#false} is VALID [2022-04-08 07:46:01,447 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-08 07:46:01,447 INFO L290 TraceCheckUtils]: 15: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-08 07:46:01,447 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-08 07:46:01,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 07:46:01,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:46:01,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215814551] [2022-04-08 07:46:01,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215814551] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:46:01,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:46:01,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 07:46:01,451 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:46:01,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [731980957] [2022-04-08 07:46:01,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [731980957] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:46:01,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:46:01,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 07:46:01,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770329455] [2022-04-08 07:46:01,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:46:01,455 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-08 07:46:01,456 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:46:01,458 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 07:46:01,486 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:46:01,486 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 07:46:01,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:46:01,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 07:46:01,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 07:46:01,512 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 07:46:01,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:46:01,646 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2022-04-08 07:46:01,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 07:46:01,647 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-08 07:46:01,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:46:01,648 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 07:46:01,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-04-08 07:46:01,660 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 07:46:01,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-04-08 07:46:01,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 65 transitions. [2022-04-08 07:46:01,736 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:46:01,745 INFO L225 Difference]: With dead ends: 50 [2022-04-08 07:46:01,745 INFO L226 Difference]: Without dead ends: 25 [2022-04-08 07:46:01,747 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 07:46:01,752 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:46:01,753 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 34 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 07:46:01,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-08 07:46:01,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-04-08 07:46:01,782 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:46:01,783 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:46:01,783 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:46:01,784 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:46:01,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:46:01,793 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-08 07:46:01,794 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-08 07:46:01,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:46:01,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:46:01,795 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 25 states. [2022-04-08 07:46:01,796 INFO L87 Difference]: Start difference. First operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 25 states. [2022-04-08 07:46:01,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:46:01,798 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-08 07:46:01,799 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-08 07:46:01,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:46:01,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:46:01,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:46:01,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:46:01,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:46:01,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-08 07:46:01,802 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 17 [2022-04-08 07:46:01,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:46:01,802 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-08 07:46:01,802 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 07:46:01,802 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 27 transitions. [2022-04-08 07:46:01,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:46:01,827 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-08 07:46:01,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 07:46:01,828 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:46:01,828 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:46:01,828 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 07:46:01,828 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:46:01,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:46:01,829 INFO L85 PathProgramCache]: Analyzing trace with hash -119968982, now seen corresponding path program 1 times [2022-04-08 07:46:01,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:46:01,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1961309993] [2022-04-08 07:46:01,834 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:46:01,834 INFO L85 PathProgramCache]: Analyzing trace with hash -119968982, now seen corresponding path program 2 times [2022-04-08 07:46:01,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:46:01,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276647789] [2022-04-08 07:46:01,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:46:01,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:46:01,854 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:46:01,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [473851023] [2022-04-08 07:46:01,855 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:46:01,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:46:01,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:46:01,856 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:46:01,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 07:46:01,892 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 07:46:01,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:46:01,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 07:46:01,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:46:01,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:46:02,036 INFO L272 TraceCheckUtils]: 0: Hoare triple {242#true} call ULTIMATE.init(); {242#true} is VALID [2022-04-08 07:46:02,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {242#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {250#(<= ~counter~0 0)} is VALID [2022-04-08 07:46:02,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {250#(<= ~counter~0 0)} assume true; {250#(<= ~counter~0 0)} is VALID [2022-04-08 07:46:02,037 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {250#(<= ~counter~0 0)} {242#true} #61#return; {250#(<= ~counter~0 0)} is VALID [2022-04-08 07:46:02,038 INFO L272 TraceCheckUtils]: 4: Hoare triple {250#(<= ~counter~0 0)} call #t~ret6 := main(); {250#(<= ~counter~0 0)} is VALID [2022-04-08 07:46:02,038 INFO L290 TraceCheckUtils]: 5: Hoare triple {250#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {250#(<= ~counter~0 0)} is VALID [2022-04-08 07:46:02,039 INFO L272 TraceCheckUtils]: 6: Hoare triple {250#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {250#(<= ~counter~0 0)} is VALID [2022-04-08 07:46:02,039 INFO L290 TraceCheckUtils]: 7: Hoare triple {250#(<= ~counter~0 0)} ~cond := #in~cond; {250#(<= ~counter~0 0)} is VALID [2022-04-08 07:46:02,039 INFO L290 TraceCheckUtils]: 8: Hoare triple {250#(<= ~counter~0 0)} assume !(0 == ~cond); {250#(<= ~counter~0 0)} is VALID [2022-04-08 07:46:02,040 INFO L290 TraceCheckUtils]: 9: Hoare triple {250#(<= ~counter~0 0)} assume true; {250#(<= ~counter~0 0)} is VALID [2022-04-08 07:46:02,040 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {250#(<= ~counter~0 0)} {250#(<= ~counter~0 0)} #53#return; {250#(<= ~counter~0 0)} is VALID [2022-04-08 07:46:02,041 INFO L290 TraceCheckUtils]: 11: Hoare triple {250#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {250#(<= ~counter~0 0)} is VALID [2022-04-08 07:46:02,041 INFO L290 TraceCheckUtils]: 12: Hoare triple {250#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {284#(<= |main_#t~post5| 0)} is VALID [2022-04-08 07:46:02,042 INFO L290 TraceCheckUtils]: 13: Hoare triple {284#(<= |main_#t~post5| 0)} assume !(#t~post5 < 10);havoc #t~post5; {243#false} is VALID [2022-04-08 07:46:02,042 INFO L272 TraceCheckUtils]: 14: Hoare triple {243#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)); {243#false} is VALID [2022-04-08 07:46:02,042 INFO L290 TraceCheckUtils]: 15: Hoare triple {243#false} ~cond := #in~cond; {243#false} is VALID [2022-04-08 07:46:02,042 INFO L290 TraceCheckUtils]: 16: Hoare triple {243#false} assume 0 == ~cond; {243#false} is VALID [2022-04-08 07:46:02,042 INFO L290 TraceCheckUtils]: 17: Hoare triple {243#false} assume !false; {243#false} is VALID [2022-04-08 07:46:02,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 07:46:02,043 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 07:46:02,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:46:02,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276647789] [2022-04-08 07:46:02,043 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:46:02,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473851023] [2022-04-08 07:46:02,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473851023] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:46:02,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:46:02,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 07:46:02,044 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:46:02,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1961309993] [2022-04-08 07:46:02,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1961309993] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:46:02,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:46:02,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 07:46:02,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376269372] [2022-04-08 07:46:02,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:46:02,046 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-08 07:46:02,046 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:46:02,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 07:46:02,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:46:02,059 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 07:46:02,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:46:02,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 07:46:02,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 07:46:02,060 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 07:46:02,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:46:02,104 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-08 07:46:02,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 07:46:02,104 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-08 07:46:02,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:46:02,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 07:46:02,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-08 07:46:02,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 07:46:02,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-08 07:46:02,108 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-08 07:46:02,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:46:02,134 INFO L225 Difference]: With dead ends: 34 [2022-04-08 07:46:02,135 INFO L226 Difference]: Without dead ends: 26 [2022-04-08 07:46:02,135 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 07:46:02,136 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:46:02,136 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 07:46:02,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-08 07:46:02,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-08 07:46:02,145 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:46:02,146 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:46:02,146 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:46:02,146 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:46:02,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:46:02,148 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-08 07:46:02,148 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-08 07:46:02,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:46:02,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:46:02,148 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-08 07:46:02,149 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-08 07:46:02,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:46:02,150 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-08 07:46:02,150 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-08 07:46:02,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:46:02,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:46:02,151 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:46:02,151 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:46:02,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:46:02,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-04-08 07:46:02,152 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 18 [2022-04-08 07:46:02,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:46:02,152 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-04-08 07:46:02,153 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 07:46:02,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 29 transitions. [2022-04-08 07:46:02,176 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:46:02,176 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-08 07:46:02,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 07:46:02,176 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:46:02,176 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:46:02,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 07:46:02,395 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:46:02,395 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:46:02,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:46:02,396 INFO L85 PathProgramCache]: Analyzing trace with hash -118181522, now seen corresponding path program 1 times [2022-04-08 07:46:02,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:46:02,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2080534641] [2022-04-08 07:46:02,397 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:46:02,397 INFO L85 PathProgramCache]: Analyzing trace with hash -118181522, now seen corresponding path program 2 times [2022-04-08 07:46:02,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:46:02,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160785674] [2022-04-08 07:46:02,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:46:02,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:46:02,411 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:46:02,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [353949005] [2022-04-08 07:46:02,411 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:46:02,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:46:02,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:46:02,417 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:46:02,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 07:46:02,461 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 07:46:02,461 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:46:02,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 07:46:02,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:46:02,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:46:02,572 INFO L272 TraceCheckUtils]: 0: Hoare triple {471#true} call ULTIMATE.init(); {471#true} is VALID [2022-04-08 07:46:02,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {471#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {471#true} is VALID [2022-04-08 07:46:02,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {471#true} assume true; {471#true} is VALID [2022-04-08 07:46:02,572 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {471#true} {471#true} #61#return; {471#true} is VALID [2022-04-08 07:46:02,572 INFO L272 TraceCheckUtils]: 4: Hoare triple {471#true} call #t~ret6 := main(); {471#true} is VALID [2022-04-08 07:46:02,573 INFO L290 TraceCheckUtils]: 5: Hoare triple {471#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; {471#true} is VALID [2022-04-08 07:46:02,573 INFO L272 TraceCheckUtils]: 6: Hoare triple {471#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {471#true} is VALID [2022-04-08 07:46:02,573 INFO L290 TraceCheckUtils]: 7: Hoare triple {471#true} ~cond := #in~cond; {471#true} is VALID [2022-04-08 07:46:02,573 INFO L290 TraceCheckUtils]: 8: Hoare triple {471#true} assume !(0 == ~cond); {471#true} is VALID [2022-04-08 07:46:02,573 INFO L290 TraceCheckUtils]: 9: Hoare triple {471#true} assume true; {471#true} is VALID [2022-04-08 07:46:02,573 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {471#true} {471#true} #53#return; {471#true} is VALID [2022-04-08 07:46:02,574 INFO L290 TraceCheckUtils]: 11: Hoare triple {471#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {509#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:46:02,574 INFO L290 TraceCheckUtils]: 12: Hoare triple {509#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {509#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:46:02,575 INFO L290 TraceCheckUtils]: 13: Hoare triple {509#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {509#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:46:02,576 INFO L272 TraceCheckUtils]: 14: Hoare triple {509#(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)); {519#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:46:02,576 INFO L290 TraceCheckUtils]: 15: Hoare triple {519#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {523#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:46:02,576 INFO L290 TraceCheckUtils]: 16: Hoare triple {523#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {472#false} is VALID [2022-04-08 07:46:02,577 INFO L290 TraceCheckUtils]: 17: Hoare triple {472#false} assume !false; {472#false} is VALID [2022-04-08 07:46:02,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 07:46:02,577 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 07:46:02,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:46:02,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160785674] [2022-04-08 07:46:02,577 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:46:02,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353949005] [2022-04-08 07:46:02,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353949005] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:46:02,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:46:02,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 07:46:02,578 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:46:02,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2080534641] [2022-04-08 07:46:02,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2080534641] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:46:02,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:46:02,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 07:46:02,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706209921] [2022-04-08 07:46:02,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:46:02,579 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-08 07:46:02,579 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:46:02,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 07:46:02,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:46:02,591 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 07:46:02,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:46:02,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 07:46:02,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 07:46:02,592 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 07:46:02,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:46:02,711 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-08 07:46:02,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 07:46:02,712 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-08 07:46:02,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:46:02,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 07:46:02,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-08 07:46:02,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 07:46:02,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-08 07:46:02,717 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-08 07:46:02,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:46:02,746 INFO L225 Difference]: With dead ends: 36 [2022-04-08 07:46:02,746 INFO L226 Difference]: Without dead ends: 32 [2022-04-08 07:46:02,747 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 07:46:02,748 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:46:02,748 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 87 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 07:46:02,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-08 07:46:02,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-08 07:46:02,760 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:46:02,761 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:46:02,761 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:46:02,761 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:46:02,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:46:02,762 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-08 07:46:02,763 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-08 07:46:02,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:46:02,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:46:02,763 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 32 states. [2022-04-08 07:46:02,763 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 32 states. [2022-04-08 07:46:02,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:46:02,765 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-08 07:46:02,765 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-08 07:46:02,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:46:02,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:46:02,766 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:46:02,766 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:46:02,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:46:02,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-04-08 07:46:02,767 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 18 [2022-04-08 07:46:02,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:46:02,767 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-04-08 07:46:02,768 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 07:46:02,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 35 transitions. [2022-04-08 07:46:02,795 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:46:02,795 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-08 07:46:02,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 07:46:02,796 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:46:02,796 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:46:02,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 07:46:03,011 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-08 07:46:03,012 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:46:03,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:46:03,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1364840471, now seen corresponding path program 1 times [2022-04-08 07:46:03,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:46:03,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1652229470] [2022-04-08 07:46:03,137 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:46:03,137 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:46:03,137 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:46:03,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1364840471, now seen corresponding path program 2 times [2022-04-08 07:46:03,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:46:03,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358978606] [2022-04-08 07:46:03,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:46:03,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:46:03,147 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:46:03,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [505512476] [2022-04-08 07:46:03,148 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:46:03,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:46:03,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:46:03,149 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:46:03,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 07:46:03,243 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:46:03,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:46:03,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 07:46:03,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:46:03,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:46:03,380 INFO L272 TraceCheckUtils]: 0: Hoare triple {731#true} call ULTIMATE.init(); {731#true} is VALID [2022-04-08 07:46:03,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {731#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {739#(<= ~counter~0 0)} is VALID [2022-04-08 07:46:03,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {739#(<= ~counter~0 0)} assume true; {739#(<= ~counter~0 0)} is VALID [2022-04-08 07:46:03,381 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {739#(<= ~counter~0 0)} {731#true} #61#return; {739#(<= ~counter~0 0)} is VALID [2022-04-08 07:46:03,382 INFO L272 TraceCheckUtils]: 4: Hoare triple {739#(<= ~counter~0 0)} call #t~ret6 := main(); {739#(<= ~counter~0 0)} is VALID [2022-04-08 07:46:03,382 INFO L290 TraceCheckUtils]: 5: Hoare triple {739#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {739#(<= ~counter~0 0)} is VALID [2022-04-08 07:46:03,383 INFO L272 TraceCheckUtils]: 6: Hoare triple {739#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {739#(<= ~counter~0 0)} is VALID [2022-04-08 07:46:03,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {739#(<= ~counter~0 0)} ~cond := #in~cond; {739#(<= ~counter~0 0)} is VALID [2022-04-08 07:46:03,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {739#(<= ~counter~0 0)} assume !(0 == ~cond); {739#(<= ~counter~0 0)} is VALID [2022-04-08 07:46:03,384 INFO L290 TraceCheckUtils]: 9: Hoare triple {739#(<= ~counter~0 0)} assume true; {739#(<= ~counter~0 0)} is VALID [2022-04-08 07:46:03,384 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {739#(<= ~counter~0 0)} {739#(<= ~counter~0 0)} #53#return; {739#(<= ~counter~0 0)} is VALID [2022-04-08 07:46:03,384 INFO L290 TraceCheckUtils]: 11: Hoare triple {739#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {739#(<= ~counter~0 0)} is VALID [2022-04-08 07:46:03,385 INFO L290 TraceCheckUtils]: 12: Hoare triple {739#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {773#(<= ~counter~0 1)} is VALID [2022-04-08 07:46:03,385 INFO L290 TraceCheckUtils]: 13: Hoare triple {773#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {773#(<= ~counter~0 1)} is VALID [2022-04-08 07:46:03,386 INFO L272 TraceCheckUtils]: 14: Hoare triple {773#(<= ~counter~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)); {773#(<= ~counter~0 1)} is VALID [2022-04-08 07:46:03,386 INFO L290 TraceCheckUtils]: 15: Hoare triple {773#(<= ~counter~0 1)} ~cond := #in~cond; {773#(<= ~counter~0 1)} is VALID [2022-04-08 07:46:03,387 INFO L290 TraceCheckUtils]: 16: Hoare triple {773#(<= ~counter~0 1)} assume !(0 == ~cond); {773#(<= ~counter~0 1)} is VALID [2022-04-08 07:46:03,387 INFO L290 TraceCheckUtils]: 17: Hoare triple {773#(<= ~counter~0 1)} assume true; {773#(<= ~counter~0 1)} is VALID [2022-04-08 07:46:03,387 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {773#(<= ~counter~0 1)} {773#(<= ~counter~0 1)} #55#return; {773#(<= ~counter~0 1)} is VALID [2022-04-08 07:46:03,388 INFO L290 TraceCheckUtils]: 19: Hoare triple {773#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {773#(<= ~counter~0 1)} is VALID [2022-04-08 07:46:03,388 INFO L290 TraceCheckUtils]: 20: Hoare triple {773#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {798#(<= |main_#t~post5| 1)} is VALID [2022-04-08 07:46:03,389 INFO L290 TraceCheckUtils]: 21: Hoare triple {798#(<= |main_#t~post5| 1)} assume !(#t~post5 < 10);havoc #t~post5; {732#false} is VALID [2022-04-08 07:46:03,389 INFO L272 TraceCheckUtils]: 22: Hoare triple {732#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)); {732#false} is VALID [2022-04-08 07:46:03,389 INFO L290 TraceCheckUtils]: 23: Hoare triple {732#false} ~cond := #in~cond; {732#false} is VALID [2022-04-08 07:46:03,389 INFO L290 TraceCheckUtils]: 24: Hoare triple {732#false} assume 0 == ~cond; {732#false} is VALID [2022-04-08 07:46:03,389 INFO L290 TraceCheckUtils]: 25: Hoare triple {732#false} assume !false; {732#false} is VALID [2022-04-08 07:46:03,389 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 07:46:03,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:46:03,508 INFO L290 TraceCheckUtils]: 25: Hoare triple {732#false} assume !false; {732#false} is VALID [2022-04-08 07:46:03,508 INFO L290 TraceCheckUtils]: 24: Hoare triple {732#false} assume 0 == ~cond; {732#false} is VALID [2022-04-08 07:46:03,508 INFO L290 TraceCheckUtils]: 23: Hoare triple {732#false} ~cond := #in~cond; {732#false} is VALID [2022-04-08 07:46:03,508 INFO L272 TraceCheckUtils]: 22: Hoare triple {732#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)); {732#false} is VALID [2022-04-08 07:46:03,509 INFO L290 TraceCheckUtils]: 21: Hoare triple {826#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {732#false} is VALID [2022-04-08 07:46:03,509 INFO L290 TraceCheckUtils]: 20: Hoare triple {830#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {826#(< |main_#t~post5| 10)} is VALID [2022-04-08 07:46:03,509 INFO L290 TraceCheckUtils]: 19: Hoare triple {830#(< ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {830#(< ~counter~0 10)} is VALID [2022-04-08 07:46:03,510 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {731#true} {830#(< ~counter~0 10)} #55#return; {830#(< ~counter~0 10)} is VALID [2022-04-08 07:46:03,510 INFO L290 TraceCheckUtils]: 17: Hoare triple {731#true} assume true; {731#true} is VALID [2022-04-08 07:46:03,510 INFO L290 TraceCheckUtils]: 16: Hoare triple {731#true} assume !(0 == ~cond); {731#true} is VALID [2022-04-08 07:46:03,510 INFO L290 TraceCheckUtils]: 15: Hoare triple {731#true} ~cond := #in~cond; {731#true} is VALID [2022-04-08 07:46:03,510 INFO L272 TraceCheckUtils]: 14: Hoare triple {830#(< ~counter~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)); {731#true} is VALID [2022-04-08 07:46:03,511 INFO L290 TraceCheckUtils]: 13: Hoare triple {830#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {830#(< ~counter~0 10)} is VALID [2022-04-08 07:46:03,511 INFO L290 TraceCheckUtils]: 12: Hoare triple {855#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {830#(< ~counter~0 10)} is VALID [2022-04-08 07:46:03,511 INFO L290 TraceCheckUtils]: 11: Hoare triple {855#(< ~counter~0 9)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {855#(< ~counter~0 9)} is VALID [2022-04-08 07:46:03,512 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {731#true} {855#(< ~counter~0 9)} #53#return; {855#(< ~counter~0 9)} is VALID [2022-04-08 07:46:03,512 INFO L290 TraceCheckUtils]: 9: Hoare triple {731#true} assume true; {731#true} is VALID [2022-04-08 07:46:03,512 INFO L290 TraceCheckUtils]: 8: Hoare triple {731#true} assume !(0 == ~cond); {731#true} is VALID [2022-04-08 07:46:03,512 INFO L290 TraceCheckUtils]: 7: Hoare triple {731#true} ~cond := #in~cond; {731#true} is VALID [2022-04-08 07:46:03,512 INFO L272 TraceCheckUtils]: 6: Hoare triple {855#(< ~counter~0 9)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {731#true} is VALID [2022-04-08 07:46:03,513 INFO L290 TraceCheckUtils]: 5: Hoare triple {855#(< ~counter~0 9)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {855#(< ~counter~0 9)} is VALID [2022-04-08 07:46:03,513 INFO L272 TraceCheckUtils]: 4: Hoare triple {855#(< ~counter~0 9)} call #t~ret6 := main(); {855#(< ~counter~0 9)} is VALID [2022-04-08 07:46:03,513 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {855#(< ~counter~0 9)} {731#true} #61#return; {855#(< ~counter~0 9)} is VALID [2022-04-08 07:46:03,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {855#(< ~counter~0 9)} assume true; {855#(< ~counter~0 9)} is VALID [2022-04-08 07:46:03,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {731#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {855#(< ~counter~0 9)} is VALID [2022-04-08 07:46:03,514 INFO L272 TraceCheckUtils]: 0: Hoare triple {731#true} call ULTIMATE.init(); {731#true} is VALID [2022-04-08 07:46:03,515 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 07:46:03,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:46:03,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358978606] [2022-04-08 07:46:03,515 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:46:03,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505512476] [2022-04-08 07:46:03,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505512476] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 07:46:03,515 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 07:46:03,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-08 07:46:03,515 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:46:03,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1652229470] [2022-04-08 07:46:03,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1652229470] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:46:03,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:46:03,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 07:46:03,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841591309] [2022-04-08 07:46:03,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:46:03,516 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2022-04-08 07:46:03,516 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:46:03,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 07:46:03,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:46:03,532 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 07:46:03,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:46:03,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 07:46:03,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-08 07:46:03,533 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 07:46:03,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:46:03,602 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-08 07:46:03,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 07:46:03,603 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2022-04-08 07:46:03,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:46:03,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 07:46:03,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-04-08 07:46:03,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 07:46:03,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-04-08 07:46:03,605 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 46 transitions. [2022-04-08 07:46:03,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:46:03,633 INFO L225 Difference]: With dead ends: 42 [2022-04-08 07:46:03,633 INFO L226 Difference]: Without dead ends: 34 [2022-04-08 07:46:03,634 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-08 07:46:03,634 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:46:03,634 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 78 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 07:46:03,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-08 07:46:03,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-08 07:46:03,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:46:03,649 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:46:03,649 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:46:03,649 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:46:03,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:46:03,651 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-08 07:46:03,651 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-08 07:46:03,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:46:03,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:46:03,651 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 34 states. [2022-04-08 07:46:03,652 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 34 states. [2022-04-08 07:46:03,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:46:03,653 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-08 07:46:03,653 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-08 07:46:03,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:46:03,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:46:03,653 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:46:03,653 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:46:03,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:46:03,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-04-08 07:46:03,654 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 26 [2022-04-08 07:46:03,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:46:03,655 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-04-08 07:46:03,655 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 07:46:03,655 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 37 transitions. [2022-04-08 07:46:03,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:46:03,681 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-08 07:46:03,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 07:46:03,682 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:46:03,682 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:46:03,698 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-08 07:46:03,898 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:46:03,898 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:46:03,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:46:03,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1363053011, now seen corresponding path program 1 times [2022-04-08 07:46:03,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:46:03,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [76106093] [2022-04-08 07:46:04,039 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:46:04,039 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:46:04,039 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:46:04,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1363053011, now seen corresponding path program 2 times [2022-04-08 07:46:04,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:46:04,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046562302] [2022-04-08 07:46:04,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:46:04,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:46:04,057 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:46:04,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1915657396] [2022-04-08 07:46:04,057 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:46:04,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:46:04,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:46:04,058 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:46:04,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-08 07:46:04,104 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:46:04,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:46:04,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 07:46:04,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:46:04,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:46:04,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1116#true} is VALID [2022-04-08 07:46:04,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {1116#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1116#true} is VALID [2022-04-08 07:46:04,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-08 07:46:04,256 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1116#true} {1116#true} #61#return; {1116#true} is VALID [2022-04-08 07:46:04,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {1116#true} call #t~ret6 := main(); {1116#true} is VALID [2022-04-08 07:46:04,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {1116#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; {1116#true} is VALID [2022-04-08 07:46:04,257 INFO L272 TraceCheckUtils]: 6: Hoare triple {1116#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1116#true} is VALID [2022-04-08 07:46:04,257 INFO L290 TraceCheckUtils]: 7: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-08 07:46:04,257 INFO L290 TraceCheckUtils]: 8: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-08 07:46:04,257 INFO L290 TraceCheckUtils]: 9: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-08 07:46:04,257 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1116#true} {1116#true} #53#return; {1116#true} is VALID [2022-04-08 07:46:04,258 INFO L290 TraceCheckUtils]: 11: Hoare triple {1116#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1154#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:46:04,258 INFO L290 TraceCheckUtils]: 12: Hoare triple {1154#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1154#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:46:04,259 INFO L290 TraceCheckUtils]: 13: Hoare triple {1154#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {1154#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:46:04,259 INFO L272 TraceCheckUtils]: 14: Hoare triple {1154#(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)); {1116#true} is VALID [2022-04-08 07:46:04,259 INFO L290 TraceCheckUtils]: 15: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-08 07:46:04,259 INFO L290 TraceCheckUtils]: 16: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-08 07:46:04,259 INFO L290 TraceCheckUtils]: 17: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-08 07:46:04,260 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1116#true} {1154#(and (= main_~x~0 0) (= main_~y~0 0))} #55#return; {1154#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:46:04,260 INFO L290 TraceCheckUtils]: 19: Hoare triple {1154#(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; {1179#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-08 07:46:04,261 INFO L290 TraceCheckUtils]: 20: Hoare triple {1179#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1179#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-08 07:46:04,261 INFO L290 TraceCheckUtils]: 21: Hoare triple {1179#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} assume !!(#t~post5 < 10);havoc #t~post5; {1179#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-08 07:46:04,262 INFO L272 TraceCheckUtils]: 22: Hoare triple {1179#(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)); {1189#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:46:04,262 INFO L290 TraceCheckUtils]: 23: Hoare triple {1189#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1193#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:46:04,263 INFO L290 TraceCheckUtils]: 24: Hoare triple {1193#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1117#false} is VALID [2022-04-08 07:46:04,263 INFO L290 TraceCheckUtils]: 25: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2022-04-08 07:46:04,263 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 07:46:04,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:46:04,379 INFO L290 TraceCheckUtils]: 25: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2022-04-08 07:46:04,379 INFO L290 TraceCheckUtils]: 24: Hoare triple {1193#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1117#false} is VALID [2022-04-08 07:46:04,380 INFO L290 TraceCheckUtils]: 23: Hoare triple {1189#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1193#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:46:04,381 INFO L272 TraceCheckUtils]: 22: Hoare triple {1209#(= (+ 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)); {1189#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:46:04,381 INFO L290 TraceCheckUtils]: 21: Hoare triple {1209#(= (+ 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 !!(#t~post5 < 10);havoc #t~post5; {1209#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-08 07:46:04,382 INFO L290 TraceCheckUtils]: 20: Hoare triple {1209#(= (+ 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)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1209#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-08 07:46:06,390 WARN L290 TraceCheckUtils]: 19: Hoare triple {1209#(= (+ 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; {1209#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is UNKNOWN [2022-04-08 07:46:06,391 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1116#true} {1209#(= (+ 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)))} #55#return; {1209#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-08 07:46:06,391 INFO L290 TraceCheckUtils]: 17: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-08 07:46:06,391 INFO L290 TraceCheckUtils]: 16: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-08 07:46:06,391 INFO L290 TraceCheckUtils]: 15: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-08 07:46:06,391 INFO L272 TraceCheckUtils]: 14: Hoare triple {1209#(= (+ 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)); {1116#true} is VALID [2022-04-08 07:46:06,392 INFO L290 TraceCheckUtils]: 13: Hoare triple {1209#(= (+ 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 !!(#t~post5 < 10);havoc #t~post5; {1209#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-08 07:46:06,392 INFO L290 TraceCheckUtils]: 12: Hoare triple {1209#(= (+ 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)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1209#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-08 07:46:06,393 INFO L290 TraceCheckUtils]: 11: Hoare triple {1116#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1209#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-08 07:46:06,393 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1116#true} {1116#true} #53#return; {1116#true} is VALID [2022-04-08 07:46:06,393 INFO L290 TraceCheckUtils]: 9: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-08 07:46:06,393 INFO L290 TraceCheckUtils]: 8: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-08 07:46:06,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-08 07:46:06,393 INFO L272 TraceCheckUtils]: 6: Hoare triple {1116#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1116#true} is VALID [2022-04-08 07:46:06,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {1116#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; {1116#true} is VALID [2022-04-08 07:46:06,394 INFO L272 TraceCheckUtils]: 4: Hoare triple {1116#true} call #t~ret6 := main(); {1116#true} is VALID [2022-04-08 07:46:06,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1116#true} {1116#true} #61#return; {1116#true} is VALID [2022-04-08 07:46:06,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-08 07:46:06,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {1116#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1116#true} is VALID [2022-04-08 07:46:06,394 INFO L272 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1116#true} is VALID [2022-04-08 07:46:06,394 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 07:46:06,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:46:06,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046562302] [2022-04-08 07:46:06,395 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:46:06,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915657396] [2022-04-08 07:46:06,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915657396] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 07:46:06,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:46:06,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-08 07:46:06,395 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:46:06,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [76106093] [2022-04-08 07:46:06,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [76106093] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:46:06,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:46:06,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 07:46:06,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57037613] [2022-04-08 07:46:06,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:46:06,396 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-08 07:46:06,396 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:46:06,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 07:46:08,446 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 23 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 07:46:08,446 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 07:46:08,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:46:08,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 07:46:08,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 07:46:08,447 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 07:46:08,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:46:08,595 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2022-04-08 07:46:08,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 07:46:08,595 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-08 07:46:08,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:46:08,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 07:46:08,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-08 07:46:08,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 07:46:08,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-08 07:46:08,597 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-08 07:46:10,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 31 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 07:46:10,716 INFO L225 Difference]: With dead ends: 40 [2022-04-08 07:46:10,716 INFO L226 Difference]: Without dead ends: 36 [2022-04-08 07:46:10,716 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-08 07:46:10,717 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:46:10,717 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 73 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 07:46:10,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-08 07:46:10,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-08 07:46:10,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:46:10,740 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:46:10,740 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:46:10,740 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:46:10,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:46:10,743 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-08 07:46:10,743 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-08 07:46:10,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:46:10,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:46:10,744 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 36 states. [2022-04-08 07:46:10,744 INFO L87 Difference]: Start difference. First operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 36 states. [2022-04-08 07:46:10,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:46:10,746 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-08 07:46:10,746 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-08 07:46:10,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:46:10,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:46:10,750 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:46:10,750 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:46:10,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:46:10,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2022-04-08 07:46:10,751 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 26 [2022-04-08 07:46:10,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:46:10,752 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2022-04-08 07:46:10,752 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 07:46:10,752 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 38 transitions. [2022-04-08 07:46:11,205 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:46:11,205 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-08 07:46:11,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 07:46:11,206 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:46:11,206 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:46:11,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-08 07:46:11,406 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:46:11,406 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:46:11,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:46:11,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1559147673, now seen corresponding path program 1 times [2022-04-08 07:46:11,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:46:11,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1668028579] [2022-04-08 07:46:11,503 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:46:11,503 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:46:11,503 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:46:11,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1559147673, now seen corresponding path program 2 times [2022-04-08 07:46:11,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:46:11,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514131995] [2022-04-08 07:46:11,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:46:11,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:46:11,525 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:46:11,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1871779804] [2022-04-08 07:46:11,526 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:46:11,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:46:11,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:46:11,538 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:46:11,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-08 07:46:11,576 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:46:11,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:46:11,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 07:46:11,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:46:11,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:46:11,836 INFO L272 TraceCheckUtils]: 0: Hoare triple {1504#true} call ULTIMATE.init(); {1504#true} is VALID [2022-04-08 07:46:11,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {1504#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1504#true} is VALID [2022-04-08 07:46:11,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-08 07:46:11,837 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1504#true} {1504#true} #61#return; {1504#true} is VALID [2022-04-08 07:46:11,837 INFO L272 TraceCheckUtils]: 4: Hoare triple {1504#true} call #t~ret6 := main(); {1504#true} is VALID [2022-04-08 07:46:11,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {1504#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; {1504#true} is VALID [2022-04-08 07:46:11,837 INFO L272 TraceCheckUtils]: 6: Hoare triple {1504#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1504#true} is VALID [2022-04-08 07:46:11,837 INFO L290 TraceCheckUtils]: 7: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-08 07:46:11,837 INFO L290 TraceCheckUtils]: 8: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-08 07:46:11,838 INFO L290 TraceCheckUtils]: 9: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-08 07:46:11,838 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1504#true} {1504#true} #53#return; {1504#true} is VALID [2022-04-08 07:46:11,838 INFO L290 TraceCheckUtils]: 11: Hoare triple {1504#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1542#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:46:11,839 INFO L290 TraceCheckUtils]: 12: Hoare triple {1542#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1542#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:46:11,839 INFO L290 TraceCheckUtils]: 13: Hoare triple {1542#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {1542#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:46:11,839 INFO L272 TraceCheckUtils]: 14: Hoare triple {1542#(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)); {1504#true} is VALID [2022-04-08 07:46:11,839 INFO L290 TraceCheckUtils]: 15: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-08 07:46:11,840 INFO L290 TraceCheckUtils]: 16: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-08 07:46:11,840 INFO L290 TraceCheckUtils]: 17: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-08 07:46:11,841 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1504#true} {1542#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {1542#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:46:11,841 INFO L290 TraceCheckUtils]: 19: Hoare triple {1542#(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; {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 07:46:11,844 INFO L290 TraceCheckUtils]: 20: Hoare triple {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 07:46:11,845 INFO L290 TraceCheckUtils]: 21: Hoare triple {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 07:46:11,845 INFO L272 TraceCheckUtils]: 22: Hoare triple {1567#(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)); {1504#true} is VALID [2022-04-08 07:46:11,845 INFO L290 TraceCheckUtils]: 23: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-08 07:46:11,845 INFO L290 TraceCheckUtils]: 24: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-08 07:46:11,845 INFO L290 TraceCheckUtils]: 25: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-08 07:46:11,846 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1504#true} {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #55#return; {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 07:46:11,846 INFO L290 TraceCheckUtils]: 27: Hoare triple {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {1592#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-08 07:46:11,847 INFO L272 TraceCheckUtils]: 28: Hoare triple {1592#(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)); {1504#true} is VALID [2022-04-08 07:46:11,847 INFO L290 TraceCheckUtils]: 29: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-08 07:46:11,847 INFO L290 TraceCheckUtils]: 30: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-08 07:46:11,847 INFO L290 TraceCheckUtils]: 31: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-08 07:46:11,847 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1504#true} {1592#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} #57#return; {1592#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-08 07:46:11,848 INFO L272 TraceCheckUtils]: 33: Hoare triple {1592#(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)); {1611#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:46:11,851 INFO L290 TraceCheckUtils]: 34: Hoare triple {1611#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1615#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:46:11,852 INFO L290 TraceCheckUtils]: 35: Hoare triple {1615#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1505#false} is VALID [2022-04-08 07:46:11,852 INFO L290 TraceCheckUtils]: 36: Hoare triple {1505#false} assume !false; {1505#false} is VALID [2022-04-08 07:46:11,852 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 07:46:11,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:46:12,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:46:12,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514131995] [2022-04-08 07:46:12,132 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:46:12,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871779804] [2022-04-08 07:46:12,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871779804] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:46:12,132 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:46:12,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-08 07:46:12,132 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:46:12,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1668028579] [2022-04-08 07:46:12,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1668028579] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:46:12,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:46:12,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 07:46:12,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127966610] [2022-04-08 07:46:12,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:46:12,133 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2022-04-08 07:46:12,133 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:46:12,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 07:46:12,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:46:12,155 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 07:46:12,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:46:12,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 07:46:12,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-08 07:46:12,157 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 07:46:12,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:46:12,394 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-04-08 07:46:12,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 07:46:12,395 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2022-04-08 07:46:12,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:46:12,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 07:46:12,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-08 07:46:12,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 07:46:12,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-08 07:46:12,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 44 transitions. [2022-04-08 07:46:12,431 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:46:12,432 INFO L225 Difference]: With dead ends: 44 [2022-04-08 07:46:12,432 INFO L226 Difference]: Without dead ends: 38 [2022-04-08 07:46:12,432 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-08 07:46:12,433 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 07:46:12,433 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 141 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 07:46:12,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-08 07:46:12,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-08 07:46:12,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:46:12,479 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:46:12,479 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:46:12,479 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:46:12,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:46:12,482 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-08 07:46:12,482 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-08 07:46:12,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:46:12,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:46:12,483 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 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 38 states. [2022-04-08 07:46:12,483 INFO L87 Difference]: Start difference. First operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 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 38 states. [2022-04-08 07:46:12,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:46:12,485 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-08 07:46:12,485 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-08 07:46:12,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:46:12,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:46:12,485 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:46:12,485 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:46:12,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:46:12,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-04-08 07:46:12,487 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 37 [2022-04-08 07:46:12,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:46:12,487 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-04-08 07:46:12,487 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 07:46:12,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 41 transitions. [2022-04-08 07:46:12,918 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:46:12,918 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-08 07:46:12,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-08 07:46:12,919 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:46:12,919 INFO L499 BasicCegarLoop]: trace histogram [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, 1] [2022-04-08 07:46:12,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-08 07:46:13,120 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:46:13,120 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:46:13,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:46:13,121 INFO L85 PathProgramCache]: Analyzing trace with hash -951509150, now seen corresponding path program 1 times [2022-04-08 07:46:13,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:46:13,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2082905692] [2022-04-08 07:46:13,224 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:46:13,224 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:46:13,225 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:46:13,225 INFO L85 PathProgramCache]: Analyzing trace with hash -951509150, now seen corresponding path program 2 times [2022-04-08 07:46:13,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:46:13,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080226003] [2022-04-08 07:46:13,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:46:13,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:46:13,233 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:46:13,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [448588] [2022-04-08 07:46:13,233 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:46:13,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:46:13,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:46:13,234 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:46:13,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-08 07:46:13,268 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:46:13,268 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:46:13,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 07:46:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:46:13,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:46:13,433 INFO L272 TraceCheckUtils]: 0: Hoare triple {1925#true} call ULTIMATE.init(); {1925#true} is VALID [2022-04-08 07:46:13,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {1925#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1933#(<= ~counter~0 0)} is VALID [2022-04-08 07:46:13,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {1933#(<= ~counter~0 0)} assume true; {1933#(<= ~counter~0 0)} is VALID [2022-04-08 07:46:13,434 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1933#(<= ~counter~0 0)} {1925#true} #61#return; {1933#(<= ~counter~0 0)} is VALID [2022-04-08 07:46:13,434 INFO L272 TraceCheckUtils]: 4: Hoare triple {1933#(<= ~counter~0 0)} call #t~ret6 := main(); {1933#(<= ~counter~0 0)} is VALID [2022-04-08 07:46:13,435 INFO L290 TraceCheckUtils]: 5: Hoare triple {1933#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1933#(<= ~counter~0 0)} is VALID [2022-04-08 07:46:13,435 INFO L272 TraceCheckUtils]: 6: Hoare triple {1933#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1933#(<= ~counter~0 0)} is VALID [2022-04-08 07:46:13,435 INFO L290 TraceCheckUtils]: 7: Hoare triple {1933#(<= ~counter~0 0)} ~cond := #in~cond; {1933#(<= ~counter~0 0)} is VALID [2022-04-08 07:46:13,436 INFO L290 TraceCheckUtils]: 8: Hoare triple {1933#(<= ~counter~0 0)} assume !(0 == ~cond); {1933#(<= ~counter~0 0)} is VALID [2022-04-08 07:46:13,436 INFO L290 TraceCheckUtils]: 9: Hoare triple {1933#(<= ~counter~0 0)} assume true; {1933#(<= ~counter~0 0)} is VALID [2022-04-08 07:46:13,436 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1933#(<= ~counter~0 0)} {1933#(<= ~counter~0 0)} #53#return; {1933#(<= ~counter~0 0)} is VALID [2022-04-08 07:46:13,436 INFO L290 TraceCheckUtils]: 11: Hoare triple {1933#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1933#(<= ~counter~0 0)} is VALID [2022-04-08 07:46:13,437 INFO L290 TraceCheckUtils]: 12: Hoare triple {1933#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1967#(<= ~counter~0 1)} is VALID [2022-04-08 07:46:13,437 INFO L290 TraceCheckUtils]: 13: Hoare triple {1967#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {1967#(<= ~counter~0 1)} is VALID [2022-04-08 07:46:13,438 INFO L272 TraceCheckUtils]: 14: Hoare triple {1967#(<= ~counter~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)); {1967#(<= ~counter~0 1)} is VALID [2022-04-08 07:46:13,438 INFO L290 TraceCheckUtils]: 15: Hoare triple {1967#(<= ~counter~0 1)} ~cond := #in~cond; {1967#(<= ~counter~0 1)} is VALID [2022-04-08 07:46:13,438 INFO L290 TraceCheckUtils]: 16: Hoare triple {1967#(<= ~counter~0 1)} assume !(0 == ~cond); {1967#(<= ~counter~0 1)} is VALID [2022-04-08 07:46:13,438 INFO L290 TraceCheckUtils]: 17: Hoare triple {1967#(<= ~counter~0 1)} assume true; {1967#(<= ~counter~0 1)} is VALID [2022-04-08 07:46:13,439 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1967#(<= ~counter~0 1)} {1967#(<= ~counter~0 1)} #55#return; {1967#(<= ~counter~0 1)} is VALID [2022-04-08 07:46:13,439 INFO L290 TraceCheckUtils]: 19: Hoare triple {1967#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1967#(<= ~counter~0 1)} is VALID [2022-04-08 07:46:13,440 INFO L290 TraceCheckUtils]: 20: Hoare triple {1967#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1992#(<= ~counter~0 2)} is VALID [2022-04-08 07:46:13,440 INFO L290 TraceCheckUtils]: 21: Hoare triple {1992#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {1992#(<= ~counter~0 2)} is VALID [2022-04-08 07:46:13,440 INFO L272 TraceCheckUtils]: 22: Hoare triple {1992#(<= ~counter~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)); {1992#(<= ~counter~0 2)} is VALID [2022-04-08 07:46:13,441 INFO L290 TraceCheckUtils]: 23: Hoare triple {1992#(<= ~counter~0 2)} ~cond := #in~cond; {1992#(<= ~counter~0 2)} is VALID [2022-04-08 07:46:13,441 INFO L290 TraceCheckUtils]: 24: Hoare triple {1992#(<= ~counter~0 2)} assume !(0 == ~cond); {1992#(<= ~counter~0 2)} is VALID [2022-04-08 07:46:13,441 INFO L290 TraceCheckUtils]: 25: Hoare triple {1992#(<= ~counter~0 2)} assume true; {1992#(<= ~counter~0 2)} is VALID [2022-04-08 07:46:13,442 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1992#(<= ~counter~0 2)} {1992#(<= ~counter~0 2)} #55#return; {1992#(<= ~counter~0 2)} is VALID [2022-04-08 07:46:13,442 INFO L290 TraceCheckUtils]: 27: Hoare triple {1992#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1992#(<= ~counter~0 2)} is VALID [2022-04-08 07:46:13,442 INFO L290 TraceCheckUtils]: 28: Hoare triple {1992#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2017#(<= |main_#t~post5| 2)} is VALID [2022-04-08 07:46:13,443 INFO L290 TraceCheckUtils]: 29: Hoare triple {2017#(<= |main_#t~post5| 2)} assume !(#t~post5 < 10);havoc #t~post5; {1926#false} is VALID [2022-04-08 07:46:13,443 INFO L272 TraceCheckUtils]: 30: Hoare triple {1926#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)); {1926#false} is VALID [2022-04-08 07:46:13,443 INFO L290 TraceCheckUtils]: 31: Hoare triple {1926#false} ~cond := #in~cond; {1926#false} is VALID [2022-04-08 07:46:13,443 INFO L290 TraceCheckUtils]: 32: Hoare triple {1926#false} assume !(0 == ~cond); {1926#false} is VALID [2022-04-08 07:46:13,443 INFO L290 TraceCheckUtils]: 33: Hoare triple {1926#false} assume true; {1926#false} is VALID [2022-04-08 07:46:13,443 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1926#false} {1926#false} #57#return; {1926#false} is VALID [2022-04-08 07:46:13,443 INFO L272 TraceCheckUtils]: 35: Hoare triple {1926#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1926#false} is VALID [2022-04-08 07:46:13,443 INFO L290 TraceCheckUtils]: 36: Hoare triple {1926#false} ~cond := #in~cond; {1926#false} is VALID [2022-04-08 07:46:13,444 INFO L290 TraceCheckUtils]: 37: Hoare triple {1926#false} assume 0 == ~cond; {1926#false} is VALID [2022-04-08 07:46:13,444 INFO L290 TraceCheckUtils]: 38: Hoare triple {1926#false} assume !false; {1926#false} is VALID [2022-04-08 07:46:13,444 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 07:46:13,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:46:13,612 INFO L290 TraceCheckUtils]: 38: Hoare triple {1926#false} assume !false; {1926#false} is VALID [2022-04-08 07:46:13,612 INFO L290 TraceCheckUtils]: 37: Hoare triple {1926#false} assume 0 == ~cond; {1926#false} is VALID [2022-04-08 07:46:13,612 INFO L290 TraceCheckUtils]: 36: Hoare triple {1926#false} ~cond := #in~cond; {1926#false} is VALID [2022-04-08 07:46:13,613 INFO L272 TraceCheckUtils]: 35: Hoare triple {1926#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1926#false} is VALID [2022-04-08 07:46:13,613 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1925#true} {1926#false} #57#return; {1926#false} is VALID [2022-04-08 07:46:13,613 INFO L290 TraceCheckUtils]: 33: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-08 07:46:13,613 INFO L290 TraceCheckUtils]: 32: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-08 07:46:13,613 INFO L290 TraceCheckUtils]: 31: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-08 07:46:13,613 INFO L272 TraceCheckUtils]: 30: Hoare triple {1926#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)); {1925#true} is VALID [2022-04-08 07:46:13,614 INFO L290 TraceCheckUtils]: 29: Hoare triple {2075#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {1926#false} is VALID [2022-04-08 07:46:13,615 INFO L290 TraceCheckUtils]: 28: Hoare triple {2079#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2075#(< |main_#t~post5| 10)} is VALID [2022-04-08 07:46:13,615 INFO L290 TraceCheckUtils]: 27: Hoare triple {2079#(< ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2079#(< ~counter~0 10)} is VALID [2022-04-08 07:46:13,616 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1925#true} {2079#(< ~counter~0 10)} #55#return; {2079#(< ~counter~0 10)} is VALID [2022-04-08 07:46:13,616 INFO L290 TraceCheckUtils]: 25: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-08 07:46:13,616 INFO L290 TraceCheckUtils]: 24: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-08 07:46:13,616 INFO L290 TraceCheckUtils]: 23: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-08 07:46:13,616 INFO L272 TraceCheckUtils]: 22: Hoare triple {2079#(< ~counter~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)); {1925#true} is VALID [2022-04-08 07:46:13,618 INFO L290 TraceCheckUtils]: 21: Hoare triple {2079#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {2079#(< ~counter~0 10)} is VALID [2022-04-08 07:46:13,619 INFO L290 TraceCheckUtils]: 20: Hoare triple {2104#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2079#(< ~counter~0 10)} is VALID [2022-04-08 07:46:13,620 INFO L290 TraceCheckUtils]: 19: Hoare triple {2104#(< ~counter~0 9)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2104#(< ~counter~0 9)} is VALID [2022-04-08 07:46:13,620 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1925#true} {2104#(< ~counter~0 9)} #55#return; {2104#(< ~counter~0 9)} is VALID [2022-04-08 07:46:13,620 INFO L290 TraceCheckUtils]: 17: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-08 07:46:13,620 INFO L290 TraceCheckUtils]: 16: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-08 07:46:13,620 INFO L290 TraceCheckUtils]: 15: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-08 07:46:13,620 INFO L272 TraceCheckUtils]: 14: Hoare triple {2104#(< ~counter~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)); {1925#true} is VALID [2022-04-08 07:46:13,621 INFO L290 TraceCheckUtils]: 13: Hoare triple {2104#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {2104#(< ~counter~0 9)} is VALID [2022-04-08 07:46:13,621 INFO L290 TraceCheckUtils]: 12: Hoare triple {2129#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2104#(< ~counter~0 9)} is VALID [2022-04-08 07:46:13,621 INFO L290 TraceCheckUtils]: 11: Hoare triple {2129#(< ~counter~0 8)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2129#(< ~counter~0 8)} is VALID [2022-04-08 07:46:13,622 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1925#true} {2129#(< ~counter~0 8)} #53#return; {2129#(< ~counter~0 8)} is VALID [2022-04-08 07:46:13,622 INFO L290 TraceCheckUtils]: 9: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-08 07:46:13,622 INFO L290 TraceCheckUtils]: 8: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-08 07:46:13,622 INFO L290 TraceCheckUtils]: 7: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-08 07:46:13,622 INFO L272 TraceCheckUtils]: 6: Hoare triple {2129#(< ~counter~0 8)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1925#true} is VALID [2022-04-08 07:46:13,622 INFO L290 TraceCheckUtils]: 5: Hoare triple {2129#(< ~counter~0 8)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {2129#(< ~counter~0 8)} is VALID [2022-04-08 07:46:13,623 INFO L272 TraceCheckUtils]: 4: Hoare triple {2129#(< ~counter~0 8)} call #t~ret6 := main(); {2129#(< ~counter~0 8)} is VALID [2022-04-08 07:46:13,623 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2129#(< ~counter~0 8)} {1925#true} #61#return; {2129#(< ~counter~0 8)} is VALID [2022-04-08 07:46:13,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {2129#(< ~counter~0 8)} assume true; {2129#(< ~counter~0 8)} is VALID [2022-04-08 07:46:13,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {1925#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2129#(< ~counter~0 8)} is VALID [2022-04-08 07:46:13,624 INFO L272 TraceCheckUtils]: 0: Hoare triple {1925#true} call ULTIMATE.init(); {1925#true} is VALID [2022-04-08 07:46:13,624 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 07:46:13,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:46:13,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080226003] [2022-04-08 07:46:13,624 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:46:13,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448588] [2022-04-08 07:46:13,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448588] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 07:46:13,624 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 07:46:13,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-08 07:46:13,625 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:46:13,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2082905692] [2022-04-08 07:46:13,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2082905692] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:46:13,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:46:13,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 07:46:13,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349349581] [2022-04-08 07:46:13,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:46:13,625 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Word has length 39 [2022-04-08 07:46:13,626 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:46:13,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:46:13,648 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:46:13,648 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 07:46:13,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:46:13,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 07:46:13,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-08 07:46:13,649 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:46:13,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:46:13,765 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2022-04-08 07:46:13,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 07:46:13,765 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Word has length 39 [2022-04-08 07:46:13,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:46:13,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:46:13,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. [2022-04-08 07:46:13,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:46:13,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. [2022-04-08 07:46:13,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 54 transitions. [2022-04-08 07:46:13,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:46:13,803 INFO L225 Difference]: With dead ends: 54 [2022-04-08 07:46:13,803 INFO L226 Difference]: Without dead ends: 44 [2022-04-08 07:46:13,803 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-04-08 07:46:13,804 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 12 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:46:13,804 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 84 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 07:46:13,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-08 07:46:13,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-08 07:46:13,832 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:46:13,833 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:46:13,833 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:46:13,833 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:46:13,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:46:13,834 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-08 07:46:13,834 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-08 07:46:13,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:46:13,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:46:13,834 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 44 states. [2022-04-08 07:46:13,834 INFO L87 Difference]: Start difference. First operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 44 states. [2022-04-08 07:46:13,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:46:13,836 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-08 07:46:13,836 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-08 07:46:13,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:46:13,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:46:13,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:46:13,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:46:13,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:46:13,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2022-04-08 07:46:13,837 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 39 [2022-04-08 07:46:13,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:46:13,837 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2022-04-08 07:46:13,837 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:46:13,838 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 46 transitions. [2022-04-08 07:46:14,279 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:46:14,279 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-08 07:46:14,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-08 07:46:14,279 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:46:14,279 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:46:14,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-08 07:46:14,480 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:46:14,480 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:46:14,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:46:14,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1537538120, now seen corresponding path program 3 times [2022-04-08 07:46:14,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:46:14,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1932753084] [2022-04-08 07:46:14,563 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:46:14,563 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:46:14,563 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:46:14,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1537538120, now seen corresponding path program 4 times [2022-04-08 07:46:14,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:46:14,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148204204] [2022-04-08 07:46:14,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:46:14,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:46:14,572 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:46:14,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1930514308] [2022-04-08 07:46:14,572 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 07:46:14,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:46:14,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:46:14,573 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:46:14,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-08 07:46:14,603 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 07:46:14,603 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:46:14,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-08 07:46:14,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:46:14,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:46:14,892 INFO L272 TraceCheckUtils]: 0: Hoare triple {2456#true} call ULTIMATE.init(); {2456#true} is VALID [2022-04-08 07:46:14,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {2456#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2456#true} is VALID [2022-04-08 07:46:14,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-08 07:46:14,893 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2456#true} {2456#true} #61#return; {2456#true} is VALID [2022-04-08 07:46:14,893 INFO L272 TraceCheckUtils]: 4: Hoare triple {2456#true} call #t~ret6 := main(); {2456#true} is VALID [2022-04-08 07:46:14,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {2456#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; {2456#true} is VALID [2022-04-08 07:46:14,893 INFO L272 TraceCheckUtils]: 6: Hoare triple {2456#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2456#true} is VALID [2022-04-08 07:46:14,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-08 07:46:14,893 INFO L290 TraceCheckUtils]: 8: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-08 07:46:14,893 INFO L290 TraceCheckUtils]: 9: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-08 07:46:14,893 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2456#true} {2456#true} #53#return; {2456#true} is VALID [2022-04-08 07:46:14,894 INFO L290 TraceCheckUtils]: 11: Hoare triple {2456#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2494#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:46:14,894 INFO L290 TraceCheckUtils]: 12: Hoare triple {2494#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2494#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:46:14,894 INFO L290 TraceCheckUtils]: 13: Hoare triple {2494#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {2494#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:46:14,894 INFO L272 TraceCheckUtils]: 14: Hoare triple {2494#(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)); {2456#true} is VALID [2022-04-08 07:46:14,894 INFO L290 TraceCheckUtils]: 15: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-08 07:46:14,895 INFO L290 TraceCheckUtils]: 16: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-08 07:46:14,895 INFO L290 TraceCheckUtils]: 17: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-08 07:46:14,895 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2456#true} {2494#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {2494#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:46:14,896 INFO L290 TraceCheckUtils]: 19: Hoare triple {2494#(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; {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:46:14,896 INFO L290 TraceCheckUtils]: 20: Hoare triple {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:46:14,897 INFO L290 TraceCheckUtils]: 21: Hoare triple {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:46:14,897 INFO L272 TraceCheckUtils]: 22: Hoare triple {2519#(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)); {2456#true} is VALID [2022-04-08 07:46:14,897 INFO L290 TraceCheckUtils]: 23: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-08 07:46:14,897 INFO L290 TraceCheckUtils]: 24: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-08 07:46:14,897 INFO L290 TraceCheckUtils]: 25: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-08 07:46:14,897 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2456#true} {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #55#return; {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:46:14,898 INFO L290 TraceCheckUtils]: 27: Hoare triple {2519#(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; {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-08 07:46:14,898 INFO L290 TraceCheckUtils]: 28: Hoare triple {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-08 07:46:14,899 INFO L290 TraceCheckUtils]: 29: Hoare triple {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !!(#t~post5 < 10);havoc #t~post5; {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-08 07:46:14,899 INFO L272 TraceCheckUtils]: 30: Hoare triple {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2456#true} is VALID [2022-04-08 07:46:14,899 INFO L290 TraceCheckUtils]: 31: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-08 07:46:14,899 INFO L290 TraceCheckUtils]: 32: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-08 07:46:14,899 INFO L290 TraceCheckUtils]: 33: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-08 07:46:14,900 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2456#true} {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} #55#return; {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-08 07:46:14,900 INFO L290 TraceCheckUtils]: 35: Hoare triple {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {2569#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-08 07:46:14,900 INFO L272 TraceCheckUtils]: 36: Hoare triple {2569#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2456#true} is VALID [2022-04-08 07:46:14,900 INFO L290 TraceCheckUtils]: 37: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-08 07:46:14,900 INFO L290 TraceCheckUtils]: 38: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-08 07:46:14,900 INFO L290 TraceCheckUtils]: 39: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-08 07:46:14,901 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2456#true} {2569#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} #57#return; {2569#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-08 07:46:14,901 INFO L272 TraceCheckUtils]: 41: Hoare triple {2569#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2588#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:46:14,902 INFO L290 TraceCheckUtils]: 42: Hoare triple {2588#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2592#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:46:14,902 INFO L290 TraceCheckUtils]: 43: Hoare triple {2592#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2457#false} is VALID [2022-04-08 07:46:14,902 INFO L290 TraceCheckUtils]: 44: Hoare triple {2457#false} assume !false; {2457#false} is VALID [2022-04-08 07:46:14,902 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 07:46:14,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:46:15,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:46:15,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148204204] [2022-04-08 07:46:15,114 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:46:15,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930514308] [2022-04-08 07:46:15,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930514308] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:46:15,114 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:46:15,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-08 07:46:15,114 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:46:15,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1932753084] [2022-04-08 07:46:15,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1932753084] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:46:15,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:46:15,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 07:46:15,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307379693] [2022-04-08 07:46:15,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:46:15,115 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 45 [2022-04-08 07:46:15,115 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:46:15,115 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 07:46:15,139 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:46:15,139 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 07:46:15,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:46:15,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 07:46:15,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-08 07:46:15,140 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 07:46:15,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:46:15,422 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-04-08 07:46:15,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 07:46:15,422 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 45 [2022-04-08 07:46:15,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:46:15,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 07:46:15,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-08 07:46:15,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 07:46:15,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-08 07:46:15,425 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 49 transitions. [2022-04-08 07:46:15,462 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:46:15,463 INFO L225 Difference]: With dead ends: 52 [2022-04-08 07:46:15,463 INFO L226 Difference]: Without dead ends: 46 [2022-04-08 07:46:15,463 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 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-08 07:46:15,464 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 07:46:15,464 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 181 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 07:46:15,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-08 07:46:15,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-08 07:46:15,502 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:46:15,502 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:46:15,503 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:46:15,503 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:46:15,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:46:15,505 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-04-08 07:46:15,505 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-04-08 07:46:15,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:46:15,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:46:15,506 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 46 states. [2022-04-08 07:46:15,506 INFO L87 Difference]: Start difference. First operand has 46 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 46 states. [2022-04-08 07:46:15,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:46:15,507 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-04-08 07:46:15,507 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-04-08 07:46:15,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:46:15,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:46:15,507 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:46:15,507 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:46:15,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:46:15,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2022-04-08 07:46:15,508 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 45 [2022-04-08 07:46:15,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:46:15,509 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2022-04-08 07:46:15,509 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 07:46:15,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 49 transitions. [2022-04-08 07:46:15,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:46:15,940 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-04-08 07:46:15,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-08 07:46:15,940 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:46:15,940 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:46:15,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-08 07:46:16,142 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:46:16,142 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:46:16,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:46:16,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1448798205, now seen corresponding path program 3 times [2022-04-08 07:46:16,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:46:16,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1229871153] [2022-04-08 07:46:16,241 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:46:16,241 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:46:16,241 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:46:16,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1448798205, now seen corresponding path program 4 times [2022-04-08 07:46:16,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:46:16,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058736827] [2022-04-08 07:46:16,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:46:16,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:46:16,250 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:46:16,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [476738261] [2022-04-08 07:46:16,250 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 07:46:16,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:46:16,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:46:16,251 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:46:16,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-08 07:46:16,302 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 07:46:16,302 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:46:16,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 07:46:16,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:46:16,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:46:16,519 INFO L272 TraceCheckUtils]: 0: Hoare triple {2950#true} call ULTIMATE.init(); {2950#true} is VALID [2022-04-08 07:46:16,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {2950#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2958#(<= ~counter~0 0)} is VALID [2022-04-08 07:46:16,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {2958#(<= ~counter~0 0)} assume true; {2958#(<= ~counter~0 0)} is VALID [2022-04-08 07:46:16,521 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2958#(<= ~counter~0 0)} {2950#true} #61#return; {2958#(<= ~counter~0 0)} is VALID [2022-04-08 07:46:16,522 INFO L272 TraceCheckUtils]: 4: Hoare triple {2958#(<= ~counter~0 0)} call #t~ret6 := main(); {2958#(<= ~counter~0 0)} is VALID [2022-04-08 07:46:16,522 INFO L290 TraceCheckUtils]: 5: Hoare triple {2958#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {2958#(<= ~counter~0 0)} is VALID [2022-04-08 07:46:16,522 INFO L272 TraceCheckUtils]: 6: Hoare triple {2958#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2958#(<= ~counter~0 0)} is VALID [2022-04-08 07:46:16,523 INFO L290 TraceCheckUtils]: 7: Hoare triple {2958#(<= ~counter~0 0)} ~cond := #in~cond; {2958#(<= ~counter~0 0)} is VALID [2022-04-08 07:46:16,523 INFO L290 TraceCheckUtils]: 8: Hoare triple {2958#(<= ~counter~0 0)} assume !(0 == ~cond); {2958#(<= ~counter~0 0)} is VALID [2022-04-08 07:46:16,523 INFO L290 TraceCheckUtils]: 9: Hoare triple {2958#(<= ~counter~0 0)} assume true; {2958#(<= ~counter~0 0)} is VALID [2022-04-08 07:46:16,524 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2958#(<= ~counter~0 0)} {2958#(<= ~counter~0 0)} #53#return; {2958#(<= ~counter~0 0)} is VALID [2022-04-08 07:46:16,524 INFO L290 TraceCheckUtils]: 11: Hoare triple {2958#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2958#(<= ~counter~0 0)} is VALID [2022-04-08 07:46:16,525 INFO L290 TraceCheckUtils]: 12: Hoare triple {2958#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2992#(<= ~counter~0 1)} is VALID [2022-04-08 07:46:16,525 INFO L290 TraceCheckUtils]: 13: Hoare triple {2992#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {2992#(<= ~counter~0 1)} is VALID [2022-04-08 07:46:16,526 INFO L272 TraceCheckUtils]: 14: Hoare triple {2992#(<= ~counter~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)); {2992#(<= ~counter~0 1)} is VALID [2022-04-08 07:46:16,526 INFO L290 TraceCheckUtils]: 15: Hoare triple {2992#(<= ~counter~0 1)} ~cond := #in~cond; {2992#(<= ~counter~0 1)} is VALID [2022-04-08 07:46:16,526 INFO L290 TraceCheckUtils]: 16: Hoare triple {2992#(<= ~counter~0 1)} assume !(0 == ~cond); {2992#(<= ~counter~0 1)} is VALID [2022-04-08 07:46:16,526 INFO L290 TraceCheckUtils]: 17: Hoare triple {2992#(<= ~counter~0 1)} assume true; {2992#(<= ~counter~0 1)} is VALID [2022-04-08 07:46:16,527 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2992#(<= ~counter~0 1)} {2992#(<= ~counter~0 1)} #55#return; {2992#(<= ~counter~0 1)} is VALID [2022-04-08 07:46:16,527 INFO L290 TraceCheckUtils]: 19: Hoare triple {2992#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2992#(<= ~counter~0 1)} is VALID [2022-04-08 07:46:16,528 INFO L290 TraceCheckUtils]: 20: Hoare triple {2992#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3017#(<= ~counter~0 2)} is VALID [2022-04-08 07:46:16,528 INFO L290 TraceCheckUtils]: 21: Hoare triple {3017#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {3017#(<= ~counter~0 2)} is VALID [2022-04-08 07:46:16,529 INFO L272 TraceCheckUtils]: 22: Hoare triple {3017#(<= ~counter~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)); {3017#(<= ~counter~0 2)} is VALID [2022-04-08 07:46:16,529 INFO L290 TraceCheckUtils]: 23: Hoare triple {3017#(<= ~counter~0 2)} ~cond := #in~cond; {3017#(<= ~counter~0 2)} is VALID [2022-04-08 07:46:16,529 INFO L290 TraceCheckUtils]: 24: Hoare triple {3017#(<= ~counter~0 2)} assume !(0 == ~cond); {3017#(<= ~counter~0 2)} is VALID [2022-04-08 07:46:16,530 INFO L290 TraceCheckUtils]: 25: Hoare triple {3017#(<= ~counter~0 2)} assume true; {3017#(<= ~counter~0 2)} is VALID [2022-04-08 07:46:16,530 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3017#(<= ~counter~0 2)} {3017#(<= ~counter~0 2)} #55#return; {3017#(<= ~counter~0 2)} is VALID [2022-04-08 07:46:16,531 INFO L290 TraceCheckUtils]: 27: Hoare triple {3017#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3017#(<= ~counter~0 2)} is VALID [2022-04-08 07:46:16,531 INFO L290 TraceCheckUtils]: 28: Hoare triple {3017#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3042#(<= ~counter~0 3)} is VALID [2022-04-08 07:46:16,532 INFO L290 TraceCheckUtils]: 29: Hoare triple {3042#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {3042#(<= ~counter~0 3)} is VALID [2022-04-08 07:46:16,533 INFO L272 TraceCheckUtils]: 30: Hoare triple {3042#(<= ~counter~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)); {3042#(<= ~counter~0 3)} is VALID [2022-04-08 07:46:16,533 INFO L290 TraceCheckUtils]: 31: Hoare triple {3042#(<= ~counter~0 3)} ~cond := #in~cond; {3042#(<= ~counter~0 3)} is VALID [2022-04-08 07:46:16,533 INFO L290 TraceCheckUtils]: 32: Hoare triple {3042#(<= ~counter~0 3)} assume !(0 == ~cond); {3042#(<= ~counter~0 3)} is VALID [2022-04-08 07:46:16,534 INFO L290 TraceCheckUtils]: 33: Hoare triple {3042#(<= ~counter~0 3)} assume true; {3042#(<= ~counter~0 3)} is VALID [2022-04-08 07:46:16,534 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3042#(<= ~counter~0 3)} {3042#(<= ~counter~0 3)} #55#return; {3042#(<= ~counter~0 3)} is VALID [2022-04-08 07:46:16,534 INFO L290 TraceCheckUtils]: 35: Hoare triple {3042#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3042#(<= ~counter~0 3)} is VALID [2022-04-08 07:46:16,535 INFO L290 TraceCheckUtils]: 36: Hoare triple {3042#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3067#(<= |main_#t~post5| 3)} is VALID [2022-04-08 07:46:16,535 INFO L290 TraceCheckUtils]: 37: Hoare triple {3067#(<= |main_#t~post5| 3)} assume !(#t~post5 < 10);havoc #t~post5; {2951#false} is VALID [2022-04-08 07:46:16,535 INFO L272 TraceCheckUtils]: 38: Hoare triple {2951#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)); {2951#false} is VALID [2022-04-08 07:46:16,535 INFO L290 TraceCheckUtils]: 39: Hoare triple {2951#false} ~cond := #in~cond; {2951#false} is VALID [2022-04-08 07:46:16,535 INFO L290 TraceCheckUtils]: 40: Hoare triple {2951#false} assume !(0 == ~cond); {2951#false} is VALID [2022-04-08 07:46:16,535 INFO L290 TraceCheckUtils]: 41: Hoare triple {2951#false} assume true; {2951#false} is VALID [2022-04-08 07:46:16,536 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2951#false} {2951#false} #57#return; {2951#false} is VALID [2022-04-08 07:46:16,536 INFO L272 TraceCheckUtils]: 43: Hoare triple {2951#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2951#false} is VALID [2022-04-08 07:46:16,536 INFO L290 TraceCheckUtils]: 44: Hoare triple {2951#false} ~cond := #in~cond; {2951#false} is VALID [2022-04-08 07:46:16,536 INFO L290 TraceCheckUtils]: 45: Hoare triple {2951#false} assume 0 == ~cond; {2951#false} is VALID [2022-04-08 07:46:16,536 INFO L290 TraceCheckUtils]: 46: Hoare triple {2951#false} assume !false; {2951#false} is VALID [2022-04-08 07:46:16,536 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 07:46:16,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:46:16,757 INFO L290 TraceCheckUtils]: 46: Hoare triple {2951#false} assume !false; {2951#false} is VALID [2022-04-08 07:46:16,757 INFO L290 TraceCheckUtils]: 45: Hoare triple {2951#false} assume 0 == ~cond; {2951#false} is VALID [2022-04-08 07:46:16,757 INFO L290 TraceCheckUtils]: 44: Hoare triple {2951#false} ~cond := #in~cond; {2951#false} is VALID [2022-04-08 07:46:16,757 INFO L272 TraceCheckUtils]: 43: Hoare triple {2951#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2951#false} is VALID [2022-04-08 07:46:16,757 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2950#true} {2951#false} #57#return; {2951#false} is VALID [2022-04-08 07:46:16,757 INFO L290 TraceCheckUtils]: 41: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-08 07:46:16,758 INFO L290 TraceCheckUtils]: 40: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-08 07:46:16,758 INFO L290 TraceCheckUtils]: 39: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-08 07:46:16,758 INFO L272 TraceCheckUtils]: 38: Hoare triple {2951#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)); {2950#true} is VALID [2022-04-08 07:46:16,760 INFO L290 TraceCheckUtils]: 37: Hoare triple {3125#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {2951#false} is VALID [2022-04-08 07:46:16,761 INFO L290 TraceCheckUtils]: 36: Hoare triple {3129#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3125#(< |main_#t~post5| 10)} is VALID [2022-04-08 07:46:16,761 INFO L290 TraceCheckUtils]: 35: Hoare triple {3129#(< ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3129#(< ~counter~0 10)} is VALID [2022-04-08 07:46:16,761 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2950#true} {3129#(< ~counter~0 10)} #55#return; {3129#(< ~counter~0 10)} is VALID [2022-04-08 07:46:16,762 INFO L290 TraceCheckUtils]: 33: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-08 07:46:16,762 INFO L290 TraceCheckUtils]: 32: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-08 07:46:16,762 INFO L290 TraceCheckUtils]: 31: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-08 07:46:16,762 INFO L272 TraceCheckUtils]: 30: Hoare triple {3129#(< ~counter~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)); {2950#true} is VALID [2022-04-08 07:46:16,762 INFO L290 TraceCheckUtils]: 29: Hoare triple {3129#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {3129#(< ~counter~0 10)} is VALID [2022-04-08 07:46:16,763 INFO L290 TraceCheckUtils]: 28: Hoare triple {3154#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3129#(< ~counter~0 10)} is VALID [2022-04-08 07:46:16,763 INFO L290 TraceCheckUtils]: 27: Hoare triple {3154#(< ~counter~0 9)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3154#(< ~counter~0 9)} is VALID [2022-04-08 07:46:16,764 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2950#true} {3154#(< ~counter~0 9)} #55#return; {3154#(< ~counter~0 9)} is VALID [2022-04-08 07:46:16,764 INFO L290 TraceCheckUtils]: 25: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-08 07:46:16,764 INFO L290 TraceCheckUtils]: 24: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-08 07:46:16,764 INFO L290 TraceCheckUtils]: 23: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-08 07:46:16,764 INFO L272 TraceCheckUtils]: 22: Hoare triple {3154#(< ~counter~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)); {2950#true} is VALID [2022-04-08 07:46:16,764 INFO L290 TraceCheckUtils]: 21: Hoare triple {3154#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {3154#(< ~counter~0 9)} is VALID [2022-04-08 07:46:16,765 INFO L290 TraceCheckUtils]: 20: Hoare triple {3179#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3154#(< ~counter~0 9)} is VALID [2022-04-08 07:46:16,765 INFO L290 TraceCheckUtils]: 19: Hoare triple {3179#(< ~counter~0 8)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3179#(< ~counter~0 8)} is VALID [2022-04-08 07:46:16,766 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2950#true} {3179#(< ~counter~0 8)} #55#return; {3179#(< ~counter~0 8)} is VALID [2022-04-08 07:46:16,766 INFO L290 TraceCheckUtils]: 17: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-08 07:46:16,766 INFO L290 TraceCheckUtils]: 16: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-08 07:46:16,766 INFO L290 TraceCheckUtils]: 15: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-08 07:46:16,766 INFO L272 TraceCheckUtils]: 14: Hoare triple {3179#(< ~counter~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)); {2950#true} is VALID [2022-04-08 07:46:16,766 INFO L290 TraceCheckUtils]: 13: Hoare triple {3179#(< ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {3179#(< ~counter~0 8)} is VALID [2022-04-08 07:46:16,767 INFO L290 TraceCheckUtils]: 12: Hoare triple {3204#(< ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3179#(< ~counter~0 8)} is VALID [2022-04-08 07:46:16,767 INFO L290 TraceCheckUtils]: 11: Hoare triple {3204#(< ~counter~0 7)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3204#(< ~counter~0 7)} is VALID [2022-04-08 07:46:16,767 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2950#true} {3204#(< ~counter~0 7)} #53#return; {3204#(< ~counter~0 7)} is VALID [2022-04-08 07:46:16,768 INFO L290 TraceCheckUtils]: 9: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-08 07:46:16,768 INFO L290 TraceCheckUtils]: 8: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-08 07:46:16,768 INFO L290 TraceCheckUtils]: 7: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-08 07:46:16,768 INFO L272 TraceCheckUtils]: 6: Hoare triple {3204#(< ~counter~0 7)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2950#true} is VALID [2022-04-08 07:46:16,768 INFO L290 TraceCheckUtils]: 5: Hoare triple {3204#(< ~counter~0 7)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {3204#(< ~counter~0 7)} is VALID [2022-04-08 07:46:16,768 INFO L272 TraceCheckUtils]: 4: Hoare triple {3204#(< ~counter~0 7)} call #t~ret6 := main(); {3204#(< ~counter~0 7)} is VALID [2022-04-08 07:46:16,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3204#(< ~counter~0 7)} {2950#true} #61#return; {3204#(< ~counter~0 7)} is VALID [2022-04-08 07:46:16,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {3204#(< ~counter~0 7)} assume true; {3204#(< ~counter~0 7)} is VALID [2022-04-08 07:46:16,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {2950#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3204#(< ~counter~0 7)} is VALID [2022-04-08 07:46:16,770 INFO L272 TraceCheckUtils]: 0: Hoare triple {2950#true} call ULTIMATE.init(); {2950#true} is VALID [2022-04-08 07:46:16,770 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 07:46:16,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:46:16,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058736827] [2022-04-08 07:46:16,770 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:46:16,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476738261] [2022-04-08 07:46:16,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476738261] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 07:46:16,770 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 07:46:16,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-08 07:46:16,771 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:46:16,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1229871153] [2022-04-08 07:46:16,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1229871153] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:46:16,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:46:16,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 07:46:16,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261651502] [2022-04-08 07:46:16,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:46:16,772 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Word has length 47 [2022-04-08 07:46:16,772 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:46:16,772 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:46:16,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:46:16,803 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 07:46:16,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:46:16,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 07:46:16,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-08 07:46:16,803 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:46:16,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:46:16,976 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2022-04-08 07:46:16,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 07:46:16,976 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Word has length 47 [2022-04-08 07:46:16,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:46:16,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:46:16,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2022-04-08 07:46:16,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:46:16,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2022-04-08 07:46:16,985 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 62 transitions. [2022-04-08 07:46:17,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:46:17,022 INFO L225 Difference]: With dead ends: 62 [2022-04-08 07:46:17,022 INFO L226 Difference]: Without dead ends: 52 [2022-04-08 07:46:17,022 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2022-04-08 07:46:17,024 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 6 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:46:17,024 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 99 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 07:46:17,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-08 07:46:17,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-08 07:46:17,059 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:46:17,059 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:46:17,060 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:46:17,062 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:46:17,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:46:17,064 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-08 07:46:17,064 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-08 07:46:17,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:46:17,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:46:17,065 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 52 states. [2022-04-08 07:46:17,065 INFO L87 Difference]: Start difference. First operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 52 states. [2022-04-08 07:46:17,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:46:17,065 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-08 07:46:17,066 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-08 07:46:17,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:46:17,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:46:17,066 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:46:17,066 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:46:17,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:46:17,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2022-04-08 07:46:17,067 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 47 [2022-04-08 07:46:17,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:46:17,067 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2022-04-08 07:46:17,067 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:46:17,067 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 54 transitions. [2022-04-08 07:46:19,129 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 53 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 07:46:19,131 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-08 07:46:19,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-08 07:46:19,132 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:46:19,132 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:46:19,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-08 07:46:19,347 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-08 07:46:19,348 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:46:19,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:46:19,348 INFO L85 PathProgramCache]: Analyzing trace with hash 468857897, now seen corresponding path program 5 times [2022-04-08 07:46:19,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:46:19,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1407120457] [2022-04-08 07:46:19,449 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:46:19,449 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:46:19,449 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:46:19,449 INFO L85 PathProgramCache]: Analyzing trace with hash 468857897, now seen corresponding path program 6 times [2022-04-08 07:46:19,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:46:19,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072194562] [2022-04-08 07:46:19,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:46:19,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:46:19,464 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:46:19,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [9770415] [2022-04-08 07:46:19,465 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 07:46:19,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:46:19,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:46:19,465 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:46:19,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-08 07:46:19,833 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 07:46:19,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:46:19,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-08 07:46:19,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:46:19,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:46:20,183 INFO L272 TraceCheckUtils]: 0: Hoare triple {3581#true} call ULTIMATE.init(); {3581#true} is VALID [2022-04-08 07:46:20,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {3581#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3581#true} is VALID [2022-04-08 07:46:20,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-08 07:46:20,184 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3581#true} {3581#true} #61#return; {3581#true} is VALID [2022-04-08 07:46:20,184 INFO L272 TraceCheckUtils]: 4: Hoare triple {3581#true} call #t~ret6 := main(); {3581#true} is VALID [2022-04-08 07:46:20,184 INFO L290 TraceCheckUtils]: 5: Hoare triple {3581#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; {3581#true} is VALID [2022-04-08 07:46:20,184 INFO L272 TraceCheckUtils]: 6: Hoare triple {3581#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3581#true} is VALID [2022-04-08 07:46:20,184 INFO L290 TraceCheckUtils]: 7: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-08 07:46:20,184 INFO L290 TraceCheckUtils]: 8: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-08 07:46:20,184 INFO L290 TraceCheckUtils]: 9: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-08 07:46:20,184 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3581#true} {3581#true} #53#return; {3581#true} is VALID [2022-04-08 07:46:20,185 INFO L290 TraceCheckUtils]: 11: Hoare triple {3581#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3619#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:46:20,185 INFO L290 TraceCheckUtils]: 12: Hoare triple {3619#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3619#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:46:20,185 INFO L290 TraceCheckUtils]: 13: Hoare triple {3619#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {3619#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:46:20,185 INFO L272 TraceCheckUtils]: 14: Hoare triple {3619#(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)); {3581#true} is VALID [2022-04-08 07:46:20,186 INFO L290 TraceCheckUtils]: 15: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-08 07:46:20,186 INFO L290 TraceCheckUtils]: 16: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-08 07:46:20,186 INFO L290 TraceCheckUtils]: 17: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-08 07:46:20,186 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3581#true} {3619#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {3619#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:46:20,187 INFO L290 TraceCheckUtils]: 19: Hoare triple {3619#(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; {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:46:20,187 INFO L290 TraceCheckUtils]: 20: Hoare triple {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:46:20,187 INFO L290 TraceCheckUtils]: 21: Hoare triple {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:46:20,188 INFO L272 TraceCheckUtils]: 22: Hoare triple {3644#(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)); {3581#true} is VALID [2022-04-08 07:46:20,188 INFO L290 TraceCheckUtils]: 23: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-08 07:46:20,188 INFO L290 TraceCheckUtils]: 24: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-08 07:46:20,188 INFO L290 TraceCheckUtils]: 25: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-08 07:46:20,188 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3581#true} {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #55#return; {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:46:20,189 INFO L290 TraceCheckUtils]: 27: Hoare triple {3644#(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; {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 07:46:20,189 INFO L290 TraceCheckUtils]: 28: Hoare triple {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 07:46:20,189 INFO L290 TraceCheckUtils]: 29: Hoare triple {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(#t~post5 < 10);havoc #t~post5; {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 07:46:20,189 INFO L272 TraceCheckUtils]: 30: Hoare triple {3669#(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)); {3581#true} is VALID [2022-04-08 07:46:20,189 INFO L290 TraceCheckUtils]: 31: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-08 07:46:20,190 INFO L290 TraceCheckUtils]: 32: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-08 07:46:20,190 INFO L290 TraceCheckUtils]: 33: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-08 07:46:20,190 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3581#true} {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #55#return; {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 07:46:20,190 INFO L290 TraceCheckUtils]: 35: Hoare triple {3669#(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; {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-08 07:46:20,191 INFO L290 TraceCheckUtils]: 36: Hoare triple {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-08 07:46:20,191 INFO L290 TraceCheckUtils]: 37: Hoare triple {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} assume !!(#t~post5 < 10);havoc #t~post5; {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-08 07:46:20,191 INFO L272 TraceCheckUtils]: 38: Hoare triple {3694#(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)); {3581#true} is VALID [2022-04-08 07:46:20,191 INFO L290 TraceCheckUtils]: 39: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-08 07:46:20,191 INFO L290 TraceCheckUtils]: 40: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-08 07:46:20,191 INFO L290 TraceCheckUtils]: 41: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-08 07:46:20,192 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {3581#true} {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} #55#return; {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-08 07:46:20,192 INFO L290 TraceCheckUtils]: 43: Hoare triple {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {3719#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-08 07:46:20,192 INFO L272 TraceCheckUtils]: 44: Hoare triple {3719#(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)); {3581#true} is VALID [2022-04-08 07:46:20,192 INFO L290 TraceCheckUtils]: 45: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-08 07:46:20,193 INFO L290 TraceCheckUtils]: 46: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-08 07:46:20,193 INFO L290 TraceCheckUtils]: 47: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-08 07:46:20,193 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {3581#true} {3719#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} #57#return; {3719#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-08 07:46:20,194 INFO L272 TraceCheckUtils]: 49: Hoare triple {3719#(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)); {3738#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:46:20,194 INFO L290 TraceCheckUtils]: 50: Hoare triple {3738#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3742#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:46:20,194 INFO L290 TraceCheckUtils]: 51: Hoare triple {3742#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3582#false} is VALID [2022-04-08 07:46:20,194 INFO L290 TraceCheckUtils]: 52: Hoare triple {3582#false} assume !false; {3582#false} is VALID [2022-04-08 07:46:20,194 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 10 proven. 24 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-08 07:46:20,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:46:20,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:46:20,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072194562] [2022-04-08 07:46:20,492 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:46:20,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9770415] [2022-04-08 07:46:20,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9770415] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:46:20,492 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:46:20,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-08 07:46:20,492 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:46:20,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1407120457] [2022-04-08 07:46:20,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1407120457] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:46:20,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:46:20,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 07:46:20,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673505564] [2022-04-08 07:46:20,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:46:20,493 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 53 [2022-04-08 07:46:20,494 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:46:20,495 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 07:46:20,520 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:46:20,520 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 07:46:20,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:46:20,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 07:46:20,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-08 07:46:20,521 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 07:46:20,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:46:20,977 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2022-04-08 07:46:20,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 07:46:20,977 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 53 [2022-04-08 07:46:20,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:46:20,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 07:46:20,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-04-08 07:46:20,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 07:46:20,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-04-08 07:46:20,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 54 transitions. [2022-04-08 07:46:21,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:46:21,044 INFO L225 Difference]: With dead ends: 60 [2022-04-08 07:46:21,045 INFO L226 Difference]: Without dead ends: 54 [2022-04-08 07:46:21,045 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-08 07:46:21,045 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 2 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 07:46:21,045 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 223 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 07:46:21,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-08 07:46:21,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-08 07:46:21,107 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:46:21,108 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:46:21,108 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:46:21,108 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:46:21,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:46:21,109 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-04-08 07:46:21,109 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-08 07:46:21,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:46:21,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:46:21,110 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 54 states. [2022-04-08 07:46:21,110 INFO L87 Difference]: Start difference. First operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 54 states. [2022-04-08 07:46:21,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:46:21,111 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-04-08 07:46:21,111 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-08 07:46:21,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:46:21,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:46:21,111 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:46:21,111 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:46:21,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:46:21,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2022-04-08 07:46:21,112 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 53 [2022-04-08 07:46:21,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:46:21,113 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2022-04-08 07:46:21,113 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 07:46:21,113 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 57 transitions. [2022-04-08 07:46:21,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:46:21,586 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-08 07:46:21,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-08 07:46:21,586 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:46:21,586 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:46:21,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-08 07:46:21,786 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-08 07:46:21,787 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:46:21,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:46:21,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1953308764, now seen corresponding path program 5 times [2022-04-08 07:46:21,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:46:21,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1447185955] [2022-04-08 07:46:21,882 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:46:21,882 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:46:21,882 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:46:21,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1953308764, now seen corresponding path program 6 times [2022-04-08 07:46:21,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:46:21,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645946283] [2022-04-08 07:46:21,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:46:21,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:46:21,892 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:46:21,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [854418038] [2022-04-08 07:46:21,892 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 07:46:21,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:46:21,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:46:21,912 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:46:21,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process