/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/ps3-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 04:32:59,505 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 04:32:59,507 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 04:32:59,547 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 04:32:59,547 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 04:32:59,548 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 04:32:59,552 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 04:32:59,553 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 04:32:59,554 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 04:32:59,555 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 04:32:59,555 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 04:32:59,556 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 04:32:59,556 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 04:32:59,557 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 04:32:59,558 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 04:32:59,559 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 04:32:59,559 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 04:32:59,560 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 04:32:59,561 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 04:32:59,566 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 04:32:59,572 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 04:32:59,577 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 04:32:59,578 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 04:32:59,579 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 04:32:59,579 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 04:32:59,582 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 04:32:59,582 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 04:32:59,582 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 04:32:59,583 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 04:32:59,583 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 04:32:59,584 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 04:32:59,584 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 04:32:59,584 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 04:32:59,585 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 04:32:59,585 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 04:32:59,586 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 04:32:59,586 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 04:32:59,592 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 04:32:59,593 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 04:32:59,593 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 04:32:59,594 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 04:32:59,596 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 04:32:59,597 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 04:32:59,610 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 04:32:59,610 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 04:32:59,611 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 04:32:59,611 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 04:32:59,611 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 04:32:59,611 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 04:32:59,611 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 04:32:59,612 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 04:32:59,612 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 04:32:59,612 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 04:32:59,613 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 04:32:59,613 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 04:32:59,613 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 04:32:59,613 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 04:32:59,613 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 04:32:59,613 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 04:32:59,613 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 04:32:59,613 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 04:32:59,614 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:32:59,614 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 04:32:59,614 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 04:32:59,614 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 04:32:59,614 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 04:32:59,614 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 04:32:59,614 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 04:32:59,614 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 04:32:59,840 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 04:32:59,861 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 04:32:59,863 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 04:32:59,864 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 04:32:59,865 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 04:32:59,866 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/ps3-ll.c [2022-04-08 04:32:59,931 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d1e71d16/f8f7a828d22848edb17536c63f17c871/FLAG09edbb61f [2022-04-08 04:33:00,302 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 04:33:00,302 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/ps3-ll.c [2022-04-08 04:33:00,306 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d1e71d16/f8f7a828d22848edb17536c63f17c871/FLAG09edbb61f [2022-04-08 04:33:00,315 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d1e71d16/f8f7a828d22848edb17536c63f17c871 [2022-04-08 04:33:00,317 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 04:33:00,318 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 04:33:00,323 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 04:33:00,324 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 04:33:00,326 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 04:33:00,327 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:33:00" (1/1) ... [2022-04-08 04:33:00,328 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57cde434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:33:00, skipping insertion in model container [2022-04-08 04:33:00,328 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:33:00" (1/1) ... [2022-04-08 04:33:00,334 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 04:33:00,344 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 04:33:00,518 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/ps3-ll.c[458,471] [2022-04-08 04:33:00,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:33:00,561 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 04:33:00,575 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/ps3-ll.c[458,471] [2022-04-08 04:33:00,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:33:00,606 INFO L208 MainTranslator]: Completed translation [2022-04-08 04:33:00,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:33:00 WrapperNode [2022-04-08 04:33:00,607 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 04:33:00,608 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 04:33:00,608 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 04:33:00,608 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 04:33:00,618 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:33:00" (1/1) ... [2022-04-08 04:33:00,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:33:00" (1/1) ... [2022-04-08 04:33:00,623 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:33:00" (1/1) ... [2022-04-08 04:33:00,623 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:33:00" (1/1) ... [2022-04-08 04:33:00,626 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:33:00" (1/1) ... [2022-04-08 04:33:00,629 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:33:00" (1/1) ... [2022-04-08 04:33:00,630 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:33:00" (1/1) ... [2022-04-08 04:33:00,631 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 04:33:00,632 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 04:33:00,632 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 04:33:00,632 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 04:33:00,633 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:33:00" (1/1) ... [2022-04-08 04:33:00,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:33:00,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:33:00,658 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 04:33:00,673 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 04:33:00,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 04:33:00,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 04:33:00,697 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 04:33:00,697 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 04:33:00,697 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 04:33:00,697 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 04:33:00,697 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 04:33:00,697 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 04:33:00,697 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 04:33:00,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 04:33:00,698 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-08 04:33:00,698 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 04:33:00,698 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 04:33:00,698 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 04:33:00,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 04:33:00,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 04:33:00,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 04:33:00,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 04:33:00,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 04:33:00,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 04:33:00,748 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 04:33:00,749 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 04:33:00,879 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 04:33:00,886 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 04:33:00,887 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 04:33:00,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:33:00 BoogieIcfgContainer [2022-04-08 04:33:00,888 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 04:33:00,904 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 04:33:00,905 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 04:33:00,907 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 04:33:00,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 04:33:00" (1/3) ... [2022-04-08 04:33:00,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b5ea11a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:33:00, skipping insertion in model container [2022-04-08 04:33:00,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:33:00" (2/3) ... [2022-04-08 04:33:00,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b5ea11a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:33:00, skipping insertion in model container [2022-04-08 04:33:00,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:33:00" (3/3) ... [2022-04-08 04:33:00,910 INFO L111 eAbstractionObserver]: Analyzing ICFG ps3-ll.c [2022-04-08 04:33:00,914 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 04:33:00,914 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 04:33:00,959 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 04:33:00,965 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 04:33:00,965 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 04:33:00,980 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 04:33:00,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 04:33:00,986 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:33:00,986 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:33:00,987 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:33:00,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:33:00,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1469283919, now seen corresponding path program 1 times [2022-04-08 04:33:00,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:33:00,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [853732668] [2022-04-08 04:33:01,005 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:33:01,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1469283919, now seen corresponding path program 2 times [2022-04-08 04:33:01,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:33:01,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944861037] [2022-04-08 04:33:01,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:33:01,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:33:01,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:33:01,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:33:01,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:33:01,170 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(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); {24#true} is VALID [2022-04-08 04:33:01,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-08 04:33:01,171 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #53#return; {24#true} is VALID [2022-04-08 04:33:01,178 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:33:01,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(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); {24#true} is VALID [2022-04-08 04:33:01,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-08 04:33:01,179 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #53#return; {24#true} is VALID [2022-04-08 04:33:01,180 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret5 := main(); {24#true} is VALID [2022-04-08 04:33:01,180 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {24#true} is VALID [2022-04-08 04:33:01,183 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume false; {25#false} is VALID [2022-04-08 04:33:01,183 INFO L272 TraceCheckUtils]: 7: Hoare triple {25#false} call __VERIFIER_assert((if 0 == 6 * ~x~0 - 2 * ~y~0 * ~y~0 * ~y~0 - 3 * ~y~0 * ~y~0 - ~y~0 then 1 else 0)); {25#false} is VALID [2022-04-08 04:33:01,184 INFO L290 TraceCheckUtils]: 8: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-04-08 04:33:01,184 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2022-04-08 04:33:01,184 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-08 04:33:01,185 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 04:33:01,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:33:01,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944861037] [2022-04-08 04:33:01,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944861037] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:33:01,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:33:01,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 04:33:01,189 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:33:01,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [853732668] [2022-04-08 04:33:01,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [853732668] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:33:01,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:33:01,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 04:33:01,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81841480] [2022-04-08 04:33:01,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:33:01,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 04:33:01,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:33:01,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:33:01,225 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:33:01,225 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 04:33:01,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:33:01,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 04:33:01,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 04:33:01,249 INFO L87 Difference]: Start difference. First operand has 21 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:33:01,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:33:01,464 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2022-04-08 04:33:01,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 04:33:01,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 04:33:01,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:33:01,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:33:01,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-04-08 04:33:01,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:33:01,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-04-08 04:33:01,478 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 46 transitions. [2022-04-08 04:33:01,534 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:33:01,543 INFO L225 Difference]: With dead ends: 36 [2022-04-08 04:33:01,544 INFO L226 Difference]: Without dead ends: 16 [2022-04-08 04:33:01,547 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 04:33:01,553 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 04:33:01,554 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 04:33:01,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-08 04:33:01,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-08 04:33:01,591 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:33:01,593 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:33:01,595 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:33:01,596 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:33:01,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:33:01,602 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-04-08 04:33:01,602 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-08 04:33:01,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:33:01,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:33:01,603 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 16 states. [2022-04-08 04:33:01,604 INFO L87 Difference]: Start difference. First operand has 16 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 16 states. [2022-04-08 04:33:01,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:33:01,607 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-04-08 04:33:01,607 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-08 04:33:01,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:33:01,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:33:01,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:33:01,608 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:33:01,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:33:01,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-08 04:33:01,612 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2022-04-08 04:33:01,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:33:01,613 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-08 04:33:01,614 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:33:01,614 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 17 transitions. [2022-04-08 04:33:01,635 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 04:33:01,636 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-08 04:33:01,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 04:33:01,636 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:33:01,636 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:33:01,637 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 04:33:01,637 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:33:01,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:33:01,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1467496459, now seen corresponding path program 1 times [2022-04-08 04:33:01,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:33:01,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2088147942] [2022-04-08 04:33:01,639 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:33:01,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1467496459, now seen corresponding path program 2 times [2022-04-08 04:33:01,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:33:01,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615429031] [2022-04-08 04:33:01,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:33:01,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:33:01,666 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:33:01,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [773173623] [2022-04-08 04:33:01,667 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:33:01,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:33:01,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:33:01,669 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 04:33:01,679 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 04:33:01,754 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 04:33:01,754 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:33:01,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 04:33:01,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:33:01,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:33:01,907 INFO L272 TraceCheckUtils]: 0: Hoare triple {168#true} call ULTIMATE.init(); {168#true} is VALID [2022-04-08 04:33:01,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {168#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); {168#true} is VALID [2022-04-08 04:33:01,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {168#true} assume true; {168#true} is VALID [2022-04-08 04:33:01,908 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {168#true} {168#true} #53#return; {168#true} is VALID [2022-04-08 04:33:01,908 INFO L272 TraceCheckUtils]: 4: Hoare triple {168#true} call #t~ret5 := main(); {168#true} is VALID [2022-04-08 04:33:01,909 INFO L290 TraceCheckUtils]: 5: Hoare triple {168#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {188#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:33:01,910 INFO L290 TraceCheckUtils]: 6: Hoare triple {188#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {188#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:33:01,911 INFO L272 TraceCheckUtils]: 7: Hoare triple {188#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~x~0 - 2 * ~y~0 * ~y~0 * ~y~0 - 3 * ~y~0 * ~y~0 - ~y~0 then 1 else 0)); {195#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:33:01,912 INFO L290 TraceCheckUtils]: 8: Hoare triple {195#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {199#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:33:01,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {199#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {169#false} is VALID [2022-04-08 04:33:01,912 INFO L290 TraceCheckUtils]: 10: Hoare triple {169#false} assume !false; {169#false} is VALID [2022-04-08 04:33:01,913 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 04:33:01,913 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 04:33:01,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:33:01,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615429031] [2022-04-08 04:33:01,913 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:33:01,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773173623] [2022-04-08 04:33:01,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773173623] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:33:01,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:33:01,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 04:33:01,915 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:33:01,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2088147942] [2022-04-08 04:33:01,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2088147942] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:33:01,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:33:01,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 04:33:01,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951729761] [2022-04-08 04:33:01,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:33:01,917 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 04:33:01,917 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:33:01,917 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:33:01,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:33:01,928 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 04:33:01,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:33:01,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 04:33:01,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 04:33:01,929 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:33:02,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:33:02,046 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-08 04:33:02,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 04:33:02,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 04:33:02,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:33:02,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:33:02,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-04-08 04:33:02,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:33:02,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-04-08 04:33:02,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 28 transitions. [2022-04-08 04:33:02,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:33:02,083 INFO L225 Difference]: With dead ends: 26 [2022-04-08 04:33:02,084 INFO L226 Difference]: Without dead ends: 23 [2022-04-08 04:33:02,085 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 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 04:33:02,087 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 04:33:02,092 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 49 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 04:33:02,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-08 04:33:02,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-08 04:33:02,108 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:33:02,108 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:33:02,109 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:33:02,110 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:33:02,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:33:02,112 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-04-08 04:33:02,113 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-04-08 04:33:02,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:33:02,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:33:02,113 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 23 states. [2022-04-08 04:33:02,114 INFO L87 Difference]: Start difference. First operand has 23 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 23 states. [2022-04-08 04:33:02,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:33:02,117 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-04-08 04:33:02,117 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-04-08 04:33:02,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:33:02,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:33:02,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:33:02,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:33:02,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:33:02,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2022-04-08 04:33:02,120 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 11 [2022-04-08 04:33:02,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:33:02,121 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2022-04-08 04:33:02,121 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:33:02,121 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 24 transitions. [2022-04-08 04:33:02,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:33:02,150 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-04-08 04:33:02,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 04:33:02,151 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:33:02,151 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:33:02,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-08 04:33:02,359 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 04:33:02,360 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:33:02,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:33:02,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1366100723, now seen corresponding path program 1 times [2022-04-08 04:33:02,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:33:02,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1073150023] [2022-04-08 04:33:02,554 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:33:02,554 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:33:02,554 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:33:02,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1366100723, now seen corresponding path program 2 times [2022-04-08 04:33:02,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:33:02,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238965415] [2022-04-08 04:33:02,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:33:02,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:33:02,568 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:33:02,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [257020315] [2022-04-08 04:33:02,568 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:33:02,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:33:02,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:33:02,569 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 04:33:02,571 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 04:33:02,610 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:33:02,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:33:02,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 04:33:02,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:33:02,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:33:02,748 INFO L272 TraceCheckUtils]: 0: Hoare triple {351#true} call ULTIMATE.init(); {351#true} is VALID [2022-04-08 04:33:02,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {351#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); {351#true} is VALID [2022-04-08 04:33:02,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {351#true} assume true; {351#true} is VALID [2022-04-08 04:33:02,749 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {351#true} {351#true} #53#return; {351#true} is VALID [2022-04-08 04:33:02,749 INFO L272 TraceCheckUtils]: 4: Hoare triple {351#true} call #t~ret5 := main(); {351#true} is VALID [2022-04-08 04:33:02,750 INFO L290 TraceCheckUtils]: 5: Hoare triple {351#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {371#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:33:02,750 INFO L290 TraceCheckUtils]: 6: Hoare triple {371#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {371#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:33:02,750 INFO L272 TraceCheckUtils]: 7: Hoare triple {371#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~x~0 - 2 * ~y~0 * ~y~0 * ~y~0 - 3 * ~y~0 * ~y~0 - ~y~0 then 1 else 0)); {351#true} is VALID [2022-04-08 04:33:02,751 INFO L290 TraceCheckUtils]: 8: Hoare triple {351#true} ~cond := #in~cond; {351#true} is VALID [2022-04-08 04:33:02,751 INFO L290 TraceCheckUtils]: 9: Hoare triple {351#true} assume !(0 == ~cond); {351#true} is VALID [2022-04-08 04:33:02,751 INFO L290 TraceCheckUtils]: 10: Hoare triple {351#true} assume true; {351#true} is VALID [2022-04-08 04:33:02,752 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {351#true} {371#(and (= main_~x~0 0) (= main_~y~0 0))} #49#return; {371#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:33:02,753 INFO L290 TraceCheckUtils]: 12: Hoare triple {371#(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 + ~x~0; {393#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 main_~y~0)))} is VALID [2022-04-08 04:33:02,754 INFO L290 TraceCheckUtils]: 13: Hoare triple {393#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 main_~y~0)))} assume !false; {393#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 main_~y~0)))} is VALID [2022-04-08 04:33:02,755 INFO L272 TraceCheckUtils]: 14: Hoare triple {393#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 main_~y~0)))} call __VERIFIER_assert((if 0 == 6 * ~x~0 - 2 * ~y~0 * ~y~0 * ~y~0 - 3 * ~y~0 * ~y~0 - ~y~0 then 1 else 0)); {400#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:33:02,756 INFO L290 TraceCheckUtils]: 15: Hoare triple {400#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {404#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:33:02,757 INFO L290 TraceCheckUtils]: 16: Hoare triple {404#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {352#false} is VALID [2022-04-08 04:33:02,757 INFO L290 TraceCheckUtils]: 17: Hoare triple {352#false} assume !false; {352#false} is VALID [2022-04-08 04:33:02,757 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 04:33:02,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:33:02,926 INFO L290 TraceCheckUtils]: 17: Hoare triple {352#false} assume !false; {352#false} is VALID [2022-04-08 04:33:02,927 INFO L290 TraceCheckUtils]: 16: Hoare triple {404#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {352#false} is VALID [2022-04-08 04:33:02,928 INFO L290 TraceCheckUtils]: 15: Hoare triple {400#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {404#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:33:02,929 INFO L272 TraceCheckUtils]: 14: Hoare triple {420#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} call __VERIFIER_assert((if 0 == 6 * ~x~0 - 2 * ~y~0 * ~y~0 * ~y~0 - 3 * ~y~0 * ~y~0 - ~y~0 then 1 else 0)); {400#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:33:02,930 INFO L290 TraceCheckUtils]: 13: Hoare triple {420#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} assume !false; {420#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} is VALID [2022-04-08 04:33:03,485 INFO L290 TraceCheckUtils]: 12: Hoare triple {420#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 + ~x~0; {420#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} is VALID [2022-04-08 04:33:03,487 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {351#true} {420#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} #49#return; {420#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} is VALID [2022-04-08 04:33:03,487 INFO L290 TraceCheckUtils]: 10: Hoare triple {351#true} assume true; {351#true} is VALID [2022-04-08 04:33:03,487 INFO L290 TraceCheckUtils]: 9: Hoare triple {351#true} assume !(0 == ~cond); {351#true} is VALID [2022-04-08 04:33:03,488 INFO L290 TraceCheckUtils]: 8: Hoare triple {351#true} ~cond := #in~cond; {351#true} is VALID [2022-04-08 04:33:03,488 INFO L272 TraceCheckUtils]: 7: Hoare triple {420#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} call __VERIFIER_assert((if 0 == 6 * ~x~0 - 2 * ~y~0 * ~y~0 * ~y~0 - 3 * ~y~0 * ~y~0 - ~y~0 then 1 else 0)); {351#true} is VALID [2022-04-08 04:33:03,492 INFO L290 TraceCheckUtils]: 6: Hoare triple {420#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} assume !false; {420#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} is VALID [2022-04-08 04:33:03,492 INFO L290 TraceCheckUtils]: 5: Hoare triple {351#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {420#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} is VALID [2022-04-08 04:33:03,492 INFO L272 TraceCheckUtils]: 4: Hoare triple {351#true} call #t~ret5 := main(); {351#true} is VALID [2022-04-08 04:33:03,493 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {351#true} {351#true} #53#return; {351#true} is VALID [2022-04-08 04:33:03,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {351#true} assume true; {351#true} is VALID [2022-04-08 04:33:03,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {351#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); {351#true} is VALID [2022-04-08 04:33:03,493 INFO L272 TraceCheckUtils]: 0: Hoare triple {351#true} call ULTIMATE.init(); {351#true} is VALID [2022-04-08 04:33:03,493 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 04:33:03,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:33:03,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238965415] [2022-04-08 04:33:03,494 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:33:03,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257020315] [2022-04-08 04:33:03,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257020315] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 04:33:03,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 04:33:03,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-08 04:33:03,494 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:33:03,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1073150023] [2022-04-08 04:33:03,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1073150023] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:33:03,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:33:03,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 04:33:03,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472225232] [2022-04-08 04:33:03,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:33:03,495 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), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-08 04:33:03,496 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:33:03,496 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), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:33:05,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 16 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 04:33:05,528 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 04:33:05,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:33:05,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 04:33:05,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 04:33:05,529 INFO L87 Difference]: Start difference. First operand 23 states and 24 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), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:33:05,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:33:05,611 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-04-08 04:33:05,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 04:33:05,611 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), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-08 04:33:05,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:33:05,612 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), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:33:05,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2022-04-08 04:33:05,613 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), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:33:05,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2022-04-08 04:33:05,614 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 17 transitions. [2022-04-08 04:33:07,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 16 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 04:33:07,638 INFO L225 Difference]: With dead ends: 23 [2022-04-08 04:33:07,638 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 04:33:07,638 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-08 04:33:07,639 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 04:33:07,640 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 33 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 04:33:07,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 04:33:07,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 04:33:07,640 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:33:07,641 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 04:33:07,641 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 04:33:07,641 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 04:33:07,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:33:07,641 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 04:33:07,641 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 04:33:07,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:33:07,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:33:07,641 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 04:33:07,641 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 04:33:07,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:33:07,642 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 04:33:07,642 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 04:33:07,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:33:07,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:33:07,642 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:33:07,642 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:33:07,642 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 04:33:07,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 04:33:07,642 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2022-04-08 04:33:07,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:33:07,643 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 04:33:07,643 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), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:33:07,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 04:33:07,643 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 04:33:07,643 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 04:33:07,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:33:07,646 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 04:33:07,692 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 04:33:07,867 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 04:33:07,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 04:33:07,980 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-08 04:33:07,980 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-08 04:33:07,980 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-08 04:33:07,980 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2022-04-08 04:33:07,980 INFO L882 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-08 04:33:07,980 INFO L882 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-04-08 04:33:07,986 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-04-08 04:33:07,987 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 17 38) the Hoare annotation is: true [2022-04-08 04:33:07,987 INFO L878 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: (= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6)) [2022-04-08 04:33:07,988 INFO L878 garLoopResultBuilder]: At program point L27-1(lines 26 35) the Hoare annotation is: (= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6)) [2022-04-08 04:33:07,988 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 17 38) the Hoare annotation is: true [2022-04-08 04:33:07,988 INFO L878 garLoopResultBuilder]: At program point L26-2(lines 26 35) the Hoare annotation is: (= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6)) [2022-04-08 04:33:07,988 INFO L878 garLoopResultBuilder]: At program point L26-3(lines 26 35) the Hoare annotation is: (= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6)) [2022-04-08 04:33:07,988 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 17 38) the Hoare annotation is: true [2022-04-08 04:33:07,988 INFO L885 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: true [2022-04-08 04:33:07,989 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 04:33:07,989 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 04:33:07,989 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 04:33:07,989 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 04:33:07,989 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 04:33:07,989 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 04:33:07,989 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 04:33:07,989 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 9 15) the Hoare annotation is: true [2022-04-08 04:33:07,989 INFO L878 garLoopResultBuilder]: At program point L11(lines 11 12) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-08 04:33:07,989 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 04:33:07,990 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 04:33:07,990 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 04:33:07,990 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 04:33:07,993 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2] [2022-04-08 04:33:07,994 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 04:33:08,000 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 04:33:08,001 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-08 04:33:08,002 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 04:33:08,002 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-08 04:33:08,002 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-08 04:33:08,006 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-08 04:33:10,242 INFO L163 areAnnotationChecker]: CFG has 25 edges. 24 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 04:33:10,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 04:33:10 BoogieIcfgContainer [2022-04-08 04:33:10,250 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 04:33:10,251 INFO L158 Benchmark]: Toolchain (without parser) took 9932.38ms. Allocated memory was 180.4MB in the beginning and 219.2MB in the end (delta: 38.8MB). Free memory was 129.7MB in the beginning and 103.6MB in the end (delta: 26.1MB). Peak memory consumption was 65.3MB. Max. memory is 8.0GB. [2022-04-08 04:33:10,251 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 180.4MB. Free memory was 145.9MB in the beginning and 145.8MB in the end (delta: 74.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 04:33:10,252 INFO L158 Benchmark]: CACSL2BoogieTranslator took 284.23ms. Allocated memory is still 180.4MB. Free memory was 129.4MB in the beginning and 156.0MB in the end (delta: -26.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 04:33:10,252 INFO L158 Benchmark]: Boogie Preprocessor took 23.41ms. Allocated memory is still 180.4MB. Free memory was 156.0MB in the beginning and 154.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 04:33:10,252 INFO L158 Benchmark]: RCFGBuilder took 270.84ms. Allocated memory is still 180.4MB. Free memory was 154.4MB in the beginning and 144.4MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-08 04:33:10,253 INFO L158 Benchmark]: TraceAbstraction took 9345.54ms. Allocated memory was 180.4MB in the beginning and 219.2MB in the end (delta: 38.8MB). Free memory was 143.9MB in the beginning and 103.6MB in the end (delta: 40.3MB). Peak memory consumption was 79.1MB. Max. memory is 8.0GB. [2022-04-08 04:33:10,254 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.09ms. Allocated memory is still 180.4MB. Free memory was 145.9MB in the beginning and 145.8MB in the end (delta: 74.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 284.23ms. Allocated memory is still 180.4MB. Free memory was 129.4MB in the beginning and 156.0MB in the end (delta: -26.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.41ms. Allocated memory is still 180.4MB. Free memory was 156.0MB in the beginning and 154.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 270.84ms. Allocated memory is still 180.4MB. Free memory was 154.4MB in the beginning and 144.4MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 9345.54ms. Allocated memory was 180.4MB in the beginning and 219.2MB in the end (delta: 38.8MB). Free memory was 143.9MB in the beginning and 103.6MB in the end (delta: 40.3MB). Peak memory consumption was 79.1MB. 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, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.0s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 26 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 23 mSDsluCounter, 105 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 39 IncrementalHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 45 mSDtfsCounter, 39 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=2, InterpolantAutomatonStates: 13, 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 51 PreInvPairs, 76 NumberOfFragments, 118 HoareAnnotationTreeSize, 51 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 21 FomulaSimplificationsInter, 95 FormulaSimplificationTreeSizeReductionInter, 0.1s 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: 26]: Loop Invariant Derived loop invariant: 3 * (y * y) + y + y * y * y * 2 == x * 6 - 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 04:33:10,271 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...