/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps3-ll_valuebound20.c
--------------------------------------------------------------------------------
This is Ultimate 0.2.2-dev-34549b5
[2022-04-08 07:43:44,638 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-04-08 07:43:44,646 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-04-08 07:43:44,693 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-04-08 07:43:44,693 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-04-08 07:43:44,696 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-04-08 07:43:44,698 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-04-08 07:43:44,700 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-04-08 07:43:44,701 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-04-08 07:43:44,702 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-04-08 07:43:44,702 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-04-08 07:43:44,703 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-04-08 07:43:44,704 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-04-08 07:43:44,704 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-04-08 07:43:44,705 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-04-08 07:43:44,706 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-04-08 07:43:44,707 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-04-08 07:43:44,707 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-04-08 07:43:44,708 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-04-08 07:43:44,710 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-04-08 07:43:44,711 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values
[2022-04-08 07:43:44,714 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-04-08 07:43:44,715 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-04-08 07:43:44,716 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-04-08 07:43:44,716 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-04-08 07:43:44,718 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-04-08 07:43:44,718 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-04-08 07:43:44,719 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-04-08 07:43:44,719 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-04-08 07:43:44,720 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-04-08 07:43:44,720 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-04-08 07:43:44,721 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-04-08 07:43:44,721 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-04-08 07:43:44,722 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-04-08 07:43:44,722 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-04-08 07:43:44,723 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-04-08 07:43:44,723 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-04-08 07:43:44,724 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-04-08 07:43:44,724 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-04-08 07:43:44,724 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-04-08 07:43:44,725 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-04-08 07:43:44,731 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-04-08 07:43:44,731 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf
[2022-04-08 07:43:44,740 INFO L113 SettingsManager]: Loading preferences was successful
[2022-04-08 07:43:44,741 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-04-08 07:43:44,742 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-04-08 07:43:44,742 INFO L138 SettingsManager]: * sizeof long=4
[2022-04-08 07:43:44,742 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-04-08 07:43:44,742 INFO L138 SettingsManager]: * sizeof POINTER=4
[2022-04-08 07:43:44,742 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-04-08 07:43:44,742 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-04-08 07:43:44,742 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-04-08 07:43:44,743 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-04-08 07:43:44,743 INFO L138 SettingsManager]: * sizeof long double=12
[2022-04-08 07:43:44,744 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-04-08 07:43:44,744 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-04-08 07:43:44,744 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-04-08 07:43:44,744 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-04-08 07:43:44,744 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-04-08 07:43:44,744 INFO L138 SettingsManager]: * To the following directory=./dump/
[2022-04-08 07:43:44,744 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-04-08 07:43:44,744 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-08 07:43:44,745 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-04-08 07:43:44,745 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation
[2022-04-08 07:43:44,745 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION
[2022-04-08 07:43:44,745 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL
[2022-04-08 07:43:44,745 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-04-08 07:43:44,745 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN
[2022-04-08 07:43:44,745 INFO L138 SettingsManager]: * Use separate solver for trace checks=false
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN;
[2022-04-08 07:43:44,974 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-04-08 07:43:44,998 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-04-08 07:43:45,000 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-04-08 07:43:45,001 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-04-08 07:43:45,003 INFO L275 PluginConnector]: CDTParser initialized
[2022-04-08 07:43:45,004 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps3-ll_valuebound20.c
[2022-04-08 07:43:45,065 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89284f7de/0e62224ea65744d2874558e8aafd59ec/FLAGd4e055e65
[2022-04-08 07:43:45,458 INFO L306 CDTParser]: Found 1 translation units.
[2022-04-08 07:43:45,458 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps3-ll_valuebound20.c
[2022-04-08 07:43:45,464 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89284f7de/0e62224ea65744d2874558e8aafd59ec/FLAGd4e055e65
[2022-04-08 07:43:45,481 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89284f7de/0e62224ea65744d2874558e8aafd59ec
[2022-04-08 07:43:45,484 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-04-08 07:43:45,485 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2022-04-08 07:43:45,488 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-04-08 07:43:45,488 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-04-08 07:43:45,491 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-04-08 07:43:45,492 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 07:43:45" (1/1) ...
[2022-04-08 07:43:45,493 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ad596f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:43:45, skipping insertion in model container
[2022-04-08 07:43:45,493 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 07:43:45" (1/1) ...
[2022-04-08 07:43:45,499 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-04-08 07:43:45,512 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-04-08 07:43:45,667 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps3-ll_valuebound20.c[458,471]
[2022-04-08 07:43:45,680 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-08 07:43:45,687 INFO L203 MainTranslator]: Completed pre-run
[2022-04-08 07:43:45,699 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps3-ll_valuebound20.c[458,471]
[2022-04-08 07:43:45,704 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-08 07:43:45,715 INFO L208 MainTranslator]: Completed translation
[2022-04-08 07:43:45,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:43:45 WrapperNode
[2022-04-08 07:43:45,715 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-04-08 07:43:45,716 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-04-08 07:43:45,716 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-04-08 07:43:45,716 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-04-08 07:43:45,725 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:43:45" (1/1) ...
[2022-04-08 07:43:45,725 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:43:45" (1/1) ...
[2022-04-08 07:43:45,730 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:43:45" (1/1) ...
[2022-04-08 07:43:45,730 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:43:45" (1/1) ...
[2022-04-08 07:43:45,735 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:43:45" (1/1) ...
[2022-04-08 07:43:45,738 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:43:45" (1/1) ...
[2022-04-08 07:43:45,739 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:43:45" (1/1) ...
[2022-04-08 07:43:45,741 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-04-08 07:43:45,742 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-04-08 07:43:45,742 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-04-08 07:43:45,742 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-04-08 07:43:45,743 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:43:45" (1/1) ...
[2022-04-08 07:43:45,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-08 07:43:45,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 07:43:45,768 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2022-04-08 07:43:45,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2022-04-08 07:43:45,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2022-04-08 07:43:45,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-04-08 07:43:45,807 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error
[2022-04-08 07:43:45,807 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2022-04-08 07:43:45,808 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2022-04-08 07:43:45,808 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2022-04-08 07:43:45,808 INFO L130 BoogieDeclarations]: Found specification of procedure abort
[2022-04-08 07:43:45,808 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail
[2022-04-08 07:43:45,808 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error
[2022-04-08 07:43:45,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-04-08 07:43:45,808 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short
[2022-04-08 07:43:45,808 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2022-04-08 07:43:45,809 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2022-04-08 07:43:45,809 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2022-04-08 07:43:45,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2022-04-08 07:43:45,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-04-08 07:43:45,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-04-08 07:43:45,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2022-04-08 07:43:45,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2022-04-08 07:43:45,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-04-08 07:43:45,857 INFO L234 CfgBuilder]: Building ICFG
[2022-04-08 07:43:45,858 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-04-08 07:43:46,032 INFO L275 CfgBuilder]: Performing block encoding
[2022-04-08 07:43:46,037 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-04-08 07:43:46,038 INFO L299 CfgBuilder]: Removed 1 assume(true) statements.
[2022-04-08 07:43:46,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 07:43:46 BoogieIcfgContainer
[2022-04-08 07:43:46,039 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-04-08 07:43:46,041 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-04-08 07:43:46,041 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-04-08 07:43:46,057 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-04-08 07:43:46,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 07:43:45" (1/3) ...
[2022-04-08 07:43:46,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7002d1ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 07:43:46, skipping insertion in model container
[2022-04-08 07:43:46,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:43:45" (2/3) ...
[2022-04-08 07:43:46,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7002d1ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 07:43:46, skipping insertion in model container
[2022-04-08 07:43:46,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 07:43:46" (3/3) ...
[2022-04-08 07:43:46,059 INFO L111 eAbstractionObserver]: Analyzing ICFG ps3-ll_valuebound20.c
[2022-04-08 07:43:46,063 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION
[2022-04-08 07:43:46,064 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2022-04-08 07:43:46,128 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-04-08 07:43:46,133 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP
[2022-04-08 07:43:46,134 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-04-08 07:43:46,172 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2022-04-08 07:43:46,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2022-04-08 07:43:46,185 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 07:43:46,186 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 07:43:46,186 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 07:43:46,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 07:43:46,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1914087080, now seen corresponding path program 1 times
[2022-04-08 07:43:46,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 07:43:46,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [604547805]
[2022-04-08 07:43:46,213 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 07:43:46,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1914087080, now seen corresponding path program 2 times
[2022-04-08 07:43:46,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 07:43:46,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926129087]
[2022-04-08 07:43:46,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 07:43:46,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 07:43:46,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 07:43:46,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 07:43:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 07:43:46,474 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(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); {30#true} is VALID
[2022-04-08 07:43:46,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume true; {30#true} is VALID
[2022-04-08 07:43:46,475 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30#true} {30#true} #57#return; {30#true} is VALID
[2022-04-08 07:43:46,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2022-04-08 07:43:46,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 07:43:46,492 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#true} ~cond := #in~cond; {30#true} is VALID
[2022-04-08 07:43:46,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume 0 == ~cond;assume false; {31#false} is VALID
[2022-04-08 07:43:46,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#false} assume true; {31#false} is VALID
[2022-04-08 07:43:46,493 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#false} {30#true} #51#return; {31#false} is VALID
[2022-04-08 07:43:46,497 INFO L272 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {39#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 07:43:46,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(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); {30#true} is VALID
[2022-04-08 07:43:46,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {30#true} assume true; {30#true} is VALID
[2022-04-08 07:43:46,498 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30#true} {30#true} #57#return; {30#true} is VALID
[2022-04-08 07:43:46,498 INFO L272 TraceCheckUtils]: 4: Hoare triple {30#true} call #t~ret5 := main(); {30#true} is VALID
[2022-04-08 07:43:46,498 INFO L290 TraceCheckUtils]: 5: Hoare triple {30#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; {30#true} is VALID
[2022-04-08 07:43:46,499 INFO L272 TraceCheckUtils]: 6: Hoare triple {30#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {30#true} is VALID
[2022-04-08 07:43:46,499 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#true} ~cond := #in~cond; {30#true} is VALID
[2022-04-08 07:43:46,501 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#true} assume 0 == ~cond;assume false; {31#false} is VALID
[2022-04-08 07:43:46,501 INFO L290 TraceCheckUtils]: 9: Hoare triple {31#false} assume true; {31#false} is VALID
[2022-04-08 07:43:46,501 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31#false} {30#true} #51#return; {31#false} is VALID
[2022-04-08 07:43:46,502 INFO L290 TraceCheckUtils]: 11: Hoare triple {31#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {31#false} is VALID
[2022-04-08 07:43:46,502 INFO L290 TraceCheckUtils]: 12: Hoare triple {31#false} assume false; {31#false} is VALID
[2022-04-08 07:43:46,502 INFO L272 TraceCheckUtils]: 13: Hoare triple {31#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)); {31#false} is VALID
[2022-04-08 07:43:46,502 INFO L290 TraceCheckUtils]: 14: Hoare triple {31#false} ~cond := #in~cond; {31#false} is VALID
[2022-04-08 07:43:46,503 INFO L290 TraceCheckUtils]: 15: Hoare triple {31#false} assume 0 == ~cond; {31#false} is VALID
[2022-04-08 07:43:46,503 INFO L290 TraceCheckUtils]: 16: Hoare triple {31#false} assume !false; {31#false} is VALID
[2022-04-08 07:43:46,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 07:43:46,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 07:43:46,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926129087]
[2022-04-08 07:43:46,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926129087] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 07:43:46,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 07:43:46,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-04-08 07:43:46,507 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 07:43:46,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [604547805]
[2022-04-08 07:43:46,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [604547805] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 07:43:46,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 07:43:46,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-04-08 07:43:46,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141895916]
[2022-04-08 07:43:46,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 07:43:46,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17
[2022-04-08 07:43:46,516 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 07:43:46,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2)
[2022-04-08 07:43:46,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:43:46,555 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-04-08 07:43:46,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 07:43:46,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-04-08 07:43:46,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-04-08 07:43:46,583 INFO L87 Difference]: Start difference. First operand has 27 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2)
[2022-04-08 07:43:46,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:43:46,709 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions.
[2022-04-08 07:43:46,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-04-08 07:43:46,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17
[2022-04-08 07:43:46,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 07:43:46,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2)
[2022-04-08 07:43:46,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions.
[2022-04-08 07:43:46,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2)
[2022-04-08 07:43:46,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions.
[2022-04-08 07:43:46,731 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 56 transitions.
[2022-04-08 07:43:46,811 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:43:46,820 INFO L225 Difference]: With dead ends: 45
[2022-04-08 07:43:46,820 INFO L226 Difference]: Without dead ends: 22
[2022-04-08 07:43:46,822 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-04-08 07:43:46,825 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 07:43:46,827 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 28 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 07:43:46,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states.
[2022-04-08 07:43:46,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22.
[2022-04-08 07:43:46,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 07:43:46,866 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 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 07:43:46,866 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 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 07:43:46,867 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 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 07:43:46,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:43:46,870 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions.
[2022-04-08 07:43:46,870 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions.
[2022-04-08 07:43:46,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 07:43:46,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 07:43:46,871 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 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 22 states.
[2022-04-08 07:43:46,871 INFO L87 Difference]: Start difference. First operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 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 22 states.
[2022-04-08 07:43:46,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:43:46,873 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions.
[2022-04-08 07:43:46,873 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions.
[2022-04-08 07:43:46,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 07:43:46,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 07:43:46,874 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 07:43:46,874 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 07:43:46,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 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 07:43:46,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions.
[2022-04-08 07:43:46,877 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 17
[2022-04-08 07:43:46,877 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 07:43:46,877 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions.
[2022-04-08 07:43:46,878 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2)
[2022-04-08 07:43:46,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 23 transitions.
[2022-04-08 07:43:46,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:43:46,905 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions.
[2022-04-08 07:43:46,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2022-04-08 07:43:46,906 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 07:43:46,906 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 07:43:46,906 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-04-08 07:43:46,906 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 07:43:46,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 07:43:46,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1699034386, now seen corresponding path program 1 times
[2022-04-08 07:43:46,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 07:43:46,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1295546693]
[2022-04-08 07:43:46,908 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 07:43:46,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1699034386, now seen corresponding path program 2 times
[2022-04-08 07:43:46,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 07:43:46,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506667395]
[2022-04-08 07:43:46,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 07:43:46,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 07:43:46,927 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-08 07:43:46,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1855270796]
[2022-04-08 07:43:46,927 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 07:43:46,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 07:43:46,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 07:43:46,929 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 07:43:46,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2022-04-08 07:43:46,973 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2022-04-08 07:43:46,974 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 07:43:46,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core
[2022-04-08 07:43:46,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 07:43:46,987 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 07:43:47,140 INFO L272 TraceCheckUtils]: 0: Hoare triple {220#true} call ULTIMATE.init(); {220#true} is VALID
[2022-04-08 07:43:47,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {220#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); {220#true} is VALID
[2022-04-08 07:43:47,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {220#true} assume true; {220#true} is VALID
[2022-04-08 07:43:47,141 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {220#true} {220#true} #57#return; {220#true} is VALID
[2022-04-08 07:43:47,141 INFO L272 TraceCheckUtils]: 4: Hoare triple {220#true} call #t~ret5 := main(); {220#true} is VALID
[2022-04-08 07:43:47,141 INFO L290 TraceCheckUtils]: 5: Hoare triple {220#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; {220#true} is VALID
[2022-04-08 07:43:47,141 INFO L272 TraceCheckUtils]: 6: Hoare triple {220#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {220#true} is VALID
[2022-04-08 07:43:47,142 INFO L290 TraceCheckUtils]: 7: Hoare triple {220#true} ~cond := #in~cond; {220#true} is VALID
[2022-04-08 07:43:47,142 INFO L290 TraceCheckUtils]: 8: Hoare triple {220#true} assume !(0 == ~cond); {220#true} is VALID
[2022-04-08 07:43:47,142 INFO L290 TraceCheckUtils]: 9: Hoare triple {220#true} assume true; {220#true} is VALID
[2022-04-08 07:43:47,142 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {220#true} {220#true} #51#return; {220#true} is VALID
[2022-04-08 07:43:47,143 INFO L290 TraceCheckUtils]: 11: Hoare triple {220#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {258#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 07:43:47,144 INFO L290 TraceCheckUtils]: 12: Hoare triple {258#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {258#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 07:43:47,145 INFO L272 TraceCheckUtils]: 13: Hoare triple {258#(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)); {265#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 07:43:47,145 INFO L290 TraceCheckUtils]: 14: Hoare triple {265#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {269#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 07:43:47,146 INFO L290 TraceCheckUtils]: 15: Hoare triple {269#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {221#false} is VALID
[2022-04-08 07:43:47,146 INFO L290 TraceCheckUtils]: 16: Hoare triple {221#false} assume !false; {221#false} is VALID
[2022-04-08 07:43:47,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 07:43:47,147 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-08 07:43:47,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 07:43:47,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506667395]
[2022-04-08 07:43:47,147 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-08 07:43:47,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855270796]
[2022-04-08 07:43:47,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855270796] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 07:43:47,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 07:43:47,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-08 07:43:47,149 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 07:43:47,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1295546693]
[2022-04-08 07:43:47,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1295546693] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 07:43:47,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 07:43:47,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-08 07:43:47,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440578494]
[2022-04-08 07:43:47,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 07:43:47,151 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17
[2022-04-08 07:43:47,151 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 07:43:47,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2022-04-08 07:43:47,166 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:43:47,166 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-04-08 07:43:47,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 07:43:47,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-04-08 07:43:47,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2022-04-08 07:43:47,167 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2022-04-08 07:43:47,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:43:47,298 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions.
[2022-04-08 07:43:47,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2022-04-08 07:43:47,298 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17
[2022-04-08 07:43:47,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 07:43:47,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2022-04-08 07:43:47,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions.
[2022-04-08 07:43:47,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2022-04-08 07:43:47,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions.
[2022-04-08 07:43:47,305 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 34 transitions.
[2022-04-08 07:43:47,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:43:47,335 INFO L225 Difference]: With dead ends: 32
[2022-04-08 07:43:47,335 INFO L226 Difference]: Without dead ends: 29
[2022-04-08 07:43:47,336 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2022-04-08 07:43:47,337 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 07:43:47,337 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 72 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 07:43:47,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states.
[2022-04-08 07:43:47,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29.
[2022-04-08 07:43:47,347 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 07:43:47,348 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-08 07:43:47,348 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-08 07:43:47,349 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-08 07:43:47,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:43:47,351 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions.
[2022-04-08 07:43:47,351 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions.
[2022-04-08 07:43:47,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 07:43:47,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 07:43:47,352 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states.
[2022-04-08 07:43:47,352 INFO L87 Difference]: Start difference. First operand has 29 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states.
[2022-04-08 07:43:47,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:43:47,354 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions.
[2022-04-08 07:43:47,354 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions.
[2022-04-08 07:43:47,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 07:43:47,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 07:43:47,355 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 07:43:47,355 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 07:43:47,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-08 07:43:47,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions.
[2022-04-08 07:43:47,357 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 17
[2022-04-08 07:43:47,358 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 07:43:47,358 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions.
[2022-04-08 07:43:47,358 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2022-04-08 07:43:47,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 30 transitions.
[2022-04-08 07:43:47,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:43:47,392 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions.
[2022-04-08 07:43:47,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2022-04-08 07:43:47,395 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 07:43:47,395 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 07:43:47,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2022-04-08 07:43:47,615 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 07:43:47,616 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 07:43:47,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 07:43:47,616 INFO L85 PathProgramCache]: Analyzing trace with hash 276758134, now seen corresponding path program 1 times
[2022-04-08 07:43:47,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 07:43:47,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [114336102]
[2022-04-08 07:43:47,831 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult
[2022-04-08 07:43:47,832 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE
[2022-04-08 07:43:47,832 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 07:43:47,832 INFO L85 PathProgramCache]: Analyzing trace with hash 276758134, now seen corresponding path program 2 times
[2022-04-08 07:43:47,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 07:43:47,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468218593]
[2022-04-08 07:43:47,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 07:43:47,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 07:43:47,845 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-08 07:43:47,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1854030225]
[2022-04-08 07:43:47,845 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 07:43:47,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 07:43:47,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 07:43:47,856 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 07:43:47,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2022-04-08 07:43:47,984 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 07:43:47,985 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 07:43:47,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core
[2022-04-08 07:43:47,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 07:43:47,999 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 07:43:48,126 INFO L272 TraceCheckUtils]: 0: Hoare triple {457#true} call ULTIMATE.init(); {457#true} is VALID
[2022-04-08 07:43:48,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {457#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); {457#true} is VALID
[2022-04-08 07:43:48,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {457#true} assume true; {457#true} is VALID
[2022-04-08 07:43:48,127 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {457#true} {457#true} #57#return; {457#true} is VALID
[2022-04-08 07:43:48,127 INFO L272 TraceCheckUtils]: 4: Hoare triple {457#true} call #t~ret5 := main(); {457#true} is VALID
[2022-04-08 07:43:48,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {457#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; {457#true} is VALID
[2022-04-08 07:43:48,128 INFO L272 TraceCheckUtils]: 6: Hoare triple {457#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {457#true} is VALID
[2022-04-08 07:43:48,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {457#true} ~cond := #in~cond; {457#true} is VALID
[2022-04-08 07:43:48,128 INFO L290 TraceCheckUtils]: 8: Hoare triple {457#true} assume !(0 == ~cond); {457#true} is VALID
[2022-04-08 07:43:48,128 INFO L290 TraceCheckUtils]: 9: Hoare triple {457#true} assume true; {457#true} is VALID
[2022-04-08 07:43:48,129 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {457#true} {457#true} #51#return; {457#true} is VALID
[2022-04-08 07:43:48,129 INFO L290 TraceCheckUtils]: 11: Hoare triple {457#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {495#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 07:43:48,130 INFO L290 TraceCheckUtils]: 12: Hoare triple {495#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {495#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 07:43:48,130 INFO L272 TraceCheckUtils]: 13: Hoare triple {495#(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)); {457#true} is VALID
[2022-04-08 07:43:48,130 INFO L290 TraceCheckUtils]: 14: Hoare triple {457#true} ~cond := #in~cond; {457#true} is VALID
[2022-04-08 07:43:48,130 INFO L290 TraceCheckUtils]: 15: Hoare triple {457#true} assume !(0 == ~cond); {457#true} is VALID
[2022-04-08 07:43:48,130 INFO L290 TraceCheckUtils]: 16: Hoare triple {457#true} assume true; {457#true} is VALID
[2022-04-08 07:43:48,131 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {457#true} {495#(and (= main_~x~0 0) (= main_~y~0 0))} #53#return; {495#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 07:43:48,132 INFO L290 TraceCheckUtils]: 18: Hoare triple {495#(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; {517#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0)) 0))} is VALID
[2022-04-08 07:43:48,132 INFO L290 TraceCheckUtils]: 19: Hoare triple {517#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0)) 0))} assume !false; {517#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0)) 0))} is VALID
[2022-04-08 07:43:48,133 INFO L272 TraceCheckUtils]: 20: Hoare triple {517#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~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)); {524#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 07:43:48,134 INFO L290 TraceCheckUtils]: 21: Hoare triple {524#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {528#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 07:43:48,134 INFO L290 TraceCheckUtils]: 22: Hoare triple {528#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {458#false} is VALID
[2022-04-08 07:43:48,135 INFO L290 TraceCheckUtils]: 23: Hoare triple {458#false} assume !false; {458#false} is VALID
[2022-04-08 07:43:48,135 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 07:43:48,135 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 07:43:48,303 INFO L290 TraceCheckUtils]: 23: Hoare triple {458#false} assume !false; {458#false} is VALID
[2022-04-08 07:43:48,303 INFO L290 TraceCheckUtils]: 22: Hoare triple {528#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {458#false} is VALID
[2022-04-08 07:43:48,304 INFO L290 TraceCheckUtils]: 21: Hoare triple {524#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {528#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 07:43:48,305 INFO L272 TraceCheckUtils]: 20: Hoare triple {544#(= (+ (* 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)); {524#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 07:43:48,306 INFO L290 TraceCheckUtils]: 19: Hoare triple {544#(= (+ (* 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; {544#(= (+ (* 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 07:43:48,659 INFO L290 TraceCheckUtils]: 18: Hoare triple {544#(= (+ (* 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; {544#(= (+ (* 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 07:43:48,660 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {457#true} {544#(= (+ (* 3 (* main_~y~0 main_~y~0)) main_~y~0 (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 6))} #53#return; {544#(= (+ (* 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 07:43:48,660 INFO L290 TraceCheckUtils]: 16: Hoare triple {457#true} assume true; {457#true} is VALID
[2022-04-08 07:43:48,660 INFO L290 TraceCheckUtils]: 15: Hoare triple {457#true} assume !(0 == ~cond); {457#true} is VALID
[2022-04-08 07:43:48,660 INFO L290 TraceCheckUtils]: 14: Hoare triple {457#true} ~cond := #in~cond; {457#true} is VALID
[2022-04-08 07:43:48,661 INFO L272 TraceCheckUtils]: 13: Hoare triple {544#(= (+ (* 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)); {457#true} is VALID
[2022-04-08 07:43:48,664 INFO L290 TraceCheckUtils]: 12: Hoare triple {544#(= (+ (* 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; {544#(= (+ (* 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 07:43:48,665 INFO L290 TraceCheckUtils]: 11: Hoare triple {457#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {544#(= (+ (* 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 07:43:48,665 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {457#true} {457#true} #51#return; {457#true} is VALID
[2022-04-08 07:43:48,665 INFO L290 TraceCheckUtils]: 9: Hoare triple {457#true} assume true; {457#true} is VALID
[2022-04-08 07:43:48,665 INFO L290 TraceCheckUtils]: 8: Hoare triple {457#true} assume !(0 == ~cond); {457#true} is VALID
[2022-04-08 07:43:48,665 INFO L290 TraceCheckUtils]: 7: Hoare triple {457#true} ~cond := #in~cond; {457#true} is VALID
[2022-04-08 07:43:48,665 INFO L272 TraceCheckUtils]: 6: Hoare triple {457#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {457#true} is VALID
[2022-04-08 07:43:48,666 INFO L290 TraceCheckUtils]: 5: Hoare triple {457#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; {457#true} is VALID
[2022-04-08 07:43:48,666 INFO L272 TraceCheckUtils]: 4: Hoare triple {457#true} call #t~ret5 := main(); {457#true} is VALID
[2022-04-08 07:43:48,666 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {457#true} {457#true} #57#return; {457#true} is VALID
[2022-04-08 07:43:48,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {457#true} assume true; {457#true} is VALID
[2022-04-08 07:43:48,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {457#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); {457#true} is VALID
[2022-04-08 07:43:48,666 INFO L272 TraceCheckUtils]: 0: Hoare triple {457#true} call ULTIMATE.init(); {457#true} is VALID
[2022-04-08 07:43:48,667 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2022-04-08 07:43:48,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 07:43:48,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468218593]
[2022-04-08 07:43:48,667 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-08 07:43:48,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854030225]
[2022-04-08 07:43:48,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854030225] provided 1 perfect and 1 imperfect interpolant sequences
[2022-04-08 07:43:48,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2022-04-08 07:43:48,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7
[2022-04-08 07:43:48,668 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 07:43:48,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [114336102]
[2022-04-08 07:43:48,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [114336102] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 07:43:48,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 07:43:48,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-08 07:43:48,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518573584]
[2022-04-08 07:43:48,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 07:43:48,670 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24
[2022-04-08 07:43:48,670 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 07:43:48,670 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-08 07:43:50,696 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 22 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity.
[2022-04-08 07:43:50,696 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-04-08 07:43:50,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 07:43:50,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-04-08 07:43:50,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2022-04-08 07:43:50,697 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-08 07:43:50,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:43:50,847 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions.
[2022-04-08 07:43:50,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2022-04-08 07:43:50,848 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24
[2022-04-08 07:43:50,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 07:43:50,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-08 07:43:50,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions.
[2022-04-08 07:43:50,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-08 07:43:50,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions.
[2022-04-08 07:43:50,851 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 23 transitions.
[2022-04-08 07:43:52,880 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 22 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity.
[2022-04-08 07:43:52,881 INFO L225 Difference]: With dead ends: 29
[2022-04-08 07:43:52,881 INFO L226 Difference]: Without dead ends: 0
[2022-04-08 07:43:52,881 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 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 07:43:52,882 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 6 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 07:43:52,883 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 56 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 07:43:52,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2022-04-08 07:43:52,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2022-04-08 07:43:52,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 07:43:52,884 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-04-08 07:43:52,884 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-04-08 07:43:52,884 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-04-08 07:43:52,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:43:52,884 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions.
[2022-04-08 07:43:52,884 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2022-04-08 07:43:52,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 07:43:52,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 07:43:52,885 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states.
[2022-04-08 07:43:52,885 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states.
[2022-04-08 07:43:52,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:43:52,885 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions.
[2022-04-08 07:43:52,885 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2022-04-08 07:43:52,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 07:43:52,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 07:43:52,886 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 07:43:52,886 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 07:43:52,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-04-08 07:43:52,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2022-04-08 07:43:52,886 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24
[2022-04-08 07:43:52,886 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 07:43:52,886 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2022-04-08 07:43:52,887 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-08 07:43:52,887 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions.
[2022-04-08 07:43:52,887 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:43:52,887 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2022-04-08 07:43:52,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 07:43:52,889 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2022-04-08 07:43:52,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2022-04-08 07:43:53,090 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2
[2022-04-08 07:43:53,092 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2022-04-08 07:43:53,208 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed.
[2022-04-08 07:43:53,208 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed.
[2022-04-08 07:43:53,209 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed.
[2022-04-08 07:43:53,209 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 6 8) the Hoare annotation is: true
[2022-04-08 07:43:53,209 INFO L885 garLoopResultBuilder]: At program point L7(line 7) the Hoare annotation is: true
[2022-04-08 07:43:53,209 INFO L885 garLoopResultBuilder]: At program point L7-2(lines 6 8) the Hoare annotation is: true
[2022-04-08 07:43:53,209 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 6 8) the Hoare annotation is: true
[2022-04-08 07:43:53,209 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 17 39) the Hoare annotation is: true
[2022-04-08 07:43:53,209 INFO L878 garLoopResultBuilder]: At program point L28(line 28) 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 07:43:53,209 INFO L878 garLoopResultBuilder]: At program point L28-1(lines 27 36) 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 07:43:53,210 INFO L878 garLoopResultBuilder]: At program point L27-2(lines 27 36) 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 07:43:53,210 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 17 39) the Hoare annotation is: true
[2022-04-08 07:43:53,210 INFO L878 garLoopResultBuilder]: At program point L27-3(lines 27 36) 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 07:43:53,210 INFO L885 garLoopResultBuilder]: At program point L21(line 21) the Hoare annotation is: true
[2022-04-08 07:43:53,210 INFO L885 garLoopResultBuilder]: At program point L21-1(line 21) the Hoare annotation is: true
[2022-04-08 07:43:53,210 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 17 39) the Hoare annotation is: true
[2022-04-08 07:43:53,210 INFO L885 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: true
[2022-04-08 07:43:53,210 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true
[2022-04-08 07:43:53,211 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))
[2022-04-08 07:43:53,211 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true
[2022-04-08 07:43:53,211 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true
[2022-04-08 07:43:53,211 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true
[2022-04-08 07:43:53,211 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true
[2022-04-08 07:43:53,211 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true
[2022-04-08 07:43:53,211 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 9 15) the Hoare annotation is: true
[2022-04-08 07:43:53,211 INFO L878 garLoopResultBuilder]: At program point L11(lines 11 12) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|))
[2022-04-08 07:43:53,212 INFO L878 garLoopResultBuilder]: At program point L10(lines 10 13) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond))
[2022-04-08 07:43:53,212 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 9 15) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond))
[2022-04-08 07:43:53,212 INFO L878 garLoopResultBuilder]: At program point L10-2(lines 9 15) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond))
[2022-04-08 07:43:53,212 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|))
[2022-04-08 07:43:53,214 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2]
[2022-04-08 07:43:53,215 INFO L178 ceAbstractionStarter]: Computing trace abstraction results
[2022-04-08 07:43:53,218 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation
[2022-04-08 07:43:53,219 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation
[2022-04-08 07:43:55,424 INFO L163 areAnnotationChecker]: CFG has 32 edges. 31 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[2022-04-08 07:43:55,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 07:43:55 BoogieIcfgContainer
[2022-04-08 07:43:55,432 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2022-04-08 07:43:55,433 INFO L158 Benchmark]: Toolchain (without parser) took 9947.85ms. Allocated memory was 178.3MB in the beginning and 213.9MB in the end (delta: 35.7MB). Free memory was 129.1MB in the beginning and 78.1MB in the end (delta: 50.9MB). Peak memory consumption was 88.0MB. Max. memory is 8.0GB.
[2022-04-08 07:43:55,434 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 178.3MB. Free memory was 145.3MB in the beginning and 145.2MB in the end (delta: 74.4kB). There was no memory consumed. Max. memory is 8.0GB.
[2022-04-08 07:43:55,434 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.20ms. Allocated memory is still 178.3MB. Free memory was 128.9MB in the beginning and 153.3MB in the end (delta: -24.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB.
[2022-04-08 07:43:55,434 INFO L158 Benchmark]: Boogie Preprocessor took 24.62ms. Allocated memory is still 178.3MB. Free memory was 153.3MB in the beginning and 151.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
[2022-04-08 07:43:55,435 INFO L158 Benchmark]: RCFGBuilder took 297.66ms. Allocated memory is still 178.3MB. Free memory was 151.7MB in the beginning and 140.7MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB.
[2022-04-08 07:43:55,435 INFO L158 Benchmark]: TraceAbstraction took 9391.82ms. Allocated memory was 178.3MB in the beginning and 213.9MB in the end (delta: 35.7MB). Free memory was 140.2MB in the beginning and 78.1MB in the end (delta: 62.0MB). Peak memory consumption was 99.0MB. Max. memory is 8.0GB.
[2022-04-08 07:43:55,437 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.12ms. Allocated memory is still 178.3MB. Free memory was 145.3MB in the beginning and 145.2MB in the end (delta: 74.4kB). There was no memory consumed. Max. memory is 8.0GB.
* CACSL2BoogieTranslator took 228.20ms. Allocated memory is still 178.3MB. Free memory was 128.9MB in the beginning and 153.3MB in the end (delta: -24.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB.
* Boogie Preprocessor took 24.62ms. Allocated memory is still 178.3MB. Free memory was 153.3MB in the beginning and 151.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
* RCFGBuilder took 297.66ms. Allocated memory is still 178.3MB. Free memory was 151.7MB in the beginning and 140.7MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB.
* TraceAbstraction took 9391.82ms. Allocated memory was 178.3MB in the beginning and 213.9MB in the end (delta: 35.7MB). Free memory was 140.2MB in the beginning and 78.1MB in the end (delta: 62.0MB). Peak memory consumption was 99.0MB. 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, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.1s, 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, 31 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 27 mSDsluCounter, 156 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 94 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 42 IncrementalHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 62 mSDtfsCounter, 42 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred 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, 27 LocationsWithAnnotation, 57 PreInvPairs, 85 NumberOfFragments, 124 HoareAnnotationTreeSize, 57 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 27 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: 27]: Loop Invariant
Derived loop invariant: 3 * (y * y) + y + y * y * y * 2 == x * 6
- ProcedureContractResult [Line: 6]: Procedure Contract for assume_abort_if_not
Derived contract for procedure assume_abort_if_not: 1
- ProcedureContractResult [Line: 17]: Procedure Contract for main
Derived contract for procedure main: 1
- ProcedureContractResult [Line: 9]: Procedure Contract for __VERIFIER_assert
Derived contract for procedure __VERIFIER_assert: !(1 <= \old(cond)) || 1 <= cond
RESULT: Ultimate proved your program to be correct!
[2022-04-08 07:43:55,452 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...