/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound100.c
--------------------------------------------------------------------------------
This is Ultimate 0.2.2-dev-34549b5
[2022-04-08 07:43:57,321 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-04-08 07:43:57,322 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-04-08 07:43:57,339 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-04-08 07:43:57,339 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-04-08 07:43:57,340 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-04-08 07:43:57,341 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-04-08 07:43:57,342 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-04-08 07:43:57,343 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-04-08 07:43:57,344 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-04-08 07:43:57,344 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-04-08 07:43:57,345 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-04-08 07:43:57,346 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-04-08 07:43:57,347 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-04-08 07:43:57,347 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-04-08 07:43:57,348 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-04-08 07:43:57,349 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-04-08 07:43:57,349 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-04-08 07:43:57,350 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-04-08 07:43:57,352 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-04-08 07:43:57,353 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values
[2022-04-08 07:43:57,353 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-04-08 07:43:57,354 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-04-08 07:43:57,355 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-04-08 07:43:57,355 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-04-08 07:43:57,357 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-04-08 07:43:57,357 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-04-08 07:43:57,358 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-04-08 07:43:57,358 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-04-08 07:43:57,358 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-04-08 07:43:57,359 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-04-08 07:43:57,359 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-04-08 07:43:57,360 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-04-08 07:43:57,360 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-04-08 07:43:57,361 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-04-08 07:43:57,361 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-04-08 07:43:57,361 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-04-08 07:43:57,362 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-04-08 07:43:57,362 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-04-08 07:43:57,362 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-04-08 07:43:57,363 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-04-08 07:43:57,363 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-04-08 07:43:57,364 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:57,369 INFO L113 SettingsManager]: Loading preferences was successful
[2022-04-08 07:43:57,369 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-04-08 07:43:57,370 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-04-08 07:43:57,370 INFO L138 SettingsManager]: * sizeof long=4
[2022-04-08 07:43:57,370 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-04-08 07:43:57,370 INFO L138 SettingsManager]: * sizeof POINTER=4
[2022-04-08 07:43:57,370 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-04-08 07:43:57,371 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-04-08 07:43:57,371 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-04-08 07:43:57,371 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-04-08 07:43:57,371 INFO L138 SettingsManager]: * sizeof long double=12
[2022-04-08 07:43:57,371 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-04-08 07:43:57,371 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-04-08 07:43:57,371 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-04-08 07:43:57,371 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-04-08 07:43:57,371 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-04-08 07:43:57,372 INFO L138 SettingsManager]: * To the following directory=./dump/
[2022-04-08 07:43:57,372 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-04-08 07:43:57,372 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-08 07:43:57,372 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-04-08 07:43:57,372 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation
[2022-04-08 07:43:57,372 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION
[2022-04-08 07:43:57,372 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL
[2022-04-08 07:43:57,372 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-04-08 07:43:57,372 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN
[2022-04-08 07:43:57,372 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:57,562 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-04-08 07:43:57,579 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-04-08 07:43:57,580 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-04-08 07:43:57,581 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-04-08 07:43:57,581 INFO L275 PluginConnector]: CDTParser initialized
[2022-04-08 07:43:57,582 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound100.c
[2022-04-08 07:43:57,642 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43a115c78/2df84af7fd1f43c0a99232b98c1c1647/FLAG0af701809
[2022-04-08 07:43:58,005 INFO L306 CDTParser]: Found 1 translation units.
[2022-04-08 07:43:58,006 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound100.c
[2022-04-08 07:43:58,010 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43a115c78/2df84af7fd1f43c0a99232b98c1c1647/FLAG0af701809
[2022-04-08 07:43:58,018 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43a115c78/2df84af7fd1f43c0a99232b98c1c1647
[2022-04-08 07:43:58,020 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-04-08 07:43:58,021 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2022-04-08 07:43:58,022 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-04-08 07:43:58,022 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-04-08 07:43:58,024 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-04-08 07:43:58,025 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 07:43:58" (1/1) ...
[2022-04-08 07:43:58,026 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@595cd8f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:43:58, skipping insertion in model container
[2022-04-08 07:43:58,026 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 07:43:58" (1/1) ...
[2022-04-08 07:43:58,031 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-04-08 07:43:58,040 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-04-08 07:43:58,159 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound100.c[458,471]
[2022-04-08 07:43:58,171 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-08 07:43:58,177 INFO L203 MainTranslator]: Completed pre-run
[2022-04-08 07:43:58,184 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound100.c[458,471]
[2022-04-08 07:43:58,189 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-08 07:43:58,197 INFO L208 MainTranslator]: Completed translation
[2022-04-08 07:43:58,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:43:58 WrapperNode
[2022-04-08 07:43:58,197 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-04-08 07:43:58,198 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-04-08 07:43:58,198 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-04-08 07:43:58,198 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-04-08 07:43:58,205 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:58" (1/1) ...
[2022-04-08 07:43:58,205 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:58" (1/1) ...
[2022-04-08 07:43:58,209 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:58" (1/1) ...
[2022-04-08 07:43:58,209 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:58" (1/1) ...
[2022-04-08 07:43:58,212 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:58" (1/1) ...
[2022-04-08 07:43:58,215 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:58" (1/1) ...
[2022-04-08 07:43:58,215 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:58" (1/1) ...
[2022-04-08 07:43:58,216 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-04-08 07:43:58,217 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-04-08 07:43:58,217 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-04-08 07:43:58,217 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-04-08 07:43:58,217 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:43:58" (1/1) ...
[2022-04-08 07:43:58,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-08 07:43:58,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 07:43:58,252 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:58,259 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:58,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2022-04-08 07:43:58,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-04-08 07:43:58,276 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error
[2022-04-08 07:43:58,276 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2022-04-08 07:43:58,276 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2022-04-08 07:43:58,276 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2022-04-08 07:43:58,277 INFO L130 BoogieDeclarations]: Found specification of procedure abort
[2022-04-08 07:43:58,277 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail
[2022-04-08 07:43:58,277 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error
[2022-04-08 07:43:58,277 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-04-08 07:43:58,277 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short
[2022-04-08 07:43:58,277 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2022-04-08 07:43:58,277 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2022-04-08 07:43:58,277 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2022-04-08 07:43:58,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2022-04-08 07:43:58,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-04-08 07:43:58,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-04-08 07:43:58,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2022-04-08 07:43:58,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2022-04-08 07:43:58,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-04-08 07:43:58,315 INFO L234 CfgBuilder]: Building ICFG
[2022-04-08 07:43:58,316 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-04-08 07:43:58,429 INFO L275 CfgBuilder]: Performing block encoding
[2022-04-08 07:43:58,433 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-04-08 07:43:58,433 INFO L299 CfgBuilder]: Removed 1 assume(true) statements.
[2022-04-08 07:43:58,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 07:43:58 BoogieIcfgContainer
[2022-04-08 07:43:58,436 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-04-08 07:43:58,437 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-04-08 07:43:58,437 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-04-08 07:43:58,444 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-04-08 07:43:58,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 07:43:58" (1/3) ...
[2022-04-08 07:43:58,445 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16d69700 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 07:43:58, skipping insertion in model container
[2022-04-08 07:43:58,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:43:58" (2/3) ...
[2022-04-08 07:43:58,445 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16d69700 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 07:43:58, skipping insertion in model container
[2022-04-08 07:43:58,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 07:43:58" (3/3) ...
[2022-04-08 07:43:58,446 INFO L111 eAbstractionObserver]: Analyzing ICFG ps4-ll_unwindbound100.c
[2022-04-08 07:43:58,449 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION
[2022-04-08 07:43:58,449 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2022-04-08 07:43:58,512 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-04-08 07:43:58,532 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:58,532 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-04-08 07:43:58,558 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2022-04-08 07:43:58,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2022-04-08 07:43:58,562 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 07:43:58,562 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 07:43:58,563 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 07:43:58,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 07:43:58,574 INFO L85 PathProgramCache]: Analyzing trace with hash -2133548928, now seen corresponding path program 1 times
[2022-04-08 07:43:58,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 07:43:58,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1129244231]
[2022-04-08 07:43:58,586 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 07:43:58,587 INFO L85 PathProgramCache]: Analyzing trace with hash -2133548928, now seen corresponding path program 2 times
[2022-04-08 07:43:58,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 07:43:58,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768570962]
[2022-04-08 07:43:58,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 07:43:58,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 07:43:58,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 07:43:58,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 07:43:58,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 07:43:58,759 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {26#true} is VALID
[2022-04-08 07:43:58,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID
[2022-04-08 07:43:58,759 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #57#return; {26#true} is VALID
[2022-04-08 07:43:58,761 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {31#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 07:43:58,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {26#true} is VALID
[2022-04-08 07:43:58,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID
[2022-04-08 07:43:58,762 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #57#return; {26#true} is VALID
[2022-04-08 07:43:58,762 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret6 := main(); {26#true} is VALID
[2022-04-08 07:43:58,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {26#true} is VALID
[2022-04-08 07:43:58,763 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} assume !true; {27#false} is VALID
[2022-04-08 07:43:58,763 INFO L272 TraceCheckUtils]: 7: Hoare triple {27#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27#false} is VALID
[2022-04-08 07:43:58,764 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID
[2022-04-08 07:43:58,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID
[2022-04-08 07:43:58,764 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#false} assume !false; {27#false} is VALID
[2022-04-08 07:43:58,765 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:58,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 07:43:58,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768570962]
[2022-04-08 07:43:58,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768570962] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 07:43:58,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 07:43:58,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-04-08 07:43:58,768 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 07:43:58,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1129244231]
[2022-04-08 07:43:58,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1129244231] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 07:43:58,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 07:43:58,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-04-08 07:43:58,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352307013]
[2022-04-08 07:43:58,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 07:43:58,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11
[2022-04-08 07:43:58,774 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 07:43:58,776 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 07:43:58,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:43:58,792 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-04-08 07:43:58,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 07:43:58,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-04-08 07:43:58,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-04-08 07:43:58,812 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 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 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 07:43:59,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:43:59,004 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions.
[2022-04-08 07:43:59,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-04-08 07:43:59,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11
[2022-04-08 07:43:59,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 07:43:59,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 07:43:59,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions.
[2022-04-08 07:43:59,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 07:43:59,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions.
[2022-04-08 07:43:59,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 55 transitions.
[2022-04-08 07:43:59,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:43:59,066 INFO L225 Difference]: With dead ends: 41
[2022-04-08 07:43:59,066 INFO L226 Difference]: Without dead ends: 19
[2022-04-08 07:43:59,068 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-04-08 07:43:59,070 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 07:43:59,070 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 29 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 07:43:59,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states.
[2022-04-08 07:43:59,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18.
[2022-04-08 07:43:59,089 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 07:43:59,089 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2022-04-08 07:43:59,090 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2022-04-08 07:43:59,090 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2022-04-08 07:43:59,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:43:59,093 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions.
[2022-04-08 07:43:59,093 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions.
[2022-04-08 07:43:59,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 07:43:59,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 07:43:59,093 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 19 states.
[2022-04-08 07:43:59,094 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 19 states.
[2022-04-08 07:43:59,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:43:59,096 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions.
[2022-04-08 07:43:59,096 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions.
[2022-04-08 07:43:59,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 07:43:59,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 07:43:59,096 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 07:43:59,097 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 07:43:59,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2022-04-08 07:43:59,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions.
[2022-04-08 07:43:59,099 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 11
[2022-04-08 07:43:59,099 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 07:43:59,099 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions.
[2022-04-08 07:43:59,099 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 07:43:59,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 21 transitions.
[2022-04-08 07:43:59,118 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:43:59,118 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions.
[2022-04-08 07:43:59,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2022-04-08 07:43:59,119 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 07:43:59,119 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 07:43:59,119 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-04-08 07:43:59,119 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 07:43:59,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 07:43:59,120 INFO L85 PathProgramCache]: Analyzing trace with hash -2118701623, now seen corresponding path program 1 times
[2022-04-08 07:43:59,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 07:43:59,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2069523584]
[2022-04-08 07:43:59,121 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 07:43:59,121 INFO L85 PathProgramCache]: Analyzing trace with hash -2118701623, now seen corresponding path program 2 times
[2022-04-08 07:43:59,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 07:43:59,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037420318]
[2022-04-08 07:43:59,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 07:43:59,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 07:43:59,133 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-08 07:43:59,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [754941701]
[2022-04-08 07:43:59,133 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 07:43:59,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 07:43:59,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 07:43:59,135 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:59,155 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:59,191 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2022-04-08 07:43:59,192 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 07:43:59,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core
[2022-04-08 07:43:59,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 07:43:59,204 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 07:43:59,289 INFO L272 TraceCheckUtils]: 0: Hoare triple {190#true} call ULTIMATE.init(); {190#true} is VALID
[2022-04-08 07:43:59,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {190#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {198#(<= ~counter~0 0)} is VALID
[2022-04-08 07:43:59,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {198#(<= ~counter~0 0)} assume true; {198#(<= ~counter~0 0)} is VALID
[2022-04-08 07:43:59,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {198#(<= ~counter~0 0)} {190#true} #57#return; {198#(<= ~counter~0 0)} is VALID
[2022-04-08 07:43:59,291 INFO L272 TraceCheckUtils]: 4: Hoare triple {198#(<= ~counter~0 0)} call #t~ret6 := main(); {198#(<= ~counter~0 0)} is VALID
[2022-04-08 07:43:59,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {198#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {198#(<= ~counter~0 0)} is VALID
[2022-04-08 07:43:59,292 INFO L290 TraceCheckUtils]: 6: Hoare triple {198#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {214#(<= |main_#t~post5| 0)} is VALID
[2022-04-08 07:43:59,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {214#(<= |main_#t~post5| 0)} assume !(#t~post5 < 100);havoc #t~post5; {191#false} is VALID
[2022-04-08 07:43:59,293 INFO L272 TraceCheckUtils]: 8: Hoare triple {191#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {191#false} is VALID
[2022-04-08 07:43:59,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {191#false} ~cond := #in~cond; {191#false} is VALID
[2022-04-08 07:43:59,293 INFO L290 TraceCheckUtils]: 10: Hoare triple {191#false} assume 0 == ~cond; {191#false} is VALID
[2022-04-08 07:43:59,293 INFO L290 TraceCheckUtils]: 11: Hoare triple {191#false} assume !false; {191#false} is VALID
[2022-04-08 07:43:59,293 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:59,294 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-08 07:43:59,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 07:43:59,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037420318]
[2022-04-08 07:43:59,294 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-08 07:43:59,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754941701]
[2022-04-08 07:43:59,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754941701] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 07:43:59,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 07:43:59,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 07:43:59,295 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 07:43:59,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2069523584]
[2022-04-08 07:43:59,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2069523584] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 07:43:59,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 07:43:59,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 07:43:59,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362286697]
[2022-04-08 07:43:59,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 07:43:59,296 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12
[2022-04-08 07:43:59,297 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 07:43:59,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 07:43:59,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:43:59,306 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 07:43:59,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 07:43:59,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 07:43:59,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 07:43:59,307 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 07:43:59,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:43:59,350 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions.
[2022-04-08 07:43:59,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 07:43:59,351 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12
[2022-04-08 07:43:59,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 07:43:59,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 07:43:59,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions.
[2022-04-08 07:43:59,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 07:43:59,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions.
[2022-04-08 07:43:59,354 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 32 transitions.
[2022-04-08 07:43:59,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:43:59,377 INFO L225 Difference]: With dead ends: 28
[2022-04-08 07:43:59,377 INFO L226 Difference]: Without dead ends: 20
[2022-04-08 07:43:59,377 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 07:43:59,378 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 07:43:59,379 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 07:43:59,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states.
[2022-04-08 07:43:59,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20.
[2022-04-08 07:43:59,385 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 07:43:59,385 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2022-04-08 07:43:59,385 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2022-04-08 07:43:59,386 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2022-04-08 07:43:59,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:43:59,387 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions.
[2022-04-08 07:43:59,387 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions.
[2022-04-08 07:43:59,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 07:43:59,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 07:43:59,388 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 20 states.
[2022-04-08 07:43:59,388 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 20 states.
[2022-04-08 07:43:59,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:43:59,389 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions.
[2022-04-08 07:43:59,389 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions.
[2022-04-08 07:43:59,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 07:43:59,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 07:43:59,390 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 07:43:59,390 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 07:43:59,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2022-04-08 07:43:59,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions.
[2022-04-08 07:43:59,391 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 12
[2022-04-08 07:43:59,391 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 07:43:59,391 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions.
[2022-04-08 07:43:59,391 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 07:43:59,391 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 23 transitions.
[2022-04-08 07:43:59,412 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:59,412 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions.
[2022-04-08 07:43:59,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2022-04-08 07:43:59,413 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 07:43:59,413 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 07:43:59,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2022-04-08 07:43:59,646 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:59,647 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 07:43:59,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 07:43:59,648 INFO L85 PathProgramCache]: Analyzing trace with hash -2116914163, now seen corresponding path program 1 times
[2022-04-08 07:43:59,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 07:43:59,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [725218872]
[2022-04-08 07:43:59,648 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 07:43:59,650 INFO L85 PathProgramCache]: Analyzing trace with hash -2116914163, now seen corresponding path program 2 times
[2022-04-08 07:43:59,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 07:43:59,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106911769]
[2022-04-08 07:43:59,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 07:43:59,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 07:43:59,669 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-08 07:43:59,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1012250331]
[2022-04-08 07:43:59,670 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 07:43:59,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 07:43:59,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 07:43:59,687 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:59,688 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:59,716 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2022-04-08 07:43:59,716 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 07:43:59,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjunts are in the unsatisfiable core
[2022-04-08 07:43:59,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 07:43:59,723 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 07:43:59,807 INFO L272 TraceCheckUtils]: 0: Hoare triple {365#true} call ULTIMATE.init(); {365#true} is VALID
[2022-04-08 07:43:59,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {365#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {365#true} is VALID
[2022-04-08 07:43:59,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {365#true} assume true; {365#true} is VALID
[2022-04-08 07:43:59,808 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {365#true} {365#true} #57#return; {365#true} is VALID
[2022-04-08 07:43:59,808 INFO L272 TraceCheckUtils]: 4: Hoare triple {365#true} call #t~ret6 := main(); {365#true} is VALID
[2022-04-08 07:43:59,814 INFO L290 TraceCheckUtils]: 5: Hoare triple {365#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {385#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 07:43:59,815 INFO L290 TraceCheckUtils]: 6: Hoare triple {385#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {385#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 07:43:59,815 INFO L290 TraceCheckUtils]: 7: Hoare triple {385#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {385#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 07:43:59,816 INFO L272 TraceCheckUtils]: 8: Hoare triple {385#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {395#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 07:43:59,817 INFO L290 TraceCheckUtils]: 9: Hoare triple {395#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {399#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 07:43:59,817 INFO L290 TraceCheckUtils]: 10: Hoare triple {399#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {366#false} is VALID
[2022-04-08 07:43:59,817 INFO L290 TraceCheckUtils]: 11: Hoare triple {366#false} assume !false; {366#false} is VALID
[2022-04-08 07:43:59,817 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:59,817 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-08 07:43:59,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 07:43:59,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106911769]
[2022-04-08 07:43:59,818 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-08 07:43:59,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012250331]
[2022-04-08 07:43:59,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012250331] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 07:43:59,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 07:43:59,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-08 07:43:59,818 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 07:43:59,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [725218872]
[2022-04-08 07:43:59,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [725218872] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 07:43:59,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 07:43:59,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-08 07:43:59,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107316514]
[2022-04-08 07:43:59,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 07:43:59,819 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12
[2022-04-08 07:43:59,819 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 07:43:59,819 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 07:43:59,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:43:59,841 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-04-08 07:43:59,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 07:43:59,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-04-08 07:43:59,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2022-04-08 07:43:59,841 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 07:43:59,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:43:59,959 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions.
[2022-04-08 07:43:59,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2022-04-08 07:43:59,960 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12
[2022-04-08 07:43:59,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 07:43:59,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 07:43:59,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions.
[2022-04-08 07:43:59,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 07:43:59,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions.
[2022-04-08 07:43:59,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 35 transitions.
[2022-04-08 07:43:59,990 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:43:59,991 INFO L225 Difference]: With dead ends: 30
[2022-04-08 07:43:59,992 INFO L226 Difference]: Without dead ends: 26
[2022-04-08 07:43:59,992 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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:59,993 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 6 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 07:43:59,993 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 64 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 07:43:59,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states.
[2022-04-08 07:44:00,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26.
[2022-04-08 07:44:00,020 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 07:44:00,020 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-08 07:44:00,020 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-08 07:44:00,020 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-08 07:44:00,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:44:00,022 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions.
[2022-04-08 07:44:00,022 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions.
[2022-04-08 07:44:00,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 07:44:00,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 07:44:00,023 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states.
[2022-04-08 07:44:00,023 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states.
[2022-04-08 07:44:00,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:44:00,024 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions.
[2022-04-08 07:44:00,024 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions.
[2022-04-08 07:44:00,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 07:44:00,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 07:44:00,025 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 07:44:00,025 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 07:44:00,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-08 07:44:00,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions.
[2022-04-08 07:44:00,027 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 12
[2022-04-08 07:44:00,027 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 07:44:00,027 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions.
[2022-04-08 07:44:00,027 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 07:44:00,028 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 29 transitions.
[2022-04-08 07:44:00,057 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:44:00,057 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions.
[2022-04-08 07:44:00,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2022-04-08 07:44:00,060 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 07:44:00,060 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 07:44:00,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2022-04-08 07:44:00,275 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2
[2022-04-08 07:44:00,276 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 07:44:00,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 07:44:00,276 INFO L85 PathProgramCache]: Analyzing trace with hash -263585780, now seen corresponding path program 1 times
[2022-04-08 07:44:00,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 07:44:00,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [355709939]
[2022-04-08 07:44:00,483 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult
[2022-04-08 07:44:00,483 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE
[2022-04-08 07:44:00,483 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 07:44:00,483 INFO L85 PathProgramCache]: Analyzing trace with hash -263585780, now seen corresponding path program 2 times
[2022-04-08 07:44:00,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 07:44:00,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938628571]
[2022-04-08 07:44:00,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 07:44:00,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 07:44:00,492 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-08 07:44:00,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [579593397]
[2022-04-08 07:44:00,492 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 07:44:00,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 07:44:00,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 07:44:00,508 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 07:44:00,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2022-04-08 07:44:00,538 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 07:44:00,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 07:44:00,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core
[2022-04-08 07:44:00,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 07:44:00,547 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 07:44:00,648 INFO L272 TraceCheckUtils]: 0: Hoare triple {571#true} call ULTIMATE.init(); {571#true} is VALID
[2022-04-08 07:44:00,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {571#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {579#(<= ~counter~0 0)} is VALID
[2022-04-08 07:44:00,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {579#(<= ~counter~0 0)} assume true; {579#(<= ~counter~0 0)} is VALID
[2022-04-08 07:44:00,650 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {579#(<= ~counter~0 0)} {571#true} #57#return; {579#(<= ~counter~0 0)} is VALID
[2022-04-08 07:44:00,650 INFO L272 TraceCheckUtils]: 4: Hoare triple {579#(<= ~counter~0 0)} call #t~ret6 := main(); {579#(<= ~counter~0 0)} is VALID
[2022-04-08 07:44:00,654 INFO L290 TraceCheckUtils]: 5: Hoare triple {579#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {579#(<= ~counter~0 0)} is VALID
[2022-04-08 07:44:00,654 INFO L290 TraceCheckUtils]: 6: Hoare triple {579#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {595#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:00,658 INFO L290 TraceCheckUtils]: 7: Hoare triple {595#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {595#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:00,658 INFO L272 TraceCheckUtils]: 8: Hoare triple {595#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {595#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:00,659 INFO L290 TraceCheckUtils]: 9: Hoare triple {595#(<= ~counter~0 1)} ~cond := #in~cond; {595#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:00,659 INFO L290 TraceCheckUtils]: 10: Hoare triple {595#(<= ~counter~0 1)} assume !(0 == ~cond); {595#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:00,660 INFO L290 TraceCheckUtils]: 11: Hoare triple {595#(<= ~counter~0 1)} assume true; {595#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:00,660 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {595#(<= ~counter~0 1)} {595#(<= ~counter~0 1)} #51#return; {595#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:00,661 INFO L290 TraceCheckUtils]: 13: Hoare triple {595#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {595#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:00,661 INFO L290 TraceCheckUtils]: 14: Hoare triple {595#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {620#(<= |main_#t~post5| 1)} is VALID
[2022-04-08 07:44:00,661 INFO L290 TraceCheckUtils]: 15: Hoare triple {620#(<= |main_#t~post5| 1)} assume !(#t~post5 < 100);havoc #t~post5; {572#false} is VALID
[2022-04-08 07:44:00,662 INFO L272 TraceCheckUtils]: 16: Hoare triple {572#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {572#false} is VALID
[2022-04-08 07:44:00,662 INFO L290 TraceCheckUtils]: 17: Hoare triple {572#false} ~cond := #in~cond; {572#false} is VALID
[2022-04-08 07:44:00,662 INFO L290 TraceCheckUtils]: 18: Hoare triple {572#false} assume 0 == ~cond; {572#false} is VALID
[2022-04-08 07:44:00,662 INFO L290 TraceCheckUtils]: 19: Hoare triple {572#false} assume !false; {572#false} is VALID
[2022-04-08 07:44:00,662 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 07:44:00,662 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 07:44:00,793 INFO L290 TraceCheckUtils]: 19: Hoare triple {572#false} assume !false; {572#false} is VALID
[2022-04-08 07:44:00,794 INFO L290 TraceCheckUtils]: 18: Hoare triple {572#false} assume 0 == ~cond; {572#false} is VALID
[2022-04-08 07:44:00,794 INFO L290 TraceCheckUtils]: 17: Hoare triple {572#false} ~cond := #in~cond; {572#false} is VALID
[2022-04-08 07:44:00,794 INFO L272 TraceCheckUtils]: 16: Hoare triple {572#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {572#false} is VALID
[2022-04-08 07:44:00,794 INFO L290 TraceCheckUtils]: 15: Hoare triple {648#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {572#false} is VALID
[2022-04-08 07:44:00,795 INFO L290 TraceCheckUtils]: 14: Hoare triple {652#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {648#(< |main_#t~post5| 100)} is VALID
[2022-04-08 07:44:00,795 INFO L290 TraceCheckUtils]: 13: Hoare triple {652#(< ~counter~0 100)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {652#(< ~counter~0 100)} is VALID
[2022-04-08 07:44:00,796 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {571#true} {652#(< ~counter~0 100)} #51#return; {652#(< ~counter~0 100)} is VALID
[2022-04-08 07:44:00,796 INFO L290 TraceCheckUtils]: 11: Hoare triple {571#true} assume true; {571#true} is VALID
[2022-04-08 07:44:00,796 INFO L290 TraceCheckUtils]: 10: Hoare triple {571#true} assume !(0 == ~cond); {571#true} is VALID
[2022-04-08 07:44:00,796 INFO L290 TraceCheckUtils]: 9: Hoare triple {571#true} ~cond := #in~cond; {571#true} is VALID
[2022-04-08 07:44:00,796 INFO L272 TraceCheckUtils]: 8: Hoare triple {652#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {571#true} is VALID
[2022-04-08 07:44:00,796 INFO L290 TraceCheckUtils]: 7: Hoare triple {652#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {652#(< ~counter~0 100)} is VALID
[2022-04-08 07:44:00,797 INFO L290 TraceCheckUtils]: 6: Hoare triple {677#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {652#(< ~counter~0 100)} is VALID
[2022-04-08 07:44:00,797 INFO L290 TraceCheckUtils]: 5: Hoare triple {677#(< ~counter~0 99)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {677#(< ~counter~0 99)} is VALID
[2022-04-08 07:44:00,798 INFO L272 TraceCheckUtils]: 4: Hoare triple {677#(< ~counter~0 99)} call #t~ret6 := main(); {677#(< ~counter~0 99)} is VALID
[2022-04-08 07:44:00,798 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {677#(< ~counter~0 99)} {571#true} #57#return; {677#(< ~counter~0 99)} is VALID
[2022-04-08 07:44:00,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {677#(< ~counter~0 99)} assume true; {677#(< ~counter~0 99)} is VALID
[2022-04-08 07:44:00,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {571#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {677#(< ~counter~0 99)} is VALID
[2022-04-08 07:44:00,799 INFO L272 TraceCheckUtils]: 0: Hoare triple {571#true} call ULTIMATE.init(); {571#true} is VALID
[2022-04-08 07:44:00,799 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 07:44:00,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 07:44:00,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938628571]
[2022-04-08 07:44:00,800 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-08 07:44:00,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579593397]
[2022-04-08 07:44:00,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579593397] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 07:44:00,800 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2022-04-08 07:44:00,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8
[2022-04-08 07:44:00,800 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 07:44:00,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [355709939]
[2022-04-08 07:44:00,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [355709939] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 07:44:00,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 07:44:00,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-08 07:44:00,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636479341]
[2022-04-08 07:44:00,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 07:44:00,801 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20
[2022-04-08 07:44:00,801 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 07:44:00,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-08 07:44:00,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:44:00,814 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-04-08 07:44:00,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 07:44:00,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-04-08 07:44:00,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2022-04-08 07:44:00,815 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-08 07:44:00,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:44:00,900 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions.
[2022-04-08 07:44:00,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2022-04-08 07:44:00,901 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20
[2022-04-08 07:44:00,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 07:44:00,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-08 07:44:00,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions.
[2022-04-08 07:44:00,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-08 07:44:00,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions.
[2022-04-08 07:44:00,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions.
[2022-04-08 07:44:00,931 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:44:00,931 INFO L225 Difference]: With dead ends: 36
[2022-04-08 07:44:00,931 INFO L226 Difference]: Without dead ends: 28
[2022-04-08 07:44:00,932 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2022-04-08 07:44:00,932 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 2 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 07:44:00,933 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 66 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 07:44:00,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states.
[2022-04-08 07:44:00,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28.
[2022-04-08 07:44:00,946 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 07:44:00,946 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-08 07:44:00,947 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-08 07:44:00,947 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-08 07:44:00,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:44:00,948 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions.
[2022-04-08 07:44:00,948 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions.
[2022-04-08 07:44:00,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 07:44:00,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 07:44:00,949 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 28 states.
[2022-04-08 07:44:00,949 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 28 states.
[2022-04-08 07:44:00,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:44:00,950 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions.
[2022-04-08 07:44:00,950 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions.
[2022-04-08 07:44:00,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 07:44:00,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 07:44:00,950 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 07:44:00,950 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 07:44:00,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-08 07:44:00,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions.
[2022-04-08 07:44:00,951 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 20
[2022-04-08 07:44:00,952 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 07:44:00,952 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions.
[2022-04-08 07:44:00,952 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-08 07:44:00,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 31 transitions.
[2022-04-08 07:44:00,978 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:44:00,978 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions.
[2022-04-08 07:44:00,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2022-04-08 07:44:00,979 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 07:44:00,979 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 07:44:01,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2022-04-08 07:44:01,187 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 07:44:01,187 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 07:44:01,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 07:44:01,188 INFO L85 PathProgramCache]: Analyzing trace with hash -261798320, now seen corresponding path program 1 times
[2022-04-08 07:44:01,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 07:44:01,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [4363182]
[2022-04-08 07:44:01,289 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult
[2022-04-08 07:44:01,289 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE
[2022-04-08 07:44:01,289 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 07:44:01,289 INFO L85 PathProgramCache]: Analyzing trace with hash -261798320, now seen corresponding path program 2 times
[2022-04-08 07:44:01,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 07:44:01,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710325726]
[2022-04-08 07:44:01,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 07:44:01,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 07:44:01,302 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-08 07:44:01,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [789985877]
[2022-04-08 07:44:01,303 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 07:44:01,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 07:44:01,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 07:44:01,304 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 07:44:01,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2022-04-08 07:44:01,333 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 07:44:01,333 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 07:44:01,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 11 conjunts are in the unsatisfiable core
[2022-04-08 07:44:01,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 07:44:01,339 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 07:44:01,438 INFO L272 TraceCheckUtils]: 0: Hoare triple {884#true} call ULTIMATE.init(); {884#true} is VALID
[2022-04-08 07:44:01,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {884#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {884#true} is VALID
[2022-04-08 07:44:01,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {884#true} assume true; {884#true} is VALID
[2022-04-08 07:44:01,438 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {884#true} {884#true} #57#return; {884#true} is VALID
[2022-04-08 07:44:01,438 INFO L272 TraceCheckUtils]: 4: Hoare triple {884#true} call #t~ret6 := main(); {884#true} is VALID
[2022-04-08 07:44:01,439 INFO L290 TraceCheckUtils]: 5: Hoare triple {884#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {904#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 07:44:01,439 INFO L290 TraceCheckUtils]: 6: Hoare triple {904#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {904#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 07:44:01,441 INFO L290 TraceCheckUtils]: 7: Hoare triple {904#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {904#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 07:44:01,441 INFO L272 TraceCheckUtils]: 8: Hoare triple {904#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {884#true} is VALID
[2022-04-08 07:44:01,441 INFO L290 TraceCheckUtils]: 9: Hoare triple {884#true} ~cond := #in~cond; {884#true} is VALID
[2022-04-08 07:44:01,441 INFO L290 TraceCheckUtils]: 10: Hoare triple {884#true} assume !(0 == ~cond); {884#true} is VALID
[2022-04-08 07:44:01,441 INFO L290 TraceCheckUtils]: 11: Hoare triple {884#true} assume true; {884#true} is VALID
[2022-04-08 07:44:01,442 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {884#true} {904#(and (= main_~x~0 0) (= main_~y~0 0))} #51#return; {904#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 07:44:01,443 INFO L290 TraceCheckUtils]: 13: Hoare triple {904#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {929#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} is VALID
[2022-04-08 07:44:01,443 INFO L290 TraceCheckUtils]: 14: Hoare triple {929#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {929#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} is VALID
[2022-04-08 07:44:01,444 INFO L290 TraceCheckUtils]: 15: Hoare triple {929#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} assume !!(#t~post5 < 100);havoc #t~post5; {929#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} is VALID
[2022-04-08 07:44:01,444 INFO L272 TraceCheckUtils]: 16: Hoare triple {929#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {939#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 07:44:01,445 INFO L290 TraceCheckUtils]: 17: Hoare triple {939#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {943#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 07:44:01,445 INFO L290 TraceCheckUtils]: 18: Hoare triple {943#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {885#false} is VALID
[2022-04-08 07:44:01,445 INFO L290 TraceCheckUtils]: 19: Hoare triple {885#false} assume !false; {885#false} is VALID
[2022-04-08 07:44:01,445 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 07:44:01,446 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 07:44:01,585 INFO L290 TraceCheckUtils]: 19: Hoare triple {885#false} assume !false; {885#false} is VALID
[2022-04-08 07:44:01,586 INFO L290 TraceCheckUtils]: 18: Hoare triple {943#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {885#false} is VALID
[2022-04-08 07:44:01,586 INFO L290 TraceCheckUtils]: 17: Hoare triple {939#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {943#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 07:44:01,587 INFO L272 TraceCheckUtils]: 16: Hoare triple {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {939#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 07:44:01,587 INFO L290 TraceCheckUtils]: 15: Hoare triple {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !!(#t~post5 < 100);havoc #t~post5; {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID
[2022-04-08 07:44:01,589 INFO L290 TraceCheckUtils]: 14: Hoare triple {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID
[2022-04-08 07:44:01,596 INFO L290 TraceCheckUtils]: 13: Hoare triple {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID
[2022-04-08 07:44:01,597 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {884#true} {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} #51#return; {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID
[2022-04-08 07:44:01,597 INFO L290 TraceCheckUtils]: 11: Hoare triple {884#true} assume true; {884#true} is VALID
[2022-04-08 07:44:01,597 INFO L290 TraceCheckUtils]: 10: Hoare triple {884#true} assume !(0 == ~cond); {884#true} is VALID
[2022-04-08 07:44:01,597 INFO L290 TraceCheckUtils]: 9: Hoare triple {884#true} ~cond := #in~cond; {884#true} is VALID
[2022-04-08 07:44:01,598 INFO L272 TraceCheckUtils]: 8: Hoare triple {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {884#true} is VALID
[2022-04-08 07:44:01,598 INFO L290 TraceCheckUtils]: 7: Hoare triple {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !!(#t~post5 < 100);havoc #t~post5; {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID
[2022-04-08 07:44:01,598 INFO L290 TraceCheckUtils]: 6: Hoare triple {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID
[2022-04-08 07:44:01,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {884#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID
[2022-04-08 07:44:01,600 INFO L272 TraceCheckUtils]: 4: Hoare triple {884#true} call #t~ret6 := main(); {884#true} is VALID
[2022-04-08 07:44:01,600 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {884#true} {884#true} #57#return; {884#true} is VALID
[2022-04-08 07:44:01,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {884#true} assume true; {884#true} is VALID
[2022-04-08 07:44:01,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {884#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {884#true} is VALID
[2022-04-08 07:44:01,600 INFO L272 TraceCheckUtils]: 0: Hoare triple {884#true} call ULTIMATE.init(); {884#true} is VALID
[2022-04-08 07:44:01,600 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2022-04-08 07:44:01,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 07:44:01,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710325726]
[2022-04-08 07:44:01,601 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-08 07:44:01,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789985877]
[2022-04-08 07:44:01,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789985877] provided 1 perfect and 1 imperfect interpolant sequences
[2022-04-08 07:44:01,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2022-04-08 07:44:01,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7
[2022-04-08 07:44:01,601 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 07:44:01,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [4363182]
[2022-04-08 07:44:01,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [4363182] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 07:44:01,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 07:44:01,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-08 07:44:01,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637989222]
[2022-04-08 07:44:01,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 07:44:01,602 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20
[2022-04-08 07:44:01,602 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 07:44:01,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-08 07:44:01,627 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:44:01,627 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-04-08 07:44:01,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 07:44:01,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-04-08 07:44:01,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2022-04-08 07:44:01,628 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-08 07:44:01,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:44:01,716 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions.
[2022-04-08 07:44:01,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2022-04-08 07:44:01,716 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20
[2022-04-08 07:44:01,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 07:44:01,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-08 07:44:01,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions.
[2022-04-08 07:44:01,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-08 07:44:01,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions.
[2022-04-08 07:44:01,719 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 26 transitions.
[2022-04-08 07:44:01,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:44:01,744 INFO L225 Difference]: With dead ends: 34
[2022-04-08 07:44:01,744 INFO L226 Difference]: Without dead ends: 29
[2022-04-08 07:44:01,744 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2022-04-08 07:44:01,745 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 7 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 07:44:01,745 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 53 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 07:44:01,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states.
[2022-04-08 07:44:01,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29.
[2022-04-08 07:44:01,762 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 07:44:01,762 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 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:44:01,763 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 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:44:01,763 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 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:44:01,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:44:01,764 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions.
[2022-04-08 07:44:01,764 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions.
[2022-04-08 07:44:01,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 07:44:01,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 07:44:01,764 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 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 29 states.
[2022-04-08 07:44:01,765 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 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 29 states.
[2022-04-08 07:44:01,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:44:01,766 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions.
[2022-04-08 07:44:01,766 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions.
[2022-04-08 07:44:01,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 07:44:01,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 07:44:01,766 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 07:44:01,766 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 07:44:01,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 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:44:01,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions.
[2022-04-08 07:44:01,767 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 20
[2022-04-08 07:44:01,767 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 07:44:01,767 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions.
[2022-04-08 07:44:01,767 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-08 07:44:01,767 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 30 transitions.
[2022-04-08 07:44:01,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:44:01,799 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions.
[2022-04-08 07:44:01,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2022-04-08 07:44:01,799 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 07:44:01,799 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 07:44:01,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2022-04-08 07:44:02,000 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 07:44:02,000 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 07:44:02,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 07:44:02,000 INFO L85 PathProgramCache]: Analyzing trace with hash 891414954, now seen corresponding path program 1 times
[2022-04-08 07:44:02,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 07:44:02,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1245301269]
[2022-04-08 07:44:02,084 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult
[2022-04-08 07:44:02,084 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE
[2022-04-08 07:44:02,084 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 07:44:02,084 INFO L85 PathProgramCache]: Analyzing trace with hash 891414954, now seen corresponding path program 2 times
[2022-04-08 07:44:02,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 07:44:02,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994455222]
[2022-04-08 07:44:02,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 07:44:02,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 07:44:02,093 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-08 07:44:02,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [563804132]
[2022-04-08 07:44:02,093 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 07:44:02,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 07:44:02,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 07:44:02,094 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 07:44:02,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2022-04-08 07:44:02,125 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 07:44:02,125 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 07:44:02,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 12 conjunts are in the unsatisfiable core
[2022-04-08 07:44:02,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 07:44:02,139 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 07:44:02,366 INFO L272 TraceCheckUtils]: 0: Hoare triple {1196#true} call ULTIMATE.init(); {1196#true} is VALID
[2022-04-08 07:44:02,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {1196#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1196#true} is VALID
[2022-04-08 07:44:02,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {1196#true} assume true; {1196#true} is VALID
[2022-04-08 07:44:02,367 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1196#true} {1196#true} #57#return; {1196#true} is VALID
[2022-04-08 07:44:02,367 INFO L272 TraceCheckUtils]: 4: Hoare triple {1196#true} call #t~ret6 := main(); {1196#true} is VALID
[2022-04-08 07:44:02,370 INFO L290 TraceCheckUtils]: 5: Hoare triple {1196#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {1216#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 07:44:02,370 INFO L290 TraceCheckUtils]: 6: Hoare triple {1216#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1216#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 07:44:02,370 INFO L290 TraceCheckUtils]: 7: Hoare triple {1216#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {1216#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 07:44:02,370 INFO L272 TraceCheckUtils]: 8: Hoare triple {1216#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1196#true} is VALID
[2022-04-08 07:44:02,371 INFO L290 TraceCheckUtils]: 9: Hoare triple {1196#true} ~cond := #in~cond; {1196#true} is VALID
[2022-04-08 07:44:02,371 INFO L290 TraceCheckUtils]: 10: Hoare triple {1196#true} assume !(0 == ~cond); {1196#true} is VALID
[2022-04-08 07:44:02,371 INFO L290 TraceCheckUtils]: 11: Hoare triple {1196#true} assume true; {1196#true} is VALID
[2022-04-08 07:44:02,371 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1196#true} {1216#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {1216#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 07:44:02,372 INFO L290 TraceCheckUtils]: 13: Hoare triple {1216#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1241#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID
[2022-04-08 07:44:02,372 INFO L290 TraceCheckUtils]: 14: Hoare triple {1241#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1241#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID
[2022-04-08 07:44:02,372 INFO L290 TraceCheckUtils]: 15: Hoare triple {1241#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {1241#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID
[2022-04-08 07:44:02,372 INFO L272 TraceCheckUtils]: 16: Hoare triple {1241#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1196#true} is VALID
[2022-04-08 07:44:02,372 INFO L290 TraceCheckUtils]: 17: Hoare triple {1196#true} ~cond := #in~cond; {1196#true} is VALID
[2022-04-08 07:44:02,373 INFO L290 TraceCheckUtils]: 18: Hoare triple {1196#true} assume !(0 == ~cond); {1196#true} is VALID
[2022-04-08 07:44:02,373 INFO L290 TraceCheckUtils]: 19: Hoare triple {1196#true} assume true; {1196#true} is VALID
[2022-04-08 07:44:02,373 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1196#true} {1241#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #51#return; {1241#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID
[2022-04-08 07:44:02,374 INFO L290 TraceCheckUtils]: 21: Hoare triple {1241#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {1266#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID
[2022-04-08 07:44:02,374 INFO L272 TraceCheckUtils]: 22: Hoare triple {1266#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1270#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 07:44:02,374 INFO L290 TraceCheckUtils]: 23: Hoare triple {1270#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1274#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 07:44:02,375 INFO L290 TraceCheckUtils]: 24: Hoare triple {1274#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1197#false} is VALID
[2022-04-08 07:44:02,375 INFO L290 TraceCheckUtils]: 25: Hoare triple {1197#false} assume !false; {1197#false} is VALID
[2022-04-08 07:44:02,375 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2022-04-08 07:44:02,375 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 07:44:02,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 07:44:02,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994455222]
[2022-04-08 07:44:02,595 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-08 07:44:02,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563804132]
[2022-04-08 07:44:02,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563804132] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 07:44:02,595 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences.
[2022-04-08 07:44:02,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7
[2022-04-08 07:44:02,595 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 07:44:02,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1245301269]
[2022-04-08 07:44:02,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1245301269] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 07:44:02,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 07:44:02,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2022-04-08 07:44:02,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909045018]
[2022-04-08 07:44:02,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 07:44:02,596 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26
[2022-04-08 07:44:02,596 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 07:44:02,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2022-04-08 07:44:02,610 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:44:02,610 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2022-04-08 07:44:02,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 07:44:02,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2022-04-08 07:44:02,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2022-04-08 07:44:02,610 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2022-04-08 07:44:02,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:44:02,774 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions.
[2022-04-08 07:44:02,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2022-04-08 07:44:02,775 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26
[2022-04-08 07:44:02,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 07:44:02,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2022-04-08 07:44:02,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions.
[2022-04-08 07:44:02,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2022-04-08 07:44:02,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions.
[2022-04-08 07:44:02,777 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 34 transitions.
[2022-04-08 07:44:02,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:44:02,793 INFO L225 Difference]: With dead ends: 36
[2022-04-08 07:44:02,793 INFO L226 Difference]: Without dead ends: 31
[2022-04-08 07:44:02,794 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132
[2022-04-08 07:44:02,794 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 07:44:02,795 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 100 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 07:44:02,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states.
[2022-04-08 07:44:02,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31.
[2022-04-08 07:44:02,810 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 07:44:02,811 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-08 07:44:02,811 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-08 07:44:02,811 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-08 07:44:02,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:44:02,812 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions.
[2022-04-08 07:44:02,812 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions.
[2022-04-08 07:44:02,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 07:44:02,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 07:44:02,812 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 31 states.
[2022-04-08 07:44:02,813 INFO L87 Difference]: Start difference. First operand has 31 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 31 states.
[2022-04-08 07:44:02,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:44:02,813 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions.
[2022-04-08 07:44:02,813 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions.
[2022-04-08 07:44:02,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 07:44:02,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 07:44:02,814 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 07:44:02,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 07:44:02,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-08 07:44:02,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions.
[2022-04-08 07:44:02,815 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 26
[2022-04-08 07:44:02,823 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 07:44:02,824 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions.
[2022-04-08 07:44:02,824 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2022-04-08 07:44:02,824 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 33 transitions.
[2022-04-08 07:44:02,860 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:44:02,860 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions.
[2022-04-08 07:44:02,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2022-04-08 07:44:02,860 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 07:44:02,860 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 07:44:02,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2022-04-08 07:44:03,061 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 07:44:03,061 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 07:44:03,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 07:44:03,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1647059121, now seen corresponding path program 3 times
[2022-04-08 07:44:03,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 07:44:03,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1021381726]
[2022-04-08 07:44:03,151 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult
[2022-04-08 07:44:03,152 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE
[2022-04-08 07:44:03,152 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 07:44:03,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1647059121, now seen corresponding path program 4 times
[2022-04-08 07:44:03,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 07:44:03,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512627718]
[2022-04-08 07:44:03,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 07:44:03,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 07:44:03,173 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-08 07:44:03,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [388084089]
[2022-04-08 07:44:03,173 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-04-08 07:44:03,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 07:44:03,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 07:44:03,183 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 07:44:03,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2022-04-08 07:44:03,240 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-04-08 07:44:03,240 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 07:44:03,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core
[2022-04-08 07:44:03,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 07:44:03,248 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 07:44:03,363 INFO L272 TraceCheckUtils]: 0: Hoare triple {1525#true} call ULTIMATE.init(); {1525#true} is VALID
[2022-04-08 07:44:03,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {1525#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1533#(<= ~counter~0 0)} is VALID
[2022-04-08 07:44:03,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {1533#(<= ~counter~0 0)} assume true; {1533#(<= ~counter~0 0)} is VALID
[2022-04-08 07:44:03,364 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1533#(<= ~counter~0 0)} {1525#true} #57#return; {1533#(<= ~counter~0 0)} is VALID
[2022-04-08 07:44:03,364 INFO L272 TraceCheckUtils]: 4: Hoare triple {1533#(<= ~counter~0 0)} call #t~ret6 := main(); {1533#(<= ~counter~0 0)} is VALID
[2022-04-08 07:44:03,365 INFO L290 TraceCheckUtils]: 5: Hoare triple {1533#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {1533#(<= ~counter~0 0)} is VALID
[2022-04-08 07:44:03,365 INFO L290 TraceCheckUtils]: 6: Hoare triple {1533#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1549#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:03,366 INFO L290 TraceCheckUtils]: 7: Hoare triple {1549#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {1549#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:03,367 INFO L272 TraceCheckUtils]: 8: Hoare triple {1549#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1549#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:03,367 INFO L290 TraceCheckUtils]: 9: Hoare triple {1549#(<= ~counter~0 1)} ~cond := #in~cond; {1549#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:03,367 INFO L290 TraceCheckUtils]: 10: Hoare triple {1549#(<= ~counter~0 1)} assume !(0 == ~cond); {1549#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:03,368 INFO L290 TraceCheckUtils]: 11: Hoare triple {1549#(<= ~counter~0 1)} assume true; {1549#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:03,368 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1549#(<= ~counter~0 1)} {1549#(<= ~counter~0 1)} #51#return; {1549#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:03,368 INFO L290 TraceCheckUtils]: 13: Hoare triple {1549#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1549#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:03,369 INFO L290 TraceCheckUtils]: 14: Hoare triple {1549#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1574#(<= ~counter~0 2)} is VALID
[2022-04-08 07:44:03,369 INFO L290 TraceCheckUtils]: 15: Hoare triple {1574#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {1574#(<= ~counter~0 2)} is VALID
[2022-04-08 07:44:03,370 INFO L272 TraceCheckUtils]: 16: Hoare triple {1574#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1574#(<= ~counter~0 2)} is VALID
[2022-04-08 07:44:03,370 INFO L290 TraceCheckUtils]: 17: Hoare triple {1574#(<= ~counter~0 2)} ~cond := #in~cond; {1574#(<= ~counter~0 2)} is VALID
[2022-04-08 07:44:03,370 INFO L290 TraceCheckUtils]: 18: Hoare triple {1574#(<= ~counter~0 2)} assume !(0 == ~cond); {1574#(<= ~counter~0 2)} is VALID
[2022-04-08 07:44:03,370 INFO L290 TraceCheckUtils]: 19: Hoare triple {1574#(<= ~counter~0 2)} assume true; {1574#(<= ~counter~0 2)} is VALID
[2022-04-08 07:44:03,371 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1574#(<= ~counter~0 2)} {1574#(<= ~counter~0 2)} #51#return; {1574#(<= ~counter~0 2)} is VALID
[2022-04-08 07:44:03,371 INFO L290 TraceCheckUtils]: 21: Hoare triple {1574#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1574#(<= ~counter~0 2)} is VALID
[2022-04-08 07:44:03,372 INFO L290 TraceCheckUtils]: 22: Hoare triple {1574#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1599#(<= |main_#t~post5| 2)} is VALID
[2022-04-08 07:44:03,372 INFO L290 TraceCheckUtils]: 23: Hoare triple {1599#(<= |main_#t~post5| 2)} assume !(#t~post5 < 100);havoc #t~post5; {1526#false} is VALID
[2022-04-08 07:44:03,372 INFO L272 TraceCheckUtils]: 24: Hoare triple {1526#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1526#false} is VALID
[2022-04-08 07:44:03,372 INFO L290 TraceCheckUtils]: 25: Hoare triple {1526#false} ~cond := #in~cond; {1526#false} is VALID
[2022-04-08 07:44:03,372 INFO L290 TraceCheckUtils]: 26: Hoare triple {1526#false} assume 0 == ~cond; {1526#false} is VALID
[2022-04-08 07:44:03,372 INFO L290 TraceCheckUtils]: 27: Hoare triple {1526#false} assume !false; {1526#false} is VALID
[2022-04-08 07:44:03,372 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 07:44:03,373 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 07:44:03,504 INFO L290 TraceCheckUtils]: 27: Hoare triple {1526#false} assume !false; {1526#false} is VALID
[2022-04-08 07:44:03,504 INFO L290 TraceCheckUtils]: 26: Hoare triple {1526#false} assume 0 == ~cond; {1526#false} is VALID
[2022-04-08 07:44:03,504 INFO L290 TraceCheckUtils]: 25: Hoare triple {1526#false} ~cond := #in~cond; {1526#false} is VALID
[2022-04-08 07:44:03,504 INFO L272 TraceCheckUtils]: 24: Hoare triple {1526#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1526#false} is VALID
[2022-04-08 07:44:03,505 INFO L290 TraceCheckUtils]: 23: Hoare triple {1627#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {1526#false} is VALID
[2022-04-08 07:44:03,505 INFO L290 TraceCheckUtils]: 22: Hoare triple {1631#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1627#(< |main_#t~post5| 100)} is VALID
[2022-04-08 07:44:03,505 INFO L290 TraceCheckUtils]: 21: Hoare triple {1631#(< ~counter~0 100)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1631#(< ~counter~0 100)} is VALID
[2022-04-08 07:44:03,506 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1525#true} {1631#(< ~counter~0 100)} #51#return; {1631#(< ~counter~0 100)} is VALID
[2022-04-08 07:44:03,506 INFO L290 TraceCheckUtils]: 19: Hoare triple {1525#true} assume true; {1525#true} is VALID
[2022-04-08 07:44:03,506 INFO L290 TraceCheckUtils]: 18: Hoare triple {1525#true} assume !(0 == ~cond); {1525#true} is VALID
[2022-04-08 07:44:03,506 INFO L290 TraceCheckUtils]: 17: Hoare triple {1525#true} ~cond := #in~cond; {1525#true} is VALID
[2022-04-08 07:44:03,506 INFO L272 TraceCheckUtils]: 16: Hoare triple {1631#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1525#true} is VALID
[2022-04-08 07:44:03,507 INFO L290 TraceCheckUtils]: 15: Hoare triple {1631#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {1631#(< ~counter~0 100)} is VALID
[2022-04-08 07:44:03,507 INFO L290 TraceCheckUtils]: 14: Hoare triple {1656#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1631#(< ~counter~0 100)} is VALID
[2022-04-08 07:44:03,507 INFO L290 TraceCheckUtils]: 13: Hoare triple {1656#(< ~counter~0 99)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1656#(< ~counter~0 99)} is VALID
[2022-04-08 07:44:03,508 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1525#true} {1656#(< ~counter~0 99)} #51#return; {1656#(< ~counter~0 99)} is VALID
[2022-04-08 07:44:03,508 INFO L290 TraceCheckUtils]: 11: Hoare triple {1525#true} assume true; {1525#true} is VALID
[2022-04-08 07:44:03,508 INFO L290 TraceCheckUtils]: 10: Hoare triple {1525#true} assume !(0 == ~cond); {1525#true} is VALID
[2022-04-08 07:44:03,508 INFO L290 TraceCheckUtils]: 9: Hoare triple {1525#true} ~cond := #in~cond; {1525#true} is VALID
[2022-04-08 07:44:03,508 INFO L272 TraceCheckUtils]: 8: Hoare triple {1656#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1525#true} is VALID
[2022-04-08 07:44:03,508 INFO L290 TraceCheckUtils]: 7: Hoare triple {1656#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {1656#(< ~counter~0 99)} is VALID
[2022-04-08 07:44:03,509 INFO L290 TraceCheckUtils]: 6: Hoare triple {1681#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1656#(< ~counter~0 99)} is VALID
[2022-04-08 07:44:03,509 INFO L290 TraceCheckUtils]: 5: Hoare triple {1681#(< ~counter~0 98)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {1681#(< ~counter~0 98)} is VALID
[2022-04-08 07:44:03,510 INFO L272 TraceCheckUtils]: 4: Hoare triple {1681#(< ~counter~0 98)} call #t~ret6 := main(); {1681#(< ~counter~0 98)} is VALID
[2022-04-08 07:44:03,510 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1681#(< ~counter~0 98)} {1525#true} #57#return; {1681#(< ~counter~0 98)} is VALID
[2022-04-08 07:44:03,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {1681#(< ~counter~0 98)} assume true; {1681#(< ~counter~0 98)} is VALID
[2022-04-08 07:44:03,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {1525#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1681#(< ~counter~0 98)} is VALID
[2022-04-08 07:44:03,511 INFO L272 TraceCheckUtils]: 0: Hoare triple {1525#true} call ULTIMATE.init(); {1525#true} is VALID
[2022-04-08 07:44:03,511 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2022-04-08 07:44:03,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 07:44:03,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512627718]
[2022-04-08 07:44:03,511 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-08 07:44:03,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388084089]
[2022-04-08 07:44:03,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388084089] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 07:44:03,511 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2022-04-08 07:44:03,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10
[2022-04-08 07:44:03,512 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 07:44:03,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1021381726]
[2022-04-08 07:44:03,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1021381726] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 07:44:03,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 07:44:03,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-04-08 07:44:03,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737846111]
[2022-04-08 07:44:03,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 07:44:03,512 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 28
[2022-04-08 07:44:03,513 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 07:44:03,513 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 5 states have call successors, (5), 5 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:44:03,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:44:03,529 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-04-08 07:44:03,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 07:44:03,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-04-08 07:44:03,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90
[2022-04-08 07:44:03,530 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 5 states have call successors, (5), 5 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:44:03,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:44:03,614 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions.
[2022-04-08 07:44:03,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2022-04-08 07:44:03,614 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 28
[2022-04-08 07:44:03,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 07:44:03,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 5 states have call successors, (5), 5 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:44:03,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions.
[2022-04-08 07:44:03,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 5 states have call successors, (5), 5 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:44:03,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions.
[2022-04-08 07:44:03,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 42 transitions.
[2022-04-08 07:44:03,639 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:44:03,640 INFO L225 Difference]: With dead ends: 42
[2022-04-08 07:44:03,640 INFO L226 Difference]: Without dead ends: 37
[2022-04-08 07:44:03,640 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132
[2022-04-08 07:44:03,641 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 07:44:03,641 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 64 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 07:44:03,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states.
[2022-04-08 07:44:03,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37.
[2022-04-08 07:44:03,666 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 07:44:03,666 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-08 07:44:03,666 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-08 07:44:03,666 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-08 07:44:03,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:44:03,667 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions.
[2022-04-08 07:44:03,667 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions.
[2022-04-08 07:44:03,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 07:44:03,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 07:44:03,668 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 37 states.
[2022-04-08 07:44:03,668 INFO L87 Difference]: Start difference. First operand has 37 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 37 states.
[2022-04-08 07:44:03,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:44:03,669 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions.
[2022-04-08 07:44:03,669 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions.
[2022-04-08 07:44:03,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 07:44:03,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 07:44:03,669 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 07:44:03,669 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 07:44:03,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-08 07:44:03,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions.
[2022-04-08 07:44:03,670 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 28
[2022-04-08 07:44:03,671 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 07:44:03,671 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions.
[2022-04-08 07:44:03,671 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 5 states have call successors, (5), 5 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:44:03,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 38 transitions.
[2022-04-08 07:44:03,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:44:03,714 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions.
[2022-04-08 07:44:03,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35
[2022-04-08 07:44:03,714 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 07:44:03,715 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 07:44:03,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0
[2022-04-08 07:44:03,931 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 07:44:03,931 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 07:44:03,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 07:44:03,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1036651181, now seen corresponding path program 3 times
[2022-04-08 07:44:03,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 07:44:03,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [396711690]
[2022-04-08 07:44:04,033 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult
[2022-04-08 07:44:04,033 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE
[2022-04-08 07:44:04,033 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 07:44:04,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1036651181, now seen corresponding path program 4 times
[2022-04-08 07:44:04,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 07:44:04,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163985342]
[2022-04-08 07:44:04,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 07:44:04,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 07:44:04,044 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-08 07:44:04,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1856039187]
[2022-04-08 07:44:04,045 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-04-08 07:44:04,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 07:44:04,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 07:44:04,049 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 07:44:04,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2022-04-08 07:44:04,108 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-04-08 07:44:04,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 07:44:04,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 17 conjunts are in the unsatisfiable core
[2022-04-08 07:44:04,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 07:44:04,119 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 07:44:04,364 INFO L272 TraceCheckUtils]: 0: Hoare triple {1938#true} call ULTIMATE.init(); {1938#true} is VALID
[2022-04-08 07:44:04,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {1938#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1938#true} is VALID
[2022-04-08 07:44:04,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {1938#true} assume true; {1938#true} is VALID
[2022-04-08 07:44:04,364 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1938#true} {1938#true} #57#return; {1938#true} is VALID
[2022-04-08 07:44:04,364 INFO L272 TraceCheckUtils]: 4: Hoare triple {1938#true} call #t~ret6 := main(); {1938#true} is VALID
[2022-04-08 07:44:04,364 INFO L290 TraceCheckUtils]: 5: Hoare triple {1938#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {1958#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 07:44:04,365 INFO L290 TraceCheckUtils]: 6: Hoare triple {1958#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1958#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 07:44:04,365 INFO L290 TraceCheckUtils]: 7: Hoare triple {1958#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {1958#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 07:44:04,365 INFO L272 TraceCheckUtils]: 8: Hoare triple {1958#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1938#true} is VALID
[2022-04-08 07:44:04,365 INFO L290 TraceCheckUtils]: 9: Hoare triple {1938#true} ~cond := #in~cond; {1938#true} is VALID
[2022-04-08 07:44:04,365 INFO L290 TraceCheckUtils]: 10: Hoare triple {1938#true} assume !(0 == ~cond); {1938#true} is VALID
[2022-04-08 07:44:04,366 INFO L290 TraceCheckUtils]: 11: Hoare triple {1938#true} assume true; {1938#true} is VALID
[2022-04-08 07:44:04,366 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1938#true} {1958#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {1958#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 07:44:04,366 INFO L290 TraceCheckUtils]: 13: Hoare triple {1958#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1983#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID
[2022-04-08 07:44:04,367 INFO L290 TraceCheckUtils]: 14: Hoare triple {1983#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1983#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID
[2022-04-08 07:44:04,367 INFO L290 TraceCheckUtils]: 15: Hoare triple {1983#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {1983#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID
[2022-04-08 07:44:04,367 INFO L272 TraceCheckUtils]: 16: Hoare triple {1983#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1938#true} is VALID
[2022-04-08 07:44:04,367 INFO L290 TraceCheckUtils]: 17: Hoare triple {1938#true} ~cond := #in~cond; {1938#true} is VALID
[2022-04-08 07:44:04,367 INFO L290 TraceCheckUtils]: 18: Hoare triple {1938#true} assume !(0 == ~cond); {1938#true} is VALID
[2022-04-08 07:44:04,368 INFO L290 TraceCheckUtils]: 19: Hoare triple {1938#true} assume true; {1938#true} is VALID
[2022-04-08 07:44:04,368 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1938#true} {1983#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} #51#return; {1983#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID
[2022-04-08 07:44:04,368 INFO L290 TraceCheckUtils]: 21: Hoare triple {1983#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2008#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID
[2022-04-08 07:44:04,369 INFO L290 TraceCheckUtils]: 22: Hoare triple {2008#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2008#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID
[2022-04-08 07:44:04,369 INFO L290 TraceCheckUtils]: 23: Hoare triple {2008#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !!(#t~post5 < 100);havoc #t~post5; {2008#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID
[2022-04-08 07:44:04,369 INFO L272 TraceCheckUtils]: 24: Hoare triple {2008#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1938#true} is VALID
[2022-04-08 07:44:04,369 INFO L290 TraceCheckUtils]: 25: Hoare triple {1938#true} ~cond := #in~cond; {1938#true} is VALID
[2022-04-08 07:44:04,369 INFO L290 TraceCheckUtils]: 26: Hoare triple {1938#true} assume !(0 == ~cond); {1938#true} is VALID
[2022-04-08 07:44:04,369 INFO L290 TraceCheckUtils]: 27: Hoare triple {1938#true} assume true; {1938#true} is VALID
[2022-04-08 07:44:04,370 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1938#true} {2008#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} #51#return; {2008#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID
[2022-04-08 07:44:04,370 INFO L290 TraceCheckUtils]: 29: Hoare triple {2008#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {2033#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} is VALID
[2022-04-08 07:44:04,371 INFO L272 TraceCheckUtils]: 30: Hoare triple {2033#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2037#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 07:44:04,371 INFO L290 TraceCheckUtils]: 31: Hoare triple {2037#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2041#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 07:44:04,371 INFO L290 TraceCheckUtils]: 32: Hoare triple {2041#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1939#false} is VALID
[2022-04-08 07:44:04,372 INFO L290 TraceCheckUtils]: 33: Hoare triple {1939#false} assume !false; {1939#false} is VALID
[2022-04-08 07:44:04,372 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2022-04-08 07:44:04,372 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 07:44:04,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 07:44:04,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163985342]
[2022-04-08 07:44:04,676 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-08 07:44:04,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856039187]
[2022-04-08 07:44:04,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856039187] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 07:44:04,676 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences.
[2022-04-08 07:44:04,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8
[2022-04-08 07:44:04,676 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 07:44:04,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [396711690]
[2022-04-08 07:44:04,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [396711690] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 07:44:04,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 07:44:04,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2022-04-08 07:44:04,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558461741]
[2022-04-08 07:44:04,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 07:44:04,677 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 34
[2022-04-08 07:44:04,677 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 07:44:04,677 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-08 07:44:04,698 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:44:04,698 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2022-04-08 07:44:04,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 07:44:04,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2022-04-08 07:44:04,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132
[2022-04-08 07:44:04,698 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-08 07:44:04,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:44:04,937 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions.
[2022-04-08 07:44:04,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2022-04-08 07:44:04,937 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 34
[2022-04-08 07:44:04,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 07:44:04,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-08 07:44:04,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions.
[2022-04-08 07:44:04,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-08 07:44:04,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions.
[2022-04-08 07:44:04,939 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 39 transitions.
[2022-04-08 07:44:04,966 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:44:04,967 INFO L225 Difference]: With dead ends: 44
[2022-04-08 07:44:04,967 INFO L226 Difference]: Without dead ends: 39
[2022-04-08 07:44:04,967 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182
[2022-04-08 07:44:04,967 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-08 07:44:04,968 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 132 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-08 07:44:04,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states.
[2022-04-08 07:44:05,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39.
[2022-04-08 07:44:05,000 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 07:44:05,000 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2022-04-08 07:44:05,000 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2022-04-08 07:44:05,000 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2022-04-08 07:44:05,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:44:05,001 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions.
[2022-04-08 07:44:05,002 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions.
[2022-04-08 07:44:05,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 07:44:05,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 07:44:05,002 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 39 states.
[2022-04-08 07:44:05,002 INFO L87 Difference]: Start difference. First operand has 39 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 39 states.
[2022-04-08 07:44:05,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:44:05,003 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions.
[2022-04-08 07:44:05,004 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions.
[2022-04-08 07:44:05,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 07:44:05,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 07:44:05,004 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 07:44:05,004 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 07:44:05,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2022-04-08 07:44:05,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions.
[2022-04-08 07:44:05,005 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 34
[2022-04-08 07:44:05,005 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 07:44:05,006 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions.
[2022-04-08 07:44:05,006 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-08 07:44:05,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 41 transitions.
[2022-04-08 07:44:05,068 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:44:05,068 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions.
[2022-04-08 07:44:05,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37
[2022-04-08 07:44:05,068 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 07:44:05,069 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 07:44:05,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2022-04-08 07:44:05,269 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 07:44:05,269 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 07:44:05,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 07:44:05,270 INFO L85 PathProgramCache]: Analyzing trace with hash 486001554, now seen corresponding path program 5 times
[2022-04-08 07:44:05,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 07:44:05,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [401596014]
[2022-04-08 07:44:05,351 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult
[2022-04-08 07:44:05,352 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE
[2022-04-08 07:44:05,352 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 07:44:05,352 INFO L85 PathProgramCache]: Analyzing trace with hash 486001554, now seen corresponding path program 6 times
[2022-04-08 07:44:05,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 07:44:05,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224463748]
[2022-04-08 07:44:05,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 07:44:05,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 07:44:05,360 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-08 07:44:05,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [442627816]
[2022-04-08 07:44:05,360 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2022-04-08 07:44:05,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 07:44:05,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 07:44:05,361 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 07:44:05,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2022-04-08 07:44:05,404 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s)
[2022-04-08 07:44:05,405 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 07:44:05,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core
[2022-04-08 07:44:05,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 07:44:05,415 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 07:44:05,610 INFO L272 TraceCheckUtils]: 0: Hoare triple {2365#true} call ULTIMATE.init(); {2365#true} is VALID
[2022-04-08 07:44:05,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {2365#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2373#(<= ~counter~0 0)} is VALID
[2022-04-08 07:44:05,611 INFO L290 TraceCheckUtils]: 2: Hoare triple {2373#(<= ~counter~0 0)} assume true; {2373#(<= ~counter~0 0)} is VALID
[2022-04-08 07:44:05,611 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2373#(<= ~counter~0 0)} {2365#true} #57#return; {2373#(<= ~counter~0 0)} is VALID
[2022-04-08 07:44:05,612 INFO L272 TraceCheckUtils]: 4: Hoare triple {2373#(<= ~counter~0 0)} call #t~ret6 := main(); {2373#(<= ~counter~0 0)} is VALID
[2022-04-08 07:44:05,612 INFO L290 TraceCheckUtils]: 5: Hoare triple {2373#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {2373#(<= ~counter~0 0)} is VALID
[2022-04-08 07:44:05,612 INFO L290 TraceCheckUtils]: 6: Hoare triple {2373#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2389#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:05,613 INFO L290 TraceCheckUtils]: 7: Hoare triple {2389#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {2389#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:05,613 INFO L272 TraceCheckUtils]: 8: Hoare triple {2389#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2389#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:05,614 INFO L290 TraceCheckUtils]: 9: Hoare triple {2389#(<= ~counter~0 1)} ~cond := #in~cond; {2389#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:05,614 INFO L290 TraceCheckUtils]: 10: Hoare triple {2389#(<= ~counter~0 1)} assume !(0 == ~cond); {2389#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:05,614 INFO L290 TraceCheckUtils]: 11: Hoare triple {2389#(<= ~counter~0 1)} assume true; {2389#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:05,615 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2389#(<= ~counter~0 1)} {2389#(<= ~counter~0 1)} #51#return; {2389#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:05,615 INFO L290 TraceCheckUtils]: 13: Hoare triple {2389#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2389#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:05,616 INFO L290 TraceCheckUtils]: 14: Hoare triple {2389#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2414#(<= ~counter~0 2)} is VALID
[2022-04-08 07:44:05,616 INFO L290 TraceCheckUtils]: 15: Hoare triple {2414#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {2414#(<= ~counter~0 2)} is VALID
[2022-04-08 07:44:05,617 INFO L272 TraceCheckUtils]: 16: Hoare triple {2414#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2414#(<= ~counter~0 2)} is VALID
[2022-04-08 07:44:05,617 INFO L290 TraceCheckUtils]: 17: Hoare triple {2414#(<= ~counter~0 2)} ~cond := #in~cond; {2414#(<= ~counter~0 2)} is VALID
[2022-04-08 07:44:05,617 INFO L290 TraceCheckUtils]: 18: Hoare triple {2414#(<= ~counter~0 2)} assume !(0 == ~cond); {2414#(<= ~counter~0 2)} is VALID
[2022-04-08 07:44:05,618 INFO L290 TraceCheckUtils]: 19: Hoare triple {2414#(<= ~counter~0 2)} assume true; {2414#(<= ~counter~0 2)} is VALID
[2022-04-08 07:44:05,618 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2414#(<= ~counter~0 2)} {2414#(<= ~counter~0 2)} #51#return; {2414#(<= ~counter~0 2)} is VALID
[2022-04-08 07:44:05,618 INFO L290 TraceCheckUtils]: 21: Hoare triple {2414#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2414#(<= ~counter~0 2)} is VALID
[2022-04-08 07:44:05,619 INFO L290 TraceCheckUtils]: 22: Hoare triple {2414#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2439#(<= ~counter~0 3)} is VALID
[2022-04-08 07:44:05,619 INFO L290 TraceCheckUtils]: 23: Hoare triple {2439#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {2439#(<= ~counter~0 3)} is VALID
[2022-04-08 07:44:05,620 INFO L272 TraceCheckUtils]: 24: Hoare triple {2439#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2439#(<= ~counter~0 3)} is VALID
[2022-04-08 07:44:05,620 INFO L290 TraceCheckUtils]: 25: Hoare triple {2439#(<= ~counter~0 3)} ~cond := #in~cond; {2439#(<= ~counter~0 3)} is VALID
[2022-04-08 07:44:05,620 INFO L290 TraceCheckUtils]: 26: Hoare triple {2439#(<= ~counter~0 3)} assume !(0 == ~cond); {2439#(<= ~counter~0 3)} is VALID
[2022-04-08 07:44:05,621 INFO L290 TraceCheckUtils]: 27: Hoare triple {2439#(<= ~counter~0 3)} assume true; {2439#(<= ~counter~0 3)} is VALID
[2022-04-08 07:44:05,621 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2439#(<= ~counter~0 3)} {2439#(<= ~counter~0 3)} #51#return; {2439#(<= ~counter~0 3)} is VALID
[2022-04-08 07:44:05,622 INFO L290 TraceCheckUtils]: 29: Hoare triple {2439#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2439#(<= ~counter~0 3)} is VALID
[2022-04-08 07:44:05,622 INFO L290 TraceCheckUtils]: 30: Hoare triple {2439#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2464#(<= |main_#t~post5| 3)} is VALID
[2022-04-08 07:44:05,622 INFO L290 TraceCheckUtils]: 31: Hoare triple {2464#(<= |main_#t~post5| 3)} assume !(#t~post5 < 100);havoc #t~post5; {2366#false} is VALID
[2022-04-08 07:44:05,622 INFO L272 TraceCheckUtils]: 32: Hoare triple {2366#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2366#false} is VALID
[2022-04-08 07:44:05,623 INFO L290 TraceCheckUtils]: 33: Hoare triple {2366#false} ~cond := #in~cond; {2366#false} is VALID
[2022-04-08 07:44:05,623 INFO L290 TraceCheckUtils]: 34: Hoare triple {2366#false} assume 0 == ~cond; {2366#false} is VALID
[2022-04-08 07:44:05,623 INFO L290 TraceCheckUtils]: 35: Hoare triple {2366#false} assume !false; {2366#false} is VALID
[2022-04-08 07:44:05,623 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 07:44:05,623 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 07:44:05,861 INFO L290 TraceCheckUtils]: 35: Hoare triple {2366#false} assume !false; {2366#false} is VALID
[2022-04-08 07:44:05,862 INFO L290 TraceCheckUtils]: 34: Hoare triple {2366#false} assume 0 == ~cond; {2366#false} is VALID
[2022-04-08 07:44:05,862 INFO L290 TraceCheckUtils]: 33: Hoare triple {2366#false} ~cond := #in~cond; {2366#false} is VALID
[2022-04-08 07:44:05,862 INFO L272 TraceCheckUtils]: 32: Hoare triple {2366#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2366#false} is VALID
[2022-04-08 07:44:05,862 INFO L290 TraceCheckUtils]: 31: Hoare triple {2492#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {2366#false} is VALID
[2022-04-08 07:44:05,863 INFO L290 TraceCheckUtils]: 30: Hoare triple {2496#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2492#(< |main_#t~post5| 100)} is VALID
[2022-04-08 07:44:05,863 INFO L290 TraceCheckUtils]: 29: Hoare triple {2496#(< ~counter~0 100)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2496#(< ~counter~0 100)} is VALID
[2022-04-08 07:44:05,864 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2365#true} {2496#(< ~counter~0 100)} #51#return; {2496#(< ~counter~0 100)} is VALID
[2022-04-08 07:44:05,864 INFO L290 TraceCheckUtils]: 27: Hoare triple {2365#true} assume true; {2365#true} is VALID
[2022-04-08 07:44:05,864 INFO L290 TraceCheckUtils]: 26: Hoare triple {2365#true} assume !(0 == ~cond); {2365#true} is VALID
[2022-04-08 07:44:05,864 INFO L290 TraceCheckUtils]: 25: Hoare triple {2365#true} ~cond := #in~cond; {2365#true} is VALID
[2022-04-08 07:44:05,864 INFO L272 TraceCheckUtils]: 24: Hoare triple {2496#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2365#true} is VALID
[2022-04-08 07:44:05,864 INFO L290 TraceCheckUtils]: 23: Hoare triple {2496#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {2496#(< ~counter~0 100)} is VALID
[2022-04-08 07:44:05,865 INFO L290 TraceCheckUtils]: 22: Hoare triple {2521#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2496#(< ~counter~0 100)} is VALID
[2022-04-08 07:44:05,865 INFO L290 TraceCheckUtils]: 21: Hoare triple {2521#(< ~counter~0 99)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2521#(< ~counter~0 99)} is VALID
[2022-04-08 07:44:05,866 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2365#true} {2521#(< ~counter~0 99)} #51#return; {2521#(< ~counter~0 99)} is VALID
[2022-04-08 07:44:05,866 INFO L290 TraceCheckUtils]: 19: Hoare triple {2365#true} assume true; {2365#true} is VALID
[2022-04-08 07:44:05,866 INFO L290 TraceCheckUtils]: 18: Hoare triple {2365#true} assume !(0 == ~cond); {2365#true} is VALID
[2022-04-08 07:44:05,866 INFO L290 TraceCheckUtils]: 17: Hoare triple {2365#true} ~cond := #in~cond; {2365#true} is VALID
[2022-04-08 07:44:05,866 INFO L272 TraceCheckUtils]: 16: Hoare triple {2521#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2365#true} is VALID
[2022-04-08 07:44:05,866 INFO L290 TraceCheckUtils]: 15: Hoare triple {2521#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {2521#(< ~counter~0 99)} is VALID
[2022-04-08 07:44:05,867 INFO L290 TraceCheckUtils]: 14: Hoare triple {2546#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2521#(< ~counter~0 99)} is VALID
[2022-04-08 07:44:05,867 INFO L290 TraceCheckUtils]: 13: Hoare triple {2546#(< ~counter~0 98)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2546#(< ~counter~0 98)} is VALID
[2022-04-08 07:44:05,868 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2365#true} {2546#(< ~counter~0 98)} #51#return; {2546#(< ~counter~0 98)} is VALID
[2022-04-08 07:44:05,868 INFO L290 TraceCheckUtils]: 11: Hoare triple {2365#true} assume true; {2365#true} is VALID
[2022-04-08 07:44:05,868 INFO L290 TraceCheckUtils]: 10: Hoare triple {2365#true} assume !(0 == ~cond); {2365#true} is VALID
[2022-04-08 07:44:05,868 INFO L290 TraceCheckUtils]: 9: Hoare triple {2365#true} ~cond := #in~cond; {2365#true} is VALID
[2022-04-08 07:44:05,868 INFO L272 TraceCheckUtils]: 8: Hoare triple {2546#(< ~counter~0 98)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2365#true} is VALID
[2022-04-08 07:44:05,869 INFO L290 TraceCheckUtils]: 7: Hoare triple {2546#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {2546#(< ~counter~0 98)} is VALID
[2022-04-08 07:44:05,869 INFO L290 TraceCheckUtils]: 6: Hoare triple {2571#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2546#(< ~counter~0 98)} is VALID
[2022-04-08 07:44:05,869 INFO L290 TraceCheckUtils]: 5: Hoare triple {2571#(< ~counter~0 97)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {2571#(< ~counter~0 97)} is VALID
[2022-04-08 07:44:05,870 INFO L272 TraceCheckUtils]: 4: Hoare triple {2571#(< ~counter~0 97)} call #t~ret6 := main(); {2571#(< ~counter~0 97)} is VALID
[2022-04-08 07:44:05,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2571#(< ~counter~0 97)} {2365#true} #57#return; {2571#(< ~counter~0 97)} is VALID
[2022-04-08 07:44:05,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {2571#(< ~counter~0 97)} assume true; {2571#(< ~counter~0 97)} is VALID
[2022-04-08 07:44:05,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {2365#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2571#(< ~counter~0 97)} is VALID
[2022-04-08 07:44:05,871 INFO L272 TraceCheckUtils]: 0: Hoare triple {2365#true} call ULTIMATE.init(); {2365#true} is VALID
[2022-04-08 07:44:05,871 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2022-04-08 07:44:05,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 07:44:05,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224463748]
[2022-04-08 07:44:05,872 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-08 07:44:05,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442627816]
[2022-04-08 07:44:05,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442627816] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 07:44:05,872 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2022-04-08 07:44:05,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12
[2022-04-08 07:44:05,872 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 07:44:05,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [401596014]
[2022-04-08 07:44:05,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [401596014] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 07:44:05,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 07:44:05,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2022-04-08 07:44:05,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620750761]
[2022-04-08 07:44:05,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 07:44:05,874 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 36
[2022-04-08 07:44:05,874 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 07:44:05,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-08 07:44:05,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:44:05,898 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2022-04-08 07:44:05,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 07:44:05,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2022-04-08 07:44:05,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132
[2022-04-08 07:44:05,899 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-08 07:44:06,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:44:06,037 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions.
[2022-04-08 07:44:06,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2022-04-08 07:44:06,037 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 36
[2022-04-08 07:44:06,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 07:44:06,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-08 07:44:06,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions.
[2022-04-08 07:44:06,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-08 07:44:06,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions.
[2022-04-08 07:44:06,040 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 50 transitions.
[2022-04-08 07:44:06,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:44:06,078 INFO L225 Difference]: With dead ends: 50
[2022-04-08 07:44:06,078 INFO L226 Difference]: Without dead ends: 45
[2022-04-08 07:44:06,078 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210
[2022-04-08 07:44:06,078 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 07:44:06,079 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 77 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 07:44:06,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states.
[2022-04-08 07:44:06,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45.
[2022-04-08 07:44:06,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 07:44:06,121 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2022-04-08 07:44:06,121 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2022-04-08 07:44:06,121 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2022-04-08 07:44:06,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:44:06,122 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions.
[2022-04-08 07:44:06,122 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions.
[2022-04-08 07:44:06,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 07:44:06,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 07:44:06,123 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 45 states.
[2022-04-08 07:44:06,123 INFO L87 Difference]: Start difference. First operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 45 states.
[2022-04-08 07:44:06,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:44:06,124 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions.
[2022-04-08 07:44:06,124 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions.
[2022-04-08 07:44:06,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 07:44:06,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 07:44:06,124 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 07:44:06,124 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 07:44:06,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2022-04-08 07:44:06,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions.
[2022-04-08 07:44:06,125 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 36
[2022-04-08 07:44:06,126 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 07:44:06,126 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions.
[2022-04-08 07:44:06,126 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-08 07:44:06,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 46 transitions.
[2022-04-08 07:44:06,177 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:44:06,177 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions.
[2022-04-08 07:44:06,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43
[2022-04-08 07:44:06,178 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 07:44:06,178 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 07:44:06,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0
[2022-04-08 07:44:06,394 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8
[2022-04-08 07:44:06,395 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 07:44:06,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 07:44:06,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1383171920, now seen corresponding path program 5 times
[2022-04-08 07:44:06,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 07:44:06,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [239296462]
[2022-04-08 07:44:06,479 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult
[2022-04-08 07:44:06,479 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE
[2022-04-08 07:44:06,479 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 07:44:06,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1383171920, now seen corresponding path program 6 times
[2022-04-08 07:44:06,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 07:44:06,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473815998]
[2022-04-08 07:44:06,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 07:44:06,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 07:44:06,487 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-08 07:44:06,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [171578585]
[2022-04-08 07:44:06,487 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2022-04-08 07:44:06,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 07:44:06,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 07:44:06,488 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 07:44:06,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2022-04-08 07:44:06,614 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s)
[2022-04-08 07:44:06,614 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 07:44:06,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 20 conjunts are in the unsatisfiable core
[2022-04-08 07:44:06,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 07:44:06,626 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 07:44:06,939 INFO L272 TraceCheckUtils]: 0: Hoare triple {2878#true} call ULTIMATE.init(); {2878#true} is VALID
[2022-04-08 07:44:06,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {2878#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2878#true} is VALID
[2022-04-08 07:44:06,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {2878#true} assume true; {2878#true} is VALID
[2022-04-08 07:44:06,939 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2878#true} {2878#true} #57#return; {2878#true} is VALID
[2022-04-08 07:44:06,939 INFO L272 TraceCheckUtils]: 4: Hoare triple {2878#true} call #t~ret6 := main(); {2878#true} is VALID
[2022-04-08 07:44:06,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {2878#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {2898#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 07:44:06,940 INFO L290 TraceCheckUtils]: 6: Hoare triple {2898#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2898#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 07:44:06,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {2898#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {2898#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 07:44:06,941 INFO L272 TraceCheckUtils]: 8: Hoare triple {2898#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2878#true} is VALID
[2022-04-08 07:44:06,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID
[2022-04-08 07:44:06,941 INFO L290 TraceCheckUtils]: 10: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID
[2022-04-08 07:44:06,941 INFO L290 TraceCheckUtils]: 11: Hoare triple {2878#true} assume true; {2878#true} is VALID
[2022-04-08 07:44:06,941 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2878#true} {2898#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {2898#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 07:44:06,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {2898#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2923#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID
[2022-04-08 07:44:06,942 INFO L290 TraceCheckUtils]: 14: Hoare triple {2923#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2923#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID
[2022-04-08 07:44:06,943 INFO L290 TraceCheckUtils]: 15: Hoare triple {2923#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {2923#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID
[2022-04-08 07:44:06,943 INFO L272 TraceCheckUtils]: 16: Hoare triple {2923#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2878#true} is VALID
[2022-04-08 07:44:06,943 INFO L290 TraceCheckUtils]: 17: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID
[2022-04-08 07:44:06,943 INFO L290 TraceCheckUtils]: 18: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID
[2022-04-08 07:44:06,943 INFO L290 TraceCheckUtils]: 19: Hoare triple {2878#true} assume true; {2878#true} is VALID
[2022-04-08 07:44:06,944 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2878#true} {2923#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #51#return; {2923#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID
[2022-04-08 07:44:06,944 INFO L290 TraceCheckUtils]: 21: Hoare triple {2923#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2948#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID
[2022-04-08 07:44:06,944 INFO L290 TraceCheckUtils]: 22: Hoare triple {2948#(and (= main_~y~0 2) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2948#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID
[2022-04-08 07:44:06,945 INFO L290 TraceCheckUtils]: 23: Hoare triple {2948#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(#t~post5 < 100);havoc #t~post5; {2948#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID
[2022-04-08 07:44:06,945 INFO L272 TraceCheckUtils]: 24: Hoare triple {2948#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2878#true} is VALID
[2022-04-08 07:44:06,945 INFO L290 TraceCheckUtils]: 25: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID
[2022-04-08 07:44:06,945 INFO L290 TraceCheckUtils]: 26: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID
[2022-04-08 07:44:06,945 INFO L290 TraceCheckUtils]: 27: Hoare triple {2878#true} assume true; {2878#true} is VALID
[2022-04-08 07:44:06,946 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2878#true} {2948#(and (= main_~y~0 2) (= main_~c~0 2))} #51#return; {2948#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID
[2022-04-08 07:44:06,946 INFO L290 TraceCheckUtils]: 29: Hoare triple {2948#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2973#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} is VALID
[2022-04-08 07:44:06,946 INFO L290 TraceCheckUtils]: 30: Hoare triple {2973#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2973#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} is VALID
[2022-04-08 07:44:06,947 INFO L290 TraceCheckUtils]: 31: Hoare triple {2973#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} assume !!(#t~post5 < 100);havoc #t~post5; {2973#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} is VALID
[2022-04-08 07:44:06,947 INFO L272 TraceCheckUtils]: 32: Hoare triple {2973#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2878#true} is VALID
[2022-04-08 07:44:06,947 INFO L290 TraceCheckUtils]: 33: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID
[2022-04-08 07:44:06,947 INFO L290 TraceCheckUtils]: 34: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID
[2022-04-08 07:44:06,947 INFO L290 TraceCheckUtils]: 35: Hoare triple {2878#true} assume true; {2878#true} is VALID
[2022-04-08 07:44:06,948 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2878#true} {2973#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} #51#return; {2973#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} is VALID
[2022-04-08 07:44:06,948 INFO L290 TraceCheckUtils]: 37: Hoare triple {2973#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {2998#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID
[2022-04-08 07:44:06,949 INFO L272 TraceCheckUtils]: 38: Hoare triple {2998#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~k~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3002#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 07:44:06,949 INFO L290 TraceCheckUtils]: 39: Hoare triple {3002#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3006#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 07:44:06,950 INFO L290 TraceCheckUtils]: 40: Hoare triple {3006#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2879#false} is VALID
[2022-04-08 07:44:06,950 INFO L290 TraceCheckUtils]: 41: Hoare triple {2879#false} assume !false; {2879#false} is VALID
[2022-04-08 07:44:06,950 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked.
[2022-04-08 07:44:06,950 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 07:44:07,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 07:44:07,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473815998]
[2022-04-08 07:44:07,182 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-08 07:44:07,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171578585]
[2022-04-08 07:44:07,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171578585] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 07:44:07,183 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences.
[2022-04-08 07:44:07,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9
[2022-04-08 07:44:07,183 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 07:44:07,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [239296462]
[2022-04-08 07:44:07,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [239296462] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 07:44:07,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 07:44:07,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2022-04-08 07:44:07,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521104429]
[2022-04-08 07:44:07,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 07:44:07,184 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 42
[2022-04-08 07:44:07,184 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 07:44:07,184 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2022-04-08 07:44:07,206 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:44:07,206 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2022-04-08 07:44:07,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 07:44:07,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2022-04-08 07:44:07,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132
[2022-04-08 07:44:07,206 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2022-04-08 07:44:07,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:44:07,498 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions.
[2022-04-08 07:44:07,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2022-04-08 07:44:07,499 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 42
[2022-04-08 07:44:07,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 07:44:07,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2022-04-08 07:44:07,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions.
[2022-04-08 07:44:07,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2022-04-08 07:44:07,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions.
[2022-04-08 07:44:07,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 44 transitions.
[2022-04-08 07:44:07,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:44:07,529 INFO L225 Difference]: With dead ends: 52
[2022-04-08 07:44:07,529 INFO L226 Difference]: Without dead ends: 47
[2022-04-08 07:44:07,529 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182
[2022-04-08 07:44:07,530 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-08 07:44:07,530 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 168 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-08 07:44:07,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states.
[2022-04-08 07:44:07,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47.
[2022-04-08 07:44:07,573 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 07:44:07,573 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2022-04-08 07:44:07,573 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2022-04-08 07:44:07,573 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2022-04-08 07:44:07,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:44:07,574 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions.
[2022-04-08 07:44:07,574 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions.
[2022-04-08 07:44:07,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 07:44:07,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 07:44:07,575 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 47 states.
[2022-04-08 07:44:07,575 INFO L87 Difference]: Start difference. First operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 47 states.
[2022-04-08 07:44:07,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:44:07,576 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions.
[2022-04-08 07:44:07,576 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions.
[2022-04-08 07:44:07,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 07:44:07,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 07:44:07,576 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 07:44:07,576 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 07:44:07,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2022-04-08 07:44:07,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions.
[2022-04-08 07:44:07,577 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 42
[2022-04-08 07:44:07,577 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 07:44:07,577 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions.
[2022-04-08 07:44:07,577 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2022-04-08 07:44:07,577 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 49 transitions.
[2022-04-08 07:44:07,629 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:44:07,629 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions.
[2022-04-08 07:44:07,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2022-04-08 07:44:07,629 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 07:44:07,629 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 07:44:07,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0
[2022-04-08 07:44:07,830 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9
[2022-04-08 07:44:07,830 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 07:44:07,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 07:44:07,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1386691371, now seen corresponding path program 7 times
[2022-04-08 07:44:07,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 07:44:07,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1523232688]
[2022-04-08 07:44:07,930 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult
[2022-04-08 07:44:07,930 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE
[2022-04-08 07:44:07,930 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 07:44:07,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1386691371, now seen corresponding path program 8 times
[2022-04-08 07:44:07,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 07:44:07,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413606495]
[2022-04-08 07:44:07,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 07:44:07,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 07:44:07,937 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-08 07:44:07,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [542266969]
[2022-04-08 07:44:07,937 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 07:44:07,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 07:44:07,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 07:44:07,938 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 07:44:07,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2022-04-08 07:44:07,974 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 07:44:07,974 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 07:44:07,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 13 conjunts are in the unsatisfiable core
[2022-04-08 07:44:07,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 07:44:07,987 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 07:44:08,227 INFO L272 TraceCheckUtils]: 0: Hoare triple {3353#true} call ULTIMATE.init(); {3353#true} is VALID
[2022-04-08 07:44:08,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {3353#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3361#(<= ~counter~0 0)} is VALID
[2022-04-08 07:44:08,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {3361#(<= ~counter~0 0)} assume true; {3361#(<= ~counter~0 0)} is VALID
[2022-04-08 07:44:08,230 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3361#(<= ~counter~0 0)} {3353#true} #57#return; {3361#(<= ~counter~0 0)} is VALID
[2022-04-08 07:44:08,230 INFO L272 TraceCheckUtils]: 4: Hoare triple {3361#(<= ~counter~0 0)} call #t~ret6 := main(); {3361#(<= ~counter~0 0)} is VALID
[2022-04-08 07:44:08,230 INFO L290 TraceCheckUtils]: 5: Hoare triple {3361#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {3361#(<= ~counter~0 0)} is VALID
[2022-04-08 07:44:08,231 INFO L290 TraceCheckUtils]: 6: Hoare triple {3361#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3377#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:08,231 INFO L290 TraceCheckUtils]: 7: Hoare triple {3377#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {3377#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:08,231 INFO L272 TraceCheckUtils]: 8: Hoare triple {3377#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3377#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:08,231 INFO L290 TraceCheckUtils]: 9: Hoare triple {3377#(<= ~counter~0 1)} ~cond := #in~cond; {3377#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:08,232 INFO L290 TraceCheckUtils]: 10: Hoare triple {3377#(<= ~counter~0 1)} assume !(0 == ~cond); {3377#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:08,232 INFO L290 TraceCheckUtils]: 11: Hoare triple {3377#(<= ~counter~0 1)} assume true; {3377#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:08,232 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3377#(<= ~counter~0 1)} {3377#(<= ~counter~0 1)} #51#return; {3377#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:08,233 INFO L290 TraceCheckUtils]: 13: Hoare triple {3377#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3377#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:08,233 INFO L290 TraceCheckUtils]: 14: Hoare triple {3377#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3402#(<= ~counter~0 2)} is VALID
[2022-04-08 07:44:08,233 INFO L290 TraceCheckUtils]: 15: Hoare triple {3402#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {3402#(<= ~counter~0 2)} is VALID
[2022-04-08 07:44:08,234 INFO L272 TraceCheckUtils]: 16: Hoare triple {3402#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3402#(<= ~counter~0 2)} is VALID
[2022-04-08 07:44:08,234 INFO L290 TraceCheckUtils]: 17: Hoare triple {3402#(<= ~counter~0 2)} ~cond := #in~cond; {3402#(<= ~counter~0 2)} is VALID
[2022-04-08 07:44:08,234 INFO L290 TraceCheckUtils]: 18: Hoare triple {3402#(<= ~counter~0 2)} assume !(0 == ~cond); {3402#(<= ~counter~0 2)} is VALID
[2022-04-08 07:44:08,235 INFO L290 TraceCheckUtils]: 19: Hoare triple {3402#(<= ~counter~0 2)} assume true; {3402#(<= ~counter~0 2)} is VALID
[2022-04-08 07:44:08,235 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3402#(<= ~counter~0 2)} {3402#(<= ~counter~0 2)} #51#return; {3402#(<= ~counter~0 2)} is VALID
[2022-04-08 07:44:08,236 INFO L290 TraceCheckUtils]: 21: Hoare triple {3402#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3402#(<= ~counter~0 2)} is VALID
[2022-04-08 07:44:08,237 INFO L290 TraceCheckUtils]: 22: Hoare triple {3402#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3427#(<= ~counter~0 3)} is VALID
[2022-04-08 07:44:08,239 INFO L290 TraceCheckUtils]: 23: Hoare triple {3427#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {3427#(<= ~counter~0 3)} is VALID
[2022-04-08 07:44:08,240 INFO L272 TraceCheckUtils]: 24: Hoare triple {3427#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3427#(<= ~counter~0 3)} is VALID
[2022-04-08 07:44:08,241 INFO L290 TraceCheckUtils]: 25: Hoare triple {3427#(<= ~counter~0 3)} ~cond := #in~cond; {3427#(<= ~counter~0 3)} is VALID
[2022-04-08 07:44:08,242 INFO L290 TraceCheckUtils]: 26: Hoare triple {3427#(<= ~counter~0 3)} assume !(0 == ~cond); {3427#(<= ~counter~0 3)} is VALID
[2022-04-08 07:44:08,242 INFO L290 TraceCheckUtils]: 27: Hoare triple {3427#(<= ~counter~0 3)} assume true; {3427#(<= ~counter~0 3)} is VALID
[2022-04-08 07:44:08,242 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3427#(<= ~counter~0 3)} {3427#(<= ~counter~0 3)} #51#return; {3427#(<= ~counter~0 3)} is VALID
[2022-04-08 07:44:08,243 INFO L290 TraceCheckUtils]: 29: Hoare triple {3427#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3427#(<= ~counter~0 3)} is VALID
[2022-04-08 07:44:08,244 INFO L290 TraceCheckUtils]: 30: Hoare triple {3427#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3452#(<= ~counter~0 4)} is VALID
[2022-04-08 07:44:08,244 INFO L290 TraceCheckUtils]: 31: Hoare triple {3452#(<= ~counter~0 4)} assume !!(#t~post5 < 100);havoc #t~post5; {3452#(<= ~counter~0 4)} is VALID
[2022-04-08 07:44:08,244 INFO L272 TraceCheckUtils]: 32: Hoare triple {3452#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3452#(<= ~counter~0 4)} is VALID
[2022-04-08 07:44:08,245 INFO L290 TraceCheckUtils]: 33: Hoare triple {3452#(<= ~counter~0 4)} ~cond := #in~cond; {3452#(<= ~counter~0 4)} is VALID
[2022-04-08 07:44:08,245 INFO L290 TraceCheckUtils]: 34: Hoare triple {3452#(<= ~counter~0 4)} assume !(0 == ~cond); {3452#(<= ~counter~0 4)} is VALID
[2022-04-08 07:44:08,245 INFO L290 TraceCheckUtils]: 35: Hoare triple {3452#(<= ~counter~0 4)} assume true; {3452#(<= ~counter~0 4)} is VALID
[2022-04-08 07:44:08,246 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3452#(<= ~counter~0 4)} {3452#(<= ~counter~0 4)} #51#return; {3452#(<= ~counter~0 4)} is VALID
[2022-04-08 07:44:08,246 INFO L290 TraceCheckUtils]: 37: Hoare triple {3452#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3452#(<= ~counter~0 4)} is VALID
[2022-04-08 07:44:08,246 INFO L290 TraceCheckUtils]: 38: Hoare triple {3452#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3477#(<= |main_#t~post5| 4)} is VALID
[2022-04-08 07:44:08,246 INFO L290 TraceCheckUtils]: 39: Hoare triple {3477#(<= |main_#t~post5| 4)} assume !(#t~post5 < 100);havoc #t~post5; {3354#false} is VALID
[2022-04-08 07:44:08,246 INFO L272 TraceCheckUtils]: 40: Hoare triple {3354#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3354#false} is VALID
[2022-04-08 07:44:08,247 INFO L290 TraceCheckUtils]: 41: Hoare triple {3354#false} ~cond := #in~cond; {3354#false} is VALID
[2022-04-08 07:44:08,247 INFO L290 TraceCheckUtils]: 42: Hoare triple {3354#false} assume 0 == ~cond; {3354#false} is VALID
[2022-04-08 07:44:08,247 INFO L290 TraceCheckUtils]: 43: Hoare triple {3354#false} assume !false; {3354#false} is VALID
[2022-04-08 07:44:08,247 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 07:44:08,247 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 07:44:08,502 INFO L290 TraceCheckUtils]: 43: Hoare triple {3354#false} assume !false; {3354#false} is VALID
[2022-04-08 07:44:08,502 INFO L290 TraceCheckUtils]: 42: Hoare triple {3354#false} assume 0 == ~cond; {3354#false} is VALID
[2022-04-08 07:44:08,502 INFO L290 TraceCheckUtils]: 41: Hoare triple {3354#false} ~cond := #in~cond; {3354#false} is VALID
[2022-04-08 07:44:08,502 INFO L272 TraceCheckUtils]: 40: Hoare triple {3354#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3354#false} is VALID
[2022-04-08 07:44:08,503 INFO L290 TraceCheckUtils]: 39: Hoare triple {3505#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {3354#false} is VALID
[2022-04-08 07:44:08,503 INFO L290 TraceCheckUtils]: 38: Hoare triple {3509#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3505#(< |main_#t~post5| 100)} is VALID
[2022-04-08 07:44:08,503 INFO L290 TraceCheckUtils]: 37: Hoare triple {3509#(< ~counter~0 100)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3509#(< ~counter~0 100)} is VALID
[2022-04-08 07:44:08,504 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3353#true} {3509#(< ~counter~0 100)} #51#return; {3509#(< ~counter~0 100)} is VALID
[2022-04-08 07:44:08,504 INFO L290 TraceCheckUtils]: 35: Hoare triple {3353#true} assume true; {3353#true} is VALID
[2022-04-08 07:44:08,504 INFO L290 TraceCheckUtils]: 34: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID
[2022-04-08 07:44:08,504 INFO L290 TraceCheckUtils]: 33: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID
[2022-04-08 07:44:08,504 INFO L272 TraceCheckUtils]: 32: Hoare triple {3509#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3353#true} is VALID
[2022-04-08 07:44:08,504 INFO L290 TraceCheckUtils]: 31: Hoare triple {3509#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {3509#(< ~counter~0 100)} is VALID
[2022-04-08 07:44:08,505 INFO L290 TraceCheckUtils]: 30: Hoare triple {3534#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3509#(< ~counter~0 100)} is VALID
[2022-04-08 07:44:08,505 INFO L290 TraceCheckUtils]: 29: Hoare triple {3534#(< ~counter~0 99)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3534#(< ~counter~0 99)} is VALID
[2022-04-08 07:44:08,505 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3353#true} {3534#(< ~counter~0 99)} #51#return; {3534#(< ~counter~0 99)} is VALID
[2022-04-08 07:44:08,506 INFO L290 TraceCheckUtils]: 27: Hoare triple {3353#true} assume true; {3353#true} is VALID
[2022-04-08 07:44:08,506 INFO L290 TraceCheckUtils]: 26: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID
[2022-04-08 07:44:08,506 INFO L290 TraceCheckUtils]: 25: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID
[2022-04-08 07:44:08,506 INFO L272 TraceCheckUtils]: 24: Hoare triple {3534#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3353#true} is VALID
[2022-04-08 07:44:08,506 INFO L290 TraceCheckUtils]: 23: Hoare triple {3534#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {3534#(< ~counter~0 99)} is VALID
[2022-04-08 07:44:08,506 INFO L290 TraceCheckUtils]: 22: Hoare triple {3559#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3534#(< ~counter~0 99)} is VALID
[2022-04-08 07:44:08,507 INFO L290 TraceCheckUtils]: 21: Hoare triple {3559#(< ~counter~0 98)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3559#(< ~counter~0 98)} is VALID
[2022-04-08 07:44:08,507 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3353#true} {3559#(< ~counter~0 98)} #51#return; {3559#(< ~counter~0 98)} is VALID
[2022-04-08 07:44:08,507 INFO L290 TraceCheckUtils]: 19: Hoare triple {3353#true} assume true; {3353#true} is VALID
[2022-04-08 07:44:08,507 INFO L290 TraceCheckUtils]: 18: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID
[2022-04-08 07:44:08,507 INFO L290 TraceCheckUtils]: 17: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID
[2022-04-08 07:44:08,508 INFO L272 TraceCheckUtils]: 16: Hoare triple {3559#(< ~counter~0 98)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3353#true} is VALID
[2022-04-08 07:44:08,508 INFO L290 TraceCheckUtils]: 15: Hoare triple {3559#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {3559#(< ~counter~0 98)} is VALID
[2022-04-08 07:44:08,508 INFO L290 TraceCheckUtils]: 14: Hoare triple {3584#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3559#(< ~counter~0 98)} is VALID
[2022-04-08 07:44:08,509 INFO L290 TraceCheckUtils]: 13: Hoare triple {3584#(< ~counter~0 97)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3584#(< ~counter~0 97)} is VALID
[2022-04-08 07:44:08,509 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3353#true} {3584#(< ~counter~0 97)} #51#return; {3584#(< ~counter~0 97)} is VALID
[2022-04-08 07:44:08,509 INFO L290 TraceCheckUtils]: 11: Hoare triple {3353#true} assume true; {3353#true} is VALID
[2022-04-08 07:44:08,509 INFO L290 TraceCheckUtils]: 10: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID
[2022-04-08 07:44:08,509 INFO L290 TraceCheckUtils]: 9: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID
[2022-04-08 07:44:08,509 INFO L272 TraceCheckUtils]: 8: Hoare triple {3584#(< ~counter~0 97)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3353#true} is VALID
[2022-04-08 07:44:08,510 INFO L290 TraceCheckUtils]: 7: Hoare triple {3584#(< ~counter~0 97)} assume !!(#t~post5 < 100);havoc #t~post5; {3584#(< ~counter~0 97)} is VALID
[2022-04-08 07:44:08,510 INFO L290 TraceCheckUtils]: 6: Hoare triple {3609#(< ~counter~0 96)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3584#(< ~counter~0 97)} is VALID
[2022-04-08 07:44:08,510 INFO L290 TraceCheckUtils]: 5: Hoare triple {3609#(< ~counter~0 96)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {3609#(< ~counter~0 96)} is VALID
[2022-04-08 07:44:08,510 INFO L272 TraceCheckUtils]: 4: Hoare triple {3609#(< ~counter~0 96)} call #t~ret6 := main(); {3609#(< ~counter~0 96)} is VALID
[2022-04-08 07:44:08,511 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3609#(< ~counter~0 96)} {3353#true} #57#return; {3609#(< ~counter~0 96)} is VALID
[2022-04-08 07:44:08,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {3609#(< ~counter~0 96)} assume true; {3609#(< ~counter~0 96)} is VALID
[2022-04-08 07:44:08,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {3353#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3609#(< ~counter~0 96)} is VALID
[2022-04-08 07:44:08,512 INFO L272 TraceCheckUtils]: 0: Hoare triple {3353#true} call ULTIMATE.init(); {3353#true} is VALID
[2022-04-08 07:44:08,512 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked.
[2022-04-08 07:44:08,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 07:44:08,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413606495]
[2022-04-08 07:44:08,513 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-08 07:44:08,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542266969]
[2022-04-08 07:44:08,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542266969] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 07:44:08,513 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2022-04-08 07:44:08,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14
[2022-04-08 07:44:08,513 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 07:44:08,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1523232688]
[2022-04-08 07:44:08,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1523232688] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 07:44:08,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 07:44:08,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2022-04-08 07:44:08,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567267550]
[2022-04-08 07:44:08,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 07:44:08,514 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 44
[2022-04-08 07:44:08,515 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 07:44:08,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2022-04-08 07:44:08,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:44:08,541 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2022-04-08 07:44:08,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 07:44:08,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2022-04-08 07:44:08,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182
[2022-04-08 07:44:08,542 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2022-04-08 07:44:08,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:44:08,727 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions.
[2022-04-08 07:44:08,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2022-04-08 07:44:08,727 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 44
[2022-04-08 07:44:08,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 07:44:08,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2022-04-08 07:44:08,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 58 transitions.
[2022-04-08 07:44:08,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2022-04-08 07:44:08,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 58 transitions.
[2022-04-08 07:44:08,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 58 transitions.
[2022-04-08 07:44:08,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:44:08,770 INFO L225 Difference]: With dead ends: 58
[2022-04-08 07:44:08,770 INFO L226 Difference]: Without dead ends: 53
[2022-04-08 07:44:08,770 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=183, Unknown=0, NotChecked=0, Total=306
[2022-04-08 07:44:08,771 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 07:44:08,771 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 76 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 07:44:08,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states.
[2022-04-08 07:44:08,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53.
[2022-04-08 07:44:08,823 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 07:44:08,823 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 53 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2022-04-08 07:44:08,823 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 53 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2022-04-08 07:44:08,824 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 53 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2022-04-08 07:44:08,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:44:08,851 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions.
[2022-04-08 07:44:08,851 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions.
[2022-04-08 07:44:08,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 07:44:08,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 07:44:08,852 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 53 states.
[2022-04-08 07:44:08,852 INFO L87 Difference]: Start difference. First operand has 53 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 53 states.
[2022-04-08 07:44:08,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:44:08,854 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions.
[2022-04-08 07:44:08,854 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions.
[2022-04-08 07:44:08,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 07:44:08,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 07:44:08,854 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 07:44:08,854 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 07:44:08,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2022-04-08 07:44:08,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions.
[2022-04-08 07:44:08,856 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 44
[2022-04-08 07:44:08,856 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 07:44:08,856 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions.
[2022-04-08 07:44:08,856 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2022-04-08 07:44:08,856 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 54 transitions.
[2022-04-08 07:44:08,929 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:44:08,929 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions.
[2022-04-08 07:44:08,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51
[2022-04-08 07:44:08,929 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 07:44:08,930 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 07:44:08,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0
[2022-04-08 07:44:09,146 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10
[2022-04-08 07:44:09,146 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 07:44:09,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 07:44:09,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1037185971, now seen corresponding path program 7 times
[2022-04-08 07:44:09,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 07:44:09,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1705648649]
[2022-04-08 07:44:09,274 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult
[2022-04-08 07:44:09,274 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE
[2022-04-08 07:44:09,274 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 07:44:09,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1037185971, now seen corresponding path program 8 times
[2022-04-08 07:44:09,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 07:44:09,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145961339]
[2022-04-08 07:44:09,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 07:44:09,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 07:44:09,303 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-08 07:44:09,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [646113422]
[2022-04-08 07:44:09,303 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 07:44:09,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 07:44:09,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 07:44:09,313 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 07:44:09,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2022-04-08 07:44:09,454 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 07:44:09,454 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 07:44:09,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 24 conjunts are in the unsatisfiable core
[2022-04-08 07:44:09,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 07:44:09,466 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 07:44:09,791 INFO L272 TraceCheckUtils]: 0: Hoare triple {3966#true} call ULTIMATE.init(); {3966#true} is VALID
[2022-04-08 07:44:09,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {3966#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3966#true} is VALID
[2022-04-08 07:44:09,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {3966#true} assume true; {3966#true} is VALID
[2022-04-08 07:44:09,791 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3966#true} {3966#true} #57#return; {3966#true} is VALID
[2022-04-08 07:44:09,791 INFO L272 TraceCheckUtils]: 4: Hoare triple {3966#true} call #t~ret6 := main(); {3966#true} is VALID
[2022-04-08 07:44:09,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {3966#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {3986#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 07:44:09,792 INFO L290 TraceCheckUtils]: 6: Hoare triple {3986#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3986#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 07:44:09,792 INFO L290 TraceCheckUtils]: 7: Hoare triple {3986#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {3986#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 07:44:09,793 INFO L272 TraceCheckUtils]: 8: Hoare triple {3986#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3966#true} is VALID
[2022-04-08 07:44:09,793 INFO L290 TraceCheckUtils]: 9: Hoare triple {3966#true} ~cond := #in~cond; {3966#true} is VALID
[2022-04-08 07:44:09,793 INFO L290 TraceCheckUtils]: 10: Hoare triple {3966#true} assume !(0 == ~cond); {3966#true} is VALID
[2022-04-08 07:44:09,793 INFO L290 TraceCheckUtils]: 11: Hoare triple {3966#true} assume true; {3966#true} is VALID
[2022-04-08 07:44:09,793 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3966#true} {3986#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {3986#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 07:44:09,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {3986#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4011#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID
[2022-04-08 07:44:09,794 INFO L290 TraceCheckUtils]: 14: Hoare triple {4011#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4011#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID
[2022-04-08 07:44:09,794 INFO L290 TraceCheckUtils]: 15: Hoare triple {4011#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {4011#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID
[2022-04-08 07:44:09,794 INFO L272 TraceCheckUtils]: 16: Hoare triple {4011#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3966#true} is VALID
[2022-04-08 07:44:09,794 INFO L290 TraceCheckUtils]: 17: Hoare triple {3966#true} ~cond := #in~cond; {3966#true} is VALID
[2022-04-08 07:44:09,795 INFO L290 TraceCheckUtils]: 18: Hoare triple {3966#true} assume !(0 == ~cond); {3966#true} is VALID
[2022-04-08 07:44:09,795 INFO L290 TraceCheckUtils]: 19: Hoare triple {3966#true} assume true; {3966#true} is VALID
[2022-04-08 07:44:09,795 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3966#true} {4011#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #51#return; {4011#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID
[2022-04-08 07:44:09,795 INFO L290 TraceCheckUtils]: 21: Hoare triple {4011#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4036#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID
[2022-04-08 07:44:09,796 INFO L290 TraceCheckUtils]: 22: Hoare triple {4036#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4036#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID
[2022-04-08 07:44:09,796 INFO L290 TraceCheckUtils]: 23: Hoare triple {4036#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(#t~post5 < 100);havoc #t~post5; {4036#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID
[2022-04-08 07:44:09,796 INFO L272 TraceCheckUtils]: 24: Hoare triple {4036#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3966#true} is VALID
[2022-04-08 07:44:09,796 INFO L290 TraceCheckUtils]: 25: Hoare triple {3966#true} ~cond := #in~cond; {3966#true} is VALID
[2022-04-08 07:44:09,796 INFO L290 TraceCheckUtils]: 26: Hoare triple {3966#true} assume !(0 == ~cond); {3966#true} is VALID
[2022-04-08 07:44:09,796 INFO L290 TraceCheckUtils]: 27: Hoare triple {3966#true} assume true; {3966#true} is VALID
[2022-04-08 07:44:09,797 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3966#true} {4036#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #51#return; {4036#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID
[2022-04-08 07:44:09,797 INFO L290 TraceCheckUtils]: 29: Hoare triple {4036#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4061#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID
[2022-04-08 07:44:09,797 INFO L290 TraceCheckUtils]: 30: Hoare triple {4061#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4061#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID
[2022-04-08 07:44:09,798 INFO L290 TraceCheckUtils]: 31: Hoare triple {4061#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} assume !!(#t~post5 < 100);havoc #t~post5; {4061#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID
[2022-04-08 07:44:09,798 INFO L272 TraceCheckUtils]: 32: Hoare triple {4061#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3966#true} is VALID
[2022-04-08 07:44:09,798 INFO L290 TraceCheckUtils]: 33: Hoare triple {3966#true} ~cond := #in~cond; {3966#true} is VALID
[2022-04-08 07:44:09,798 INFO L290 TraceCheckUtils]: 34: Hoare triple {3966#true} assume !(0 == ~cond); {3966#true} is VALID
[2022-04-08 07:44:09,798 INFO L290 TraceCheckUtils]: 35: Hoare triple {3966#true} assume true; {3966#true} is VALID
[2022-04-08 07:44:09,798 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3966#true} {4061#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} #51#return; {4061#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID
[2022-04-08 07:44:09,799 INFO L290 TraceCheckUtils]: 37: Hoare triple {4061#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4086#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} is VALID
[2022-04-08 07:44:09,799 INFO L290 TraceCheckUtils]: 38: Hoare triple {4086#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4086#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} is VALID
[2022-04-08 07:44:09,799 INFO L290 TraceCheckUtils]: 39: Hoare triple {4086#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} assume !!(#t~post5 < 100);havoc #t~post5; {4086#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} is VALID
[2022-04-08 07:44:09,800 INFO L272 TraceCheckUtils]: 40: Hoare triple {4086#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3966#true} is VALID
[2022-04-08 07:44:09,800 INFO L290 TraceCheckUtils]: 41: Hoare triple {3966#true} ~cond := #in~cond; {3966#true} is VALID
[2022-04-08 07:44:09,800 INFO L290 TraceCheckUtils]: 42: Hoare triple {3966#true} assume !(0 == ~cond); {3966#true} is VALID
[2022-04-08 07:44:09,800 INFO L290 TraceCheckUtils]: 43: Hoare triple {3966#true} assume true; {3966#true} is VALID
[2022-04-08 07:44:09,800 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {3966#true} {4086#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} #51#return; {4086#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} is VALID
[2022-04-08 07:44:09,801 INFO L290 TraceCheckUtils]: 45: Hoare triple {4086#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {4111#(and (< 3 main_~k~0) (<= main_~k~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID
[2022-04-08 07:44:09,801 INFO L272 TraceCheckUtils]: 46: Hoare triple {4111#(and (< 3 main_~k~0) (<= main_~k~0 4) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4115#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 07:44:09,801 INFO L290 TraceCheckUtils]: 47: Hoare triple {4115#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4119#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 07:44:09,802 INFO L290 TraceCheckUtils]: 48: Hoare triple {4119#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3967#false} is VALID
[2022-04-08 07:44:09,802 INFO L290 TraceCheckUtils]: 49: Hoare triple {3967#false} assume !false; {3967#false} is VALID
[2022-04-08 07:44:09,802 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked.
[2022-04-08 07:44:09,802 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 07:44:10,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 07:44:10,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145961339]
[2022-04-08 07:44:10,034 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-08 07:44:10,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646113422]
[2022-04-08 07:44:10,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646113422] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 07:44:10,035 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences.
[2022-04-08 07:44:10,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10
[2022-04-08 07:44:10,035 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 07:44:10,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1705648649]
[2022-04-08 07:44:10,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1705648649] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 07:44:10,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 07:44:10,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-04-08 07:44:10,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852040732]
[2022-04-08 07:44:10,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 07:44:10,037 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 50
[2022-04-08 07:44:10,038 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 07:44:10,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2022-04-08 07:44:10,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:44:10,065 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2022-04-08 07:44:10,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 07:44:10,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2022-04-08 07:44:10,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156
[2022-04-08 07:44:10,066 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2022-04-08 07:44:10,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:44:10,445 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions.
[2022-04-08 07:44:10,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2022-04-08 07:44:10,445 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 50
[2022-04-08 07:44:10,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 07:44:10,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2022-04-08 07:44:10,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 49 transitions.
[2022-04-08 07:44:10,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2022-04-08 07:44:10,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 49 transitions.
[2022-04-08 07:44:10,447 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 49 transitions.
[2022-04-08 07:44:10,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:44:10,485 INFO L225 Difference]: With dead ends: 60
[2022-04-08 07:44:10,485 INFO L226 Difference]: Without dead ends: 55
[2022-04-08 07:44:10,485 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210
[2022-04-08 07:44:10,486 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-08 07:44:10,486 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 208 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-08 07:44:10,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states.
[2022-04-08 07:44:10,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55.
[2022-04-08 07:44:10,540 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 07:44:10,540 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 39 states have internal predecessors, (41), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-08 07:44:10,540 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 39 states have internal predecessors, (41), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-08 07:44:10,540 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 39 states have internal predecessors, (41), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-08 07:44:10,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:44:10,541 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions.
[2022-04-08 07:44:10,541 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions.
[2022-04-08 07:44:10,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 07:44:10,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 07:44:10,542 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 39 states have internal predecessors, (41), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 55 states.
[2022-04-08 07:44:10,542 INFO L87 Difference]: Start difference. First operand has 55 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 39 states have internal predecessors, (41), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 55 states.
[2022-04-08 07:44:10,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:44:10,543 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions.
[2022-04-08 07:44:10,543 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions.
[2022-04-08 07:44:10,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 07:44:10,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 07:44:10,543 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 07:44:10,543 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 07:44:10,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 39 states have internal predecessors, (41), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-08 07:44:10,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions.
[2022-04-08 07:44:10,544 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 50
[2022-04-08 07:44:10,544 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 07:44:10,544 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions.
[2022-04-08 07:44:10,544 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2022-04-08 07:44:10,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 57 transitions.
[2022-04-08 07:44:10,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:44:10,604 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions.
[2022-04-08 07:44:10,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53
[2022-04-08 07:44:10,604 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 07:44:10,604 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 07:44:10,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0
[2022-04-08 07:44:10,806 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11
[2022-04-08 07:44:10,806 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 07:44:10,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 07:44:10,807 INFO L85 PathProgramCache]: Analyzing trace with hash 999934744, now seen corresponding path program 9 times
[2022-04-08 07:44:10,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 07:44:10,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1384313072]
[2022-04-08 07:44:10,881 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult
[2022-04-08 07:44:10,881 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE
[2022-04-08 07:44:10,881 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 07:44:10,881 INFO L85 PathProgramCache]: Analyzing trace with hash 999934744, now seen corresponding path program 10 times
[2022-04-08 07:44:10,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 07:44:10,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951566551]
[2022-04-08 07:44:10,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 07:44:10,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 07:44:10,889 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-08 07:44:10,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1278534361]
[2022-04-08 07:44:10,889 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-04-08 07:44:10,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 07:44:10,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 07:44:10,890 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 07:44:10,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process
[2022-04-08 07:44:11,016 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-04-08 07:44:11,016 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 07:44:11,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 15 conjunts are in the unsatisfiable core
[2022-04-08 07:44:11,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 07:44:11,029 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 07:44:11,308 INFO L272 TraceCheckUtils]: 0: Hoare triple {4514#true} call ULTIMATE.init(); {4514#true} is VALID
[2022-04-08 07:44:11,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {4514#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4522#(<= ~counter~0 0)} is VALID
[2022-04-08 07:44:11,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {4522#(<= ~counter~0 0)} assume true; {4522#(<= ~counter~0 0)} is VALID
[2022-04-08 07:44:11,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4522#(<= ~counter~0 0)} {4514#true} #57#return; {4522#(<= ~counter~0 0)} is VALID
[2022-04-08 07:44:11,310 INFO L272 TraceCheckUtils]: 4: Hoare triple {4522#(<= ~counter~0 0)} call #t~ret6 := main(); {4522#(<= ~counter~0 0)} is VALID
[2022-04-08 07:44:11,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {4522#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {4522#(<= ~counter~0 0)} is VALID
[2022-04-08 07:44:11,310 INFO L290 TraceCheckUtils]: 6: Hoare triple {4522#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4538#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:11,311 INFO L290 TraceCheckUtils]: 7: Hoare triple {4538#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {4538#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:11,311 INFO L272 TraceCheckUtils]: 8: Hoare triple {4538#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4538#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:11,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {4538#(<= ~counter~0 1)} ~cond := #in~cond; {4538#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:11,312 INFO L290 TraceCheckUtils]: 10: Hoare triple {4538#(<= ~counter~0 1)} assume !(0 == ~cond); {4538#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:11,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {4538#(<= ~counter~0 1)} assume true; {4538#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:11,313 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4538#(<= ~counter~0 1)} {4538#(<= ~counter~0 1)} #51#return; {4538#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:11,313 INFO L290 TraceCheckUtils]: 13: Hoare triple {4538#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4538#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:11,313 INFO L290 TraceCheckUtils]: 14: Hoare triple {4538#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4563#(<= ~counter~0 2)} is VALID
[2022-04-08 07:44:11,314 INFO L290 TraceCheckUtils]: 15: Hoare triple {4563#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {4563#(<= ~counter~0 2)} is VALID
[2022-04-08 07:44:11,314 INFO L272 TraceCheckUtils]: 16: Hoare triple {4563#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4563#(<= ~counter~0 2)} is VALID
[2022-04-08 07:44:11,314 INFO L290 TraceCheckUtils]: 17: Hoare triple {4563#(<= ~counter~0 2)} ~cond := #in~cond; {4563#(<= ~counter~0 2)} is VALID
[2022-04-08 07:44:11,315 INFO L290 TraceCheckUtils]: 18: Hoare triple {4563#(<= ~counter~0 2)} assume !(0 == ~cond); {4563#(<= ~counter~0 2)} is VALID
[2022-04-08 07:44:11,315 INFO L290 TraceCheckUtils]: 19: Hoare triple {4563#(<= ~counter~0 2)} assume true; {4563#(<= ~counter~0 2)} is VALID
[2022-04-08 07:44:11,315 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {4563#(<= ~counter~0 2)} {4563#(<= ~counter~0 2)} #51#return; {4563#(<= ~counter~0 2)} is VALID
[2022-04-08 07:44:11,316 INFO L290 TraceCheckUtils]: 21: Hoare triple {4563#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4563#(<= ~counter~0 2)} is VALID
[2022-04-08 07:44:11,316 INFO L290 TraceCheckUtils]: 22: Hoare triple {4563#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4588#(<= ~counter~0 3)} is VALID
[2022-04-08 07:44:11,316 INFO L290 TraceCheckUtils]: 23: Hoare triple {4588#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {4588#(<= ~counter~0 3)} is VALID
[2022-04-08 07:44:11,317 INFO L272 TraceCheckUtils]: 24: Hoare triple {4588#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4588#(<= ~counter~0 3)} is VALID
[2022-04-08 07:44:11,317 INFO L290 TraceCheckUtils]: 25: Hoare triple {4588#(<= ~counter~0 3)} ~cond := #in~cond; {4588#(<= ~counter~0 3)} is VALID
[2022-04-08 07:44:11,317 INFO L290 TraceCheckUtils]: 26: Hoare triple {4588#(<= ~counter~0 3)} assume !(0 == ~cond); {4588#(<= ~counter~0 3)} is VALID
[2022-04-08 07:44:11,318 INFO L290 TraceCheckUtils]: 27: Hoare triple {4588#(<= ~counter~0 3)} assume true; {4588#(<= ~counter~0 3)} is VALID
[2022-04-08 07:44:11,318 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4588#(<= ~counter~0 3)} {4588#(<= ~counter~0 3)} #51#return; {4588#(<= ~counter~0 3)} is VALID
[2022-04-08 07:44:11,319 INFO L290 TraceCheckUtils]: 29: Hoare triple {4588#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4588#(<= ~counter~0 3)} is VALID
[2022-04-08 07:44:11,319 INFO L290 TraceCheckUtils]: 30: Hoare triple {4588#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4613#(<= ~counter~0 4)} is VALID
[2022-04-08 07:44:11,320 INFO L290 TraceCheckUtils]: 31: Hoare triple {4613#(<= ~counter~0 4)} assume !!(#t~post5 < 100);havoc #t~post5; {4613#(<= ~counter~0 4)} is VALID
[2022-04-08 07:44:11,320 INFO L272 TraceCheckUtils]: 32: Hoare triple {4613#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4613#(<= ~counter~0 4)} is VALID
[2022-04-08 07:44:11,320 INFO L290 TraceCheckUtils]: 33: Hoare triple {4613#(<= ~counter~0 4)} ~cond := #in~cond; {4613#(<= ~counter~0 4)} is VALID
[2022-04-08 07:44:11,321 INFO L290 TraceCheckUtils]: 34: Hoare triple {4613#(<= ~counter~0 4)} assume !(0 == ~cond); {4613#(<= ~counter~0 4)} is VALID
[2022-04-08 07:44:11,321 INFO L290 TraceCheckUtils]: 35: Hoare triple {4613#(<= ~counter~0 4)} assume true; {4613#(<= ~counter~0 4)} is VALID
[2022-04-08 07:44:11,322 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4613#(<= ~counter~0 4)} {4613#(<= ~counter~0 4)} #51#return; {4613#(<= ~counter~0 4)} is VALID
[2022-04-08 07:44:11,322 INFO L290 TraceCheckUtils]: 37: Hoare triple {4613#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4613#(<= ~counter~0 4)} is VALID
[2022-04-08 07:44:11,322 INFO L290 TraceCheckUtils]: 38: Hoare triple {4613#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4638#(<= ~counter~0 5)} is VALID
[2022-04-08 07:44:11,323 INFO L290 TraceCheckUtils]: 39: Hoare triple {4638#(<= ~counter~0 5)} assume !!(#t~post5 < 100);havoc #t~post5; {4638#(<= ~counter~0 5)} is VALID
[2022-04-08 07:44:11,323 INFO L272 TraceCheckUtils]: 40: Hoare triple {4638#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4638#(<= ~counter~0 5)} is VALID
[2022-04-08 07:44:11,324 INFO L290 TraceCheckUtils]: 41: Hoare triple {4638#(<= ~counter~0 5)} ~cond := #in~cond; {4638#(<= ~counter~0 5)} is VALID
[2022-04-08 07:44:11,324 INFO L290 TraceCheckUtils]: 42: Hoare triple {4638#(<= ~counter~0 5)} assume !(0 == ~cond); {4638#(<= ~counter~0 5)} is VALID
[2022-04-08 07:44:11,324 INFO L290 TraceCheckUtils]: 43: Hoare triple {4638#(<= ~counter~0 5)} assume true; {4638#(<= ~counter~0 5)} is VALID
[2022-04-08 07:44:11,325 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {4638#(<= ~counter~0 5)} {4638#(<= ~counter~0 5)} #51#return; {4638#(<= ~counter~0 5)} is VALID
[2022-04-08 07:44:11,325 INFO L290 TraceCheckUtils]: 45: Hoare triple {4638#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4638#(<= ~counter~0 5)} is VALID
[2022-04-08 07:44:11,325 INFO L290 TraceCheckUtils]: 46: Hoare triple {4638#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4663#(<= |main_#t~post5| 5)} is VALID
[2022-04-08 07:44:11,326 INFO L290 TraceCheckUtils]: 47: Hoare triple {4663#(<= |main_#t~post5| 5)} assume !(#t~post5 < 100);havoc #t~post5; {4515#false} is VALID
[2022-04-08 07:44:11,326 INFO L272 TraceCheckUtils]: 48: Hoare triple {4515#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4515#false} is VALID
[2022-04-08 07:44:11,326 INFO L290 TraceCheckUtils]: 49: Hoare triple {4515#false} ~cond := #in~cond; {4515#false} is VALID
[2022-04-08 07:44:11,326 INFO L290 TraceCheckUtils]: 50: Hoare triple {4515#false} assume 0 == ~cond; {4515#false} is VALID
[2022-04-08 07:44:11,326 INFO L290 TraceCheckUtils]: 51: Hoare triple {4515#false} assume !false; {4515#false} is VALID
[2022-04-08 07:44:11,326 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 10 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 07:44:11,326 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 07:44:11,619 INFO L290 TraceCheckUtils]: 51: Hoare triple {4515#false} assume !false; {4515#false} is VALID
[2022-04-08 07:44:11,619 INFO L290 TraceCheckUtils]: 50: Hoare triple {4515#false} assume 0 == ~cond; {4515#false} is VALID
[2022-04-08 07:44:11,619 INFO L290 TraceCheckUtils]: 49: Hoare triple {4515#false} ~cond := #in~cond; {4515#false} is VALID
[2022-04-08 07:44:11,620 INFO L272 TraceCheckUtils]: 48: Hoare triple {4515#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4515#false} is VALID
[2022-04-08 07:44:11,620 INFO L290 TraceCheckUtils]: 47: Hoare triple {4691#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {4515#false} is VALID
[2022-04-08 07:44:11,620 INFO L290 TraceCheckUtils]: 46: Hoare triple {4695#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4691#(< |main_#t~post5| 100)} is VALID
[2022-04-08 07:44:11,620 INFO L290 TraceCheckUtils]: 45: Hoare triple {4695#(< ~counter~0 100)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4695#(< ~counter~0 100)} is VALID
[2022-04-08 07:44:11,621 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {4514#true} {4695#(< ~counter~0 100)} #51#return; {4695#(< ~counter~0 100)} is VALID
[2022-04-08 07:44:11,621 INFO L290 TraceCheckUtils]: 43: Hoare triple {4514#true} assume true; {4514#true} is VALID
[2022-04-08 07:44:11,621 INFO L290 TraceCheckUtils]: 42: Hoare triple {4514#true} assume !(0 == ~cond); {4514#true} is VALID
[2022-04-08 07:44:11,621 INFO L290 TraceCheckUtils]: 41: Hoare triple {4514#true} ~cond := #in~cond; {4514#true} is VALID
[2022-04-08 07:44:11,621 INFO L272 TraceCheckUtils]: 40: Hoare triple {4695#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4514#true} is VALID
[2022-04-08 07:44:11,622 INFO L290 TraceCheckUtils]: 39: Hoare triple {4695#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {4695#(< ~counter~0 100)} is VALID
[2022-04-08 07:44:11,622 INFO L290 TraceCheckUtils]: 38: Hoare triple {4720#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4695#(< ~counter~0 100)} is VALID
[2022-04-08 07:44:11,622 INFO L290 TraceCheckUtils]: 37: Hoare triple {4720#(< ~counter~0 99)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4720#(< ~counter~0 99)} is VALID
[2022-04-08 07:44:11,623 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4514#true} {4720#(< ~counter~0 99)} #51#return; {4720#(< ~counter~0 99)} is VALID
[2022-04-08 07:44:11,623 INFO L290 TraceCheckUtils]: 35: Hoare triple {4514#true} assume true; {4514#true} is VALID
[2022-04-08 07:44:11,623 INFO L290 TraceCheckUtils]: 34: Hoare triple {4514#true} assume !(0 == ~cond); {4514#true} is VALID
[2022-04-08 07:44:11,623 INFO L290 TraceCheckUtils]: 33: Hoare triple {4514#true} ~cond := #in~cond; {4514#true} is VALID
[2022-04-08 07:44:11,623 INFO L272 TraceCheckUtils]: 32: Hoare triple {4720#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4514#true} is VALID
[2022-04-08 07:44:11,623 INFO L290 TraceCheckUtils]: 31: Hoare triple {4720#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {4720#(< ~counter~0 99)} is VALID
[2022-04-08 07:44:11,624 INFO L290 TraceCheckUtils]: 30: Hoare triple {4745#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4720#(< ~counter~0 99)} is VALID
[2022-04-08 07:44:11,624 INFO L290 TraceCheckUtils]: 29: Hoare triple {4745#(< ~counter~0 98)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4745#(< ~counter~0 98)} is VALID
[2022-04-08 07:44:11,625 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4514#true} {4745#(< ~counter~0 98)} #51#return; {4745#(< ~counter~0 98)} is VALID
[2022-04-08 07:44:11,625 INFO L290 TraceCheckUtils]: 27: Hoare triple {4514#true} assume true; {4514#true} is VALID
[2022-04-08 07:44:11,625 INFO L290 TraceCheckUtils]: 26: Hoare triple {4514#true} assume !(0 == ~cond); {4514#true} is VALID
[2022-04-08 07:44:11,625 INFO L290 TraceCheckUtils]: 25: Hoare triple {4514#true} ~cond := #in~cond; {4514#true} is VALID
[2022-04-08 07:44:11,625 INFO L272 TraceCheckUtils]: 24: Hoare triple {4745#(< ~counter~0 98)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4514#true} is VALID
[2022-04-08 07:44:11,625 INFO L290 TraceCheckUtils]: 23: Hoare triple {4745#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {4745#(< ~counter~0 98)} is VALID
[2022-04-08 07:44:11,626 INFO L290 TraceCheckUtils]: 22: Hoare triple {4770#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4745#(< ~counter~0 98)} is VALID
[2022-04-08 07:44:11,626 INFO L290 TraceCheckUtils]: 21: Hoare triple {4770#(< ~counter~0 97)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4770#(< ~counter~0 97)} is VALID
[2022-04-08 07:44:11,626 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {4514#true} {4770#(< ~counter~0 97)} #51#return; {4770#(< ~counter~0 97)} is VALID
[2022-04-08 07:44:11,627 INFO L290 TraceCheckUtils]: 19: Hoare triple {4514#true} assume true; {4514#true} is VALID
[2022-04-08 07:44:11,627 INFO L290 TraceCheckUtils]: 18: Hoare triple {4514#true} assume !(0 == ~cond); {4514#true} is VALID
[2022-04-08 07:44:11,627 INFO L290 TraceCheckUtils]: 17: Hoare triple {4514#true} ~cond := #in~cond; {4514#true} is VALID
[2022-04-08 07:44:11,627 INFO L272 TraceCheckUtils]: 16: Hoare triple {4770#(< ~counter~0 97)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4514#true} is VALID
[2022-04-08 07:44:11,627 INFO L290 TraceCheckUtils]: 15: Hoare triple {4770#(< ~counter~0 97)} assume !!(#t~post5 < 100);havoc #t~post5; {4770#(< ~counter~0 97)} is VALID
[2022-04-08 07:44:11,627 INFO L290 TraceCheckUtils]: 14: Hoare triple {4795#(< ~counter~0 96)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4770#(< ~counter~0 97)} is VALID
[2022-04-08 07:44:11,628 INFO L290 TraceCheckUtils]: 13: Hoare triple {4795#(< ~counter~0 96)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4795#(< ~counter~0 96)} is VALID
[2022-04-08 07:44:11,628 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4514#true} {4795#(< ~counter~0 96)} #51#return; {4795#(< ~counter~0 96)} is VALID
[2022-04-08 07:44:11,628 INFO L290 TraceCheckUtils]: 11: Hoare triple {4514#true} assume true; {4514#true} is VALID
[2022-04-08 07:44:11,628 INFO L290 TraceCheckUtils]: 10: Hoare triple {4514#true} assume !(0 == ~cond); {4514#true} is VALID
[2022-04-08 07:44:11,628 INFO L290 TraceCheckUtils]: 9: Hoare triple {4514#true} ~cond := #in~cond; {4514#true} is VALID
[2022-04-08 07:44:11,629 INFO L272 TraceCheckUtils]: 8: Hoare triple {4795#(< ~counter~0 96)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4514#true} is VALID
[2022-04-08 07:44:11,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {4795#(< ~counter~0 96)} assume !!(#t~post5 < 100);havoc #t~post5; {4795#(< ~counter~0 96)} is VALID
[2022-04-08 07:44:11,629 INFO L290 TraceCheckUtils]: 6: Hoare triple {4820#(< ~counter~0 95)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4795#(< ~counter~0 96)} is VALID
[2022-04-08 07:44:11,630 INFO L290 TraceCheckUtils]: 5: Hoare triple {4820#(< ~counter~0 95)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {4820#(< ~counter~0 95)} is VALID
[2022-04-08 07:44:11,630 INFO L272 TraceCheckUtils]: 4: Hoare triple {4820#(< ~counter~0 95)} call #t~ret6 := main(); {4820#(< ~counter~0 95)} is VALID
[2022-04-08 07:44:11,630 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4820#(< ~counter~0 95)} {4514#true} #57#return; {4820#(< ~counter~0 95)} is VALID
[2022-04-08 07:44:11,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {4820#(< ~counter~0 95)} assume true; {4820#(< ~counter~0 95)} is VALID
[2022-04-08 07:44:11,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {4514#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4820#(< ~counter~0 95)} is VALID
[2022-04-08 07:44:11,631 INFO L272 TraceCheckUtils]: 0: Hoare triple {4514#true} call ULTIMATE.init(); {4514#true} is VALID
[2022-04-08 07:44:11,631 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 10 proven. 50 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked.
[2022-04-08 07:44:11,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 07:44:11,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951566551]
[2022-04-08 07:44:11,632 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-08 07:44:11,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278534361]
[2022-04-08 07:44:11,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278534361] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 07:44:11,632 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2022-04-08 07:44:11,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16
[2022-04-08 07:44:11,632 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 07:44:11,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1384313072]
[2022-04-08 07:44:11,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1384313072] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 07:44:11,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 07:44:11,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2022-04-08 07:44:11,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095741601]
[2022-04-08 07:44:11,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 07:44:11,633 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 52
[2022-04-08 07:44:11,633 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 07:44:11,633 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2022-04-08 07:44:11,667 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:44:11,667 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2022-04-08 07:44:11,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 07:44:11,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2022-04-08 07:44:11,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240
[2022-04-08 07:44:11,668 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2022-04-08 07:44:11,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:44:11,847 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions.
[2022-04-08 07:44:11,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2022-04-08 07:44:11,847 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 52
[2022-04-08 07:44:11,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 07:44:11,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2022-04-08 07:44:11,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 66 transitions.
[2022-04-08 07:44:11,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2022-04-08 07:44:11,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 66 transitions.
[2022-04-08 07:44:11,849 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 66 transitions.
[2022-04-08 07:44:11,892 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:44:11,892 INFO L225 Difference]: With dead ends: 66
[2022-04-08 07:44:11,892 INFO L226 Difference]: Without dead ends: 61
[2022-04-08 07:44:11,893 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=249, Unknown=0, NotChecked=0, Total=420
[2022-04-08 07:44:11,893 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 07:44:11,893 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 82 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 07:44:11,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states.
[2022-04-08 07:44:11,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61.
[2022-04-08 07:44:11,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 07:44:11,978 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 61 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 states have internal predecessors, (46), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-08 07:44:11,979 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 61 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 states have internal predecessors, (46), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-08 07:44:11,979 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 61 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 states have internal predecessors, (46), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-08 07:44:11,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:44:11,981 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions.
[2022-04-08 07:44:11,981 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions.
[2022-04-08 07:44:11,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 07:44:11,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 07:44:11,981 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 states have internal predecessors, (46), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 61 states.
[2022-04-08 07:44:11,984 INFO L87 Difference]: Start difference. First operand has 61 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 states have internal predecessors, (46), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 61 states.
[2022-04-08 07:44:11,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:44:11,985 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions.
[2022-04-08 07:44:11,985 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions.
[2022-04-08 07:44:11,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 07:44:11,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 07:44:11,985 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 07:44:11,985 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 07:44:11,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 states have internal predecessors, (46), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-08 07:44:11,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions.
[2022-04-08 07:44:11,986 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 52
[2022-04-08 07:44:11,986 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 07:44:11,986 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions.
[2022-04-08 07:44:11,987 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2022-04-08 07:44:11,987 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 62 transitions.
[2022-04-08 07:44:12,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:44:12,080 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions.
[2022-04-08 07:44:12,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2022-04-08 07:44:12,080 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 07:44:12,080 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 07:44:12,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0
[2022-04-08 07:44:12,285 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12
[2022-04-08 07:44:12,285 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 07:44:12,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 07:44:12,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1795671114, now seen corresponding path program 9 times
[2022-04-08 07:44:12,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 07:44:12,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1136718548]
[2022-04-08 07:44:12,354 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult
[2022-04-08 07:44:12,354 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE
[2022-04-08 07:44:12,354 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 07:44:12,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1795671114, now seen corresponding path program 10 times
[2022-04-08 07:44:12,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 07:44:12,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480422955]
[2022-04-08 07:44:12,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 07:44:12,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 07:44:12,375 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-08 07:44:12,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [740844347]
[2022-04-08 07:44:12,375 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-04-08 07:44:12,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 07:44:12,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 07:44:12,376 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 07:44:12,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process
[2022-04-08 07:44:12,645 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-04-08 07:44:12,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 07:44:12,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 28 conjunts are in the unsatisfiable core
[2022-04-08 07:44:12,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 07:44:12,660 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 07:44:13,025 INFO L272 TraceCheckUtils]: 0: Hoare triple {5227#true} call ULTIMATE.init(); {5227#true} is VALID
[2022-04-08 07:44:13,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {5227#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5227#true} is VALID
[2022-04-08 07:44:13,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {5227#true} assume true; {5227#true} is VALID
[2022-04-08 07:44:13,026 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5227#true} {5227#true} #57#return; {5227#true} is VALID
[2022-04-08 07:44:13,026 INFO L272 TraceCheckUtils]: 4: Hoare triple {5227#true} call #t~ret6 := main(); {5227#true} is VALID
[2022-04-08 07:44:13,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {5227#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {5247#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 07:44:13,027 INFO L290 TraceCheckUtils]: 6: Hoare triple {5247#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5247#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 07:44:13,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {5247#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {5247#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 07:44:13,027 INFO L272 TraceCheckUtils]: 8: Hoare triple {5247#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5227#true} is VALID
[2022-04-08 07:44:13,027 INFO L290 TraceCheckUtils]: 9: Hoare triple {5227#true} ~cond := #in~cond; {5227#true} is VALID
[2022-04-08 07:44:13,027 INFO L290 TraceCheckUtils]: 10: Hoare triple {5227#true} assume !(0 == ~cond); {5227#true} is VALID
[2022-04-08 07:44:13,027 INFO L290 TraceCheckUtils]: 11: Hoare triple {5227#true} assume true; {5227#true} is VALID
[2022-04-08 07:44:13,028 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5227#true} {5247#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {5247#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 07:44:13,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {5247#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5272#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID
[2022-04-08 07:44:13,029 INFO L290 TraceCheckUtils]: 14: Hoare triple {5272#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5272#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID
[2022-04-08 07:44:13,029 INFO L290 TraceCheckUtils]: 15: Hoare triple {5272#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 100);havoc #t~post5; {5272#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID
[2022-04-08 07:44:13,029 INFO L272 TraceCheckUtils]: 16: Hoare triple {5272#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5227#true} is VALID
[2022-04-08 07:44:13,029 INFO L290 TraceCheckUtils]: 17: Hoare triple {5227#true} ~cond := #in~cond; {5227#true} is VALID
[2022-04-08 07:44:13,029 INFO L290 TraceCheckUtils]: 18: Hoare triple {5227#true} assume !(0 == ~cond); {5227#true} is VALID
[2022-04-08 07:44:13,029 INFO L290 TraceCheckUtils]: 19: Hoare triple {5227#true} assume true; {5227#true} is VALID
[2022-04-08 07:44:13,030 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {5227#true} {5272#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #51#return; {5272#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID
[2022-04-08 07:44:13,030 INFO L290 TraceCheckUtils]: 21: Hoare triple {5272#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5297#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID
[2022-04-08 07:44:13,031 INFO L290 TraceCheckUtils]: 22: Hoare triple {5297#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5297#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID
[2022-04-08 07:44:13,031 INFO L290 TraceCheckUtils]: 23: Hoare triple {5297#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 100);havoc #t~post5; {5297#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID
[2022-04-08 07:44:13,031 INFO L272 TraceCheckUtils]: 24: Hoare triple {5297#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5227#true} is VALID
[2022-04-08 07:44:13,031 INFO L290 TraceCheckUtils]: 25: Hoare triple {5227#true} ~cond := #in~cond; {5227#true} is VALID
[2022-04-08 07:44:13,031 INFO L290 TraceCheckUtils]: 26: Hoare triple {5227#true} assume !(0 == ~cond); {5227#true} is VALID
[2022-04-08 07:44:13,031 INFO L290 TraceCheckUtils]: 27: Hoare triple {5227#true} assume true; {5227#true} is VALID
[2022-04-08 07:44:13,032 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5227#true} {5297#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #51#return; {5297#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID
[2022-04-08 07:44:13,032 INFO L290 TraceCheckUtils]: 29: Hoare triple {5297#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5322#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID
[2022-04-08 07:44:13,033 INFO L290 TraceCheckUtils]: 30: Hoare triple {5322#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5322#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID
[2022-04-08 07:44:13,033 INFO L290 TraceCheckUtils]: 31: Hoare triple {5322#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !!(#t~post5 < 100);havoc #t~post5; {5322#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID
[2022-04-08 07:44:13,033 INFO L272 TraceCheckUtils]: 32: Hoare triple {5322#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5227#true} is VALID
[2022-04-08 07:44:13,033 INFO L290 TraceCheckUtils]: 33: Hoare triple {5227#true} ~cond := #in~cond; {5227#true} is VALID
[2022-04-08 07:44:13,033 INFO L290 TraceCheckUtils]: 34: Hoare triple {5227#true} assume !(0 == ~cond); {5227#true} is VALID
[2022-04-08 07:44:13,033 INFO L290 TraceCheckUtils]: 35: Hoare triple {5227#true} assume true; {5227#true} is VALID
[2022-04-08 07:44:13,034 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5227#true} {5322#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} #51#return; {5322#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID
[2022-04-08 07:44:13,034 INFO L290 TraceCheckUtils]: 37: Hoare triple {5322#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5347#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID
[2022-04-08 07:44:13,034 INFO L290 TraceCheckUtils]: 38: Hoare triple {5347#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5347#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID
[2022-04-08 07:44:13,035 INFO L290 TraceCheckUtils]: 39: Hoare triple {5347#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} assume !!(#t~post5 < 100);havoc #t~post5; {5347#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID
[2022-04-08 07:44:13,035 INFO L272 TraceCheckUtils]: 40: Hoare triple {5347#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5227#true} is VALID
[2022-04-08 07:44:13,035 INFO L290 TraceCheckUtils]: 41: Hoare triple {5227#true} ~cond := #in~cond; {5227#true} is VALID
[2022-04-08 07:44:13,035 INFO L290 TraceCheckUtils]: 42: Hoare triple {5227#true} assume !(0 == ~cond); {5227#true} is VALID
[2022-04-08 07:44:13,035 INFO L290 TraceCheckUtils]: 43: Hoare triple {5227#true} assume true; {5227#true} is VALID
[2022-04-08 07:44:13,036 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5227#true} {5347#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} #51#return; {5347#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID
[2022-04-08 07:44:13,036 INFO L290 TraceCheckUtils]: 45: Hoare triple {5347#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5372#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID
[2022-04-08 07:44:13,036 INFO L290 TraceCheckUtils]: 46: Hoare triple {5372#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5372#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID
[2022-04-08 07:44:13,037 INFO L290 TraceCheckUtils]: 47: Hoare triple {5372#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} assume !!(#t~post5 < 100);havoc #t~post5; {5372#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID
[2022-04-08 07:44:13,037 INFO L272 TraceCheckUtils]: 48: Hoare triple {5372#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5227#true} is VALID
[2022-04-08 07:44:13,037 INFO L290 TraceCheckUtils]: 49: Hoare triple {5227#true} ~cond := #in~cond; {5227#true} is VALID
[2022-04-08 07:44:13,037 INFO L290 TraceCheckUtils]: 50: Hoare triple {5227#true} assume !(0 == ~cond); {5227#true} is VALID
[2022-04-08 07:44:13,037 INFO L290 TraceCheckUtils]: 51: Hoare triple {5227#true} assume true; {5227#true} is VALID
[2022-04-08 07:44:13,038 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5227#true} {5372#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} #51#return; {5372#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID
[2022-04-08 07:44:13,038 INFO L290 TraceCheckUtils]: 53: Hoare triple {5372#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {5397#(and (<= main_~k~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID
[2022-04-08 07:44:13,039 INFO L272 TraceCheckUtils]: 54: Hoare triple {5397#(and (<= main_~k~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5401#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 07:44:13,039 INFO L290 TraceCheckUtils]: 55: Hoare triple {5401#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5405#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 07:44:13,039 INFO L290 TraceCheckUtils]: 56: Hoare triple {5405#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5228#false} is VALID
[2022-04-08 07:44:13,040 INFO L290 TraceCheckUtils]: 57: Hoare triple {5228#false} assume !false; {5228#false} is VALID
[2022-04-08 07:44:13,040 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 12 proven. 60 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2022-04-08 07:44:13,040 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 07:44:13,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 07:44:13,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480422955]
[2022-04-08 07:44:13,273 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-08 07:44:13,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740844347]
[2022-04-08 07:44:13,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740844347] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 07:44:13,273 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences.
[2022-04-08 07:44:13,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11
[2022-04-08 07:44:13,273 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 07:44:13,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1136718548]
[2022-04-08 07:44:13,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1136718548] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 07:44:13,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 07:44:13,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2022-04-08 07:44:13,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106270722]
[2022-04-08 07:44:13,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 07:44:13,274 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 58
[2022-04-08 07:44:13,274 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 07:44:13,274 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-08 07:44:13,307 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:44:13,307 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-04-08 07:44:13,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 07:44:13,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-04-08 07:44:13,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182
[2022-04-08 07:44:13,308 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-08 07:44:13,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:44:13,783 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions.
[2022-04-08 07:44:13,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2022-04-08 07:44:13,784 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 58
[2022-04-08 07:44:13,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 07:44:13,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-08 07:44:13,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 54 transitions.
[2022-04-08 07:44:13,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-08 07:44:13,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 54 transitions.
[2022-04-08 07:44:13,785 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 54 transitions.
[2022-04-08 07:44:13,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:44:13,822 INFO L225 Difference]: With dead ends: 68
[2022-04-08 07:44:13,822 INFO L226 Difference]: Without dead ends: 63
[2022-04-08 07:44:13,822 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240
[2022-04-08 07:44:13,823 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 2 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2022-04-08 07:44:13,823 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 252 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2022-04-08 07:44:13,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states.
[2022-04-08 07:44:13,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63.
[2022-04-08 07:44:13,887 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 07:44:13,887 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 63 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 45 states have internal predecessors, (47), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8)
[2022-04-08 07:44:13,888 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 63 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 45 states have internal predecessors, (47), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8)
[2022-04-08 07:44:13,888 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 63 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 45 states have internal predecessors, (47), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8)
[2022-04-08 07:44:13,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:44:13,889 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions.
[2022-04-08 07:44:13,889 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions.
[2022-04-08 07:44:13,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 07:44:13,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 07:44:13,889 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 45 states have internal predecessors, (47), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 63 states.
[2022-04-08 07:44:13,889 INFO L87 Difference]: Start difference. First operand has 63 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 45 states have internal predecessors, (47), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 63 states.
[2022-04-08 07:44:13,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:44:13,890 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions.
[2022-04-08 07:44:13,890 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions.
[2022-04-08 07:44:13,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 07:44:13,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 07:44:13,890 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 07:44:13,891 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 07:44:13,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 45 states have internal predecessors, (47), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8)
[2022-04-08 07:44:13,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions.
[2022-04-08 07:44:13,891 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 58
[2022-04-08 07:44:13,892 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 07:44:13,892 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions.
[2022-04-08 07:44:13,892 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-08 07:44:13,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 65 transitions.
[2022-04-08 07:44:13,963 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:44:13,963 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions.
[2022-04-08 07:44:13,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61
[2022-04-08 07:44:13,963 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 07:44:13,963 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 07:44:13,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0
[2022-04-08 07:44:14,164 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13
[2022-04-08 07:44:14,164 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 07:44:14,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 07:44:14,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1633541723, now seen corresponding path program 11 times
[2022-04-08 07:44:14,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 07:44:14,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [265506036]
[2022-04-08 07:44:14,265 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult
[2022-04-08 07:44:14,265 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE
[2022-04-08 07:44:14,265 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 07:44:14,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1633541723, now seen corresponding path program 12 times
[2022-04-08 07:44:14,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 07:44:14,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472255890]
[2022-04-08 07:44:14,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 07:44:14,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 07:44:14,273 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-08 07:44:14,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1236524680]
[2022-04-08 07:44:14,273 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2022-04-08 07:44:14,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 07:44:14,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 07:44:14,274 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 07:44:14,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process
[2022-04-08 07:44:14,360 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s)
[2022-04-08 07:44:14,360 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 07:44:14,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 17 conjunts are in the unsatisfiable core
[2022-04-08 07:44:14,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 07:44:14,376 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 07:44:14,677 INFO L272 TraceCheckUtils]: 0: Hoare triple {5848#true} call ULTIMATE.init(); {5848#true} is VALID
[2022-04-08 07:44:14,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {5848#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5856#(<= ~counter~0 0)} is VALID
[2022-04-08 07:44:14,678 INFO L290 TraceCheckUtils]: 2: Hoare triple {5856#(<= ~counter~0 0)} assume true; {5856#(<= ~counter~0 0)} is VALID
[2022-04-08 07:44:14,678 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5856#(<= ~counter~0 0)} {5848#true} #57#return; {5856#(<= ~counter~0 0)} is VALID
[2022-04-08 07:44:14,679 INFO L272 TraceCheckUtils]: 4: Hoare triple {5856#(<= ~counter~0 0)} call #t~ret6 := main(); {5856#(<= ~counter~0 0)} is VALID
[2022-04-08 07:44:14,679 INFO L290 TraceCheckUtils]: 5: Hoare triple {5856#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {5856#(<= ~counter~0 0)} is VALID
[2022-04-08 07:44:14,680 INFO L290 TraceCheckUtils]: 6: Hoare triple {5856#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5872#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:14,680 INFO L290 TraceCheckUtils]: 7: Hoare triple {5872#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {5872#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:14,680 INFO L272 TraceCheckUtils]: 8: Hoare triple {5872#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5872#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:14,681 INFO L290 TraceCheckUtils]: 9: Hoare triple {5872#(<= ~counter~0 1)} ~cond := #in~cond; {5872#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:14,681 INFO L290 TraceCheckUtils]: 10: Hoare triple {5872#(<= ~counter~0 1)} assume !(0 == ~cond); {5872#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:14,681 INFO L290 TraceCheckUtils]: 11: Hoare triple {5872#(<= ~counter~0 1)} assume true; {5872#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:14,682 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5872#(<= ~counter~0 1)} {5872#(<= ~counter~0 1)} #51#return; {5872#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:14,682 INFO L290 TraceCheckUtils]: 13: Hoare triple {5872#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5872#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:14,682 INFO L290 TraceCheckUtils]: 14: Hoare triple {5872#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5897#(<= ~counter~0 2)} is VALID
[2022-04-08 07:44:14,683 INFO L290 TraceCheckUtils]: 15: Hoare triple {5897#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {5897#(<= ~counter~0 2)} is VALID
[2022-04-08 07:44:14,683 INFO L272 TraceCheckUtils]: 16: Hoare triple {5897#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5897#(<= ~counter~0 2)} is VALID
[2022-04-08 07:44:14,683 INFO L290 TraceCheckUtils]: 17: Hoare triple {5897#(<= ~counter~0 2)} ~cond := #in~cond; {5897#(<= ~counter~0 2)} is VALID
[2022-04-08 07:44:14,684 INFO L290 TraceCheckUtils]: 18: Hoare triple {5897#(<= ~counter~0 2)} assume !(0 == ~cond); {5897#(<= ~counter~0 2)} is VALID
[2022-04-08 07:44:14,684 INFO L290 TraceCheckUtils]: 19: Hoare triple {5897#(<= ~counter~0 2)} assume true; {5897#(<= ~counter~0 2)} is VALID
[2022-04-08 07:44:14,684 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {5897#(<= ~counter~0 2)} {5897#(<= ~counter~0 2)} #51#return; {5897#(<= ~counter~0 2)} is VALID
[2022-04-08 07:44:14,685 INFO L290 TraceCheckUtils]: 21: Hoare triple {5897#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5897#(<= ~counter~0 2)} is VALID
[2022-04-08 07:44:14,685 INFO L290 TraceCheckUtils]: 22: Hoare triple {5897#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5922#(<= ~counter~0 3)} is VALID
[2022-04-08 07:44:14,685 INFO L290 TraceCheckUtils]: 23: Hoare triple {5922#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {5922#(<= ~counter~0 3)} is VALID
[2022-04-08 07:44:14,686 INFO L272 TraceCheckUtils]: 24: Hoare triple {5922#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5922#(<= ~counter~0 3)} is VALID
[2022-04-08 07:44:14,686 INFO L290 TraceCheckUtils]: 25: Hoare triple {5922#(<= ~counter~0 3)} ~cond := #in~cond; {5922#(<= ~counter~0 3)} is VALID
[2022-04-08 07:44:14,686 INFO L290 TraceCheckUtils]: 26: Hoare triple {5922#(<= ~counter~0 3)} assume !(0 == ~cond); {5922#(<= ~counter~0 3)} is VALID
[2022-04-08 07:44:14,687 INFO L290 TraceCheckUtils]: 27: Hoare triple {5922#(<= ~counter~0 3)} assume true; {5922#(<= ~counter~0 3)} is VALID
[2022-04-08 07:44:14,687 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5922#(<= ~counter~0 3)} {5922#(<= ~counter~0 3)} #51#return; {5922#(<= ~counter~0 3)} is VALID
[2022-04-08 07:44:14,687 INFO L290 TraceCheckUtils]: 29: Hoare triple {5922#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5922#(<= ~counter~0 3)} is VALID
[2022-04-08 07:44:14,688 INFO L290 TraceCheckUtils]: 30: Hoare triple {5922#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5947#(<= ~counter~0 4)} is VALID
[2022-04-08 07:44:14,688 INFO L290 TraceCheckUtils]: 31: Hoare triple {5947#(<= ~counter~0 4)} assume !!(#t~post5 < 100);havoc #t~post5; {5947#(<= ~counter~0 4)} is VALID
[2022-04-08 07:44:14,689 INFO L272 TraceCheckUtils]: 32: Hoare triple {5947#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5947#(<= ~counter~0 4)} is VALID
[2022-04-08 07:44:14,689 INFO L290 TraceCheckUtils]: 33: Hoare triple {5947#(<= ~counter~0 4)} ~cond := #in~cond; {5947#(<= ~counter~0 4)} is VALID
[2022-04-08 07:44:14,689 INFO L290 TraceCheckUtils]: 34: Hoare triple {5947#(<= ~counter~0 4)} assume !(0 == ~cond); {5947#(<= ~counter~0 4)} is VALID
[2022-04-08 07:44:14,689 INFO L290 TraceCheckUtils]: 35: Hoare triple {5947#(<= ~counter~0 4)} assume true; {5947#(<= ~counter~0 4)} is VALID
[2022-04-08 07:44:14,690 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5947#(<= ~counter~0 4)} {5947#(<= ~counter~0 4)} #51#return; {5947#(<= ~counter~0 4)} is VALID
[2022-04-08 07:44:14,690 INFO L290 TraceCheckUtils]: 37: Hoare triple {5947#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5947#(<= ~counter~0 4)} is VALID
[2022-04-08 07:44:14,691 INFO L290 TraceCheckUtils]: 38: Hoare triple {5947#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5972#(<= ~counter~0 5)} is VALID
[2022-04-08 07:44:14,691 INFO L290 TraceCheckUtils]: 39: Hoare triple {5972#(<= ~counter~0 5)} assume !!(#t~post5 < 100);havoc #t~post5; {5972#(<= ~counter~0 5)} is VALID
[2022-04-08 07:44:14,691 INFO L272 TraceCheckUtils]: 40: Hoare triple {5972#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5972#(<= ~counter~0 5)} is VALID
[2022-04-08 07:44:14,692 INFO L290 TraceCheckUtils]: 41: Hoare triple {5972#(<= ~counter~0 5)} ~cond := #in~cond; {5972#(<= ~counter~0 5)} is VALID
[2022-04-08 07:44:14,692 INFO L290 TraceCheckUtils]: 42: Hoare triple {5972#(<= ~counter~0 5)} assume !(0 == ~cond); {5972#(<= ~counter~0 5)} is VALID
[2022-04-08 07:44:14,692 INFO L290 TraceCheckUtils]: 43: Hoare triple {5972#(<= ~counter~0 5)} assume true; {5972#(<= ~counter~0 5)} is VALID
[2022-04-08 07:44:14,693 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5972#(<= ~counter~0 5)} {5972#(<= ~counter~0 5)} #51#return; {5972#(<= ~counter~0 5)} is VALID
[2022-04-08 07:44:14,693 INFO L290 TraceCheckUtils]: 45: Hoare triple {5972#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5972#(<= ~counter~0 5)} is VALID
[2022-04-08 07:44:14,693 INFO L290 TraceCheckUtils]: 46: Hoare triple {5972#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5997#(<= ~counter~0 6)} is VALID
[2022-04-08 07:44:14,694 INFO L290 TraceCheckUtils]: 47: Hoare triple {5997#(<= ~counter~0 6)} assume !!(#t~post5 < 100);havoc #t~post5; {5997#(<= ~counter~0 6)} is VALID
[2022-04-08 07:44:14,694 INFO L272 TraceCheckUtils]: 48: Hoare triple {5997#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5997#(<= ~counter~0 6)} is VALID
[2022-04-08 07:44:14,694 INFO L290 TraceCheckUtils]: 49: Hoare triple {5997#(<= ~counter~0 6)} ~cond := #in~cond; {5997#(<= ~counter~0 6)} is VALID
[2022-04-08 07:44:14,695 INFO L290 TraceCheckUtils]: 50: Hoare triple {5997#(<= ~counter~0 6)} assume !(0 == ~cond); {5997#(<= ~counter~0 6)} is VALID
[2022-04-08 07:44:14,695 INFO L290 TraceCheckUtils]: 51: Hoare triple {5997#(<= ~counter~0 6)} assume true; {5997#(<= ~counter~0 6)} is VALID
[2022-04-08 07:44:14,695 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5997#(<= ~counter~0 6)} {5997#(<= ~counter~0 6)} #51#return; {5997#(<= ~counter~0 6)} is VALID
[2022-04-08 07:44:14,696 INFO L290 TraceCheckUtils]: 53: Hoare triple {5997#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5997#(<= ~counter~0 6)} is VALID
[2022-04-08 07:44:14,696 INFO L290 TraceCheckUtils]: 54: Hoare triple {5997#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6022#(<= |main_#t~post5| 6)} is VALID
[2022-04-08 07:44:14,696 INFO L290 TraceCheckUtils]: 55: Hoare triple {6022#(<= |main_#t~post5| 6)} assume !(#t~post5 < 100);havoc #t~post5; {5849#false} is VALID
[2022-04-08 07:44:14,697 INFO L272 TraceCheckUtils]: 56: Hoare triple {5849#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5849#false} is VALID
[2022-04-08 07:44:14,697 INFO L290 TraceCheckUtils]: 57: Hoare triple {5849#false} ~cond := #in~cond; {5849#false} is VALID
[2022-04-08 07:44:14,697 INFO L290 TraceCheckUtils]: 58: Hoare triple {5849#false} assume 0 == ~cond; {5849#false} is VALID
[2022-04-08 07:44:14,697 INFO L290 TraceCheckUtils]: 59: Hoare triple {5849#false} assume !false; {5849#false} is VALID
[2022-04-08 07:44:14,697 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 12 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 07:44:14,697 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 07:44:15,022 INFO L290 TraceCheckUtils]: 59: Hoare triple {5849#false} assume !false; {5849#false} is VALID
[2022-04-08 07:44:15,022 INFO L290 TraceCheckUtils]: 58: Hoare triple {5849#false} assume 0 == ~cond; {5849#false} is VALID
[2022-04-08 07:44:15,022 INFO L290 TraceCheckUtils]: 57: Hoare triple {5849#false} ~cond := #in~cond; {5849#false} is VALID
[2022-04-08 07:44:15,022 INFO L272 TraceCheckUtils]: 56: Hoare triple {5849#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5849#false} is VALID
[2022-04-08 07:44:15,023 INFO L290 TraceCheckUtils]: 55: Hoare triple {6050#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {5849#false} is VALID
[2022-04-08 07:44:15,023 INFO L290 TraceCheckUtils]: 54: Hoare triple {6054#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6050#(< |main_#t~post5| 100)} is VALID
[2022-04-08 07:44:15,023 INFO L290 TraceCheckUtils]: 53: Hoare triple {6054#(< ~counter~0 100)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6054#(< ~counter~0 100)} is VALID
[2022-04-08 07:44:15,024 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5848#true} {6054#(< ~counter~0 100)} #51#return; {6054#(< ~counter~0 100)} is VALID
[2022-04-08 07:44:15,024 INFO L290 TraceCheckUtils]: 51: Hoare triple {5848#true} assume true; {5848#true} is VALID
[2022-04-08 07:44:15,024 INFO L290 TraceCheckUtils]: 50: Hoare triple {5848#true} assume !(0 == ~cond); {5848#true} is VALID
[2022-04-08 07:44:15,024 INFO L290 TraceCheckUtils]: 49: Hoare triple {5848#true} ~cond := #in~cond; {5848#true} is VALID
[2022-04-08 07:44:15,024 INFO L272 TraceCheckUtils]: 48: Hoare triple {6054#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5848#true} is VALID
[2022-04-08 07:44:15,024 INFO L290 TraceCheckUtils]: 47: Hoare triple {6054#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {6054#(< ~counter~0 100)} is VALID
[2022-04-08 07:44:15,025 INFO L290 TraceCheckUtils]: 46: Hoare triple {6079#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6054#(< ~counter~0 100)} is VALID
[2022-04-08 07:44:15,025 INFO L290 TraceCheckUtils]: 45: Hoare triple {6079#(< ~counter~0 99)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6079#(< ~counter~0 99)} is VALID
[2022-04-08 07:44:15,026 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5848#true} {6079#(< ~counter~0 99)} #51#return; {6079#(< ~counter~0 99)} is VALID
[2022-04-08 07:44:15,026 INFO L290 TraceCheckUtils]: 43: Hoare triple {5848#true} assume true; {5848#true} is VALID
[2022-04-08 07:44:15,026 INFO L290 TraceCheckUtils]: 42: Hoare triple {5848#true} assume !(0 == ~cond); {5848#true} is VALID
[2022-04-08 07:44:15,026 INFO L290 TraceCheckUtils]: 41: Hoare triple {5848#true} ~cond := #in~cond; {5848#true} is VALID
[2022-04-08 07:44:15,026 INFO L272 TraceCheckUtils]: 40: Hoare triple {6079#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5848#true} is VALID
[2022-04-08 07:44:15,026 INFO L290 TraceCheckUtils]: 39: Hoare triple {6079#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {6079#(< ~counter~0 99)} is VALID
[2022-04-08 07:44:15,027 INFO L290 TraceCheckUtils]: 38: Hoare triple {6104#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6079#(< ~counter~0 99)} is VALID
[2022-04-08 07:44:15,027 INFO L290 TraceCheckUtils]: 37: Hoare triple {6104#(< ~counter~0 98)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6104#(< ~counter~0 98)} is VALID
[2022-04-08 07:44:15,027 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5848#true} {6104#(< ~counter~0 98)} #51#return; {6104#(< ~counter~0 98)} is VALID
[2022-04-08 07:44:15,028 INFO L290 TraceCheckUtils]: 35: Hoare triple {5848#true} assume true; {5848#true} is VALID
[2022-04-08 07:44:15,028 INFO L290 TraceCheckUtils]: 34: Hoare triple {5848#true} assume !(0 == ~cond); {5848#true} is VALID
[2022-04-08 07:44:15,028 INFO L290 TraceCheckUtils]: 33: Hoare triple {5848#true} ~cond := #in~cond; {5848#true} is VALID
[2022-04-08 07:44:15,028 INFO L272 TraceCheckUtils]: 32: Hoare triple {6104#(< ~counter~0 98)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5848#true} is VALID
[2022-04-08 07:44:15,028 INFO L290 TraceCheckUtils]: 31: Hoare triple {6104#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {6104#(< ~counter~0 98)} is VALID
[2022-04-08 07:44:15,028 INFO L290 TraceCheckUtils]: 30: Hoare triple {6129#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6104#(< ~counter~0 98)} is VALID
[2022-04-08 07:44:15,029 INFO L290 TraceCheckUtils]: 29: Hoare triple {6129#(< ~counter~0 97)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6129#(< ~counter~0 97)} is VALID
[2022-04-08 07:44:15,029 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5848#true} {6129#(< ~counter~0 97)} #51#return; {6129#(< ~counter~0 97)} is VALID
[2022-04-08 07:44:15,029 INFO L290 TraceCheckUtils]: 27: Hoare triple {5848#true} assume true; {5848#true} is VALID
[2022-04-08 07:44:15,029 INFO L290 TraceCheckUtils]: 26: Hoare triple {5848#true} assume !(0 == ~cond); {5848#true} is VALID
[2022-04-08 07:44:15,030 INFO L290 TraceCheckUtils]: 25: Hoare triple {5848#true} ~cond := #in~cond; {5848#true} is VALID
[2022-04-08 07:44:15,030 INFO L272 TraceCheckUtils]: 24: Hoare triple {6129#(< ~counter~0 97)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5848#true} is VALID
[2022-04-08 07:44:15,030 INFO L290 TraceCheckUtils]: 23: Hoare triple {6129#(< ~counter~0 97)} assume !!(#t~post5 < 100);havoc #t~post5; {6129#(< ~counter~0 97)} is VALID
[2022-04-08 07:44:15,030 INFO L290 TraceCheckUtils]: 22: Hoare triple {6154#(< ~counter~0 96)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6129#(< ~counter~0 97)} is VALID
[2022-04-08 07:44:15,031 INFO L290 TraceCheckUtils]: 21: Hoare triple {6154#(< ~counter~0 96)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6154#(< ~counter~0 96)} is VALID
[2022-04-08 07:44:15,031 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {5848#true} {6154#(< ~counter~0 96)} #51#return; {6154#(< ~counter~0 96)} is VALID
[2022-04-08 07:44:15,031 INFO L290 TraceCheckUtils]: 19: Hoare triple {5848#true} assume true; {5848#true} is VALID
[2022-04-08 07:44:15,031 INFO L290 TraceCheckUtils]: 18: Hoare triple {5848#true} assume !(0 == ~cond); {5848#true} is VALID
[2022-04-08 07:44:15,031 INFO L290 TraceCheckUtils]: 17: Hoare triple {5848#true} ~cond := #in~cond; {5848#true} is VALID
[2022-04-08 07:44:15,031 INFO L272 TraceCheckUtils]: 16: Hoare triple {6154#(< ~counter~0 96)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5848#true} is VALID
[2022-04-08 07:44:15,032 INFO L290 TraceCheckUtils]: 15: Hoare triple {6154#(< ~counter~0 96)} assume !!(#t~post5 < 100);havoc #t~post5; {6154#(< ~counter~0 96)} is VALID
[2022-04-08 07:44:15,032 INFO L290 TraceCheckUtils]: 14: Hoare triple {6179#(< ~counter~0 95)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6154#(< ~counter~0 96)} is VALID
[2022-04-08 07:44:15,032 INFO L290 TraceCheckUtils]: 13: Hoare triple {6179#(< ~counter~0 95)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6179#(< ~counter~0 95)} is VALID
[2022-04-08 07:44:15,033 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5848#true} {6179#(< ~counter~0 95)} #51#return; {6179#(< ~counter~0 95)} is VALID
[2022-04-08 07:44:15,033 INFO L290 TraceCheckUtils]: 11: Hoare triple {5848#true} assume true; {5848#true} is VALID
[2022-04-08 07:44:15,033 INFO L290 TraceCheckUtils]: 10: Hoare triple {5848#true} assume !(0 == ~cond); {5848#true} is VALID
[2022-04-08 07:44:15,033 INFO L290 TraceCheckUtils]: 9: Hoare triple {5848#true} ~cond := #in~cond; {5848#true} is VALID
[2022-04-08 07:44:15,033 INFO L272 TraceCheckUtils]: 8: Hoare triple {6179#(< ~counter~0 95)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5848#true} is VALID
[2022-04-08 07:44:15,033 INFO L290 TraceCheckUtils]: 7: Hoare triple {6179#(< ~counter~0 95)} assume !!(#t~post5 < 100);havoc #t~post5; {6179#(< ~counter~0 95)} is VALID
[2022-04-08 07:44:15,034 INFO L290 TraceCheckUtils]: 6: Hoare triple {6204#(< ~counter~0 94)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6179#(< ~counter~0 95)} is VALID
[2022-04-08 07:44:15,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {6204#(< ~counter~0 94)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {6204#(< ~counter~0 94)} is VALID
[2022-04-08 07:44:15,035 INFO L272 TraceCheckUtils]: 4: Hoare triple {6204#(< ~counter~0 94)} call #t~ret6 := main(); {6204#(< ~counter~0 94)} is VALID
[2022-04-08 07:44:15,035 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6204#(< ~counter~0 94)} {5848#true} #57#return; {6204#(< ~counter~0 94)} is VALID
[2022-04-08 07:44:15,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {6204#(< ~counter~0 94)} assume true; {6204#(< ~counter~0 94)} is VALID
[2022-04-08 07:44:15,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {5848#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6204#(< ~counter~0 94)} is VALID
[2022-04-08 07:44:15,036 INFO L272 TraceCheckUtils]: 0: Hoare triple {5848#true} call ULTIMATE.init(); {5848#true} is VALID
[2022-04-08 07:44:15,036 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 12 proven. 72 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2022-04-08 07:44:15,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 07:44:15,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472255890]
[2022-04-08 07:44:15,036 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-08 07:44:15,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236524680]
[2022-04-08 07:44:15,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236524680] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 07:44:15,036 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2022-04-08 07:44:15,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18
[2022-04-08 07:44:15,037 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 07:44:15,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [265506036]
[2022-04-08 07:44:15,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [265506036] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 07:44:15,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 07:44:15,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-04-08 07:44:15,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146540655]
[2022-04-08 07:44:15,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 07:44:15,037 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 60
[2022-04-08 07:44:15,038 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 07:44:15,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-08 07:44:15,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:44:15,078 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2022-04-08 07:44:15,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 07:44:15,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2022-04-08 07:44:15,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306
[2022-04-08 07:44:15,079 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-08 07:44:15,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:44:15,302 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions.
[2022-04-08 07:44:15,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2022-04-08 07:44:15,302 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 60
[2022-04-08 07:44:15,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 07:44:15,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-08 07:44:15,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 74 transitions.
[2022-04-08 07:44:15,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-08 07:44:15,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 74 transitions.
[2022-04-08 07:44:15,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 74 transitions.
[2022-04-08 07:44:15,352 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:44:15,353 INFO L225 Difference]: With dead ends: 74
[2022-04-08 07:44:15,353 INFO L226 Difference]: Without dead ends: 69
[2022-04-08 07:44:15,353 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=227, Invalid=325, Unknown=0, NotChecked=0, Total=552
[2022-04-08 07:44:15,354 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 4 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 07:44:15,354 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 102 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 07:44:15,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states.
[2022-04-08 07:44:15,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69.
[2022-04-08 07:44:15,429 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 07:44:15,429 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 69 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 10 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8)
[2022-04-08 07:44:15,430 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 69 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 10 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8)
[2022-04-08 07:44:15,430 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 69 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 10 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8)
[2022-04-08 07:44:15,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:44:15,431 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions.
[2022-04-08 07:44:15,431 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions.
[2022-04-08 07:44:15,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 07:44:15,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 07:44:15,431 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 10 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 69 states.
[2022-04-08 07:44:15,431 INFO L87 Difference]: Start difference. First operand has 69 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 10 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 69 states.
[2022-04-08 07:44:15,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:44:15,432 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions.
[2022-04-08 07:44:15,432 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions.
[2022-04-08 07:44:15,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 07:44:15,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 07:44:15,433 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 07:44:15,433 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 07:44:15,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 10 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8)
[2022-04-08 07:44:15,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions.
[2022-04-08 07:44:15,434 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 60
[2022-04-08 07:44:15,434 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 07:44:15,434 INFO L478 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions.
[2022-04-08 07:44:15,434 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-08 07:44:15,434 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 70 transitions.
[2022-04-08 07:44:15,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:44:15,508 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions.
[2022-04-08 07:44:15,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2022-04-08 07:44:15,508 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 07:44:15,508 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 07:44:15,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0
[2022-04-08 07:44:15,708 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 07:44:15,709 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 07:44:15,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 07:44:15,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1180930233, now seen corresponding path program 11 times
[2022-04-08 07:44:15,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 07:44:15,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1774113002]
[2022-04-08 07:44:15,785 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult
[2022-04-08 07:44:15,785 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE
[2022-04-08 07:44:15,785 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 07:44:15,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1180930233, now seen corresponding path program 12 times
[2022-04-08 07:44:15,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 07:44:15,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525230133]
[2022-04-08 07:44:15,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 07:44:15,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 07:44:15,794 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-08 07:44:15,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1805980452]
[2022-04-08 07:44:15,794 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2022-04-08 07:44:15,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 07:44:15,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 07:44:15,795 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 07:44:15,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process
[2022-04-08 07:44:16,131 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s)
[2022-04-08 07:44:16,132 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 07:44:16,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 32 conjunts are in the unsatisfiable core
[2022-04-08 07:44:16,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 07:44:16,147 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 07:44:16,597 INFO L272 TraceCheckUtils]: 0: Hoare triple {6661#true} call ULTIMATE.init(); {6661#true} is VALID
[2022-04-08 07:44:16,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {6661#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6661#true} is VALID
[2022-04-08 07:44:16,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {6661#true} assume true; {6661#true} is VALID
[2022-04-08 07:44:16,597 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6661#true} {6661#true} #57#return; {6661#true} is VALID
[2022-04-08 07:44:16,597 INFO L272 TraceCheckUtils]: 4: Hoare triple {6661#true} call #t~ret6 := main(); {6661#true} is VALID
[2022-04-08 07:44:16,598 INFO L290 TraceCheckUtils]: 5: Hoare triple {6661#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {6681#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 07:44:16,598 INFO L290 TraceCheckUtils]: 6: Hoare triple {6681#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6681#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 07:44:16,598 INFO L290 TraceCheckUtils]: 7: Hoare triple {6681#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {6681#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 07:44:16,598 INFO L272 TraceCheckUtils]: 8: Hoare triple {6681#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6661#true} is VALID
[2022-04-08 07:44:16,599 INFO L290 TraceCheckUtils]: 9: Hoare triple {6661#true} ~cond := #in~cond; {6661#true} is VALID
[2022-04-08 07:44:16,599 INFO L290 TraceCheckUtils]: 10: Hoare triple {6661#true} assume !(0 == ~cond); {6661#true} is VALID
[2022-04-08 07:44:16,599 INFO L290 TraceCheckUtils]: 11: Hoare triple {6661#true} assume true; {6661#true} is VALID
[2022-04-08 07:44:16,599 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6661#true} {6681#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {6681#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 07:44:16,600 INFO L290 TraceCheckUtils]: 13: Hoare triple {6681#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6706#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID
[2022-04-08 07:44:16,600 INFO L290 TraceCheckUtils]: 14: Hoare triple {6706#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6706#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID
[2022-04-08 07:44:16,600 INFO L290 TraceCheckUtils]: 15: Hoare triple {6706#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {6706#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID
[2022-04-08 07:44:16,601 INFO L272 TraceCheckUtils]: 16: Hoare triple {6706#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6661#true} is VALID
[2022-04-08 07:44:16,601 INFO L290 TraceCheckUtils]: 17: Hoare triple {6661#true} ~cond := #in~cond; {6661#true} is VALID
[2022-04-08 07:44:16,601 INFO L290 TraceCheckUtils]: 18: Hoare triple {6661#true} assume !(0 == ~cond); {6661#true} is VALID
[2022-04-08 07:44:16,601 INFO L290 TraceCheckUtils]: 19: Hoare triple {6661#true} assume true; {6661#true} is VALID
[2022-04-08 07:44:16,601 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {6661#true} {6706#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #51#return; {6706#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID
[2022-04-08 07:44:16,602 INFO L290 TraceCheckUtils]: 21: Hoare triple {6706#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6731#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID
[2022-04-08 07:44:16,602 INFO L290 TraceCheckUtils]: 22: Hoare triple {6731#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6731#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID
[2022-04-08 07:44:16,603 INFO L290 TraceCheckUtils]: 23: Hoare triple {6731#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(#t~post5 < 100);havoc #t~post5; {6731#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID
[2022-04-08 07:44:16,603 INFO L272 TraceCheckUtils]: 24: Hoare triple {6731#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6661#true} is VALID
[2022-04-08 07:44:16,603 INFO L290 TraceCheckUtils]: 25: Hoare triple {6661#true} ~cond := #in~cond; {6661#true} is VALID
[2022-04-08 07:44:16,603 INFO L290 TraceCheckUtils]: 26: Hoare triple {6661#true} assume !(0 == ~cond); {6661#true} is VALID
[2022-04-08 07:44:16,603 INFO L290 TraceCheckUtils]: 27: Hoare triple {6661#true} assume true; {6661#true} is VALID
[2022-04-08 07:44:16,603 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6661#true} {6731#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #51#return; {6731#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID
[2022-04-08 07:44:16,604 INFO L290 TraceCheckUtils]: 29: Hoare triple {6731#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6756#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID
[2022-04-08 07:44:16,604 INFO L290 TraceCheckUtils]: 30: Hoare triple {6756#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6756#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID
[2022-04-08 07:44:16,605 INFO L290 TraceCheckUtils]: 31: Hoare triple {6756#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(#t~post5 < 100);havoc #t~post5; {6756#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID
[2022-04-08 07:44:16,605 INFO L272 TraceCheckUtils]: 32: Hoare triple {6756#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6661#true} is VALID
[2022-04-08 07:44:16,605 INFO L290 TraceCheckUtils]: 33: Hoare triple {6661#true} ~cond := #in~cond; {6661#true} is VALID
[2022-04-08 07:44:16,605 INFO L290 TraceCheckUtils]: 34: Hoare triple {6661#true} assume !(0 == ~cond); {6661#true} is VALID
[2022-04-08 07:44:16,605 INFO L290 TraceCheckUtils]: 35: Hoare triple {6661#true} assume true; {6661#true} is VALID
[2022-04-08 07:44:16,605 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6661#true} {6756#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #51#return; {6756#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID
[2022-04-08 07:44:16,606 INFO L290 TraceCheckUtils]: 37: Hoare triple {6756#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6781#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID
[2022-04-08 07:44:16,606 INFO L290 TraceCheckUtils]: 38: Hoare triple {6781#(and (= main_~y~0 4) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6781#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID
[2022-04-08 07:44:16,607 INFO L290 TraceCheckUtils]: 39: Hoare triple {6781#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(#t~post5 < 100);havoc #t~post5; {6781#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID
[2022-04-08 07:44:16,607 INFO L272 TraceCheckUtils]: 40: Hoare triple {6781#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6661#true} is VALID
[2022-04-08 07:44:16,607 INFO L290 TraceCheckUtils]: 41: Hoare triple {6661#true} ~cond := #in~cond; {6661#true} is VALID
[2022-04-08 07:44:16,607 INFO L290 TraceCheckUtils]: 42: Hoare triple {6661#true} assume !(0 == ~cond); {6661#true} is VALID
[2022-04-08 07:44:16,607 INFO L290 TraceCheckUtils]: 43: Hoare triple {6661#true} assume true; {6661#true} is VALID
[2022-04-08 07:44:16,608 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {6661#true} {6781#(and (= main_~y~0 4) (= main_~c~0 4))} #51#return; {6781#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID
[2022-04-08 07:44:16,608 INFO L290 TraceCheckUtils]: 45: Hoare triple {6781#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6806#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID
[2022-04-08 07:44:16,608 INFO L290 TraceCheckUtils]: 46: Hoare triple {6806#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6806#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID
[2022-04-08 07:44:16,609 INFO L290 TraceCheckUtils]: 47: Hoare triple {6806#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} assume !!(#t~post5 < 100);havoc #t~post5; {6806#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID
[2022-04-08 07:44:16,609 INFO L272 TraceCheckUtils]: 48: Hoare triple {6806#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6661#true} is VALID
[2022-04-08 07:44:16,609 INFO L290 TraceCheckUtils]: 49: Hoare triple {6661#true} ~cond := #in~cond; {6661#true} is VALID
[2022-04-08 07:44:16,609 INFO L290 TraceCheckUtils]: 50: Hoare triple {6661#true} assume !(0 == ~cond); {6661#true} is VALID
[2022-04-08 07:44:16,609 INFO L290 TraceCheckUtils]: 51: Hoare triple {6661#true} assume true; {6661#true} is VALID
[2022-04-08 07:44:16,610 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6661#true} {6806#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} #51#return; {6806#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID
[2022-04-08 07:44:16,610 INFO L290 TraceCheckUtils]: 53: Hoare triple {6806#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6831#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID
[2022-04-08 07:44:16,610 INFO L290 TraceCheckUtils]: 54: Hoare triple {6831#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6831#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID
[2022-04-08 07:44:16,611 INFO L290 TraceCheckUtils]: 55: Hoare triple {6831#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !!(#t~post5 < 100);havoc #t~post5; {6831#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID
[2022-04-08 07:44:16,611 INFO L272 TraceCheckUtils]: 56: Hoare triple {6831#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6661#true} is VALID
[2022-04-08 07:44:16,611 INFO L290 TraceCheckUtils]: 57: Hoare triple {6661#true} ~cond := #in~cond; {6661#true} is VALID
[2022-04-08 07:44:16,611 INFO L290 TraceCheckUtils]: 58: Hoare triple {6661#true} assume !(0 == ~cond); {6661#true} is VALID
[2022-04-08 07:44:16,611 INFO L290 TraceCheckUtils]: 59: Hoare triple {6661#true} assume true; {6661#true} is VALID
[2022-04-08 07:44:16,612 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {6661#true} {6831#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #51#return; {6831#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID
[2022-04-08 07:44:16,612 INFO L290 TraceCheckUtils]: 61: Hoare triple {6831#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !(~c~0 < ~k~0); {6856#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID
[2022-04-08 07:44:16,613 INFO L272 TraceCheckUtils]: 62: Hoare triple {6856#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6860#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 07:44:16,613 INFO L290 TraceCheckUtils]: 63: Hoare triple {6860#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6864#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 07:44:16,614 INFO L290 TraceCheckUtils]: 64: Hoare triple {6864#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6662#false} is VALID
[2022-04-08 07:44:16,614 INFO L290 TraceCheckUtils]: 65: Hoare triple {6662#false} assume !false; {6662#false} is VALID
[2022-04-08 07:44:16,614 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 14 proven. 84 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2022-04-08 07:44:16,614 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 07:44:16,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 07:44:16,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525230133]
[2022-04-08 07:44:16,945 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-08 07:44:16,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805980452]
[2022-04-08 07:44:16,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805980452] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 07:44:16,945 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences.
[2022-04-08 07:44:16,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12
[2022-04-08 07:44:16,945 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 07:44:16,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1774113002]
[2022-04-08 07:44:16,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1774113002] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 07:44:16,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 07:44:16,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2022-04-08 07:44:16,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577356496]
[2022-04-08 07:44:16,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 07:44:16,946 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 66
[2022-04-08 07:44:16,946 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 07:44:16,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8)
[2022-04-08 07:44:16,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:44:16,980 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2022-04-08 07:44:16,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 07:44:16,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2022-04-08 07:44:16,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210
[2022-04-08 07:44:16,980 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8)
[2022-04-08 07:44:17,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:44:17,632 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions.
[2022-04-08 07:44:17,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2022-04-08 07:44:17,632 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 66
[2022-04-08 07:44:17,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 07:44:17,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8)
[2022-04-08 07:44:17,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 59 transitions.
[2022-04-08 07:44:17,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8)
[2022-04-08 07:44:17,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 59 transitions.
[2022-04-08 07:44:17,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 59 transitions.
[2022-04-08 07:44:17,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:44:17,674 INFO L225 Difference]: With dead ends: 76
[2022-04-08 07:44:17,674 INFO L226 Difference]: Without dead ends: 71
[2022-04-08 07:44:17,674 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272
[2022-04-08 07:44:17,675 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 2 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2022-04-08 07:44:17,675 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 300 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2022-04-08 07:44:17,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states.
[2022-04-08 07:44:17,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71.
[2022-04-08 07:44:17,750 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 07:44:17,750 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 71 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 51 states have internal predecessors, (53), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9)
[2022-04-08 07:44:17,750 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 71 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 51 states have internal predecessors, (53), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9)
[2022-04-08 07:44:17,751 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 71 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 51 states have internal predecessors, (53), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9)
[2022-04-08 07:44:17,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:44:17,752 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions.
[2022-04-08 07:44:17,752 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions.
[2022-04-08 07:44:17,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 07:44:17,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 07:44:17,755 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 51 states have internal predecessors, (53), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 71 states.
[2022-04-08 07:44:17,755 INFO L87 Difference]: Start difference. First operand has 71 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 51 states have internal predecessors, (53), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 71 states.
[2022-04-08 07:44:17,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:44:17,756 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions.
[2022-04-08 07:44:17,756 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions.
[2022-04-08 07:44:17,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 07:44:17,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 07:44:17,757 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 07:44:17,757 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 07:44:17,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 51 states have internal predecessors, (53), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9)
[2022-04-08 07:44:17,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions.
[2022-04-08 07:44:17,758 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 66
[2022-04-08 07:44:17,758 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 07:44:17,758 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions.
[2022-04-08 07:44:17,758 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8)
[2022-04-08 07:44:17,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 73 transitions.
[2022-04-08 07:44:17,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:44:17,835 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions.
[2022-04-08 07:44:17,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2022-04-08 07:44:17,835 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 07:44:17,835 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 07:44:17,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0
[2022-04-08 07:44:18,035 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2022-04-08 07:44:18,036 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 07:44:18,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 07:44:18,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1699217054, now seen corresponding path program 13 times
[2022-04-08 07:44:18,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 07:44:18,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2141311929]
[2022-04-08 07:44:18,118 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult
[2022-04-08 07:44:18,118 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE
[2022-04-08 07:44:18,118 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 07:44:18,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1699217054, now seen corresponding path program 14 times
[2022-04-08 07:44:18,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 07:44:18,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241602750]
[2022-04-08 07:44:18,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 07:44:18,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 07:44:18,140 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-08 07:44:18,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [419235507]
[2022-04-08 07:44:18,141 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 07:44:18,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 07:44:18,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 07:44:18,141 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 07:44:18,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process
[2022-04-08 07:44:18,194 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 07:44:18,195 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 07:44:18,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 19 conjunts are in the unsatisfiable core
[2022-04-08 07:44:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 07:44:18,231 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 07:44:18,647 INFO L272 TraceCheckUtils]: 0: Hoare triple {7355#true} call ULTIMATE.init(); {7355#true} is VALID
[2022-04-08 07:44:18,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {7355#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7363#(<= ~counter~0 0)} is VALID
[2022-04-08 07:44:18,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {7363#(<= ~counter~0 0)} assume true; {7363#(<= ~counter~0 0)} is VALID
[2022-04-08 07:44:18,648 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7363#(<= ~counter~0 0)} {7355#true} #57#return; {7363#(<= ~counter~0 0)} is VALID
[2022-04-08 07:44:18,648 INFO L272 TraceCheckUtils]: 4: Hoare triple {7363#(<= ~counter~0 0)} call #t~ret6 := main(); {7363#(<= ~counter~0 0)} is VALID
[2022-04-08 07:44:18,648 INFO L290 TraceCheckUtils]: 5: Hoare triple {7363#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {7363#(<= ~counter~0 0)} is VALID
[2022-04-08 07:44:18,649 INFO L290 TraceCheckUtils]: 6: Hoare triple {7363#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7379#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:18,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {7379#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {7379#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:18,650 INFO L272 TraceCheckUtils]: 8: Hoare triple {7379#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7379#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:18,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {7379#(<= ~counter~0 1)} ~cond := #in~cond; {7379#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:18,650 INFO L290 TraceCheckUtils]: 10: Hoare triple {7379#(<= ~counter~0 1)} assume !(0 == ~cond); {7379#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:18,651 INFO L290 TraceCheckUtils]: 11: Hoare triple {7379#(<= ~counter~0 1)} assume true; {7379#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:18,651 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7379#(<= ~counter~0 1)} {7379#(<= ~counter~0 1)} #51#return; {7379#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:18,651 INFO L290 TraceCheckUtils]: 13: Hoare triple {7379#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7379#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:18,652 INFO L290 TraceCheckUtils]: 14: Hoare triple {7379#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7404#(<= ~counter~0 2)} is VALID
[2022-04-08 07:44:18,652 INFO L290 TraceCheckUtils]: 15: Hoare triple {7404#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {7404#(<= ~counter~0 2)} is VALID
[2022-04-08 07:44:18,652 INFO L272 TraceCheckUtils]: 16: Hoare triple {7404#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7404#(<= ~counter~0 2)} is VALID
[2022-04-08 07:44:18,653 INFO L290 TraceCheckUtils]: 17: Hoare triple {7404#(<= ~counter~0 2)} ~cond := #in~cond; {7404#(<= ~counter~0 2)} is VALID
[2022-04-08 07:44:18,653 INFO L290 TraceCheckUtils]: 18: Hoare triple {7404#(<= ~counter~0 2)} assume !(0 == ~cond); {7404#(<= ~counter~0 2)} is VALID
[2022-04-08 07:44:18,653 INFO L290 TraceCheckUtils]: 19: Hoare triple {7404#(<= ~counter~0 2)} assume true; {7404#(<= ~counter~0 2)} is VALID
[2022-04-08 07:44:18,654 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7404#(<= ~counter~0 2)} {7404#(<= ~counter~0 2)} #51#return; {7404#(<= ~counter~0 2)} is VALID
[2022-04-08 07:44:18,654 INFO L290 TraceCheckUtils]: 21: Hoare triple {7404#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7404#(<= ~counter~0 2)} is VALID
[2022-04-08 07:44:18,654 INFO L290 TraceCheckUtils]: 22: Hoare triple {7404#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7429#(<= ~counter~0 3)} is VALID
[2022-04-08 07:44:18,655 INFO L290 TraceCheckUtils]: 23: Hoare triple {7429#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {7429#(<= ~counter~0 3)} is VALID
[2022-04-08 07:44:18,655 INFO L272 TraceCheckUtils]: 24: Hoare triple {7429#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7429#(<= ~counter~0 3)} is VALID
[2022-04-08 07:44:18,655 INFO L290 TraceCheckUtils]: 25: Hoare triple {7429#(<= ~counter~0 3)} ~cond := #in~cond; {7429#(<= ~counter~0 3)} is VALID
[2022-04-08 07:44:18,656 INFO L290 TraceCheckUtils]: 26: Hoare triple {7429#(<= ~counter~0 3)} assume !(0 == ~cond); {7429#(<= ~counter~0 3)} is VALID
[2022-04-08 07:44:18,656 INFO L290 TraceCheckUtils]: 27: Hoare triple {7429#(<= ~counter~0 3)} assume true; {7429#(<= ~counter~0 3)} is VALID
[2022-04-08 07:44:18,656 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7429#(<= ~counter~0 3)} {7429#(<= ~counter~0 3)} #51#return; {7429#(<= ~counter~0 3)} is VALID
[2022-04-08 07:44:18,657 INFO L290 TraceCheckUtils]: 29: Hoare triple {7429#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7429#(<= ~counter~0 3)} is VALID
[2022-04-08 07:44:18,657 INFO L290 TraceCheckUtils]: 30: Hoare triple {7429#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7454#(<= ~counter~0 4)} is VALID
[2022-04-08 07:44:18,657 INFO L290 TraceCheckUtils]: 31: Hoare triple {7454#(<= ~counter~0 4)} assume !!(#t~post5 < 100);havoc #t~post5; {7454#(<= ~counter~0 4)} is VALID
[2022-04-08 07:44:18,658 INFO L272 TraceCheckUtils]: 32: Hoare triple {7454#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7454#(<= ~counter~0 4)} is VALID
[2022-04-08 07:44:18,658 INFO L290 TraceCheckUtils]: 33: Hoare triple {7454#(<= ~counter~0 4)} ~cond := #in~cond; {7454#(<= ~counter~0 4)} is VALID
[2022-04-08 07:44:18,658 INFO L290 TraceCheckUtils]: 34: Hoare triple {7454#(<= ~counter~0 4)} assume !(0 == ~cond); {7454#(<= ~counter~0 4)} is VALID
[2022-04-08 07:44:18,659 INFO L290 TraceCheckUtils]: 35: Hoare triple {7454#(<= ~counter~0 4)} assume true; {7454#(<= ~counter~0 4)} is VALID
[2022-04-08 07:44:18,659 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7454#(<= ~counter~0 4)} {7454#(<= ~counter~0 4)} #51#return; {7454#(<= ~counter~0 4)} is VALID
[2022-04-08 07:44:18,659 INFO L290 TraceCheckUtils]: 37: Hoare triple {7454#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7454#(<= ~counter~0 4)} is VALID
[2022-04-08 07:44:18,660 INFO L290 TraceCheckUtils]: 38: Hoare triple {7454#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7479#(<= ~counter~0 5)} is VALID
[2022-04-08 07:44:18,660 INFO L290 TraceCheckUtils]: 39: Hoare triple {7479#(<= ~counter~0 5)} assume !!(#t~post5 < 100);havoc #t~post5; {7479#(<= ~counter~0 5)} is VALID
[2022-04-08 07:44:18,661 INFO L272 TraceCheckUtils]: 40: Hoare triple {7479#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7479#(<= ~counter~0 5)} is VALID
[2022-04-08 07:44:18,661 INFO L290 TraceCheckUtils]: 41: Hoare triple {7479#(<= ~counter~0 5)} ~cond := #in~cond; {7479#(<= ~counter~0 5)} is VALID
[2022-04-08 07:44:18,661 INFO L290 TraceCheckUtils]: 42: Hoare triple {7479#(<= ~counter~0 5)} assume !(0 == ~cond); {7479#(<= ~counter~0 5)} is VALID
[2022-04-08 07:44:18,661 INFO L290 TraceCheckUtils]: 43: Hoare triple {7479#(<= ~counter~0 5)} assume true; {7479#(<= ~counter~0 5)} is VALID
[2022-04-08 07:44:18,662 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7479#(<= ~counter~0 5)} {7479#(<= ~counter~0 5)} #51#return; {7479#(<= ~counter~0 5)} is VALID
[2022-04-08 07:44:18,662 INFO L290 TraceCheckUtils]: 45: Hoare triple {7479#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7479#(<= ~counter~0 5)} is VALID
[2022-04-08 07:44:18,662 INFO L290 TraceCheckUtils]: 46: Hoare triple {7479#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7504#(<= ~counter~0 6)} is VALID
[2022-04-08 07:44:18,663 INFO L290 TraceCheckUtils]: 47: Hoare triple {7504#(<= ~counter~0 6)} assume !!(#t~post5 < 100);havoc #t~post5; {7504#(<= ~counter~0 6)} is VALID
[2022-04-08 07:44:18,663 INFO L272 TraceCheckUtils]: 48: Hoare triple {7504#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7504#(<= ~counter~0 6)} is VALID
[2022-04-08 07:44:18,663 INFO L290 TraceCheckUtils]: 49: Hoare triple {7504#(<= ~counter~0 6)} ~cond := #in~cond; {7504#(<= ~counter~0 6)} is VALID
[2022-04-08 07:44:18,664 INFO L290 TraceCheckUtils]: 50: Hoare triple {7504#(<= ~counter~0 6)} assume !(0 == ~cond); {7504#(<= ~counter~0 6)} is VALID
[2022-04-08 07:44:18,664 INFO L290 TraceCheckUtils]: 51: Hoare triple {7504#(<= ~counter~0 6)} assume true; {7504#(<= ~counter~0 6)} is VALID
[2022-04-08 07:44:18,664 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7504#(<= ~counter~0 6)} {7504#(<= ~counter~0 6)} #51#return; {7504#(<= ~counter~0 6)} is VALID
[2022-04-08 07:44:18,665 INFO L290 TraceCheckUtils]: 53: Hoare triple {7504#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7504#(<= ~counter~0 6)} is VALID
[2022-04-08 07:44:18,665 INFO L290 TraceCheckUtils]: 54: Hoare triple {7504#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7529#(<= ~counter~0 7)} is VALID
[2022-04-08 07:44:18,665 INFO L290 TraceCheckUtils]: 55: Hoare triple {7529#(<= ~counter~0 7)} assume !!(#t~post5 < 100);havoc #t~post5; {7529#(<= ~counter~0 7)} is VALID
[2022-04-08 07:44:18,666 INFO L272 TraceCheckUtils]: 56: Hoare triple {7529#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7529#(<= ~counter~0 7)} is VALID
[2022-04-08 07:44:18,666 INFO L290 TraceCheckUtils]: 57: Hoare triple {7529#(<= ~counter~0 7)} ~cond := #in~cond; {7529#(<= ~counter~0 7)} is VALID
[2022-04-08 07:44:18,666 INFO L290 TraceCheckUtils]: 58: Hoare triple {7529#(<= ~counter~0 7)} assume !(0 == ~cond); {7529#(<= ~counter~0 7)} is VALID
[2022-04-08 07:44:18,667 INFO L290 TraceCheckUtils]: 59: Hoare triple {7529#(<= ~counter~0 7)} assume true; {7529#(<= ~counter~0 7)} is VALID
[2022-04-08 07:44:18,667 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7529#(<= ~counter~0 7)} {7529#(<= ~counter~0 7)} #51#return; {7529#(<= ~counter~0 7)} is VALID
[2022-04-08 07:44:18,667 INFO L290 TraceCheckUtils]: 61: Hoare triple {7529#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7529#(<= ~counter~0 7)} is VALID
[2022-04-08 07:44:18,668 INFO L290 TraceCheckUtils]: 62: Hoare triple {7529#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7554#(<= |main_#t~post5| 7)} is VALID
[2022-04-08 07:44:18,668 INFO L290 TraceCheckUtils]: 63: Hoare triple {7554#(<= |main_#t~post5| 7)} assume !(#t~post5 < 100);havoc #t~post5; {7356#false} is VALID
[2022-04-08 07:44:18,668 INFO L272 TraceCheckUtils]: 64: Hoare triple {7356#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7356#false} is VALID
[2022-04-08 07:44:18,668 INFO L290 TraceCheckUtils]: 65: Hoare triple {7356#false} ~cond := #in~cond; {7356#false} is VALID
[2022-04-08 07:44:18,668 INFO L290 TraceCheckUtils]: 66: Hoare triple {7356#false} assume 0 == ~cond; {7356#false} is VALID
[2022-04-08 07:44:18,669 INFO L290 TraceCheckUtils]: 67: Hoare triple {7356#false} assume !false; {7356#false} is VALID
[2022-04-08 07:44:18,669 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 14 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 07:44:18,669 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 07:44:18,977 INFO L290 TraceCheckUtils]: 67: Hoare triple {7356#false} assume !false; {7356#false} is VALID
[2022-04-08 07:44:18,977 INFO L290 TraceCheckUtils]: 66: Hoare triple {7356#false} assume 0 == ~cond; {7356#false} is VALID
[2022-04-08 07:44:18,977 INFO L290 TraceCheckUtils]: 65: Hoare triple {7356#false} ~cond := #in~cond; {7356#false} is VALID
[2022-04-08 07:44:18,977 INFO L272 TraceCheckUtils]: 64: Hoare triple {7356#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7356#false} is VALID
[2022-04-08 07:44:18,977 INFO L290 TraceCheckUtils]: 63: Hoare triple {7582#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {7356#false} is VALID
[2022-04-08 07:44:18,978 INFO L290 TraceCheckUtils]: 62: Hoare triple {7586#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7582#(< |main_#t~post5| 100)} is VALID
[2022-04-08 07:44:18,978 INFO L290 TraceCheckUtils]: 61: Hoare triple {7586#(< ~counter~0 100)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7586#(< ~counter~0 100)} is VALID
[2022-04-08 07:44:18,978 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7355#true} {7586#(< ~counter~0 100)} #51#return; {7586#(< ~counter~0 100)} is VALID
[2022-04-08 07:44:18,978 INFO L290 TraceCheckUtils]: 59: Hoare triple {7355#true} assume true; {7355#true} is VALID
[2022-04-08 07:44:18,978 INFO L290 TraceCheckUtils]: 58: Hoare triple {7355#true} assume !(0 == ~cond); {7355#true} is VALID
[2022-04-08 07:44:18,978 INFO L290 TraceCheckUtils]: 57: Hoare triple {7355#true} ~cond := #in~cond; {7355#true} is VALID
[2022-04-08 07:44:18,979 INFO L272 TraceCheckUtils]: 56: Hoare triple {7586#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7355#true} is VALID
[2022-04-08 07:44:18,979 INFO L290 TraceCheckUtils]: 55: Hoare triple {7586#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {7586#(< ~counter~0 100)} is VALID
[2022-04-08 07:44:18,979 INFO L290 TraceCheckUtils]: 54: Hoare triple {7611#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7586#(< ~counter~0 100)} is VALID
[2022-04-08 07:44:18,979 INFO L290 TraceCheckUtils]: 53: Hoare triple {7611#(< ~counter~0 99)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7611#(< ~counter~0 99)} is VALID
[2022-04-08 07:44:18,980 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7355#true} {7611#(< ~counter~0 99)} #51#return; {7611#(< ~counter~0 99)} is VALID
[2022-04-08 07:44:18,980 INFO L290 TraceCheckUtils]: 51: Hoare triple {7355#true} assume true; {7355#true} is VALID
[2022-04-08 07:44:18,980 INFO L290 TraceCheckUtils]: 50: Hoare triple {7355#true} assume !(0 == ~cond); {7355#true} is VALID
[2022-04-08 07:44:18,980 INFO L290 TraceCheckUtils]: 49: Hoare triple {7355#true} ~cond := #in~cond; {7355#true} is VALID
[2022-04-08 07:44:18,980 INFO L272 TraceCheckUtils]: 48: Hoare triple {7611#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7355#true} is VALID
[2022-04-08 07:44:18,980 INFO L290 TraceCheckUtils]: 47: Hoare triple {7611#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {7611#(< ~counter~0 99)} is VALID
[2022-04-08 07:44:18,981 INFO L290 TraceCheckUtils]: 46: Hoare triple {7636#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7611#(< ~counter~0 99)} is VALID
[2022-04-08 07:44:18,981 INFO L290 TraceCheckUtils]: 45: Hoare triple {7636#(< ~counter~0 98)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7636#(< ~counter~0 98)} is VALID
[2022-04-08 07:44:18,981 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7355#true} {7636#(< ~counter~0 98)} #51#return; {7636#(< ~counter~0 98)} is VALID
[2022-04-08 07:44:18,981 INFO L290 TraceCheckUtils]: 43: Hoare triple {7355#true} assume true; {7355#true} is VALID
[2022-04-08 07:44:18,981 INFO L290 TraceCheckUtils]: 42: Hoare triple {7355#true} assume !(0 == ~cond); {7355#true} is VALID
[2022-04-08 07:44:18,981 INFO L290 TraceCheckUtils]: 41: Hoare triple {7355#true} ~cond := #in~cond; {7355#true} is VALID
[2022-04-08 07:44:18,981 INFO L272 TraceCheckUtils]: 40: Hoare triple {7636#(< ~counter~0 98)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7355#true} is VALID
[2022-04-08 07:44:18,982 INFO L290 TraceCheckUtils]: 39: Hoare triple {7636#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {7636#(< ~counter~0 98)} is VALID
[2022-04-08 07:44:18,982 INFO L290 TraceCheckUtils]: 38: Hoare triple {7661#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7636#(< ~counter~0 98)} is VALID
[2022-04-08 07:44:18,982 INFO L290 TraceCheckUtils]: 37: Hoare triple {7661#(< ~counter~0 97)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7661#(< ~counter~0 97)} is VALID
[2022-04-08 07:44:18,982 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7355#true} {7661#(< ~counter~0 97)} #51#return; {7661#(< ~counter~0 97)} is VALID
[2022-04-08 07:44:18,983 INFO L290 TraceCheckUtils]: 35: Hoare triple {7355#true} assume true; {7355#true} is VALID
[2022-04-08 07:44:18,983 INFO L290 TraceCheckUtils]: 34: Hoare triple {7355#true} assume !(0 == ~cond); {7355#true} is VALID
[2022-04-08 07:44:18,983 INFO L290 TraceCheckUtils]: 33: Hoare triple {7355#true} ~cond := #in~cond; {7355#true} is VALID
[2022-04-08 07:44:18,983 INFO L272 TraceCheckUtils]: 32: Hoare triple {7661#(< ~counter~0 97)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7355#true} is VALID
[2022-04-08 07:44:18,983 INFO L290 TraceCheckUtils]: 31: Hoare triple {7661#(< ~counter~0 97)} assume !!(#t~post5 < 100);havoc #t~post5; {7661#(< ~counter~0 97)} is VALID
[2022-04-08 07:44:18,983 INFO L290 TraceCheckUtils]: 30: Hoare triple {7686#(< ~counter~0 96)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7661#(< ~counter~0 97)} is VALID
[2022-04-08 07:44:18,984 INFO L290 TraceCheckUtils]: 29: Hoare triple {7686#(< ~counter~0 96)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7686#(< ~counter~0 96)} is VALID
[2022-04-08 07:44:18,984 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7355#true} {7686#(< ~counter~0 96)} #51#return; {7686#(< ~counter~0 96)} is VALID
[2022-04-08 07:44:18,984 INFO L290 TraceCheckUtils]: 27: Hoare triple {7355#true} assume true; {7355#true} is VALID
[2022-04-08 07:44:18,984 INFO L290 TraceCheckUtils]: 26: Hoare triple {7355#true} assume !(0 == ~cond); {7355#true} is VALID
[2022-04-08 07:44:18,984 INFO L290 TraceCheckUtils]: 25: Hoare triple {7355#true} ~cond := #in~cond; {7355#true} is VALID
[2022-04-08 07:44:18,984 INFO L272 TraceCheckUtils]: 24: Hoare triple {7686#(< ~counter~0 96)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7355#true} is VALID
[2022-04-08 07:44:18,984 INFO L290 TraceCheckUtils]: 23: Hoare triple {7686#(< ~counter~0 96)} assume !!(#t~post5 < 100);havoc #t~post5; {7686#(< ~counter~0 96)} is VALID
[2022-04-08 07:44:18,985 INFO L290 TraceCheckUtils]: 22: Hoare triple {7711#(< ~counter~0 95)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7686#(< ~counter~0 96)} is VALID
[2022-04-08 07:44:18,985 INFO L290 TraceCheckUtils]: 21: Hoare triple {7711#(< ~counter~0 95)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7711#(< ~counter~0 95)} is VALID
[2022-04-08 07:44:18,985 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7355#true} {7711#(< ~counter~0 95)} #51#return; {7711#(< ~counter~0 95)} is VALID
[2022-04-08 07:44:18,985 INFO L290 TraceCheckUtils]: 19: Hoare triple {7355#true} assume true; {7355#true} is VALID
[2022-04-08 07:44:18,985 INFO L290 TraceCheckUtils]: 18: Hoare triple {7355#true} assume !(0 == ~cond); {7355#true} is VALID
[2022-04-08 07:44:18,989 INFO L290 TraceCheckUtils]: 17: Hoare triple {7355#true} ~cond := #in~cond; {7355#true} is VALID
[2022-04-08 07:44:18,989 INFO L272 TraceCheckUtils]: 16: Hoare triple {7711#(< ~counter~0 95)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7355#true} is VALID
[2022-04-08 07:44:18,989 INFO L290 TraceCheckUtils]: 15: Hoare triple {7711#(< ~counter~0 95)} assume !!(#t~post5 < 100);havoc #t~post5; {7711#(< ~counter~0 95)} is VALID
[2022-04-08 07:44:18,990 INFO L290 TraceCheckUtils]: 14: Hoare triple {7736#(< ~counter~0 94)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7711#(< ~counter~0 95)} is VALID
[2022-04-08 07:44:18,990 INFO L290 TraceCheckUtils]: 13: Hoare triple {7736#(< ~counter~0 94)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7736#(< ~counter~0 94)} is VALID
[2022-04-08 07:44:18,990 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7355#true} {7736#(< ~counter~0 94)} #51#return; {7736#(< ~counter~0 94)} is VALID
[2022-04-08 07:44:18,990 INFO L290 TraceCheckUtils]: 11: Hoare triple {7355#true} assume true; {7355#true} is VALID
[2022-04-08 07:44:18,991 INFO L290 TraceCheckUtils]: 10: Hoare triple {7355#true} assume !(0 == ~cond); {7355#true} is VALID
[2022-04-08 07:44:18,991 INFO L290 TraceCheckUtils]: 9: Hoare triple {7355#true} ~cond := #in~cond; {7355#true} is VALID
[2022-04-08 07:44:18,991 INFO L272 TraceCheckUtils]: 8: Hoare triple {7736#(< ~counter~0 94)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7355#true} is VALID
[2022-04-08 07:44:18,991 INFO L290 TraceCheckUtils]: 7: Hoare triple {7736#(< ~counter~0 94)} assume !!(#t~post5 < 100);havoc #t~post5; {7736#(< ~counter~0 94)} is VALID
[2022-04-08 07:44:18,991 INFO L290 TraceCheckUtils]: 6: Hoare triple {7761#(< ~counter~0 93)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7736#(< ~counter~0 94)} is VALID
[2022-04-08 07:44:18,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {7761#(< ~counter~0 93)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {7761#(< ~counter~0 93)} is VALID
[2022-04-08 07:44:18,992 INFO L272 TraceCheckUtils]: 4: Hoare triple {7761#(< ~counter~0 93)} call #t~ret6 := main(); {7761#(< ~counter~0 93)} is VALID
[2022-04-08 07:44:18,992 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7761#(< ~counter~0 93)} {7355#true} #57#return; {7761#(< ~counter~0 93)} is VALID
[2022-04-08 07:44:18,992 INFO L290 TraceCheckUtils]: 2: Hoare triple {7761#(< ~counter~0 93)} assume true; {7761#(< ~counter~0 93)} is VALID
[2022-04-08 07:44:18,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {7355#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7761#(< ~counter~0 93)} is VALID
[2022-04-08 07:44:18,992 INFO L272 TraceCheckUtils]: 0: Hoare triple {7355#true} call ULTIMATE.init(); {7355#true} is VALID
[2022-04-08 07:44:18,993 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 14 proven. 98 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2022-04-08 07:44:18,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 07:44:18,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241602750]
[2022-04-08 07:44:18,993 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-08 07:44:18,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419235507]
[2022-04-08 07:44:18,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419235507] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 07:44:18,993 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2022-04-08 07:44:18,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20
[2022-04-08 07:44:18,993 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 07:44:18,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2141311929]
[2022-04-08 07:44:18,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2141311929] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 07:44:18,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 07:44:18,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2022-04-08 07:44:18,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725154911]
[2022-04-08 07:44:18,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 07:44:19,011 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 10 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 68
[2022-04-08 07:44:19,011 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 07:44:19,011 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 10 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8)
[2022-04-08 07:44:19,041 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:44:19,041 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-04-08 07:44:19,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 07:44:19,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-04-08 07:44:19,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380
[2022-04-08 07:44:19,042 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 10 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8)
[2022-04-08 07:44:19,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:44:19,244 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions.
[2022-04-08 07:44:19,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states.
[2022-04-08 07:44:19,244 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 10 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 68
[2022-04-08 07:44:19,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 07:44:19,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 10 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8)
[2022-04-08 07:44:19,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 82 transitions.
[2022-04-08 07:44:19,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 10 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8)
[2022-04-08 07:44:19,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 82 transitions.
[2022-04-08 07:44:19,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 82 transitions.
[2022-04-08 07:44:19,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:44:19,306 INFO L225 Difference]: With dead ends: 82
[2022-04-08 07:44:19,306 INFO L226 Difference]: Without dead ends: 77
[2022-04-08 07:44:19,307 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=291, Invalid=411, Unknown=0, NotChecked=0, Total=702
[2022-04-08 07:44:19,307 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 07:44:19,307 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 101 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 07:44:19,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states.
[2022-04-08 07:44:19,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77.
[2022-04-08 07:44:19,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 07:44:19,363 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 77 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 states have internal predecessors, (58), 11 states have call successors, (11), 11 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9)
[2022-04-08 07:44:19,363 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 77 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 states have internal predecessors, (58), 11 states have call successors, (11), 11 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9)
[2022-04-08 07:44:19,363 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 77 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 states have internal predecessors, (58), 11 states have call successors, (11), 11 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9)
[2022-04-08 07:44:19,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:44:19,364 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions.
[2022-04-08 07:44:19,364 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions.
[2022-04-08 07:44:19,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 07:44:19,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 07:44:19,364 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 states have internal predecessors, (58), 11 states have call successors, (11), 11 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 77 states.
[2022-04-08 07:44:19,364 INFO L87 Difference]: Start difference. First operand has 77 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 states have internal predecessors, (58), 11 states have call successors, (11), 11 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 77 states.
[2022-04-08 07:44:19,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:44:19,365 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions.
[2022-04-08 07:44:19,365 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions.
[2022-04-08 07:44:19,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 07:44:19,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 07:44:19,366 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 07:44:19,366 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 07:44:19,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 states have internal predecessors, (58), 11 states have call successors, (11), 11 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9)
[2022-04-08 07:44:19,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions.
[2022-04-08 07:44:19,367 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 68
[2022-04-08 07:44:19,367 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 07:44:19,367 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions.
[2022-04-08 07:44:19,367 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 10 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8)
[2022-04-08 07:44:19,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 78 transitions.
[2022-04-08 07:44:19,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:44:19,459 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions.
[2022-04-08 07:44:19,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75
[2022-04-08 07:44:19,460 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 07:44:19,460 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 07:44:19,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0
[2022-04-08 07:44:19,660 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2022-04-08 07:44:19,660 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 07:44:19,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 07:44:19,661 INFO L85 PathProgramCache]: Analyzing trace with hash -763940164, now seen corresponding path program 13 times
[2022-04-08 07:44:19,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 07:44:19,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2026514262]
[2022-04-08 07:44:19,729 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult
[2022-04-08 07:44:19,729 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE
[2022-04-08 07:44:19,730 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 07:44:19,730 INFO L85 PathProgramCache]: Analyzing trace with hash -763940164, now seen corresponding path program 14 times
[2022-04-08 07:44:19,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 07:44:19,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552108032]
[2022-04-08 07:44:19,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 07:44:19,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 07:44:19,746 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-08 07:44:19,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [656886432]
[2022-04-08 07:44:19,746 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 07:44:19,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 07:44:19,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 07:44:19,748 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 07:44:19,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process
[2022-04-08 07:44:20,152 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 07:44:20,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 07:44:20,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 36 conjunts are in the unsatisfiable core
[2022-04-08 07:44:20,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 07:44:20,175 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 07:44:20,698 INFO L272 TraceCheckUtils]: 0: Hoare triple {8268#true} call ULTIMATE.init(); {8268#true} is VALID
[2022-04-08 07:44:20,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {8268#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8268#true} is VALID
[2022-04-08 07:44:20,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {8268#true} assume true; {8268#true} is VALID
[2022-04-08 07:44:20,698 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8268#true} {8268#true} #57#return; {8268#true} is VALID
[2022-04-08 07:44:20,698 INFO L272 TraceCheckUtils]: 4: Hoare triple {8268#true} call #t~ret6 := main(); {8268#true} is VALID
[2022-04-08 07:44:20,698 INFO L290 TraceCheckUtils]: 5: Hoare triple {8268#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {8288#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 07:44:20,699 INFO L290 TraceCheckUtils]: 6: Hoare triple {8288#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8288#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 07:44:20,699 INFO L290 TraceCheckUtils]: 7: Hoare triple {8288#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {8288#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 07:44:20,699 INFO L272 TraceCheckUtils]: 8: Hoare triple {8288#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8268#true} is VALID
[2022-04-08 07:44:20,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {8268#true} ~cond := #in~cond; {8268#true} is VALID
[2022-04-08 07:44:20,699 INFO L290 TraceCheckUtils]: 10: Hoare triple {8268#true} assume !(0 == ~cond); {8268#true} is VALID
[2022-04-08 07:44:20,699 INFO L290 TraceCheckUtils]: 11: Hoare triple {8268#true} assume true; {8268#true} is VALID
[2022-04-08 07:44:20,700 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {8268#true} {8288#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {8288#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 07:44:20,700 INFO L290 TraceCheckUtils]: 13: Hoare triple {8288#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8313#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID
[2022-04-08 07:44:20,701 INFO L290 TraceCheckUtils]: 14: Hoare triple {8313#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8313#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID
[2022-04-08 07:44:20,701 INFO L290 TraceCheckUtils]: 15: Hoare triple {8313#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {8313#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID
[2022-04-08 07:44:20,701 INFO L272 TraceCheckUtils]: 16: Hoare triple {8313#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8268#true} is VALID
[2022-04-08 07:44:20,701 INFO L290 TraceCheckUtils]: 17: Hoare triple {8268#true} ~cond := #in~cond; {8268#true} is VALID
[2022-04-08 07:44:20,701 INFO L290 TraceCheckUtils]: 18: Hoare triple {8268#true} assume !(0 == ~cond); {8268#true} is VALID
[2022-04-08 07:44:20,701 INFO L290 TraceCheckUtils]: 19: Hoare triple {8268#true} assume true; {8268#true} is VALID
[2022-04-08 07:44:20,702 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {8268#true} {8313#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #51#return; {8313#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID
[2022-04-08 07:44:20,702 INFO L290 TraceCheckUtils]: 21: Hoare triple {8313#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8338#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID
[2022-04-08 07:44:20,703 INFO L290 TraceCheckUtils]: 22: Hoare triple {8338#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8338#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID
[2022-04-08 07:44:20,703 INFO L290 TraceCheckUtils]: 23: Hoare triple {8338#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 100);havoc #t~post5; {8338#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID
[2022-04-08 07:44:20,703 INFO L272 TraceCheckUtils]: 24: Hoare triple {8338#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8268#true} is VALID
[2022-04-08 07:44:20,703 INFO L290 TraceCheckUtils]: 25: Hoare triple {8268#true} ~cond := #in~cond; {8268#true} is VALID
[2022-04-08 07:44:20,703 INFO L290 TraceCheckUtils]: 26: Hoare triple {8268#true} assume !(0 == ~cond); {8268#true} is VALID
[2022-04-08 07:44:20,703 INFO L290 TraceCheckUtils]: 27: Hoare triple {8268#true} assume true; {8268#true} is VALID
[2022-04-08 07:44:20,704 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {8268#true} {8338#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #51#return; {8338#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID
[2022-04-08 07:44:20,704 INFO L290 TraceCheckUtils]: 29: Hoare triple {8338#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8363#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} is VALID
[2022-04-08 07:44:20,704 INFO L290 TraceCheckUtils]: 30: Hoare triple {8363#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8363#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} is VALID
[2022-04-08 07:44:20,705 INFO L290 TraceCheckUtils]: 31: Hoare triple {8363#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} assume !!(#t~post5 < 100);havoc #t~post5; {8363#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} is VALID
[2022-04-08 07:44:20,705 INFO L272 TraceCheckUtils]: 32: Hoare triple {8363#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8268#true} is VALID
[2022-04-08 07:44:20,705 INFO L290 TraceCheckUtils]: 33: Hoare triple {8268#true} ~cond := #in~cond; {8268#true} is VALID
[2022-04-08 07:44:20,705 INFO L290 TraceCheckUtils]: 34: Hoare triple {8268#true} assume !(0 == ~cond); {8268#true} is VALID
[2022-04-08 07:44:20,705 INFO L290 TraceCheckUtils]: 35: Hoare triple {8268#true} assume true; {8268#true} is VALID
[2022-04-08 07:44:20,706 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8268#true} {8363#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} #51#return; {8363#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} is VALID
[2022-04-08 07:44:20,706 INFO L290 TraceCheckUtils]: 37: Hoare triple {8363#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8388#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID
[2022-04-08 07:44:20,706 INFO L290 TraceCheckUtils]: 38: Hoare triple {8388#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8388#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID
[2022-04-08 07:44:20,707 INFO L290 TraceCheckUtils]: 39: Hoare triple {8388#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !!(#t~post5 < 100);havoc #t~post5; {8388#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID
[2022-04-08 07:44:20,707 INFO L272 TraceCheckUtils]: 40: Hoare triple {8388#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8268#true} is VALID
[2022-04-08 07:44:20,707 INFO L290 TraceCheckUtils]: 41: Hoare triple {8268#true} ~cond := #in~cond; {8268#true} is VALID
[2022-04-08 07:44:20,707 INFO L290 TraceCheckUtils]: 42: Hoare triple {8268#true} assume !(0 == ~cond); {8268#true} is VALID
[2022-04-08 07:44:20,707 INFO L290 TraceCheckUtils]: 43: Hoare triple {8268#true} assume true; {8268#true} is VALID
[2022-04-08 07:44:20,708 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {8268#true} {8388#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} #51#return; {8388#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID
[2022-04-08 07:44:20,708 INFO L290 TraceCheckUtils]: 45: Hoare triple {8388#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8413#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID
[2022-04-08 07:44:20,709 INFO L290 TraceCheckUtils]: 46: Hoare triple {8413#(and (= 5 main_~c~0) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8413#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID
[2022-04-08 07:44:20,709 INFO L290 TraceCheckUtils]: 47: Hoare triple {8413#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(#t~post5 < 100);havoc #t~post5; {8413#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID
[2022-04-08 07:44:20,709 INFO L272 TraceCheckUtils]: 48: Hoare triple {8413#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8268#true} is VALID
[2022-04-08 07:44:20,709 INFO L290 TraceCheckUtils]: 49: Hoare triple {8268#true} ~cond := #in~cond; {8268#true} is VALID
[2022-04-08 07:44:20,709 INFO L290 TraceCheckUtils]: 50: Hoare triple {8268#true} assume !(0 == ~cond); {8268#true} is VALID
[2022-04-08 07:44:20,709 INFO L290 TraceCheckUtils]: 51: Hoare triple {8268#true} assume true; {8268#true} is VALID
[2022-04-08 07:44:20,710 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8268#true} {8413#(and (= 5 main_~c~0) (= 5 main_~y~0))} #51#return; {8413#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID
[2022-04-08 07:44:20,710 INFO L290 TraceCheckUtils]: 53: Hoare triple {8413#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8438#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID
[2022-04-08 07:44:20,711 INFO L290 TraceCheckUtils]: 54: Hoare triple {8438#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8438#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID
[2022-04-08 07:44:20,711 INFO L290 TraceCheckUtils]: 55: Hoare triple {8438#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !!(#t~post5 < 100);havoc #t~post5; {8438#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID
[2022-04-08 07:44:20,711 INFO L272 TraceCheckUtils]: 56: Hoare triple {8438#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8268#true} is VALID
[2022-04-08 07:44:20,711 INFO L290 TraceCheckUtils]: 57: Hoare triple {8268#true} ~cond := #in~cond; {8268#true} is VALID
[2022-04-08 07:44:20,711 INFO L290 TraceCheckUtils]: 58: Hoare triple {8268#true} assume !(0 == ~cond); {8268#true} is VALID
[2022-04-08 07:44:20,711 INFO L290 TraceCheckUtils]: 59: Hoare triple {8268#true} assume true; {8268#true} is VALID
[2022-04-08 07:44:20,712 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8268#true} {8438#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #51#return; {8438#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID
[2022-04-08 07:44:20,712 INFO L290 TraceCheckUtils]: 61: Hoare triple {8438#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8463#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID
[2022-04-08 07:44:20,713 INFO L290 TraceCheckUtils]: 62: Hoare triple {8463#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8463#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID
[2022-04-08 07:44:20,713 INFO L290 TraceCheckUtils]: 63: Hoare triple {8463#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !!(#t~post5 < 100);havoc #t~post5; {8463#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID
[2022-04-08 07:44:20,713 INFO L272 TraceCheckUtils]: 64: Hoare triple {8463#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8268#true} is VALID
[2022-04-08 07:44:20,713 INFO L290 TraceCheckUtils]: 65: Hoare triple {8268#true} ~cond := #in~cond; {8268#true} is VALID
[2022-04-08 07:44:20,713 INFO L290 TraceCheckUtils]: 66: Hoare triple {8268#true} assume !(0 == ~cond); {8268#true} is VALID
[2022-04-08 07:44:20,713 INFO L290 TraceCheckUtils]: 67: Hoare triple {8268#true} assume true; {8268#true} is VALID
[2022-04-08 07:44:20,714 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {8268#true} {8463#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #51#return; {8463#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID
[2022-04-08 07:44:20,714 INFO L290 TraceCheckUtils]: 69: Hoare triple {8463#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {8488#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID
[2022-04-08 07:44:20,715 INFO L272 TraceCheckUtils]: 70: Hoare triple {8488#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8492#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 07:44:20,715 INFO L290 TraceCheckUtils]: 71: Hoare triple {8492#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8496#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 07:44:20,715 INFO L290 TraceCheckUtils]: 72: Hoare triple {8496#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8269#false} is VALID
[2022-04-08 07:44:20,716 INFO L290 TraceCheckUtils]: 73: Hoare triple {8269#false} assume !false; {8269#false} is VALID
[2022-04-08 07:44:20,716 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 16 proven. 112 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked.
[2022-04-08 07:44:20,716 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 07:44:21,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 07:44:21,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552108032]
[2022-04-08 07:44:21,033 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-08 07:44:21,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656886432]
[2022-04-08 07:44:21,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656886432] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 07:44:21,033 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences.
[2022-04-08 07:44:21,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13
[2022-04-08 07:44:21,033 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 07:44:21,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2026514262]
[2022-04-08 07:44:21,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2026514262] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 07:44:21,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 07:44:21,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2022-04-08 07:44:21,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039569381]
[2022-04-08 07:44:21,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 07:44:21,034 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 74
[2022-04-08 07:44:21,034 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 07:44:21,034 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9)
[2022-04-08 07:44:21,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:44:21,074 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2022-04-08 07:44:21,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 07:44:21,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2022-04-08 07:44:21,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240
[2022-04-08 07:44:21,074 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9)
[2022-04-08 07:44:21,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:44:21,794 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions.
[2022-04-08 07:44:21,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2022-04-08 07:44:21,794 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 74
[2022-04-08 07:44:21,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 07:44:21,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9)
[2022-04-08 07:44:21,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 64 transitions.
[2022-04-08 07:44:21,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9)
[2022-04-08 07:44:21,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 64 transitions.
[2022-04-08 07:44:21,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 64 transitions.
[2022-04-08 07:44:21,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:44:21,842 INFO L225 Difference]: With dead ends: 84
[2022-04-08 07:44:21,842 INFO L226 Difference]: Without dead ends: 79
[2022-04-08 07:44:21,842 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306
[2022-04-08 07:44:21,843 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 2 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2022-04-08 07:44:21,843 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 352 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2022-04-08 07:44:21,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states.
[2022-04-08 07:44:21,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79.
[2022-04-08 07:44:21,934 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 07:44:21,934 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 79 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 57 states have internal predecessors, (59), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2022-04-08 07:44:21,934 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 79 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 57 states have internal predecessors, (59), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2022-04-08 07:44:21,934 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 79 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 57 states have internal predecessors, (59), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2022-04-08 07:44:21,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:44:21,935 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions.
[2022-04-08 07:44:21,935 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions.
[2022-04-08 07:44:21,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 07:44:21,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 07:44:21,936 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 57 states have internal predecessors, (59), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 79 states.
[2022-04-08 07:44:21,936 INFO L87 Difference]: Start difference. First operand has 79 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 57 states have internal predecessors, (59), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 79 states.
[2022-04-08 07:44:21,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:44:21,937 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions.
[2022-04-08 07:44:21,937 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions.
[2022-04-08 07:44:21,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 07:44:21,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 07:44:21,937 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 07:44:21,937 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 07:44:21,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 57 states have internal predecessors, (59), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2022-04-08 07:44:21,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions.
[2022-04-08 07:44:21,939 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 74
[2022-04-08 07:44:21,939 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 07:44:21,939 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions.
[2022-04-08 07:44:21,939 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9)
[2022-04-08 07:44:21,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 81 transitions.
[2022-04-08 07:44:22,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:44:22,029 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions.
[2022-04-08 07:44:22,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77
[2022-04-08 07:44:22,030 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 07:44:22,030 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 07:44:22,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0
[2022-04-08 07:44:22,230 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2022-04-08 07:44:22,230 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 07:44:22,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 07:44:22,231 INFO L85 PathProgramCache]: Analyzing trace with hash 989539297, now seen corresponding path program 15 times
[2022-04-08 07:44:22,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 07:44:22,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1404635750]
[2022-04-08 07:44:22,293 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult
[2022-04-08 07:44:22,294 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE
[2022-04-08 07:44:22,294 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 07:44:22,294 INFO L85 PathProgramCache]: Analyzing trace with hash 989539297, now seen corresponding path program 16 times
[2022-04-08 07:44:22,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 07:44:22,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24775149]
[2022-04-08 07:44:22,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 07:44:22,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 07:44:22,314 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-08 07:44:22,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [489954341]
[2022-04-08 07:44:22,314 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-04-08 07:44:22,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 07:44:22,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 07:44:22,315 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 07:44:22,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process
[2022-04-08 07:44:22,850 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-04-08 07:44:22,851 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 07:44:22,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 21 conjunts are in the unsatisfiable core
[2022-04-08 07:44:22,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 07:44:22,887 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 07:44:23,226 INFO L272 TraceCheckUtils]: 0: Hoare triple {9035#true} call ULTIMATE.init(); {9035#true} is VALID
[2022-04-08 07:44:23,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {9035#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9043#(<= ~counter~0 0)} is VALID
[2022-04-08 07:44:23,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {9043#(<= ~counter~0 0)} assume true; {9043#(<= ~counter~0 0)} is VALID
[2022-04-08 07:44:23,227 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9043#(<= ~counter~0 0)} {9035#true} #57#return; {9043#(<= ~counter~0 0)} is VALID
[2022-04-08 07:44:23,227 INFO L272 TraceCheckUtils]: 4: Hoare triple {9043#(<= ~counter~0 0)} call #t~ret6 := main(); {9043#(<= ~counter~0 0)} is VALID
[2022-04-08 07:44:23,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {9043#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {9043#(<= ~counter~0 0)} is VALID
[2022-04-08 07:44:23,228 INFO L290 TraceCheckUtils]: 6: Hoare triple {9043#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9059#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:23,228 INFO L290 TraceCheckUtils]: 7: Hoare triple {9059#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {9059#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:23,228 INFO L272 TraceCheckUtils]: 8: Hoare triple {9059#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9059#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:23,229 INFO L290 TraceCheckUtils]: 9: Hoare triple {9059#(<= ~counter~0 1)} ~cond := #in~cond; {9059#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:23,229 INFO L290 TraceCheckUtils]: 10: Hoare triple {9059#(<= ~counter~0 1)} assume !(0 == ~cond); {9059#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:23,229 INFO L290 TraceCheckUtils]: 11: Hoare triple {9059#(<= ~counter~0 1)} assume true; {9059#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:23,229 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {9059#(<= ~counter~0 1)} {9059#(<= ~counter~0 1)} #51#return; {9059#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:23,229 INFO L290 TraceCheckUtils]: 13: Hoare triple {9059#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9059#(<= ~counter~0 1)} is VALID
[2022-04-08 07:44:23,230 INFO L290 TraceCheckUtils]: 14: Hoare triple {9059#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9084#(<= ~counter~0 2)} is VALID
[2022-04-08 07:44:23,230 INFO L290 TraceCheckUtils]: 15: Hoare triple {9084#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {9084#(<= ~counter~0 2)} is VALID
[2022-04-08 07:44:23,230 INFO L272 TraceCheckUtils]: 16: Hoare triple {9084#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9084#(<= ~counter~0 2)} is VALID
[2022-04-08 07:44:23,230 INFO L290 TraceCheckUtils]: 17: Hoare triple {9084#(<= ~counter~0 2)} ~cond := #in~cond; {9084#(<= ~counter~0 2)} is VALID
[2022-04-08 07:44:23,231 INFO L290 TraceCheckUtils]: 18: Hoare triple {9084#(<= ~counter~0 2)} assume !(0 == ~cond); {9084#(<= ~counter~0 2)} is VALID
[2022-04-08 07:44:23,231 INFO L290 TraceCheckUtils]: 19: Hoare triple {9084#(<= ~counter~0 2)} assume true; {9084#(<= ~counter~0 2)} is VALID
[2022-04-08 07:44:23,231 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {9084#(<= ~counter~0 2)} {9084#(<= ~counter~0 2)} #51#return; {9084#(<= ~counter~0 2)} is VALID
[2022-04-08 07:44:23,231 INFO L290 TraceCheckUtils]: 21: Hoare triple {9084#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9084#(<= ~counter~0 2)} is VALID
[2022-04-08 07:44:23,232 INFO L290 TraceCheckUtils]: 22: Hoare triple {9084#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9109#(<= ~counter~0 3)} is VALID
[2022-04-08 07:44:23,232 INFO L290 TraceCheckUtils]: 23: Hoare triple {9109#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {9109#(<= ~counter~0 3)} is VALID
[2022-04-08 07:44:23,232 INFO L272 TraceCheckUtils]: 24: Hoare triple {9109#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9109#(<= ~counter~0 3)} is VALID
[2022-04-08 07:44:23,232 INFO L290 TraceCheckUtils]: 25: Hoare triple {9109#(<= ~counter~0 3)} ~cond := #in~cond; {9109#(<= ~counter~0 3)} is VALID
[2022-04-08 07:44:23,232 INFO L290 TraceCheckUtils]: 26: Hoare triple {9109#(<= ~counter~0 3)} assume !(0 == ~cond); {9109#(<= ~counter~0 3)} is VALID
[2022-04-08 07:44:23,233 INFO L290 TraceCheckUtils]: 27: Hoare triple {9109#(<= ~counter~0 3)} assume true; {9109#(<= ~counter~0 3)} is VALID
[2022-04-08 07:44:23,233 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {9109#(<= ~counter~0 3)} {9109#(<= ~counter~0 3)} #51#return; {9109#(<= ~counter~0 3)} is VALID
[2022-04-08 07:44:23,233 INFO L290 TraceCheckUtils]: 29: Hoare triple {9109#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9109#(<= ~counter~0 3)} is VALID
[2022-04-08 07:44:23,233 INFO L290 TraceCheckUtils]: 30: Hoare triple {9109#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9134#(<= ~counter~0 4)} is VALID
[2022-04-08 07:44:23,234 INFO L290 TraceCheckUtils]: 31: Hoare triple {9134#(<= ~counter~0 4)} assume !!(#t~post5 < 100);havoc #t~post5; {9134#(<= ~counter~0 4)} is VALID
[2022-04-08 07:44:23,234 INFO L272 TraceCheckUtils]: 32: Hoare triple {9134#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9134#(<= ~counter~0 4)} is VALID
[2022-04-08 07:44:23,234 INFO L290 TraceCheckUtils]: 33: Hoare triple {9134#(<= ~counter~0 4)} ~cond := #in~cond; {9134#(<= ~counter~0 4)} is VALID
[2022-04-08 07:44:23,234 INFO L290 TraceCheckUtils]: 34: Hoare triple {9134#(<= ~counter~0 4)} assume !(0 == ~cond); {9134#(<= ~counter~0 4)} is VALID
[2022-04-08 07:44:23,234 INFO L290 TraceCheckUtils]: 35: Hoare triple {9134#(<= ~counter~0 4)} assume true; {9134#(<= ~counter~0 4)} is VALID
[2022-04-08 07:44:23,235 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {9134#(<= ~counter~0 4)} {9134#(<= ~counter~0 4)} #51#return; {9134#(<= ~counter~0 4)} is VALID
[2022-04-08 07:44:23,235 INFO L290 TraceCheckUtils]: 37: Hoare triple {9134#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9134#(<= ~counter~0 4)} is VALID
[2022-04-08 07:44:23,235 INFO L290 TraceCheckUtils]: 38: Hoare triple {9134#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9159#(<= ~counter~0 5)} is VALID
[2022-04-08 07:44:23,236 INFO L290 TraceCheckUtils]: 39: Hoare triple {9159#(<= ~counter~0 5)} assume !!(#t~post5 < 100);havoc #t~post5; {9159#(<= ~counter~0 5)} is VALID
[2022-04-08 07:44:23,236 INFO L272 TraceCheckUtils]: 40: Hoare triple {9159#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9159#(<= ~counter~0 5)} is VALID
[2022-04-08 07:44:23,236 INFO L290 TraceCheckUtils]: 41: Hoare triple {9159#(<= ~counter~0 5)} ~cond := #in~cond; {9159#(<= ~counter~0 5)} is VALID
[2022-04-08 07:44:23,236 INFO L290 TraceCheckUtils]: 42: Hoare triple {9159#(<= ~counter~0 5)} assume !(0 == ~cond); {9159#(<= ~counter~0 5)} is VALID
[2022-04-08 07:44:23,236 INFO L290 TraceCheckUtils]: 43: Hoare triple {9159#(<= ~counter~0 5)} assume true; {9159#(<= ~counter~0 5)} is VALID
[2022-04-08 07:44:23,237 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {9159#(<= ~counter~0 5)} {9159#(<= ~counter~0 5)} #51#return; {9159#(<= ~counter~0 5)} is VALID
[2022-04-08 07:44:23,237 INFO L290 TraceCheckUtils]: 45: Hoare triple {9159#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9159#(<= ~counter~0 5)} is VALID
[2022-04-08 07:44:23,237 INFO L290 TraceCheckUtils]: 46: Hoare triple {9159#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9184#(<= ~counter~0 6)} is VALID
[2022-04-08 07:44:23,237 INFO L290 TraceCheckUtils]: 47: Hoare triple {9184#(<= ~counter~0 6)} assume !!(#t~post5 < 100);havoc #t~post5; {9184#(<= ~counter~0 6)} is VALID
[2022-04-08 07:44:23,238 INFO L272 TraceCheckUtils]: 48: Hoare triple {9184#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9184#(<= ~counter~0 6)} is VALID
[2022-04-08 07:44:23,238 INFO L290 TraceCheckUtils]: 49: Hoare triple {9184#(<= ~counter~0 6)} ~cond := #in~cond; {9184#(<= ~counter~0 6)} is VALID
[2022-04-08 07:44:23,238 INFO L290 TraceCheckUtils]: 50: Hoare triple {9184#(<= ~counter~0 6)} assume !(0 == ~cond); {9184#(<= ~counter~0 6)} is VALID
[2022-04-08 07:44:23,238 INFO L290 TraceCheckUtils]: 51: Hoare triple {9184#(<= ~counter~0 6)} assume true; {9184#(<= ~counter~0 6)} is VALID
[2022-04-08 07:44:23,238 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {9184#(<= ~counter~0 6)} {9184#(<= ~counter~0 6)} #51#return; {9184#(<= ~counter~0 6)} is VALID
[2022-04-08 07:44:23,239 INFO L290 TraceCheckUtils]: 53: Hoare triple {9184#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9184#(<= ~counter~0 6)} is VALID
[2022-04-08 07:44:23,239 INFO L290 TraceCheckUtils]: 54: Hoare triple {9184#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9209#(<= ~counter~0 7)} is VALID
[2022-04-08 07:44:23,239 INFO L290 TraceCheckUtils]: 55: Hoare triple {9209#(<= ~counter~0 7)} assume !!(#t~post5 < 100);havoc #t~post5; {9209#(<= ~counter~0 7)} is VALID
[2022-04-08 07:44:23,239 INFO L272 TraceCheckUtils]: 56: Hoare triple {9209#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9209#(<= ~counter~0 7)} is VALID
[2022-04-08 07:44:23,240 INFO L290 TraceCheckUtils]: 57: Hoare triple {9209#(<= ~counter~0 7)} ~cond := #in~cond; {9209#(<= ~counter~0 7)} is VALID
[2022-04-08 07:44:23,240 INFO L290 TraceCheckUtils]: 58: Hoare triple {9209#(<= ~counter~0 7)} assume !(0 == ~cond); {9209#(<= ~counter~0 7)} is VALID
[2022-04-08 07:44:23,240 INFO L290 TraceCheckUtils]: 59: Hoare triple {9209#(<= ~counter~0 7)} assume true; {9209#(<= ~counter~0 7)} is VALID
[2022-04-08 07:44:23,240 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {9209#(<= ~counter~0 7)} {9209#(<= ~counter~0 7)} #51#return; {9209#(<= ~counter~0 7)} is VALID
[2022-04-08 07:44:23,240 INFO L290 TraceCheckUtils]: 61: Hoare triple {9209#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9209#(<= ~counter~0 7)} is VALID
[2022-04-08 07:44:23,241 INFO L290 TraceCheckUtils]: 62: Hoare triple {9209#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9234#(<= ~counter~0 8)} is VALID
[2022-04-08 07:44:23,241 INFO L290 TraceCheckUtils]: 63: Hoare triple {9234#(<= ~counter~0 8)} assume !!(#t~post5 < 100);havoc #t~post5; {9234#(<= ~counter~0 8)} is VALID
[2022-04-08 07:44:23,241 INFO L272 TraceCheckUtils]: 64: Hoare triple {9234#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9234#(<= ~counter~0 8)} is VALID
[2022-04-08 07:44:23,241 INFO L290 TraceCheckUtils]: 65: Hoare triple {9234#(<= ~counter~0 8)} ~cond := #in~cond; {9234#(<= ~counter~0 8)} is VALID
[2022-04-08 07:44:23,242 INFO L290 TraceCheckUtils]: 66: Hoare triple {9234#(<= ~counter~0 8)} assume !(0 == ~cond); {9234#(<= ~counter~0 8)} is VALID
[2022-04-08 07:44:23,242 INFO L290 TraceCheckUtils]: 67: Hoare triple {9234#(<= ~counter~0 8)} assume true; {9234#(<= ~counter~0 8)} is VALID
[2022-04-08 07:44:23,242 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {9234#(<= ~counter~0 8)} {9234#(<= ~counter~0 8)} #51#return; {9234#(<= ~counter~0 8)} is VALID
[2022-04-08 07:44:23,242 INFO L290 TraceCheckUtils]: 69: Hoare triple {9234#(<= ~counter~0 8)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9234#(<= ~counter~0 8)} is VALID
[2022-04-08 07:44:23,243 INFO L290 TraceCheckUtils]: 70: Hoare triple {9234#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9259#(<= |main_#t~post5| 8)} is VALID
[2022-04-08 07:44:23,243 INFO L290 TraceCheckUtils]: 71: Hoare triple {9259#(<= |main_#t~post5| 8)} assume !(#t~post5 < 100);havoc #t~post5; {9036#false} is VALID
[2022-04-08 07:44:23,243 INFO L272 TraceCheckUtils]: 72: Hoare triple {9036#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9036#false} is VALID
[2022-04-08 07:44:23,243 INFO L290 TraceCheckUtils]: 73: Hoare triple {9036#false} ~cond := #in~cond; {9036#false} is VALID
[2022-04-08 07:44:23,243 INFO L290 TraceCheckUtils]: 74: Hoare triple {9036#false} assume 0 == ~cond; {9036#false} is VALID
[2022-04-08 07:44:23,243 INFO L290 TraceCheckUtils]: 75: Hoare triple {9036#false} assume !false; {9036#false} is VALID
[2022-04-08 07:44:23,243 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 16 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 07:44:23,243 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 07:44:23,504 INFO L290 TraceCheckUtils]: 75: Hoare triple {9036#false} assume !false; {9036#false} is VALID
[2022-04-08 07:44:23,505 INFO L290 TraceCheckUtils]: 74: Hoare triple {9036#false} assume 0 == ~cond; {9036#false} is VALID
[2022-04-08 07:44:23,505 INFO L290 TraceCheckUtils]: 73: Hoare triple {9036#false} ~cond := #in~cond; {9036#false} is VALID
[2022-04-08 07:44:23,505 INFO L272 TraceCheckUtils]: 72: Hoare triple {9036#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9036#false} is VALID
[2022-04-08 07:44:23,505 INFO L290 TraceCheckUtils]: 71: Hoare triple {9287#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {9036#false} is VALID
[2022-04-08 07:44:23,505 INFO L290 TraceCheckUtils]: 70: Hoare triple {9291#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9287#(< |main_#t~post5| 100)} is VALID
[2022-04-08 07:44:23,505 INFO L290 TraceCheckUtils]: 69: Hoare triple {9291#(< ~counter~0 100)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9291#(< ~counter~0 100)} is VALID
[2022-04-08 07:44:23,506 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {9035#true} {9291#(< ~counter~0 100)} #51#return; {9291#(< ~counter~0 100)} is VALID
[2022-04-08 07:44:23,506 INFO L290 TraceCheckUtils]: 67: Hoare triple {9035#true} assume true; {9035#true} is VALID
[2022-04-08 07:44:23,506 INFO L290 TraceCheckUtils]: 66: Hoare triple {9035#true} assume !(0 == ~cond); {9035#true} is VALID
[2022-04-08 07:44:23,506 INFO L290 TraceCheckUtils]: 65: Hoare triple {9035#true} ~cond := #in~cond; {9035#true} is VALID
[2022-04-08 07:44:23,506 INFO L272 TraceCheckUtils]: 64: Hoare triple {9291#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9035#true} is VALID
[2022-04-08 07:44:23,506 INFO L290 TraceCheckUtils]: 63: Hoare triple {9291#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {9291#(< ~counter~0 100)} is VALID
[2022-04-08 07:44:23,507 INFO L290 TraceCheckUtils]: 62: Hoare triple {9316#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9291#(< ~counter~0 100)} is VALID
[2022-04-08 07:44:23,507 INFO L290 TraceCheckUtils]: 61: Hoare triple {9316#(< ~counter~0 99)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9316#(< ~counter~0 99)} is VALID
[2022-04-08 07:44:23,507 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {9035#true} {9316#(< ~counter~0 99)} #51#return; {9316#(< ~counter~0 99)} is VALID
[2022-04-08 07:44:23,507 INFO L290 TraceCheckUtils]: 59: Hoare triple {9035#true} assume true; {9035#true} is VALID
[2022-04-08 07:44:23,507 INFO L290 TraceCheckUtils]: 58: Hoare triple {9035#true} assume !(0 == ~cond); {9035#true} is VALID
[2022-04-08 07:44:23,507 INFO L290 TraceCheckUtils]: 57: Hoare triple {9035#true} ~cond := #in~cond; {9035#true} is VALID
[2022-04-08 07:44:23,507 INFO L272 TraceCheckUtils]: 56: Hoare triple {9316#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9035#true} is VALID
[2022-04-08 07:44:23,508 INFO L290 TraceCheckUtils]: 55: Hoare triple {9316#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {9316#(< ~counter~0 99)} is VALID
[2022-04-08 07:44:23,508 INFO L290 TraceCheckUtils]: 54: Hoare triple {9341#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9316#(< ~counter~0 99)} is VALID
[2022-04-08 07:44:23,508 INFO L290 TraceCheckUtils]: 53: Hoare triple {9341#(< ~counter~0 98)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9341#(< ~counter~0 98)} is VALID
[2022-04-08 07:44:23,509 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {9035#true} {9341#(< ~counter~0 98)} #51#return; {9341#(< ~counter~0 98)} is VALID
[2022-04-08 07:44:23,509 INFO L290 TraceCheckUtils]: 51: Hoare triple {9035#true} assume true; {9035#true} is VALID
[2022-04-08 07:44:23,509 INFO L290 TraceCheckUtils]: 50: Hoare triple {9035#true} assume !(0 == ~cond); {9035#true} is VALID
[2022-04-08 07:44:23,509 INFO L290 TraceCheckUtils]: 49: Hoare triple {9035#true} ~cond := #in~cond; {9035#true} is VALID
[2022-04-08 07:44:23,509 INFO L272 TraceCheckUtils]: 48: Hoare triple {9341#(< ~counter~0 98)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9035#true} is VALID
[2022-04-08 07:44:23,509 INFO L290 TraceCheckUtils]: 47: Hoare triple {9341#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {9341#(< ~counter~0 98)} is VALID
[2022-04-08 07:44:23,509 INFO L290 TraceCheckUtils]: 46: Hoare triple {9366#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9341#(< ~counter~0 98)} is VALID
[2022-04-08 07:44:23,510 INFO L290 TraceCheckUtils]: 45: Hoare triple {9366#(< ~counter~0 97)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9366#(< ~counter~0 97)} is VALID
[2022-04-08 07:44:23,510 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {9035#true} {9366#(< ~counter~0 97)} #51#return; {9366#(< ~counter~0 97)} is VALID
[2022-04-08 07:44:23,510 INFO L290 TraceCheckUtils]: 43: Hoare triple {9035#true} assume true; {9035#true} is VALID
[2022-04-08 07:44:23,510 INFO L290 TraceCheckUtils]: 42: Hoare triple {9035#true} assume !(0 == ~cond); {9035#true} is VALID
[2022-04-08 07:44:23,510 INFO L290 TraceCheckUtils]: 41: Hoare triple {9035#true} ~cond := #in~cond; {9035#true} is VALID
[2022-04-08 07:44:23,510 INFO L272 TraceCheckUtils]: 40: Hoare triple {9366#(< ~counter~0 97)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9035#true} is VALID
[2022-04-08 07:44:23,510 INFO L290 TraceCheckUtils]: 39: Hoare triple {9366#(< ~counter~0 97)} assume !!(#t~post5 < 100);havoc #t~post5; {9366#(< ~counter~0 97)} is VALID
[2022-04-08 07:44:23,511 INFO L290 TraceCheckUtils]: 38: Hoare triple {9391#(< ~counter~0 96)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9366#(< ~counter~0 97)} is VALID
[2022-04-08 07:44:23,511 INFO L290 TraceCheckUtils]: 37: Hoare triple {9391#(< ~counter~0 96)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9391#(< ~counter~0 96)} is VALID
[2022-04-08 07:44:23,511 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {9035#true} {9391#(< ~counter~0 96)} #51#return; {9391#(< ~counter~0 96)} is VALID
[2022-04-08 07:44:23,511 INFO L290 TraceCheckUtils]: 35: Hoare triple {9035#true} assume true; {9035#true} is VALID
[2022-04-08 07:44:23,511 INFO L290 TraceCheckUtils]: 34: Hoare triple {9035#true} assume !(0 == ~cond); {9035#true} is VALID
[2022-04-08 07:44:23,511 INFO L290 TraceCheckUtils]: 33: Hoare triple {9035#true} ~cond := #in~cond; {9035#true} is VALID
[2022-04-08 07:44:23,511 INFO L272 TraceCheckUtils]: 32: Hoare triple {9391#(< ~counter~0 96)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9035#true} is VALID
[2022-04-08 07:44:23,512 INFO L290 TraceCheckUtils]: 31: Hoare triple {9391#(< ~counter~0 96)} assume !!(#t~post5 < 100);havoc #t~post5; {9391#(< ~counter~0 96)} is VALID
[2022-04-08 07:44:23,512 INFO L290 TraceCheckUtils]: 30: Hoare triple {9416#(< ~counter~0 95)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9391#(< ~counter~0 96)} is VALID
[2022-04-08 07:44:23,512 INFO L290 TraceCheckUtils]: 29: Hoare triple {9416#(< ~counter~0 95)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9416#(< ~counter~0 95)} is VALID
[2022-04-08 07:44:23,512 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {9035#true} {9416#(< ~counter~0 95)} #51#return; {9416#(< ~counter~0 95)} is VALID
[2022-04-08 07:44:23,512 INFO L290 TraceCheckUtils]: 27: Hoare triple {9035#true} assume true; {9035#true} is VALID
[2022-04-08 07:44:23,513 INFO L290 TraceCheckUtils]: 26: Hoare triple {9035#true} assume !(0 == ~cond); {9035#true} is VALID
[2022-04-08 07:44:23,513 INFO L290 TraceCheckUtils]: 25: Hoare triple {9035#true} ~cond := #in~cond; {9035#true} is VALID
[2022-04-08 07:44:23,513 INFO L272 TraceCheckUtils]: 24: Hoare triple {9416#(< ~counter~0 95)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9035#true} is VALID
[2022-04-08 07:44:23,517 INFO L290 TraceCheckUtils]: 23: Hoare triple {9416#(< ~counter~0 95)} assume !!(#t~post5 < 100);havoc #t~post5; {9416#(< ~counter~0 95)} is VALID
[2022-04-08 07:44:23,517 INFO L290 TraceCheckUtils]: 22: Hoare triple {9441#(< ~counter~0 94)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9416#(< ~counter~0 95)} is VALID
[2022-04-08 07:44:23,518 INFO L290 TraceCheckUtils]: 21: Hoare triple {9441#(< ~counter~0 94)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9441#(< ~counter~0 94)} is VALID
[2022-04-08 07:44:23,518 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {9035#true} {9441#(< ~counter~0 94)} #51#return; {9441#(< ~counter~0 94)} is VALID
[2022-04-08 07:44:23,518 INFO L290 TraceCheckUtils]: 19: Hoare triple {9035#true} assume true; {9035#true} is VALID
[2022-04-08 07:44:23,518 INFO L290 TraceCheckUtils]: 18: Hoare triple {9035#true} assume !(0 == ~cond); {9035#true} is VALID
[2022-04-08 07:44:23,518 INFO L290 TraceCheckUtils]: 17: Hoare triple {9035#true} ~cond := #in~cond; {9035#true} is VALID
[2022-04-08 07:44:23,518 INFO L272 TraceCheckUtils]: 16: Hoare triple {9441#(< ~counter~0 94)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9035#true} is VALID
[2022-04-08 07:44:23,518 INFO L290 TraceCheckUtils]: 15: Hoare triple {9441#(< ~counter~0 94)} assume !!(#t~post5 < 100);havoc #t~post5; {9441#(< ~counter~0 94)} is VALID
[2022-04-08 07:44:23,519 INFO L290 TraceCheckUtils]: 14: Hoare triple {9466#(< ~counter~0 93)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9441#(< ~counter~0 94)} is VALID
[2022-04-08 07:44:23,519 INFO L290 TraceCheckUtils]: 13: Hoare triple {9466#(< ~counter~0 93)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9466#(< ~counter~0 93)} is VALID
[2022-04-08 07:44:23,519 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {9035#true} {9466#(< ~counter~0 93)} #51#return; {9466#(< ~counter~0 93)} is VALID
[2022-04-08 07:44:23,519 INFO L290 TraceCheckUtils]: 11: Hoare triple {9035#true} assume true; {9035#true} is VALID
[2022-04-08 07:44:23,519 INFO L290 TraceCheckUtils]: 10: Hoare triple {9035#true} assume !(0 == ~cond); {9035#true} is VALID
[2022-04-08 07:44:23,519 INFO L290 TraceCheckUtils]: 9: Hoare triple {9035#true} ~cond := #in~cond; {9035#true} is VALID
[2022-04-08 07:44:23,519 INFO L272 TraceCheckUtils]: 8: Hoare triple {9466#(< ~counter~0 93)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9035#true} is VALID
[2022-04-08 07:44:23,520 INFO L290 TraceCheckUtils]: 7: Hoare triple {9466#(< ~counter~0 93)} assume !!(#t~post5 < 100);havoc #t~post5; {9466#(< ~counter~0 93)} is VALID
[2022-04-08 07:44:23,520 INFO L290 TraceCheckUtils]: 6: Hoare triple {9491#(< ~counter~0 92)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9466#(< ~counter~0 93)} is VALID
[2022-04-08 07:44:23,520 INFO L290 TraceCheckUtils]: 5: Hoare triple {9491#(< ~counter~0 92)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {9491#(< ~counter~0 92)} is VALID
[2022-04-08 07:44:23,521 INFO L272 TraceCheckUtils]: 4: Hoare triple {9491#(< ~counter~0 92)} call #t~ret6 := main(); {9491#(< ~counter~0 92)} is VALID
[2022-04-08 07:44:23,521 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9491#(< ~counter~0 92)} {9035#true} #57#return; {9491#(< ~counter~0 92)} is VALID
[2022-04-08 07:44:23,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {9491#(< ~counter~0 92)} assume true; {9491#(< ~counter~0 92)} is VALID
[2022-04-08 07:44:23,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {9035#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9491#(< ~counter~0 92)} is VALID
[2022-04-08 07:44:23,522 INFO L272 TraceCheckUtils]: 0: Hoare triple {9035#true} call ULTIMATE.init(); {9035#true} is VALID
[2022-04-08 07:44:23,522 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 16 proven. 128 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked.
[2022-04-08 07:44:23,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 07:44:23,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24775149]
[2022-04-08 07:44:23,522 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-08 07:44:23,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489954341]
[2022-04-08 07:44:23,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489954341] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 07:44:23,523 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2022-04-08 07:44:23,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22
[2022-04-08 07:44:23,523 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 07:44:23,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1404635750]
[2022-04-08 07:44:23,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1404635750] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 07:44:23,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 07:44:23,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2022-04-08 07:44:23,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270171096]
[2022-04-08 07:44:23,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 07:44:23,524 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 11 states have call successors, (11), 11 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 76
[2022-04-08 07:44:23,524 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 07:44:23,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 11 states have call successors, (11), 11 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9)
[2022-04-08 07:44:23,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:44:23,561 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2022-04-08 07:44:23,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 07:44:23,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2022-04-08 07:44:23,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462
[2022-04-08 07:44:23,570 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 11 states have call successors, (11), 11 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9)
[2022-04-08 07:44:23,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:44:23,786 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions.
[2022-04-08 07:44:23,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2022-04-08 07:44:23,786 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 11 states have call successors, (11), 11 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 76
[2022-04-08 07:44:23,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 07:44:23,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 11 states have call successors, (11), 11 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9)
[2022-04-08 07:44:23,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 90 transitions.
[2022-04-08 07:44:23,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 11 states have call successors, (11), 11 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9)
[2022-04-08 07:44:23,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 90 transitions.
[2022-04-08 07:44:23,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 90 transitions.
[2022-04-08 07:44:23,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:44:23,842 INFO L225 Difference]: With dead ends: 90
[2022-04-08 07:44:23,842 INFO L226 Difference]: Without dead ends: 85
[2022-04-08 07:44:23,843 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=363, Invalid=507, Unknown=0, NotChecked=0, Total=870
[2022-04-08 07:44:23,843 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 4 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 07:44:23,844 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 107 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 07:44:23,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states.
[2022-04-08 07:44:23,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85.
[2022-04-08 07:44:23,928 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 07:44:23,928 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 85 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 12 states have call successors, (12), 12 states have call predecessors, (12), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2022-04-08 07:44:23,931 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 85 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 12 states have call successors, (12), 12 states have call predecessors, (12), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2022-04-08 07:44:23,933 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 85 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 12 states have call successors, (12), 12 states have call predecessors, (12), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2022-04-08 07:44:23,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:44:23,934 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions.
[2022-04-08 07:44:23,935 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions.
[2022-04-08 07:44:23,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 07:44:23,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 07:44:23,936 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 12 states have call successors, (12), 12 states have call predecessors, (12), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 85 states.
[2022-04-08 07:44:23,936 INFO L87 Difference]: Start difference. First operand has 85 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 12 states have call successors, (12), 12 states have call predecessors, (12), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 85 states.
[2022-04-08 07:44:23,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:44:23,937 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions.
[2022-04-08 07:44:23,937 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions.
[2022-04-08 07:44:23,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 07:44:23,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 07:44:23,937 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 07:44:23,937 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 07:44:23,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 12 states have call successors, (12), 12 states have call predecessors, (12), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2022-04-08 07:44:23,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions.
[2022-04-08 07:44:23,940 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 76
[2022-04-08 07:44:23,940 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 07:44:23,940 INFO L478 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions.
[2022-04-08 07:44:23,940 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 11 states have call successors, (11), 11 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9)
[2022-04-08 07:44:23,941 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 86 transitions.
[2022-04-08 07:44:24,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:44:24,016 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions.
[2022-04-08 07:44:24,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83
[2022-04-08 07:44:24,017 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 07:44:24,017 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 07:44:24,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0
[2022-04-08 07:44:24,222 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 07:44:24,223 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 07:44:24,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 07:44:24,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1500110401, now seen corresponding path program 15 times
[2022-04-08 07:44:24,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 07:44:24,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1412057079]
[2022-04-08 07:44:24,289 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult
[2022-04-08 07:44:24,289 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE
[2022-04-08 07:44:24,289 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 07:44:24,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1500110401, now seen corresponding path program 16 times
[2022-04-08 07:44:24,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 07:44:24,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196698029]
[2022-04-08 07:44:24,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 07:44:24,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 07:44:24,309 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-08 07:44:24,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1151560680]
[2022-04-08 07:44:24,309 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-04-08 07:44:24,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 07:44:24,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 07:44:24,310 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 07:44:24,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process
[2022-04-08 07:44:25,034 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-04-08 07:44:25,035 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 07:44:25,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 40 conjunts are in the unsatisfiable core
[2022-04-08 07:44:25,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 07:44:25,046 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 07:44:25,383 INFO L272 TraceCheckUtils]: 0: Hoare triple {10048#true} call ULTIMATE.init(); {10048#true} is VALID
[2022-04-08 07:44:25,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {10048#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10048#true} is VALID
[2022-04-08 07:44:25,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {10048#true} assume true; {10048#true} is VALID
[2022-04-08 07:44:25,383 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10048#true} {10048#true} #57#return; {10048#true} is VALID
[2022-04-08 07:44:25,383 INFO L272 TraceCheckUtils]: 4: Hoare triple {10048#true} call #t~ret6 := main(); {10048#true} is VALID
[2022-04-08 07:44:25,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {10048#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {10068#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 07:44:25,384 INFO L290 TraceCheckUtils]: 6: Hoare triple {10068#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10068#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 07:44:25,384 INFO L290 TraceCheckUtils]: 7: Hoare triple {10068#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {10068#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 07:44:25,384 INFO L272 TraceCheckUtils]: 8: Hoare triple {10068#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10048#true} is VALID
[2022-04-08 07:44:25,384 INFO L290 TraceCheckUtils]: 9: Hoare triple {10048#true} ~cond := #in~cond; {10048#true} is VALID
[2022-04-08 07:44:25,384 INFO L290 TraceCheckUtils]: 10: Hoare triple {10048#true} assume !(0 == ~cond); {10048#true} is VALID
[2022-04-08 07:44:25,384 INFO L290 TraceCheckUtils]: 11: Hoare triple {10048#true} assume true; {10048#true} is VALID
[2022-04-08 07:44:25,385 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10048#true} {10068#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {10068#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID
[2022-04-08 07:44:25,385 INFO L290 TraceCheckUtils]: 13: Hoare triple {10068#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10093#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID
[2022-04-08 07:44:25,386 INFO L290 TraceCheckUtils]: 14: Hoare triple {10093#(and (= main_~y~0 1) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10093#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID
[2022-04-08 07:44:25,386 INFO L290 TraceCheckUtils]: 15: Hoare triple {10093#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {10093#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID
[2022-04-08 07:44:25,386 INFO L272 TraceCheckUtils]: 16: Hoare triple {10093#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10048#true} is VALID
[2022-04-08 07:44:25,386 INFO L290 TraceCheckUtils]: 17: Hoare triple {10048#true} ~cond := #in~cond; {10048#true} is VALID
[2022-04-08 07:44:25,386 INFO L290 TraceCheckUtils]: 18: Hoare triple {10048#true} assume !(0 == ~cond); {10048#true} is VALID
[2022-04-08 07:44:25,386 INFO L290 TraceCheckUtils]: 19: Hoare triple {10048#true} assume true; {10048#true} is VALID
[2022-04-08 07:44:25,387 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {10048#true} {10093#(and (= main_~y~0 1) (= main_~c~0 1))} #51#return; {10093#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID
[2022-04-08 07:44:25,387 INFO L290 TraceCheckUtils]: 21: Hoare triple {10093#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10118#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID
[2022-04-08 07:44:25,387 INFO L290 TraceCheckUtils]: 22: Hoare triple {10118#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10118#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID
[2022-04-08 07:44:25,388 INFO L290 TraceCheckUtils]: 23: Hoare triple {10118#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(#t~post5 < 100);havoc #t~post5; {10118#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID
[2022-04-08 07:44:25,388 INFO L272 TraceCheckUtils]: 24: Hoare triple {10118#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10048#true} is VALID
[2022-04-08 07:44:25,388 INFO L290 TraceCheckUtils]: 25: Hoare triple {10048#true} ~cond := #in~cond; {10048#true} is VALID
[2022-04-08 07:44:25,388 INFO L290 TraceCheckUtils]: 26: Hoare triple {10048#true} assume !(0 == ~cond); {10048#true} is VALID
[2022-04-08 07:44:25,388 INFO L290 TraceCheckUtils]: 27: Hoare triple {10048#true} assume true; {10048#true} is VALID
[2022-04-08 07:44:25,388 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {10048#true} {10118#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #51#return; {10118#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID
[2022-04-08 07:44:25,389 INFO L290 TraceCheckUtils]: 29: Hoare triple {10118#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10143#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID
[2022-04-08 07:44:25,389 INFO L290 TraceCheckUtils]: 30: Hoare triple {10143#(and (= main_~y~0 3) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10143#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID
[2022-04-08 07:44:25,389 INFO L290 TraceCheckUtils]: 31: Hoare triple {10143#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(#t~post5 < 100);havoc #t~post5; {10143#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID
[2022-04-08 07:44:25,390 INFO L272 TraceCheckUtils]: 32: Hoare triple {10143#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10048#true} is VALID
[2022-04-08 07:44:25,390 INFO L290 TraceCheckUtils]: 33: Hoare triple {10048#true} ~cond := #in~cond; {10048#true} is VALID
[2022-04-08 07:44:25,390 INFO L290 TraceCheckUtils]: 34: Hoare triple {10048#true} assume !(0 == ~cond); {10048#true} is VALID
[2022-04-08 07:44:25,390 INFO L290 TraceCheckUtils]: 35: Hoare triple {10048#true} assume true; {10048#true} is VALID
[2022-04-08 07:44:25,390 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {10048#true} {10143#(and (= main_~y~0 3) (= main_~c~0 3))} #51#return; {10143#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID
[2022-04-08 07:44:25,391 INFO L290 TraceCheckUtils]: 37: Hoare triple {10143#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10168#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID
[2022-04-08 07:44:25,391 INFO L290 TraceCheckUtils]: 38: Hoare triple {10168#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10168#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID
[2022-04-08 07:44:25,391 INFO L290 TraceCheckUtils]: 39: Hoare triple {10168#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !!(#t~post5 < 100);havoc #t~post5; {10168#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID
[2022-04-08 07:44:25,391 INFO L272 TraceCheckUtils]: 40: Hoare triple {10168#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10048#true} is VALID
[2022-04-08 07:44:25,391 INFO L290 TraceCheckUtils]: 41: Hoare triple {10048#true} ~cond := #in~cond; {10048#true} is VALID
[2022-04-08 07:44:25,391 INFO L290 TraceCheckUtils]: 42: Hoare triple {10048#true} assume !(0 == ~cond); {10048#true} is VALID
[2022-04-08 07:44:25,392 INFO L290 TraceCheckUtils]: 43: Hoare triple {10048#true} assume true; {10048#true} is VALID
[2022-04-08 07:44:25,392 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {10048#true} {10168#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #51#return; {10168#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID
[2022-04-08 07:44:25,392 INFO L290 TraceCheckUtils]: 45: Hoare triple {10168#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10193#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID
[2022-04-08 07:44:25,393 INFO L290 TraceCheckUtils]: 46: Hoare triple {10193#(and (= 5 main_~c~0) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10193#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID
[2022-04-08 07:44:25,393 INFO L290 TraceCheckUtils]: 47: Hoare triple {10193#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(#t~post5 < 100);havoc #t~post5; {10193#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID
[2022-04-08 07:44:25,393 INFO L272 TraceCheckUtils]: 48: Hoare triple {10193#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10048#true} is VALID
[2022-04-08 07:44:25,393 INFO L290 TraceCheckUtils]: 49: Hoare triple {10048#true} ~cond := #in~cond; {10048#true} is VALID
[2022-04-08 07:44:25,393 INFO L290 TraceCheckUtils]: 50: Hoare triple {10048#true} assume !(0 == ~cond); {10048#true} is VALID
[2022-04-08 07:44:25,393 INFO L290 TraceCheckUtils]: 51: Hoare triple {10048#true} assume true; {10048#true} is VALID
[2022-04-08 07:44:25,394 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10048#true} {10193#(and (= 5 main_~c~0) (= 5 main_~y~0))} #51#return; {10193#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID
[2022-04-08 07:44:25,394 INFO L290 TraceCheckUtils]: 53: Hoare triple {10193#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10218#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID
[2022-04-08 07:44:25,394 INFO L290 TraceCheckUtils]: 54: Hoare triple {10218#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10218#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID
[2022-04-08 07:44:25,395 INFO L290 TraceCheckUtils]: 55: Hoare triple {10218#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !!(#t~post5 < 100);havoc #t~post5; {10218#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID
[2022-04-08 07:44:25,395 INFO L272 TraceCheckUtils]: 56: Hoare triple {10218#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10048#true} is VALID
[2022-04-08 07:44:25,395 INFO L290 TraceCheckUtils]: 57: Hoare triple {10048#true} ~cond := #in~cond; {10048#true} is VALID
[2022-04-08 07:44:25,395 INFO L290 TraceCheckUtils]: 58: Hoare triple {10048#true} assume !(0 == ~cond); {10048#true} is VALID
[2022-04-08 07:44:25,395 INFO L290 TraceCheckUtils]: 59: Hoare triple {10048#true} assume true; {10048#true} is VALID
[2022-04-08 07:44:25,395 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {10048#true} {10218#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #51#return; {10218#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID
[2022-04-08 07:44:25,396 INFO L290 TraceCheckUtils]: 61: Hoare triple {10218#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10243#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID
[2022-04-08 07:44:25,396 INFO L290 TraceCheckUtils]: 62: Hoare triple {10243#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10243#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID
[2022-04-08 07:44:25,396 INFO L290 TraceCheckUtils]: 63: Hoare triple {10243#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 100);havoc #t~post5; {10243#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID
[2022-04-08 07:44:25,397 INFO L272 TraceCheckUtils]: 64: Hoare triple {10243#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10048#true} is VALID
[2022-04-08 07:44:25,397 INFO L290 TraceCheckUtils]: 65: Hoare triple {10048#true} ~cond := #in~cond; {10048#true} is VALID
[2022-04-08 07:44:25,397 INFO L290 TraceCheckUtils]: 66: Hoare triple {10048#true} assume !(0 == ~cond); {10048#true} is VALID
[2022-04-08 07:44:25,397 INFO L290 TraceCheckUtils]: 67: Hoare triple {10048#true} assume true; {10048#true} is VALID
[2022-04-08 07:44:25,397 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10048#true} {10243#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} #51#return; {10243#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID
[2022-04-08 07:44:25,398 INFO L290 TraceCheckUtils]: 69: Hoare triple {10243#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10268#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} is VALID
[2022-04-08 07:44:25,398 INFO L290 TraceCheckUtils]: 70: Hoare triple {10268#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10268#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} is VALID
[2022-04-08 07:44:25,398 INFO L290 TraceCheckUtils]: 71: Hoare triple {10268#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} assume !!(#t~post5 < 100);havoc #t~post5; {10268#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} is VALID
[2022-04-08 07:44:25,398 INFO L272 TraceCheckUtils]: 72: Hoare triple {10268#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10048#true} is VALID
[2022-04-08 07:44:25,398 INFO L290 TraceCheckUtils]: 73: Hoare triple {10048#true} ~cond := #in~cond; {10048#true} is VALID
[2022-04-08 07:44:25,398 INFO L290 TraceCheckUtils]: 74: Hoare triple {10048#true} assume !(0 == ~cond); {10048#true} is VALID
[2022-04-08 07:44:25,399 INFO L290 TraceCheckUtils]: 75: Hoare triple {10048#true} assume true; {10048#true} is VALID
[2022-04-08 07:44:25,399 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {10048#true} {10268#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} #51#return; {10268#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} is VALID
[2022-04-08 07:44:25,400 INFO L290 TraceCheckUtils]: 77: Hoare triple {10268#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} assume !(~c~0 < ~k~0); {10293#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~k~0 8))} is VALID
[2022-04-08 07:44:25,400 INFO L272 TraceCheckUtils]: 78: Hoare triple {10293#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~k~0 8))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10297#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 07:44:25,401 INFO L290 TraceCheckUtils]: 79: Hoare triple {10297#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10301#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 07:44:25,401 INFO L290 TraceCheckUtils]: 80: Hoare triple {10301#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10049#false} is VALID
[2022-04-08 07:44:25,401 INFO L290 TraceCheckUtils]: 81: Hoare triple {10049#false} assume !false; {10049#false} is VALID
[2022-04-08 07:44:25,401 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 18 proven. 144 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked.
[2022-04-08 07:44:25,401 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 07:44:25,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 07:44:25,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196698029]
[2022-04-08 07:44:25,602 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-08 07:44:25,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151560680]
[2022-04-08 07:44:25,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151560680] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 07:44:25,602 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences.
[2022-04-08 07:44:25,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14
[2022-04-08 07:44:25,602 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 07:44:25,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1412057079]
[2022-04-08 07:44:25,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1412057079] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 07:44:25,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 07:44:25,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2022-04-08 07:44:25,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420347785]
[2022-04-08 07:44:25,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 07:44:25,603 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 82
[2022-04-08 07:44:25,605 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 07:44:25,605 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2022-04-08 07:44:25,631 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:44:25,631 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2022-04-08 07:44:25,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 07:44:25,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2022-04-08 07:44:25,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272
[2022-04-08 07:44:25,632 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2022-04-08 07:44:26,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:44:26,464 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions.
[2022-04-08 07:44:26,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2022-04-08 07:44:26,464 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 82
[2022-04-08 07:44:26,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 07:44:26,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2022-04-08 07:44:26,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 69 transitions.
[2022-04-08 07:44:26,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2022-04-08 07:44:26,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 69 transitions.
[2022-04-08 07:44:26,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 69 transitions.
[2022-04-08 07:44:26,515 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:44:26,516 INFO L225 Difference]: With dead ends: 92
[2022-04-08 07:44:26,516 INFO L226 Difference]: Without dead ends: 87
[2022-04-08 07:44:26,516 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342
[2022-04-08 07:44:26,517 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 2 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2022-04-08 07:44:26,517 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 408 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2022-04-08 07:44:26,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states.
[2022-04-08 07:44:26,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87.
[2022-04-08 07:44:26,620 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 07:44:26,620 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 87 states, 63 states have (on average 1.0317460317460319) internal successors, (65), 63 states have internal predecessors, (65), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2022-04-08 07:44:26,620 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 87 states, 63 states have (on average 1.0317460317460319) internal successors, (65), 63 states have internal predecessors, (65), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2022-04-08 07:44:26,620 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 87 states, 63 states have (on average 1.0317460317460319) internal successors, (65), 63 states have internal predecessors, (65), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2022-04-08 07:44:26,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:44:26,621 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions.
[2022-04-08 07:44:26,621 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions.
[2022-04-08 07:44:26,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 07:44:26,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 07:44:26,622 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 63 states have (on average 1.0317460317460319) internal successors, (65), 63 states have internal predecessors, (65), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 87 states.
[2022-04-08 07:44:26,622 INFO L87 Difference]: Start difference. First operand has 87 states, 63 states have (on average 1.0317460317460319) internal successors, (65), 63 states have internal predecessors, (65), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 87 states.
[2022-04-08 07:44:26,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 07:44:26,623 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions.
[2022-04-08 07:44:26,623 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions.
[2022-04-08 07:44:26,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 07:44:26,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 07:44:26,623 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 07:44:26,623 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 07:44:26,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 63 states have (on average 1.0317460317460319) internal successors, (65), 63 states have internal predecessors, (65), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2022-04-08 07:44:26,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions.
[2022-04-08 07:44:26,624 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 82
[2022-04-08 07:44:26,624 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 07:44:26,624 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions.
[2022-04-08 07:44:26,625 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2022-04-08 07:44:26,625 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 89 transitions.
[2022-04-08 07:44:26,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 07:44:26,743 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions.
[2022-04-08 07:44:26,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2022-04-08 07:44:26,743 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 07:44:26,744 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 07:44:26,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0
[2022-04-08 07:44:26,944 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 07:44:26,944 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 07:44:26,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 07:44:26,944 INFO L85 PathProgramCache]: Analyzing trace with hash -2095421916, now seen corresponding path program 17 times
[2022-04-08 07:44:26,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 07:44:26,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [525344531]
[2022-04-08 07:44:27,013 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult
[2022-04-08 07:44:27,013 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE
[2022-04-08 07:44:27,013 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 07:44:27,013 INFO L85 PathProgramCache]: Analyzing trace with hash -2095421916, now seen corresponding path program 18 times
[2022-04-08 07:44:27,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 07:44:27,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501556263]
[2022-04-08 07:44:27,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 07:44:27,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 07:44:27,025 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-08 07:44:27,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1525436035]
[2022-04-08 07:44:27,025 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2022-04-08 07:44:27,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 07:44:27,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 07:44:27,026 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 07:44:27,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process