/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 07:44:11,653 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 07:44:11,654 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 07:44:11,690 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 07:44:11,691 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 07:44:11,692 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 07:44:11,695 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 07:44:11,700 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 07:44:11,702 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 07:44:11,706 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 07:44:11,707 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 07:44:11,708 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 07:44:11,709 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 07:44:11,711 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 07:44:11,712 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 07:44:11,714 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 07:44:11,715 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 07:44:11,716 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 07:44:11,718 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 07:44:11,723 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 07:44:11,725 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 07:44:11,726 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 07:44:11,727 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 07:44:11,728 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 07:44:11,729 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 07:44:11,735 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 07:44:11,735 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 07:44:11,736 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 07:44:11,737 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 07:44:11,737 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 07:44:11,739 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 07:44:11,739 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 07:44:11,740 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 07:44:11,741 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 07:44:11,741 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 07:44:11,742 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 07:44:11,742 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 07:44:11,743 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 07:44:11,743 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 07:44:11,743 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 07:44:11,744 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 07:44:11,745 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 07:44:11,746 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:44:11,755 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 07:44:11,755 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 07:44:11,756 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 07:44:11,757 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 07:44:11,757 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 07:44:11,757 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 07:44:11,757 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 07:44:11,757 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 07:44:11,757 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 07:44:11,758 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 07:44:11,758 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 07:44:11,758 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 07:44:11,759 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 07:44:11,759 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 07:44:11,759 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 07:44:11,759 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 07:44:11,759 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 07:44:11,759 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 07:44:11,759 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 07:44:11,760 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 07:44:11,760 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 07:44:11,760 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 07:44:11,760 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 07:44:11,760 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 07:44:11,760 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 07:44:11,760 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:44:11,978 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 07:44:12,003 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 07:44:12,006 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 07:44:12,006 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 07:44:12,011 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 07:44:12,013 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound1.c [2022-04-08 07:44:12,067 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86e3b5ffd/9c017e3feea84282bf28d3d6e0222b64/FLAG16b87f34b [2022-04-08 07:44:12,442 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 07:44:12,442 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound1.c [2022-04-08 07:44:12,447 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86e3b5ffd/9c017e3feea84282bf28d3d6e0222b64/FLAG16b87f34b [2022-04-08 07:44:12,459 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86e3b5ffd/9c017e3feea84282bf28d3d6e0222b64 [2022-04-08 07:44:12,462 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 07:44:12,463 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 07:44:12,464 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 07:44:12,464 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 07:44:12,467 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 07:44:12,468 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 07:44:12" (1/1) ... [2022-04-08 07:44:12,468 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63c868b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:44:12, skipping insertion in model container [2022-04-08 07:44:12,469 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 07:44:12" (1/1) ... [2022-04-08 07:44:12,474 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 07:44:12,485 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 07:44:12,625 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound1.c[458,471] [2022-04-08 07:44:12,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 07:44:12,660 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 07:44:12,671 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound1.c[458,471] [2022-04-08 07:44:12,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 07:44:12,703 INFO L208 MainTranslator]: Completed translation [2022-04-08 07:44:12,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:44:12 WrapperNode [2022-04-08 07:44:12,704 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 07:44:12,705 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 07:44:12,705 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 07:44:12,705 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 07:44:12,714 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:44:12" (1/1) ... [2022-04-08 07:44:12,714 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:44:12" (1/1) ... [2022-04-08 07:44:12,722 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:44:12" (1/1) ... [2022-04-08 07:44:12,722 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:44:12" (1/1) ... [2022-04-08 07:44:12,734 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:44:12" (1/1) ... [2022-04-08 07:44:12,739 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:44:12" (1/1) ... [2022-04-08 07:44:12,740 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:44:12" (1/1) ... [2022-04-08 07:44:12,744 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 07:44:12,745 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 07:44:12,745 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 07:44:12,745 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 07:44:12,746 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:44:12" (1/1) ... [2022-04-08 07:44:12,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 07:44:12,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:44:12,772 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:44:12,799 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:44:12,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 07:44:12,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 07:44:12,821 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 07:44:12,821 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 07:44:12,821 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 07:44:12,821 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 07:44:12,821 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 07:44:12,821 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 07:44:12,822 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 07:44:12,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 07:44:12,822 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-08 07:44:12,823 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 07:44:12,823 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 07:44:12,823 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 07:44:12,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 07:44:12,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 07:44:12,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 07:44:12,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 07:44:12,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 07:44:12,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 07:44:12,879 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 07:44:12,881 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 07:44:13,032 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 07:44:13,037 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 07:44:13,038 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 07:44:13,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 07:44:13 BoogieIcfgContainer [2022-04-08 07:44:13,039 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 07:44:13,040 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 07:44:13,040 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 07:44:13,043 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 07:44:13,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 07:44:12" (1/3) ... [2022-04-08 07:44:13,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf9cf6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 07:44:13, skipping insertion in model container [2022-04-08 07:44:13,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:44:12" (2/3) ... [2022-04-08 07:44:13,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf9cf6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 07:44:13, skipping insertion in model container [2022-04-08 07:44:13,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 07:44:13" (3/3) ... [2022-04-08 07:44:13,045 INFO L111 eAbstractionObserver]: Analyzing ICFG ps4-ll_valuebound1.c [2022-04-08 07:44:13,049 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 07:44:13,049 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 07:44:13,085 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 07:44:13,090 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:44:13,090 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 07:44:13,105 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 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:44:13,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 07:44:13,111 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:44:13,112 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:44:13,112 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:44:13,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:44:13,117 INFO L85 PathProgramCache]: Analyzing trace with hash -630235283, now seen corresponding path program 1 times [2022-04-08 07:44:13,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:13,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [727199136] [2022-04-08 07:44:13,139 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:44:13,139 INFO L85 PathProgramCache]: Analyzing trace with hash -630235283, now seen corresponding path program 2 times [2022-04-08 07:44:13,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:44:13,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539700457] [2022-04-08 07:44:13,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:44:13,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:44:13,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:44:13,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 07:44:13,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:44:13,311 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {31#true} is VALID [2022-04-08 07:44:13,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-08 07:44:13,311 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #60#return; {31#true} is VALID [2022-04-08 07:44:13,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 07:44:13,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:44:13,320 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-04-08 07:44:13,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-04-08 07:44:13,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#false} assume true; {32#false} is VALID [2022-04-08 07:44:13,322 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#false} {31#true} #52#return; {32#false} is VALID [2022-04-08 07:44:13,323 INFO L272 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 07:44:13,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {31#true} is VALID [2022-04-08 07:44:13,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-08 07:44:13,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #60#return; {31#true} is VALID [2022-04-08 07:44:13,324 INFO L272 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret5 := main(); {31#true} is VALID [2022-04-08 07:44:13,325 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#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; {31#true} is VALID [2022-04-08 07:44:13,325 INFO L272 TraceCheckUtils]: 6: Hoare triple {31#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 1 then 1 else 0)); {31#true} is VALID [2022-04-08 07:44:13,325 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-04-08 07:44:13,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-04-08 07:44:13,326 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#false} assume true; {32#false} is VALID [2022-04-08 07:44:13,326 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {32#false} {31#true} #52#return; {32#false} is VALID [2022-04-08 07:44:13,327 INFO L290 TraceCheckUtils]: 11: Hoare triple {32#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {32#false} is VALID [2022-04-08 07:44:13,327 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#false} assume false; {32#false} is VALID [2022-04-08 07:44:13,327 INFO L272 TraceCheckUtils]: 13: Hoare triple {32#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {32#false} is VALID [2022-04-08 07:44:13,328 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2022-04-08 07:44:13,328 INFO L290 TraceCheckUtils]: 15: Hoare triple {32#false} assume 0 == ~cond; {32#false} is VALID [2022-04-08 07:44:13,328 INFO L290 TraceCheckUtils]: 16: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-04-08 07:44:13,329 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:44:13,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:44:13,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539700457] [2022-04-08 07:44:13,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539700457] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:44:13,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:44:13,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 07:44:13,333 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:44:13,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [727199136] [2022-04-08 07:44:13,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [727199136] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:44:13,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:44:13,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 07:44:13,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978521964] [2022-04-08 07:44:13,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:44:13,340 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:44:13,341 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:44:13,344 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:44:13,388 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:44:13,388 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 07:44:13,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:13,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 07:44:13,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 07:44:13,418 INFO L87 Difference]: Start difference. First operand has 28 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 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:44:13,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:13,582 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2022-04-08 07:44:13,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 07:44:13,582 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:44:13,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:44:13,591 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:44:13,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-08 07:44:13,603 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:44:13,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-08 07:44:13,610 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2022-04-08 07:44:13,708 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:13,715 INFO L225 Difference]: With dead ends: 47 [2022-04-08 07:44:13,715 INFO L226 Difference]: Without dead ends: 23 [2022-04-08 07:44:13,717 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:44:13,723 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:44:13,724 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 29 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 07:44:13,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-08 07:44:13,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-08 07:44:13,747 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:44:13,748 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 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:44:13,748 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 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:44:13,749 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 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:44:13,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:13,753 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-08 07:44:13,753 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-08 07:44:13,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:13,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:13,754 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 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 23 states. [2022-04-08 07:44:13,754 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 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 23 states. [2022-04-08 07:44:13,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:13,757 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-08 07:44:13,758 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-08 07:44:13,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:13,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:13,758 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:44:13,758 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:44:13,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 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:44:13,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-04-08 07:44:13,762 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 17 [2022-04-08 07:44:13,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:44:13,762 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-04-08 07:44:13,763 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:44:13,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 25 transitions. [2022-04-08 07:44:13,789 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:13,790 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-08 07:44:13,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 07:44:13,790 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:44:13,790 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:44:13,791 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 07:44:13,791 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:44:13,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:44:13,792 INFO L85 PathProgramCache]: Analyzing trace with hash 51610547, now seen corresponding path program 1 times [2022-04-08 07:44:13,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:13,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1840186026] [2022-04-08 07:44:13,793 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:44:13,793 INFO L85 PathProgramCache]: Analyzing trace with hash 51610547, now seen corresponding path program 2 times [2022-04-08 07:44:13,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:44:13,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897058377] [2022-04-08 07:44:13,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:44:13,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:44:13,811 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:44:13,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [111930161] [2022-04-08 07:44:13,812 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:44:13,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:44:13,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:44:13,814 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:44:13,867 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:44:13,895 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 07:44:13,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:44:13,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 07:44:13,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:44:13,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:44:14,110 INFO L272 TraceCheckUtils]: 0: Hoare triple {229#true} call ULTIMATE.init(); {229#true} is VALID [2022-04-08 07:44:14,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {229#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); {229#true} is VALID [2022-04-08 07:44:14,111 INFO L290 TraceCheckUtils]: 2: Hoare triple {229#true} assume true; {229#true} is VALID [2022-04-08 07:44:14,111 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {229#true} {229#true} #60#return; {229#true} is VALID [2022-04-08 07:44:14,111 INFO L272 TraceCheckUtils]: 4: Hoare triple {229#true} call #t~ret5 := main(); {229#true} is VALID [2022-04-08 07:44:14,112 INFO L290 TraceCheckUtils]: 5: Hoare triple {229#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; {229#true} is VALID [2022-04-08 07:44:14,112 INFO L272 TraceCheckUtils]: 6: Hoare triple {229#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 1 then 1 else 0)); {229#true} is VALID [2022-04-08 07:44:14,113 INFO L290 TraceCheckUtils]: 7: Hoare triple {229#true} ~cond := #in~cond; {229#true} is VALID [2022-04-08 07:44:14,113 INFO L290 TraceCheckUtils]: 8: Hoare triple {229#true} assume !(0 == ~cond); {229#true} is VALID [2022-04-08 07:44:14,114 INFO L290 TraceCheckUtils]: 9: Hoare triple {229#true} assume true; {229#true} is VALID [2022-04-08 07:44:14,114 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {229#true} {229#true} #52#return; {229#true} is VALID [2022-04-08 07:44:14,115 INFO L290 TraceCheckUtils]: 11: Hoare triple {229#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {267#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:14,115 INFO L290 TraceCheckUtils]: 12: Hoare triple {267#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {267#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:14,117 INFO L272 TraceCheckUtils]: 13: Hoare triple {267#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {274#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:44:14,118 INFO L290 TraceCheckUtils]: 14: Hoare triple {274#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {278#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:44:14,118 INFO L290 TraceCheckUtils]: 15: Hoare triple {278#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {230#false} is VALID [2022-04-08 07:44:14,119 INFO L290 TraceCheckUtils]: 16: Hoare triple {230#false} assume !false; {230#false} is VALID [2022-04-08 07:44:14,120 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:44:14,120 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 07:44:14,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:44:14,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897058377] [2022-04-08 07:44:14,121 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:44:14,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111930161] [2022-04-08 07:44:14,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111930161] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:44:14,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:44:14,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 07:44:14,123 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:44:14,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1840186026] [2022-04-08 07:44:14,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1840186026] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:44:14,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:44:14,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 07:44:14,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443589067] [2022-04-08 07:44:14,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:44:14,126 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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 17 [2022-04-08 07:44:14,126 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:44:14,127 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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:44:14,142 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:44:14,142 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 07:44:14,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:14,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 07:44:14,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 07:44:14,143 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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:44:14,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:14,531 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-08 07:44:14,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 07:44:14,532 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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 17 [2022-04-08 07:44:14,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:44:14,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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:44:14,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-08 07:44:14,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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:44:14,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-08 07:44:14,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2022-04-08 07:44:14,591 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:44:14,592 INFO L225 Difference]: With dead ends: 34 [2022-04-08 07:44:14,593 INFO L226 Difference]: Without dead ends: 30 [2022-04-08 07:44:14,593 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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:44:14,594 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:44:14,595 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 77 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 07:44:14,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-08 07:44:14,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-08 07:44:14,605 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:44:14,607 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 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:44:14,608 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 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:44:14,608 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 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:44:14,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:14,612 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-08 07:44:14,612 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-08 07:44:14,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:14,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:14,613 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 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 30 states. [2022-04-08 07:44:14,613 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 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 30 states. [2022-04-08 07:44:14,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:14,616 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-08 07:44:14,616 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-08 07:44:14,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:14,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:14,617 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:44:14,617 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:44:14,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 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:44:14,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-04-08 07:44:14,620 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 17 [2022-04-08 07:44:14,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:44:14,620 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-04-08 07:44:14,620 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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:44:14,620 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 32 transitions. [2022-04-08 07:44:14,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:14,655 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-08 07:44:14,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 07:44:14,656 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:44:14,656 INFO L499 BasicCegarLoop]: trace histogram [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:44:14,679 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:44:14,871 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:44:14,872 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:44:14,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:44:14,872 INFO L85 PathProgramCache]: Analyzing trace with hash 311787922, now seen corresponding path program 1 times [2022-04-08 07:44:14,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:14,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [265809410] [2022-04-08 07:44:15,089 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:44:15,089 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:44:15,089 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:44:15,090 INFO L85 PathProgramCache]: Analyzing trace with hash 311787922, now seen corresponding path program 2 times [2022-04-08 07:44:15,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:44:15,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76952202] [2022-04-08 07:44:15,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:44:15,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:44:15,117 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:44:15,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [414792636] [2022-04-08 07:44:15,122 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:44:15,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:44:15,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:44:15,128 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:44:15,129 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:44:15,173 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:44:15,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:44:15,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 07:44:15,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:44:15,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:44:15,346 INFO L272 TraceCheckUtils]: 0: Hoare triple {474#true} call ULTIMATE.init(); {474#true} is VALID [2022-04-08 07:44:15,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {474#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); {474#true} is VALID [2022-04-08 07:44:15,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-08 07:44:15,346 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {474#true} {474#true} #60#return; {474#true} is VALID [2022-04-08 07:44:15,347 INFO L272 TraceCheckUtils]: 4: Hoare triple {474#true} call #t~ret5 := main(); {474#true} is VALID [2022-04-08 07:44:15,347 INFO L290 TraceCheckUtils]: 5: Hoare triple {474#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; {474#true} is VALID [2022-04-08 07:44:15,348 INFO L272 TraceCheckUtils]: 6: Hoare triple {474#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 1 then 1 else 0)); {474#true} is VALID [2022-04-08 07:44:15,349 INFO L290 TraceCheckUtils]: 7: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-08 07:44:15,349 INFO L290 TraceCheckUtils]: 8: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-08 07:44:15,349 INFO L290 TraceCheckUtils]: 9: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-08 07:44:15,349 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {474#true} {474#true} #52#return; {474#true} is VALID [2022-04-08 07:44:15,352 INFO L290 TraceCheckUtils]: 11: Hoare triple {474#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {512#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:15,353 INFO L290 TraceCheckUtils]: 12: Hoare triple {512#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {512#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:15,353 INFO L272 TraceCheckUtils]: 13: Hoare triple {512#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {474#true} is VALID [2022-04-08 07:44:15,353 INFO L290 TraceCheckUtils]: 14: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-08 07:44:15,354 INFO L290 TraceCheckUtils]: 15: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-08 07:44:15,354 INFO L290 TraceCheckUtils]: 16: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-08 07:44:15,354 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {474#true} {512#(and (= main_~x~0 0) (= main_~y~0 0))} #54#return; {512#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:15,355 INFO L290 TraceCheckUtils]: 18: Hoare triple {512#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {534#(and (= main_~y~0 1) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} is VALID [2022-04-08 07:44:15,356 INFO L290 TraceCheckUtils]: 19: Hoare triple {534#(and (= main_~y~0 1) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} assume !false; {534#(and (= main_~y~0 1) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} is VALID [2022-04-08 07:44:15,357 INFO L272 TraceCheckUtils]: 20: Hoare triple {534#(and (= main_~y~0 1) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {541#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:44:15,357 INFO L290 TraceCheckUtils]: 21: Hoare triple {541#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {545#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:44:15,358 INFO L290 TraceCheckUtils]: 22: Hoare triple {545#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {475#false} is VALID [2022-04-08 07:44:15,358 INFO L290 TraceCheckUtils]: 23: Hoare triple {475#false} assume !false; {475#false} is VALID [2022-04-08 07:44:15,358 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:44:15,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:44:15,537 INFO L290 TraceCheckUtils]: 23: Hoare triple {475#false} assume !false; {475#false} is VALID [2022-04-08 07:44:15,538 INFO L290 TraceCheckUtils]: 22: Hoare triple {545#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {475#false} is VALID [2022-04-08 07:44:15,538 INFO L290 TraceCheckUtils]: 21: Hoare triple {541#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {545#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:44:15,539 INFO L272 TraceCheckUtils]: 20: Hoare triple {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {541#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:44:15,540 INFO L290 TraceCheckUtils]: 19: Hoare triple {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !false; {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-08 07:44:15,550 INFO L290 TraceCheckUtils]: 18: Hoare triple {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-08 07:44:15,551 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {474#true} {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} #54#return; {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-08 07:44:15,551 INFO L290 TraceCheckUtils]: 16: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-08 07:44:15,551 INFO L290 TraceCheckUtils]: 15: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-08 07:44:15,551 INFO L290 TraceCheckUtils]: 14: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-08 07:44:15,551 INFO L272 TraceCheckUtils]: 13: Hoare triple {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {474#true} is VALID [2022-04-08 07:44:15,552 INFO L290 TraceCheckUtils]: 12: Hoare triple {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !false; {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-08 07:44:15,553 INFO L290 TraceCheckUtils]: 11: Hoare triple {474#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-08 07:44:15,553 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {474#true} {474#true} #52#return; {474#true} is VALID [2022-04-08 07:44:15,553 INFO L290 TraceCheckUtils]: 9: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-08 07:44:15,553 INFO L290 TraceCheckUtils]: 8: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-08 07:44:15,553 INFO L290 TraceCheckUtils]: 7: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-08 07:44:15,554 INFO L272 TraceCheckUtils]: 6: Hoare triple {474#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 1 then 1 else 0)); {474#true} is VALID [2022-04-08 07:44:15,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {474#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; {474#true} is VALID [2022-04-08 07:44:15,554 INFO L272 TraceCheckUtils]: 4: Hoare triple {474#true} call #t~ret5 := main(); {474#true} is VALID [2022-04-08 07:44:15,554 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {474#true} {474#true} #60#return; {474#true} is VALID [2022-04-08 07:44:15,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-08 07:44:15,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {474#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); {474#true} is VALID [2022-04-08 07:44:15,555 INFO L272 TraceCheckUtils]: 0: Hoare triple {474#true} call ULTIMATE.init(); {474#true} is VALID [2022-04-08 07:44:15,555 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 07:44:15,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:44:15,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76952202] [2022-04-08 07:44:15,555 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:44:15,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414792636] [2022-04-08 07:44:15,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414792636] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 07:44:15,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:44:15,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-08 07:44:15,556 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:44:15,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [265809410] [2022-04-08 07:44:15,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [265809410] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:44:15,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:44:15,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 07:44:15,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922557919] [2022-04-08 07:44:15,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:44:15,557 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (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 24 [2022-04-08 07:44:15,558 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:44:15,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (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:44:15,590 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:15,591 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 07:44:15,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:15,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 07:44:15,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 07:44:15,592 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (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:44:15,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:15,717 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2022-04-08 07:44:15,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 07:44:15,717 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (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 24 [2022-04-08 07:44:15,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:44:15,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (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:44:15,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-08 07:44:15,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (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:44:15,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-08 07:44:15,721 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 30 transitions. [2022-04-08 07:44:15,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:15,765 INFO L225 Difference]: With dead ends: 36 [2022-04-08 07:44:15,765 INFO L226 Difference]: Without dead ends: 31 [2022-04-08 07:44:15,765 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 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:44:15,766 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:44:15,767 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 70 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 07:44:15,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-08 07:44:15,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-08 07:44:15,785 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:44:15,786 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:44:15,787 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:44:15,788 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:44:15,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:15,790 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-08 07:44:15,790 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-08 07:44:15,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:15,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:15,791 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 31 states. [2022-04-08 07:44:15,791 INFO L87 Difference]: Start difference. First operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 31 states. [2022-04-08 07:44:15,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:15,793 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-08 07:44:15,793 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-08 07:44:15,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:15,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:15,794 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:44:15,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:44:15,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:44:15,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-04-08 07:44:15,796 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 24 [2022-04-08 07:44:15,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:44:15,796 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-04-08 07:44:15,796 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (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:44:15,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 31 transitions. [2022-04-08 07:44:15,841 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:44:15,841 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-08 07:44:15,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 07:44:15,842 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:44:15,842 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:44:15,870 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:44:16,055 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:44:16,055 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:44:16,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:44:16,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1417466424, now seen corresponding path program 1 times [2022-04-08 07:44:16,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:16,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [567627800] [2022-04-08 07:44:16,186 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:44:16,187 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:44:16,187 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:44:16,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1417466424, now seen corresponding path program 2 times [2022-04-08 07:44:16,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:44:16,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532302836] [2022-04-08 07:44:16,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:44:16,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:44:16,214 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:44:16,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2009653008] [2022-04-08 07:44:16,214 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:44:16,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:44:16,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:44:16,228 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:44:16,246 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:44:16,272 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:44:16,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:44:16,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 07:44:16,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:44:16,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:44:16,563 INFO L272 TraceCheckUtils]: 0: Hoare triple {822#true} call ULTIMATE.init(); {822#true} is VALID [2022-04-08 07:44:16,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {822#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); {822#true} is VALID [2022-04-08 07:44:16,564 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-08 07:44:16,564 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {822#true} {822#true} #60#return; {822#true} is VALID [2022-04-08 07:44:16,564 INFO L272 TraceCheckUtils]: 4: Hoare triple {822#true} call #t~ret5 := main(); {822#true} is VALID [2022-04-08 07:44:16,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {822#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; {822#true} is VALID [2022-04-08 07:44:16,564 INFO L272 TraceCheckUtils]: 6: Hoare triple {822#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 1 then 1 else 0)); {822#true} is VALID [2022-04-08 07:44:16,565 INFO L290 TraceCheckUtils]: 7: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-08 07:44:16,565 INFO L290 TraceCheckUtils]: 8: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-08 07:44:16,565 INFO L290 TraceCheckUtils]: 9: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-08 07:44:16,565 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {822#true} {822#true} #52#return; {822#true} is VALID [2022-04-08 07:44:16,566 INFO L290 TraceCheckUtils]: 11: Hoare triple {822#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {860#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:16,566 INFO L290 TraceCheckUtils]: 12: Hoare triple {860#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {860#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:16,566 INFO L272 TraceCheckUtils]: 13: Hoare triple {860#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {822#true} is VALID [2022-04-08 07:44:16,566 INFO L290 TraceCheckUtils]: 14: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-08 07:44:16,567 INFO L290 TraceCheckUtils]: 15: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-08 07:44:16,567 INFO L290 TraceCheckUtils]: 16: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-08 07:44:16,569 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {822#true} {860#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {860#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:16,570 INFO L290 TraceCheckUtils]: 18: Hoare triple {860#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 07:44:16,570 INFO L290 TraceCheckUtils]: 19: Hoare triple {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !false; {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 07:44:16,570 INFO L272 TraceCheckUtils]: 20: Hoare triple {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {822#true} is VALID [2022-04-08 07:44:16,570 INFO L290 TraceCheckUtils]: 21: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-08 07:44:16,571 INFO L290 TraceCheckUtils]: 22: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-08 07:44:16,571 INFO L290 TraceCheckUtils]: 23: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-08 07:44:16,572 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {822#true} {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #54#return; {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 07:44:16,573 INFO L290 TraceCheckUtils]: 25: Hoare triple {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {904#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-08 07:44:16,575 INFO L272 TraceCheckUtils]: 26: Hoare triple {904#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {908#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:44:16,576 INFO L290 TraceCheckUtils]: 27: Hoare triple {908#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {912#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:44:16,587 INFO L290 TraceCheckUtils]: 28: Hoare triple {912#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {823#false} is VALID [2022-04-08 07:44:16,587 INFO L290 TraceCheckUtils]: 29: Hoare triple {823#false} assume !false; {823#false} is VALID [2022-04-08 07:44:16,588 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 07:44:16,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:44:16,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:44:16,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532302836] [2022-04-08 07:44:16,989 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:44:16,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009653008] [2022-04-08 07:44:16,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009653008] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:44:16,989 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:44:16,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-08 07:44:16,990 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:44:16,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [567627800] [2022-04-08 07:44:16,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [567627800] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:44:16,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:44:16,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 07:44:16,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335836762] [2022-04-08 07:44:16,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:44:16,997 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2022-04-08 07:44:16,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:44:16,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 07:44:17,020 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:44:17,021 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 07:44:17,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:17,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 07:44:17,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-08 07:44:17,024 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 07:44:17,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:17,237 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2022-04-08 07:44:17,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 07:44:17,238 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2022-04-08 07:44:17,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:44:17,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 07:44:17,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-08 07:44:17,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 07:44:17,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-08 07:44:17,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 36 transitions. [2022-04-08 07:44:17,275 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:44:17,276 INFO L225 Difference]: With dead ends: 39 [2022-04-08 07:44:17,276 INFO L226 Difference]: Without dead ends: 34 [2022-04-08 07:44:17,277 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-08 07:44:17,277 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 07:44:17,278 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 115 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 07:44:17,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-08 07:44:17,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-08 07:44:17,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:44:17,298 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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:44:17,300 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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:44:17,302 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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:44:17,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:17,308 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-04-08 07:44:17,308 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-08 07:44:17,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:17,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:17,309 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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 34 states. [2022-04-08 07:44:17,309 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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 34 states. [2022-04-08 07:44:17,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:17,310 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-04-08 07:44:17,311 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-08 07:44:17,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:17,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:17,311 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:44:17,311 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:44:17,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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:44:17,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2022-04-08 07:44:17,313 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 30 [2022-04-08 07:44:17,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:44:17,313 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2022-04-08 07:44:17,313 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 07:44:17,313 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 35 transitions. [2022-04-08 07:44:17,368 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:44:17,368 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-08 07:44:17,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 07:44:17,371 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:44:17,371 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:44:17,399 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:44:17,583 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:44:17,584 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:44:17,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:44:17,584 INFO L85 PathProgramCache]: Analyzing trace with hash -2045316535, now seen corresponding path program 3 times [2022-04-08 07:44:17,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:17,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1677708677] [2022-04-08 07:44:17,682 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:44:17,682 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:44:17,682 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:44:17,683 INFO L85 PathProgramCache]: Analyzing trace with hash -2045316535, now seen corresponding path program 4 times [2022-04-08 07:44:17,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:44:17,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456149625] [2022-04-08 07:44:17,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:44:17,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:44:17,695 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:44:17,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [289553292] [2022-04-08 07:44:17,695 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 07:44:17,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:44:17,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:44:17,696 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:44:17,698 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:44:17,731 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 07:44:17,731 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:44:17,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 07:44:17,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:44:17,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:44:17,971 INFO L272 TraceCheckUtils]: 0: Hoare triple {1178#true} call ULTIMATE.init(); {1178#true} is VALID [2022-04-08 07:44:17,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {1178#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); {1178#true} is VALID [2022-04-08 07:44:17,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-08 07:44:17,972 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1178#true} {1178#true} #60#return; {1178#true} is VALID [2022-04-08 07:44:17,972 INFO L272 TraceCheckUtils]: 4: Hoare triple {1178#true} call #t~ret5 := main(); {1178#true} is VALID [2022-04-08 07:44:17,973 INFO L290 TraceCheckUtils]: 5: Hoare triple {1178#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; {1178#true} is VALID [2022-04-08 07:44:17,973 INFO L272 TraceCheckUtils]: 6: Hoare triple {1178#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 1 then 1 else 0)); {1178#true} is VALID [2022-04-08 07:44:17,973 INFO L290 TraceCheckUtils]: 7: Hoare triple {1178#true} ~cond := #in~cond; {1204#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 07:44:17,974 INFO L290 TraceCheckUtils]: 8: Hoare triple {1204#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1208#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 07:44:17,974 INFO L290 TraceCheckUtils]: 9: Hoare triple {1208#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1208#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 07:44:17,975 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1208#(not (= |assume_abort_if_not_#in~cond| 0))} {1178#true} #52#return; {1215#(and (<= 0 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-08 07:44:17,975 INFO L290 TraceCheckUtils]: 11: Hoare triple {1215#(and (<= 0 main_~k~0) (<= main_~k~0 1))} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1219#(and (<= 0 main_~k~0) (<= main_~k~0 1) (<= 0 main_~c~0))} is VALID [2022-04-08 07:44:17,976 INFO L290 TraceCheckUtils]: 12: Hoare triple {1219#(and (<= 0 main_~k~0) (<= main_~k~0 1) (<= 0 main_~c~0))} assume !false; {1219#(and (<= 0 main_~k~0) (<= main_~k~0 1) (<= 0 main_~c~0))} is VALID [2022-04-08 07:44:17,976 INFO L272 TraceCheckUtils]: 13: Hoare triple {1219#(and (<= 0 main_~k~0) (<= main_~k~0 1) (<= 0 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1178#true} is VALID [2022-04-08 07:44:17,976 INFO L290 TraceCheckUtils]: 14: Hoare triple {1178#true} ~cond := #in~cond; {1178#true} is VALID [2022-04-08 07:44:17,976 INFO L290 TraceCheckUtils]: 15: Hoare triple {1178#true} assume !(0 == ~cond); {1178#true} is VALID [2022-04-08 07:44:17,976 INFO L290 TraceCheckUtils]: 16: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-08 07:44:17,977 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1178#true} {1219#(and (<= 0 main_~k~0) (<= main_~k~0 1) (<= 0 main_~c~0))} #54#return; {1219#(and (<= 0 main_~k~0) (<= main_~k~0 1) (<= 0 main_~c~0))} is VALID [2022-04-08 07:44:17,978 INFO L290 TraceCheckUtils]: 18: Hoare triple {1219#(and (<= 0 main_~k~0) (<= main_~k~0 1) (<= 0 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1241#(and (<= 1 main_~c~0) (<= 0 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-08 07:44:17,978 INFO L290 TraceCheckUtils]: 19: Hoare triple {1241#(and (<= 1 main_~c~0) (<= 0 main_~k~0) (<= main_~k~0 1))} assume !false; {1241#(and (<= 1 main_~c~0) (<= 0 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-08 07:44:17,978 INFO L272 TraceCheckUtils]: 20: Hoare triple {1241#(and (<= 1 main_~c~0) (<= 0 main_~k~0) (<= main_~k~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1178#true} is VALID [2022-04-08 07:44:17,978 INFO L290 TraceCheckUtils]: 21: Hoare triple {1178#true} ~cond := #in~cond; {1178#true} is VALID [2022-04-08 07:44:17,978 INFO L290 TraceCheckUtils]: 22: Hoare triple {1178#true} assume !(0 == ~cond); {1178#true} is VALID [2022-04-08 07:44:17,979 INFO L290 TraceCheckUtils]: 23: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-08 07:44:17,979 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1178#true} {1241#(and (<= 1 main_~c~0) (<= 0 main_~k~0) (<= main_~k~0 1))} #54#return; {1241#(and (<= 1 main_~c~0) (<= 0 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-08 07:44:17,980 INFO L290 TraceCheckUtils]: 25: Hoare triple {1241#(and (<= 1 main_~c~0) (<= 0 main_~k~0) (<= main_~k~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1179#false} is VALID [2022-04-08 07:44:17,980 INFO L290 TraceCheckUtils]: 26: Hoare triple {1179#false} assume !false; {1179#false} is VALID [2022-04-08 07:44:17,980 INFO L272 TraceCheckUtils]: 27: Hoare triple {1179#false} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1179#false} is VALID [2022-04-08 07:44:17,980 INFO L290 TraceCheckUtils]: 28: Hoare triple {1179#false} ~cond := #in~cond; {1179#false} is VALID [2022-04-08 07:44:17,980 INFO L290 TraceCheckUtils]: 29: Hoare triple {1179#false} assume !(0 == ~cond); {1179#false} is VALID [2022-04-08 07:44:17,981 INFO L290 TraceCheckUtils]: 30: Hoare triple {1179#false} assume true; {1179#false} is VALID [2022-04-08 07:44:17,981 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1179#false} {1179#false} #54#return; {1179#false} is VALID [2022-04-08 07:44:17,981 INFO L290 TraceCheckUtils]: 32: Hoare triple {1179#false} assume !(~c~0 < ~k~0); {1179#false} is VALID [2022-04-08 07:44:17,981 INFO L272 TraceCheckUtils]: 33: Hoare triple {1179#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1179#false} is VALID [2022-04-08 07:44:17,981 INFO L290 TraceCheckUtils]: 34: Hoare triple {1179#false} ~cond := #in~cond; {1179#false} is VALID [2022-04-08 07:44:17,981 INFO L290 TraceCheckUtils]: 35: Hoare triple {1179#false} assume 0 == ~cond; {1179#false} is VALID [2022-04-08 07:44:17,981 INFO L290 TraceCheckUtils]: 36: Hoare triple {1179#false} assume !false; {1179#false} is VALID [2022-04-08 07:44:17,982 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 07:44:17,982 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 07:44:17,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:44:17,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456149625] [2022-04-08 07:44:17,982 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:44:17,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289553292] [2022-04-08 07:44:17,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289553292] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:44:17,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:44:17,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 07:44:17,983 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:44:17,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1677708677] [2022-04-08 07:44:17,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1677708677] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:44:17,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:44:17,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 07:44:17,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283248342] [2022-04-08 07:44:17,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:44:17,984 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2022-04-08 07:44:17,984 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:44:17,985 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 07:44:18,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:18,014 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 07:44:18,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:18,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 07:44:18,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-08 07:44:18,016 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 07:44:18,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:18,114 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-08 07:44:18,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 07:44:18,114 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2022-04-08 07:44:18,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:44:18,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 07:44:18,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-04-08 07:44:18,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 07:44:18,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-04-08 07:44:18,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 34 transitions. [2022-04-08 07:44:18,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:18,144 INFO L225 Difference]: With dead ends: 38 [2022-04-08 07:44:18,144 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 07:44:18,145 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-08 07:44:18,146 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 4 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:44:18,146 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 64 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 07:44:18,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 07:44:18,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 07:44:18,147 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:44:18,147 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 07:44:18,147 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 07:44:18,147 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 07:44:18,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:18,147 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 07:44:18,147 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 07:44:18,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:18,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:18,148 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 07:44:18,148 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 07:44:18,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:18,148 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 07:44:18,148 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 07:44:18,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:18,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:18,148 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:44:18,148 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:44:18,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 07:44:18,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 07:44:18,149 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2022-04-08 07:44:18,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:44:18,149 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 07:44:18,149 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 07:44:18,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 07:44:18,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:18,149 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 07:44:18,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:18,152 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 07:44:18,177 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:44:18,369 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:44:18,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 07:44:18,660 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-08 07:44:18,661 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-08 07:44:18,661 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-08 07:44:18,661 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 6 8) the Hoare annotation is: true [2022-04-08 07:44:18,661 INFO L878 garLoopResultBuilder]: At program point L7(line 7) the Hoare annotation is: (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) [2022-04-08 07:44:18,661 INFO L878 garLoopResultBuilder]: At program point L7-2(lines 6 8) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-08 07:44:18,661 INFO L878 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 6 8) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-08 07:44:18,661 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 17 40) the Hoare annotation is: true [2022-04-08 07:44:18,661 INFO L878 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 1)) (.cse1 (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))) (or (and (<= 1 main_~c~0) .cse0 (= main_~y~0 1) (< 0 main_~k~0) .cse1 (<= main_~c~0 1)) (and (<= 0 main_~k~0) .cse0 (= main_~c~0 0) (= main_~y~0 0) .cse1))) [2022-04-08 07:44:18,661 INFO L878 garLoopResultBuilder]: At program point L28-1(lines 27 36) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 1)) (.cse1 (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))) (or (and (<= 1 main_~c~0) .cse0 (= main_~y~0 1) (< 0 main_~k~0) .cse1 (<= main_~c~0 1)) (and (<= 0 main_~k~0) .cse0 (= main_~c~0 0) (= main_~y~0 0) .cse1))) [2022-04-08 07:44:18,662 INFO L878 garLoopResultBuilder]: At program point L27-2(lines 27 36) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 1)) (.cse1 (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))) (or (and (<= 1 main_~c~0) .cse0 (= main_~y~0 1) (< 0 main_~k~0) .cse1 (<= main_~c~0 1)) (and (<= 0 main_~k~0) .cse0 (= main_~c~0 0) (= main_~y~0 0) .cse1))) [2022-04-08 07:44:18,662 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 17 40) the Hoare annotation is: true [2022-04-08 07:44:18,662 INFO L878 garLoopResultBuilder]: At program point L27-3(lines 27 36) the Hoare annotation is: (or (and (= main_~x~0 0) (= main_~y~0 0)) (and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0) (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)) (<= main_~c~0 1))) [2022-04-08 07:44:18,662 INFO L885 garLoopResultBuilder]: At program point L21(line 21) the Hoare annotation is: true [2022-04-08 07:44:18,662 INFO L878 garLoopResultBuilder]: At program point L21-1(line 21) the Hoare annotation is: (and (<= 0 main_~k~0) (<= main_~k~0 1)) [2022-04-08 07:44:18,662 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 17 40) the Hoare annotation is: true [2022-04-08 07:44:18,662 INFO L885 garLoopResultBuilder]: At program point L38(line 38) the Hoare annotation is: true [2022-04-08 07:44:18,662 INFO L878 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)) [2022-04-08 07:44:18,662 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 07:44:18,662 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 07:44:18,662 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 07:44:18,662 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 07:44:18,663 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 07:44:18,663 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 07:44:18,663 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 07:44:18,663 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 9 15) the Hoare annotation is: true [2022-04-08 07:44:18,663 INFO L878 garLoopResultBuilder]: At program point L11(lines 11 12) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-08 07:44:18,663 INFO L878 garLoopResultBuilder]: At program point L10(lines 10 13) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-08 07:44:18,663 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 9 15) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-08 07:44:18,663 INFO L878 garLoopResultBuilder]: At program point L10-2(lines 9 15) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-08 07:44:18,663 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-08 07:44:18,666 INFO L719 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2] [2022-04-08 07:44:18,667 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 07:44:18,678 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 07:44:18,680 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 07:44:18,698 INFO L163 areAnnotationChecker]: CFG has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 07:44:18,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 07:44:18 BoogieIcfgContainer [2022-04-08 07:44:18,708 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 07:44:18,709 INFO L158 Benchmark]: Toolchain (without parser) took 6245.90ms. Allocated memory was 175.1MB in the beginning and 210.8MB in the end (delta: 35.7MB). Free memory was 153.8MB in the beginning and 144.6MB in the end (delta: 9.2MB). Peak memory consumption was 45.5MB. Max. memory is 8.0GB. [2022-04-08 07:44:18,709 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 175.1MB. Free memory is still 142.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 07:44:18,709 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.51ms. Allocated memory is still 175.1MB. Free memory was 153.6MB in the beginning and 154.5MB in the end (delta: -932.7kB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-08 07:44:18,709 INFO L158 Benchmark]: Boogie Preprocessor took 39.80ms. Allocated memory is still 175.1MB. Free memory was 154.5MB in the beginning and 153.2MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 07:44:18,710 INFO L158 Benchmark]: RCFGBuilder took 293.95ms. Allocated memory is still 175.1MB. Free memory was 153.0MB in the beginning and 142.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 07:44:18,710 INFO L158 Benchmark]: TraceAbstraction took 5667.29ms. Allocated memory was 175.1MB in the beginning and 210.8MB in the end (delta: 35.7MB). Free memory was 142.0MB in the beginning and 145.1MB in the end (delta: -3.2MB). Peak memory consumption was 32.2MB. Max. memory is 8.0GB. [2022-04-08 07:44:18,714 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 175.1MB. Free memory is still 142.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 240.51ms. Allocated memory is still 175.1MB. Free memory was 153.6MB in the beginning and 154.5MB in the end (delta: -932.7kB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.80ms. Allocated memory is still 175.1MB. Free memory was 154.5MB in the beginning and 153.2MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 293.95ms. Allocated memory is still 175.1MB. Free memory was 153.0MB in the beginning and 142.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 5667.29ms. Allocated memory was 175.1MB in the beginning and 210.8MB in the end (delta: 35.7MB). Free memory was 142.0MB in the beginning and 145.1MB in the end (delta: -3.2MB). Peak memory consumption was 32.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.6s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 40 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 33 mSDsluCounter, 355 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 242 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 124 IncrementalHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 113 mSDtfsCounter, 124 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 153 GetRequests, 123 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=4, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 88 PreInvPairs, 124 NumberOfFragments, 343 HoareAnnotationTreeSize, 88 FomulaSimplifications, 24 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 28 FomulaSimplificationsInter, 29 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: (((((1 <= c && k <= 1) && y == 1) && 0 < k) && y * y * y * y + y * y + y * y * y * 2 == x * 4) && c <= 1) || ((((0 <= k && k <= 1) && c == 0) && y == 0) && y * y * y * y + y * y + y * y * y * 2 == x * 4) - ProcedureContractResult [Line: 6]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: !(\old(cond) == 0) && cond == \old(cond) - ProcedureContractResult [Line: 17]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 9]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: !(1 <= \old(cond)) || 1 <= cond RESULT: Ultimate proved your program to be correct! [2022-04-08 07:44:18,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...