/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_unwindbound2.c
--------------------------------------------------------------------------------
This is Ultimate 0.2.2-dev-e106359-m
[2022-04-15 10:44:56,430 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-04-15 10:44:56,431 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-04-15 10:44:56,460 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-04-15 10:44:56,460 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-04-15 10:44:56,461 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-04-15 10:44:56,465 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-04-15 10:44:56,466 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-04-15 10:44:56,467 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-04-15 10:44:56,468 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-04-15 10:44:56,468 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-04-15 10:44:56,469 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-04-15 10:44:56,469 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-04-15 10:44:56,469 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-04-15 10:44:56,470 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-04-15 10:44:56,471 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-04-15 10:44:56,471 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-04-15 10:44:56,472 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-04-15 10:44:56,473 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-04-15 10:44:56,474 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-04-15 10:44:56,475 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values
[2022-04-15 10:44:56,484 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-04-15 10:44:56,487 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-04-15 10:44:56,488 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-04-15 10:44:56,491 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-04-15 10:44:56,496 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-04-15 10:44:56,496 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-04-15 10:44:56,496 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-04-15 10:44:56,497 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-04-15 10:44:56,497 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-04-15 10:44:56,498 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-04-15 10:44:56,498 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-04-15 10:44:56,498 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-04-15 10:44:56,498 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-04-15 10:44:56,499 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-04-15 10:44:56,499 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-04-15 10:44:56,500 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-04-15 10:44:56,500 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-04-15 10:44:56,500 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-04-15 10:44:56,500 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-04-15 10:44:56,501 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-04-15 10:44:56,501 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-04-15 10:44:56,502 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf
[2022-04-15 10:44:56,508 INFO L113 SettingsManager]: Loading preferences was successful
[2022-04-15 10:44:56,508 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-04-15 10:44:56,509 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-04-15 10:44:56,509 INFO L138 SettingsManager]: * sizeof long=4
[2022-04-15 10:44:56,509 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-04-15 10:44:56,509 INFO L138 SettingsManager]: * sizeof POINTER=4
[2022-04-15 10:44:56,509 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-04-15 10:44:56,509 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-04-15 10:44:56,509 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-04-15 10:44:56,509 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-04-15 10:44:56,510 INFO L138 SettingsManager]: * sizeof long double=12
[2022-04-15 10:44:56,510 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-04-15 10:44:56,510 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-04-15 10:44:56,510 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-04-15 10:44:56,510 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-04-15 10:44:56,510 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-04-15 10:44:56,510 INFO L138 SettingsManager]: * To the following directory=./dump/
[2022-04-15 10:44:56,510 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-04-15 10:44:56,510 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-15 10:44:56,510 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-04-15 10:44:56,510 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation
[2022-04-15 10:44:56,511 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION
[2022-04-15 10:44:56,511 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL
[2022-04-15 10:44:56,511 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-04-15 10:44:56,511 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN
[2022-04-15 10:44:56,511 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-15 10:44:56,704 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-04-15 10:44:56,716 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-04-15 10:44:56,717 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-04-15 10:44:56,718 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-04-15 10:44:56,719 INFO L275 PluginConnector]: CDTParser initialized
[2022-04-15 10:44:56,720 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound2.c
[2022-04-15 10:44:56,768 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/946aecf59/f143a850ebcf45378601bbab3953d0ed/FLAG1611f684c
[2022-04-15 10:44:57,108 INFO L306 CDTParser]: Found 1 translation units.
[2022-04-15 10:44:57,109 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound2.c
[2022-04-15 10:44:57,112 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/946aecf59/f143a850ebcf45378601bbab3953d0ed/FLAG1611f684c
[2022-04-15 10:44:57,120 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/946aecf59/f143a850ebcf45378601bbab3953d0ed
[2022-04-15 10:44:57,122 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-04-15 10:44:57,123 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2022-04-15 10:44:57,131 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-04-15 10:44:57,132 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-04-15 10:44:57,135 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-04-15 10:44:57,138 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 10:44:57" (1/1) ...
[2022-04-15 10:44:57,139 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cbb7156 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:44:57, skipping insertion in model container
[2022-04-15 10:44:57,139 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 10:44:57" (1/1) ...
[2022-04-15 10:44:57,145 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-04-15 10:44:57,156 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-04-15 10:44:57,270 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_unwindbound2.c[458,471]
[2022-04-15 10:44:57,318 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-15 10:44:57,323 INFO L203 MainTranslator]: Completed pre-run
[2022-04-15 10:44:57,334 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_unwindbound2.c[458,471]
[2022-04-15 10:44:57,348 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-15 10:44:57,357 INFO L208 MainTranslator]: Completed translation
[2022-04-15 10:44:57,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:44:57 WrapperNode
[2022-04-15 10:44:57,358 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-04-15 10:44:57,358 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-04-15 10:44:57,358 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-04-15 10:44:57,358 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-04-15 10:44:57,366 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:44:57" (1/1) ...
[2022-04-15 10:44:57,366 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:44:57" (1/1) ...
[2022-04-15 10:44:57,372 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:44:57" (1/1) ...
[2022-04-15 10:44:57,372 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:44:57" (1/1) ...
[2022-04-15 10:44:57,382 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:44:57" (1/1) ...
[2022-04-15 10:44:57,386 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:44:57" (1/1) ...
[2022-04-15 10:44:57,387 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:44:57" (1/1) ...
[2022-04-15 10:44:57,390 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-04-15 10:44:57,391 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-04-15 10:44:57,391 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-04-15 10:44:57,391 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-04-15 10:44:57,392 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:44:57" (1/1) ...
[2022-04-15 10:44:57,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-15 10:44:57,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 10:44:57,410 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-15 10:44:57,411 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-15 10:44:57,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2022-04-15 10:44:57,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-04-15 10:44:57,442 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error
[2022-04-15 10:44:57,442 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2022-04-15 10:44:57,442 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2022-04-15 10:44:57,442 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2022-04-15 10:44:57,442 INFO L130 BoogieDeclarations]: Found specification of procedure abort
[2022-04-15 10:44:57,442 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail
[2022-04-15 10:44:57,443 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error
[2022-04-15 10:44:57,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-04-15 10:44:57,443 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short
[2022-04-15 10:44:57,444 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2022-04-15 10:44:57,444 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2022-04-15 10:44:57,444 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2022-04-15 10:44:57,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2022-04-15 10:44:57,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-04-15 10:44:57,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-04-15 10:44:57,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2022-04-15 10:44:57,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2022-04-15 10:44:57,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-04-15 10:44:57,488 INFO L234 CfgBuilder]: Building ICFG
[2022-04-15 10:44:57,490 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-04-15 10:44:57,593 INFO L275 CfgBuilder]: Performing block encoding
[2022-04-15 10:44:57,598 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-04-15 10:44:57,598 INFO L299 CfgBuilder]: Removed 1 assume(true) statements.
[2022-04-15 10:44:57,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 10:44:57 BoogieIcfgContainer
[2022-04-15 10:44:57,600 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-04-15 10:44:57,601 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-04-15 10:44:57,601 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-04-15 10:44:57,612 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-04-15 10:44:57,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 10:44:57" (1/3) ...
[2022-04-15 10:44:57,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37392276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 10:44:57, skipping insertion in model container
[2022-04-15 10:44:57,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:44:57" (2/3) ...
[2022-04-15 10:44:57,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37392276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 10:44:57, skipping insertion in model container
[2022-04-15 10:44:57,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 10:44:57" (3/3) ...
[2022-04-15 10:44:57,615 INFO L111 eAbstractionObserver]: Analyzing ICFG ps4-ll_unwindbound2.c
[2022-04-15 10:44:57,619 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION
[2022-04-15 10:44:57,619 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2022-04-15 10:44:57,658 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-04-15 10:44:57,663 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-15 10:44:57,663 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-04-15 10:44:57,684 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-15 10:44:57,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2022-04-15 10:44:57,689 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 10:44:57,689 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-15 10:44:57,690 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 10:44:57,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 10:44:57,694 INFO L85 PathProgramCache]: Analyzing trace with hash -2133548928, now seen corresponding path program 1 times
[2022-04-15 10:44:57,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 10:44:57,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1370857395]
[2022-04-15 10:44:57,723 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 10:44:57,723 INFO L85 PathProgramCache]: Analyzing trace with hash -2133548928, now seen corresponding path program 2 times
[2022-04-15 10:44:57,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 10:44:57,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209773664]
[2022-04-15 10:44:57,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 10:44:57,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 10:44:57,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 10:44:57,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-15 10:44:57,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 10:44:57,866 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-15 10:44:57,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID
[2022-04-15 10:44:57,866 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #57#return; {26#true} is VALID
[2022-04-15 10:44:57,870 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-15 10:44:57,870 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-15 10:44:57,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID
[2022-04-15 10:44:57,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #57#return; {26#true} is VALID
[2022-04-15 10:44:57,870 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret6 := main(); {26#true} is VALID
[2022-04-15 10:44:57,871 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-15 10:44:57,871 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} assume !true; {27#false} is VALID
[2022-04-15 10:44:57,871 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-15 10:44:57,872 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID
[2022-04-15 10:44:57,872 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID
[2022-04-15 10:44:57,872 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#false} assume !false; {27#false} is VALID
[2022-04-15 10:44:57,872 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-15 10:44:57,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 10:44:57,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209773664]
[2022-04-15 10:44:57,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209773664] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 10:44:57,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 10:44:57,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-04-15 10:44:57,875 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 10:44:57,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1370857395]
[2022-04-15 10:44:57,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1370857395] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 10:44:57,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 10:44:57,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-04-15 10:44:57,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640489419]
[2022-04-15 10:44:57,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 10:44:57,880 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-15 10:44:57,883 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 10:44:57,885 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-15 10:44:57,913 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-15 10:44:57,913 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-04-15 10:44:57,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 10:44:57,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-04-15 10:44:57,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-04-15 10:44:57,929 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-15 10:44:58,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 10:44:58,052 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions.
[2022-04-15 10:44:58,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-04-15 10:44:58,052 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-15 10:44:58,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 10:44:58,053 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-15 10:44:58,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions.
[2022-04-15 10:44:58,059 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-15 10:44:58,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions.
[2022-04-15 10:44:58,062 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 55 transitions.
[2022-04-15 10:44:58,137 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-15 10:44:58,142 INFO L225 Difference]: With dead ends: 41
[2022-04-15 10:44:58,142 INFO L226 Difference]: Without dead ends: 19
[2022-04-15 10:44:58,144 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-15 10:44:58,147 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-15 10:44:58,147 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-15 10:44:58,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states.
[2022-04-15 10:44:58,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18.
[2022-04-15 10:44:58,171 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 10:44:58,172 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-15 10:44:58,172 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-15 10:44:58,172 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-15 10:44:58,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 10:44:58,175 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions.
[2022-04-15 10:44:58,175 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions.
[2022-04-15 10:44:58,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 10:44:58,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 10:44:58,176 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-15 10:44:58,176 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-15 10:44:58,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 10:44:58,182 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions.
[2022-04-15 10:44:58,182 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions.
[2022-04-15 10:44:58,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 10:44:58,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 10:44:58,183 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 10:44:58,183 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 10:44:58,183 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-15 10:44:58,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions.
[2022-04-15 10:44:58,186 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 11
[2022-04-15 10:44:58,186 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 10:44:58,186 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions.
[2022-04-15 10:44:58,186 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-15 10:44:58,186 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 21 transitions.
[2022-04-15 10:44:58,209 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-15 10:44:58,209 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions.
[2022-04-15 10:44:58,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2022-04-15 10:44:58,212 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 10:44:58,213 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-15 10:44:58,213 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-04-15 10:44:58,213 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 10:44:58,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 10:44:58,214 INFO L85 PathProgramCache]: Analyzing trace with hash -2118701623, now seen corresponding path program 1 times
[2022-04-15 10:44:58,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 10:44:58,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1451892741]
[2022-04-15 10:44:58,215 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 10:44:58,215 INFO L85 PathProgramCache]: Analyzing trace with hash -2118701623, now seen corresponding path program 2 times
[2022-04-15 10:44:58,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 10:44:58,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17300202]
[2022-04-15 10:44:58,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 10:44:58,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 10:44:58,255 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-15 10:44:58,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [88370470]
[2022-04-15 10:44:58,255 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-15 10:44:58,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 10:44:58,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 10:44:58,257 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-15 10:44:58,258 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-15 10:44:58,299 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2022-04-15 10:44:58,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-15 10:44:58,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core
[2022-04-15 10:44:58,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 10:44:58,311 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-15 10:44:58,419 INFO L272 TraceCheckUtils]: 0: Hoare triple {190#true} call ULTIMATE.init(); {190#true} is VALID
[2022-04-15 10:44:58,420 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-15 10:44:58,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {198#(<= ~counter~0 0)} assume true; {198#(<= ~counter~0 0)} is VALID
[2022-04-15 10:44:58,421 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {198#(<= ~counter~0 0)} {190#true} #57#return; {198#(<= ~counter~0 0)} is VALID
[2022-04-15 10:44:58,423 INFO L272 TraceCheckUtils]: 4: Hoare triple {198#(<= ~counter~0 0)} call #t~ret6 := main(); {198#(<= ~counter~0 0)} is VALID
[2022-04-15 10:44:58,424 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-15 10:44:58,424 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-15 10:44:58,425 INFO L290 TraceCheckUtils]: 7: Hoare triple {214#(<= |main_#t~post5| 0)} assume !(#t~post5 < 2);havoc #t~post5; {191#false} is VALID
[2022-04-15 10:44:58,425 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-15 10:44:58,425 INFO L290 TraceCheckUtils]: 9: Hoare triple {191#false} ~cond := #in~cond; {191#false} is VALID
[2022-04-15 10:44:58,425 INFO L290 TraceCheckUtils]: 10: Hoare triple {191#false} assume 0 == ~cond; {191#false} is VALID
[2022-04-15 10:44:58,425 INFO L290 TraceCheckUtils]: 11: Hoare triple {191#false} assume !false; {191#false} is VALID
[2022-04-15 10:44:58,426 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-15 10:44:58,426 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-15 10:44:58,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 10:44:58,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17300202]
[2022-04-15 10:44:58,426 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-15 10:44:58,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88370470]
[2022-04-15 10:44:58,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88370470] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 10:44:58,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 10:44:58,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-15 10:44:58,428 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 10:44:58,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1451892741]
[2022-04-15 10:44:58,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1451892741] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 10:44:58,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 10:44:58,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-15 10:44:58,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676273499]
[2022-04-15 10:44:58,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 10:44:58,429 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-15 10:44:58,430 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 10:44:58,430 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-15 10:44:58,440 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-15 10:44:58,440 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-15 10:44:58,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 10:44:58,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-15 10:44:58,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-15 10:44:58,442 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-15 10:44:58,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 10:44:58,498 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions.
[2022-04-15 10:44:58,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-15 10:44:58,498 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-15 10:44:58,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 10:44:58,499 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-15 10:44:58,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions.
[2022-04-15 10:44:58,503 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-15 10:44:58,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions.
[2022-04-15 10:44:58,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 32 transitions.
[2022-04-15 10:44:58,537 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-15 10:44:58,540 INFO L225 Difference]: With dead ends: 28
[2022-04-15 10:44:58,540 INFO L226 Difference]: Without dead ends: 20
[2022-04-15 10:44:58,541 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-15 10:44:58,543 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-15 10:44:58,547 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-15 10:44:58,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states.
[2022-04-15 10:44:58,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20.
[2022-04-15 10:44:58,561 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 10:44:58,562 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-15 10:44:58,563 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-15 10:44:58,563 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-15 10:44:58,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 10:44:58,565 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions.
[2022-04-15 10:44:58,565 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions.
[2022-04-15 10:44:58,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 10:44:58,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 10:44:58,567 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-15 10:44:58,567 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-15 10:44:58,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 10:44:58,576 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions.
[2022-04-15 10:44:58,576 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions.
[2022-04-15 10:44:58,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 10:44:58,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 10:44:58,577 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 10:44:58,577 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 10:44:58,577 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-15 10:44:58,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions.
[2022-04-15 10:44:58,579 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 12
[2022-04-15 10:44:58,579 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 10:44:58,579 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions.
[2022-04-15 10:44:58,579 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-15 10:44:58,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 23 transitions.
[2022-04-15 10:44:58,597 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-15 10:44:58,598 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions.
[2022-04-15 10:44:58,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2022-04-15 10:44:58,599 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 10:44:58,599 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-15 10:44:58,616 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-15 10:44:58,813 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-15 10:44:58,813 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 10:44:58,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 10:44:58,814 INFO L85 PathProgramCache]: Analyzing trace with hash -2116914163, now seen corresponding path program 1 times
[2022-04-15 10:44:58,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 10:44:58,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1501117222]
[2022-04-15 10:44:58,814 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 10:44:58,814 INFO L85 PathProgramCache]: Analyzing trace with hash -2116914163, now seen corresponding path program 2 times
[2022-04-15 10:44:58,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 10:44:58,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905268296]
[2022-04-15 10:44:58,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 10:44:58,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 10:44:58,826 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-15 10:44:58,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [27215632]
[2022-04-15 10:44:58,826 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-15 10:44:58,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 10:44:58,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 10:44:58,840 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-15 10:44:58,859 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-15 10:44:58,896 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2022-04-15 10:44:58,896 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-15 10:44:58,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjunts are in the unsatisfiable core
[2022-04-15 10:44:58,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 10:44:58,906 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-15 10:44:59,003 INFO L272 TraceCheckUtils]: 0: Hoare triple {365#true} call ULTIMATE.init(); {365#true} is VALID
[2022-04-15 10:44:59,003 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-15 10:44:59,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {365#true} assume true; {365#true} is VALID
[2022-04-15 10:44:59,004 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {365#true} {365#true} #57#return; {365#true} is VALID
[2022-04-15 10:44:59,004 INFO L272 TraceCheckUtils]: 4: Hoare triple {365#true} call #t~ret6 := main(); {365#true} is VALID
[2022-04-15 10:44:59,004 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-15 10:44:59,005 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-15 10:44:59,005 INFO L290 TraceCheckUtils]: 7: Hoare triple {385#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 2);havoc #t~post5; {385#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID
[2022-04-15 10:44:59,006 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-15 10:44:59,007 INFO L290 TraceCheckUtils]: 9: Hoare triple {395#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {399#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-15 10:44:59,007 INFO L290 TraceCheckUtils]: 10: Hoare triple {399#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {366#false} is VALID
[2022-04-15 10:44:59,007 INFO L290 TraceCheckUtils]: 11: Hoare triple {366#false} assume !false; {366#false} is VALID
[2022-04-15 10:44:59,007 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-15 10:44:59,008 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-15 10:44:59,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 10:44:59,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905268296]
[2022-04-15 10:44:59,008 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-15 10:44:59,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27215632]
[2022-04-15 10:44:59,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27215632] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 10:44:59,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 10:44:59,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-15 10:44:59,009 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 10:44:59,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1501117222]
[2022-04-15 10:44:59,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1501117222] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 10:44:59,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 10:44:59,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-15 10:44:59,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46199366]
[2022-04-15 10:44:59,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 10:44:59,010 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-15 10:44:59,010 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 10:44:59,010 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-15 10:44:59,018 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-15 10:44:59,018 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-04-15 10:44:59,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 10:44:59,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-04-15 10:44:59,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2022-04-15 10:44:59,020 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-15 10:44:59,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 10:44:59,121 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions.
[2022-04-15 10:44:59,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2022-04-15 10:44:59,121 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-15 10:44:59,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 10:44:59,121 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-15 10:44:59,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions.
[2022-04-15 10:44:59,124 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-15 10:44:59,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions.
[2022-04-15 10:44:59,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 35 transitions.
[2022-04-15 10:44:59,148 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-15 10:44:59,150 INFO L225 Difference]: With dead ends: 30
[2022-04-15 10:44:59,150 INFO L226 Difference]: Without dead ends: 26
[2022-04-15 10:44:59,151 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-15 10:44:59,160 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-15 10:44:59,161 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-15 10:44:59,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states.
[2022-04-15 10:44:59,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26.
[2022-04-15 10:44:59,173 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 10:44:59,174 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-15 10:44:59,176 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-15 10:44:59,176 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-15 10:44:59,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 10:44:59,181 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions.
[2022-04-15 10:44:59,181 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions.
[2022-04-15 10:44:59,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 10:44:59,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 10:44:59,182 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-15 10:44:59,182 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-15 10:44:59,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 10:44:59,185 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions.
[2022-04-15 10:44:59,185 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions.
[2022-04-15 10:44:59,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 10:44:59,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 10:44:59,187 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 10:44:59,187 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 10:44:59,187 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-15 10:44:59,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions.
[2022-04-15 10:44:59,189 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 12
[2022-04-15 10:44:59,189 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 10:44:59,189 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions.
[2022-04-15 10:44:59,190 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-15 10:44:59,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 29 transitions.
[2022-04-15 10:44:59,213 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-15 10:44:59,213 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions.
[2022-04-15 10:44:59,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2022-04-15 10:44:59,216 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 10:44:59,216 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-15 10:44:59,233 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-15 10:44:59,433 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-15 10:44:59,433 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 10:44:59,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 10:44:59,434 INFO L85 PathProgramCache]: Analyzing trace with hash -263585780, now seen corresponding path program 1 times
[2022-04-15 10:44:59,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 10:44:59,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [967878601]
[2022-04-15 10:44:59,604 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult
[2022-04-15 10:44:59,605 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE
[2022-04-15 10:44:59,605 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-15 10:44:59,605 INFO L85 PathProgramCache]: Analyzing trace with hash -263585780, now seen corresponding path program 2 times
[2022-04-15 10:44:59,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 10:44:59,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586725417]
[2022-04-15 10:44:59,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 10:44:59,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 10:44:59,615 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-15 10:44:59,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [686776301]
[2022-04-15 10:44:59,615 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-15 10:44:59,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 10:44:59,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 10:44:59,620 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-15 10:44:59,620 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-15 10:44:59,655 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-15 10:44:59,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-15 10:44:59,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core
[2022-04-15 10:44:59,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 10:44:59,665 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-15 10:44:59,775 INFO L272 TraceCheckUtils]: 0: Hoare triple {571#true} call ULTIMATE.init(); {571#true} is VALID
[2022-04-15 10:44:59,775 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-15 10:44:59,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {579#(<= ~counter~0 0)} assume true; {579#(<= ~counter~0 0)} is VALID
[2022-04-15 10:44:59,777 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {579#(<= ~counter~0 0)} {571#true} #57#return; {579#(<= ~counter~0 0)} is VALID
[2022-04-15 10:44:59,777 INFO L272 TraceCheckUtils]: 4: Hoare triple {579#(<= ~counter~0 0)} call #t~ret6 := main(); {579#(<= ~counter~0 0)} is VALID
[2022-04-15 10:44:59,780 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-15 10:44:59,781 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-15 10:44:59,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {595#(<= ~counter~0 1)} assume !!(#t~post5 < 2);havoc #t~post5; {595#(<= ~counter~0 1)} is VALID
[2022-04-15 10:44:59,800 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-15 10:44:59,801 INFO L290 TraceCheckUtils]: 9: Hoare triple {595#(<= ~counter~0 1)} ~cond := #in~cond; {595#(<= ~counter~0 1)} is VALID
[2022-04-15 10:44:59,801 INFO L290 TraceCheckUtils]: 10: Hoare triple {595#(<= ~counter~0 1)} assume !(0 == ~cond); {595#(<= ~counter~0 1)} is VALID
[2022-04-15 10:44:59,802 INFO L290 TraceCheckUtils]: 11: Hoare triple {595#(<= ~counter~0 1)} assume true; {595#(<= ~counter~0 1)} is VALID
[2022-04-15 10:44:59,805 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {595#(<= ~counter~0 1)} {595#(<= ~counter~0 1)} #51#return; {595#(<= ~counter~0 1)} is VALID
[2022-04-15 10:44:59,806 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-15 10:44:59,806 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-15 10:44:59,807 INFO L290 TraceCheckUtils]: 15: Hoare triple {620#(<= |main_#t~post5| 1)} assume !(#t~post5 < 2);havoc #t~post5; {572#false} is VALID
[2022-04-15 10:44:59,807 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-15 10:44:59,807 INFO L290 TraceCheckUtils]: 17: Hoare triple {572#false} ~cond := #in~cond; {572#false} is VALID
[2022-04-15 10:44:59,807 INFO L290 TraceCheckUtils]: 18: Hoare triple {572#false} assume 0 == ~cond; {572#false} is VALID
[2022-04-15 10:44:59,807 INFO L290 TraceCheckUtils]: 19: Hoare triple {572#false} assume !false; {572#false} is VALID
[2022-04-15 10:44:59,807 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-15 10:44:59,807 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-15 10:44:59,919 INFO L290 TraceCheckUtils]: 19: Hoare triple {572#false} assume !false; {572#false} is VALID
[2022-04-15 10:44:59,919 INFO L290 TraceCheckUtils]: 18: Hoare triple {572#false} assume 0 == ~cond; {572#false} is VALID
[2022-04-15 10:44:59,919 INFO L290 TraceCheckUtils]: 17: Hoare triple {572#false} ~cond := #in~cond; {572#false} is VALID
[2022-04-15 10:44:59,920 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-15 10:44:59,920 INFO L290 TraceCheckUtils]: 15: Hoare triple {620#(<= |main_#t~post5| 1)} assume !(#t~post5 < 2);havoc #t~post5; {572#false} is VALID
[2022-04-15 10:44:59,920 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-15 10:44:59,921 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-15 10:44:59,921 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {571#true} {595#(<= ~counter~0 1)} #51#return; {595#(<= ~counter~0 1)} is VALID
[2022-04-15 10:44:59,921 INFO L290 TraceCheckUtils]: 11: Hoare triple {571#true} assume true; {571#true} is VALID
[2022-04-15 10:44:59,922 INFO L290 TraceCheckUtils]: 10: Hoare triple {571#true} assume !(0 == ~cond); {571#true} is VALID
[2022-04-15 10:44:59,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {571#true} ~cond := #in~cond; {571#true} is VALID
[2022-04-15 10:44:59,922 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)); {571#true} is VALID
[2022-04-15 10:44:59,923 INFO L290 TraceCheckUtils]: 7: Hoare triple {595#(<= ~counter~0 1)} assume !!(#t~post5 < 2);havoc #t~post5; {595#(<= ~counter~0 1)} is VALID
[2022-04-15 10:44:59,923 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-15 10:44:59,924 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-15 10:44:59,924 INFO L272 TraceCheckUtils]: 4: Hoare triple {579#(<= ~counter~0 0)} call #t~ret6 := main(); {579#(<= ~counter~0 0)} is VALID
[2022-04-15 10:44:59,924 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {579#(<= ~counter~0 0)} {571#true} #57#return; {579#(<= ~counter~0 0)} is VALID
[2022-04-15 10:44:59,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {579#(<= ~counter~0 0)} assume true; {579#(<= ~counter~0 0)} is VALID
[2022-04-15 10:44:59,925 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-15 10:44:59,925 INFO L272 TraceCheckUtils]: 0: Hoare triple {571#true} call ULTIMATE.init(); {571#true} is VALID
[2022-04-15 10:44:59,925 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-15 10:44:59,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 10:44:59,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586725417]
[2022-04-15 10:44:59,926 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-15 10:44:59,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686776301]
[2022-04-15 10:44:59,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686776301] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-15 10:44:59,926 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2022-04-15 10:44:59,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5
[2022-04-15 10:44:59,926 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 10:44:59,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [967878601]
[2022-04-15 10:44:59,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [967878601] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 10:44:59,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 10:44:59,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-15 10:44:59,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017181554]
[2022-04-15 10:44:59,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 10:44:59,927 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-15 10:44:59,927 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 10:44:59,927 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-15 10:44:59,939 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-15 10:44:59,939 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-04-15 10:44:59,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 10:44:59,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-04-15 10:44:59,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2022-04-15 10:44:59,940 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-15 10:45:00,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 10:45:00,026 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions.
[2022-04-15 10:45:00,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2022-04-15 10:45:00,027 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-15 10:45:00,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 10:45:00,027 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-15 10:45:00,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions.
[2022-04-15 10:45:00,028 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-15 10:45:00,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions.
[2022-04-15 10:45:00,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions.
[2022-04-15 10:45:00,059 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-15 10:45:00,060 INFO L225 Difference]: With dead ends: 36
[2022-04-15 10:45:00,060 INFO L226 Difference]: Without dead ends: 28
[2022-04-15 10:45:00,060 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2022-04-15 10:45:00,061 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-15 10:45:00,061 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-15 10:45:00,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states.
[2022-04-15 10:45:00,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28.
[2022-04-15 10:45:00,075 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 10:45:00,075 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-15 10:45:00,075 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-15 10:45:00,076 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-15 10:45:00,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 10:45:00,077 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions.
[2022-04-15 10:45:00,077 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions.
[2022-04-15 10:45:00,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 10:45:00,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 10:45:00,078 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-15 10:45:00,078 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-15 10:45:00,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 10:45:00,079 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions.
[2022-04-15 10:45:00,079 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions.
[2022-04-15 10:45:00,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 10:45:00,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 10:45:00,080 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 10:45:00,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 10:45:00,080 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-15 10:45:00,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions.
[2022-04-15 10:45:00,081 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 20
[2022-04-15 10:45:00,081 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 10:45:00,081 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions.
[2022-04-15 10:45:00,082 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-15 10:45:00,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 31 transitions.
[2022-04-15 10:45:00,112 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-15 10:45:00,112 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions.
[2022-04-15 10:45:00,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2022-04-15 10:45:00,113 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 10:45:00,113 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-15 10:45:00,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2022-04-15 10:45:00,313 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-15 10:45:00,314 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 10:45:00,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 10:45:00,314 INFO L85 PathProgramCache]: Analyzing trace with hash -261798320, now seen corresponding path program 1 times
[2022-04-15 10:45:00,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 10:45:00,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [285281505]
[2022-04-15 10:45:00,460 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult
[2022-04-15 10:45:00,460 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE
[2022-04-15 10:45:00,460 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-15 10:45:00,460 INFO L85 PathProgramCache]: Analyzing trace with hash -261798320, now seen corresponding path program 2 times
[2022-04-15 10:45:00,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 10:45:00,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086382309]
[2022-04-15 10:45:00,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 10:45:00,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 10:45:00,492 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-15 10:45:00,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [70074096]
[2022-04-15 10:45:00,493 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-15 10:45:00,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 10:45:00,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 10:45:00,494 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-15 10:45:00,495 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-15 10:45:00,528 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-15 10:45:00,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-15 10:45:00,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 11 conjunts are in the unsatisfiable core
[2022-04-15 10:45:00,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 10:45:00,534 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-15 10:45:00,617 INFO L272 TraceCheckUtils]: 0: Hoare triple {881#true} call ULTIMATE.init(); {881#true} is VALID
[2022-04-15 10:45:00,617 INFO L290 TraceCheckUtils]: 1: Hoare triple {881#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; {881#true} is VALID
[2022-04-15 10:45:00,617 INFO L290 TraceCheckUtils]: 2: Hoare triple {881#true} assume true; {881#true} is VALID
[2022-04-15 10:45:00,617 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {881#true} {881#true} #57#return; {881#true} is VALID
[2022-04-15 10:45:00,618 INFO L272 TraceCheckUtils]: 4: Hoare triple {881#true} call #t~ret6 := main(); {881#true} is VALID
[2022-04-15 10:45:00,618 INFO L290 TraceCheckUtils]: 5: Hoare triple {881#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; {901#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID
[2022-04-15 10:45:00,619 INFO L290 TraceCheckUtils]: 6: Hoare triple {901#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {901#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID
[2022-04-15 10:45:00,619 INFO L290 TraceCheckUtils]: 7: Hoare triple {901#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 2);havoc #t~post5; {901#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID
[2022-04-15 10:45:00,619 INFO L272 TraceCheckUtils]: 8: Hoare triple {901#(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)); {881#true} is VALID
[2022-04-15 10:45:00,621 INFO L290 TraceCheckUtils]: 9: Hoare triple {881#true} ~cond := #in~cond; {881#true} is VALID
[2022-04-15 10:45:00,621 INFO L290 TraceCheckUtils]: 10: Hoare triple {881#true} assume !(0 == ~cond); {881#true} is VALID
[2022-04-15 10:45:00,621 INFO L290 TraceCheckUtils]: 11: Hoare triple {881#true} assume true; {881#true} is VALID
[2022-04-15 10:45:00,622 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {881#true} {901#(and (= main_~x~0 0) (= main_~y~0 0))} #51#return; {901#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID
[2022-04-15 10:45:00,623 INFO L290 TraceCheckUtils]: 13: Hoare triple {901#(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; {926#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} is VALID
[2022-04-15 10:45:00,623 INFO L290 TraceCheckUtils]: 14: Hoare triple {926#(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; {926#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} is VALID
[2022-04-15 10:45:00,623 INFO L290 TraceCheckUtils]: 15: Hoare triple {926#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} assume !!(#t~post5 < 2);havoc #t~post5; {926#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} is VALID
[2022-04-15 10:45:00,624 INFO L272 TraceCheckUtils]: 16: Hoare triple {926#(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)); {936#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-15 10:45:00,624 INFO L290 TraceCheckUtils]: 17: Hoare triple {936#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {940#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-15 10:45:00,625 INFO L290 TraceCheckUtils]: 18: Hoare triple {940#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {882#false} is VALID
[2022-04-15 10:45:00,625 INFO L290 TraceCheckUtils]: 19: Hoare triple {882#false} assume !false; {882#false} is VALID
[2022-04-15 10:45:00,625 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-15 10:45:00,625 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-15 10:45:00,833 INFO L290 TraceCheckUtils]: 19: Hoare triple {882#false} assume !false; {882#false} is VALID
[2022-04-15 10:45:00,833 INFO L290 TraceCheckUtils]: 18: Hoare triple {940#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {882#false} is VALID
[2022-04-15 10:45:00,833 INFO L290 TraceCheckUtils]: 17: Hoare triple {936#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {940#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-15 10:45:00,834 INFO L272 TraceCheckUtils]: 16: Hoare triple {956#(= (+ (* 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)); {936#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-15 10:45:00,835 INFO L290 TraceCheckUtils]: 15: Hoare triple {956#(= (+ (* 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 < 2);havoc #t~post5; {956#(= (+ (* 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-15 10:45:00,835 INFO L290 TraceCheckUtils]: 14: Hoare triple {956#(= (+ (* 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; {956#(= (+ (* 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-15 10:45:01,091 INFO L290 TraceCheckUtils]: 13: Hoare triple {956#(= (+ (* 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; {956#(= (+ (* 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-15 10:45:01,092 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {881#true} {956#(= (+ (* 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; {956#(= (+ (* 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-15 10:45:01,092 INFO L290 TraceCheckUtils]: 11: Hoare triple {881#true} assume true; {881#true} is VALID
[2022-04-15 10:45:01,092 INFO L290 TraceCheckUtils]: 10: Hoare triple {881#true} assume !(0 == ~cond); {881#true} is VALID
[2022-04-15 10:45:01,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {881#true} ~cond := #in~cond; {881#true} is VALID
[2022-04-15 10:45:01,092 INFO L272 TraceCheckUtils]: 8: Hoare triple {956#(= (+ (* 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)); {881#true} is VALID
[2022-04-15 10:45:01,093 INFO L290 TraceCheckUtils]: 7: Hoare triple {956#(= (+ (* 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 < 2);havoc #t~post5; {956#(= (+ (* 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-15 10:45:01,093 INFO L290 TraceCheckUtils]: 6: Hoare triple {956#(= (+ (* 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; {956#(= (+ (* 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-15 10:45:01,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {881#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; {956#(= (+ (* 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-15 10:45:01,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {881#true} call #t~ret6 := main(); {881#true} is VALID
[2022-04-15 10:45:01,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {881#true} {881#true} #57#return; {881#true} is VALID
[2022-04-15 10:45:01,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {881#true} assume true; {881#true} is VALID
[2022-04-15 10:45:01,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {881#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; {881#true} is VALID
[2022-04-15 10:45:01,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {881#true} call ULTIMATE.init(); {881#true} is VALID
[2022-04-15 10:45:01,094 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-15 10:45:01,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 10:45:01,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086382309]
[2022-04-15 10:45:01,095 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-15 10:45:01,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70074096]
[2022-04-15 10:45:01,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70074096] provided 1 perfect and 1 imperfect interpolant sequences
[2022-04-15 10:45:01,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2022-04-15 10:45:01,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7
[2022-04-15 10:45:01,095 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 10:45:01,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [285281505]
[2022-04-15 10:45:01,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [285281505] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 10:45:01,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 10:45:01,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-15 10:45:01,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825692273]
[2022-04-15 10:45:01,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 10:45:01,096 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-15 10:45:01,096 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 10:45:01,096 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-15 10:45:01,564 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-15 10:45:01,564 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-04-15 10:45:01,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 10:45:01,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-04-15 10:45:01,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2022-04-15 10:45:01,565 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-15 10:45:01,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 10:45:01,655 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions.
[2022-04-15 10:45:01,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2022-04-15 10:45:01,655 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-15 10:45:01,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 10:45:01,656 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-15 10:45:01,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions.
[2022-04-15 10:45:01,657 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-15 10:45:01,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions.
[2022-04-15 10:45:01,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 26 transitions.
[2022-04-15 10:45:02,129 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-15 10:45:02,129 INFO L225 Difference]: With dead ends: 34
[2022-04-15 10:45:02,129 INFO L226 Difference]: Without dead ends: 29
[2022-04-15 10:45:02,130 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-15 10:45:02,130 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-15 10:45:02,130 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-15 10:45:02,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states.
[2022-04-15 10:45:02,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29.
[2022-04-15 10:45:02,147 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 10:45:02,147 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-15 10:45:02,148 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-15 10:45:02,148 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-15 10:45:02,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 10:45:02,149 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions.
[2022-04-15 10:45:02,149 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions.
[2022-04-15 10:45:02,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 10:45:02,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 10:45:02,149 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-15 10:45:02,149 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-15 10:45:02,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 10:45:02,150 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions.
[2022-04-15 10:45:02,150 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions.
[2022-04-15 10:45:02,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 10:45:02,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 10:45:02,150 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 10:45:02,150 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 10:45:02,151 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-15 10:45:02,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions.
[2022-04-15 10:45:02,151 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 20
[2022-04-15 10:45:02,151 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 10:45:02,152 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions.
[2022-04-15 10:45:02,152 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-15 10:45:02,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 30 transitions.
[2022-04-15 10:45:02,796 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-15 10:45:02,797 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions.
[2022-04-15 10:45:02,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2022-04-15 10:45:02,797 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 10:45:02,797 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-15 10:45:02,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2022-04-15 10:45:02,998 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-15 10:45:02,998 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 10:45:02,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 10:45:02,998 INFO L85 PathProgramCache]: Analyzing trace with hash 891414954, now seen corresponding path program 1 times
[2022-04-15 10:45:02,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 10:45:02,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [722029043]
[2022-04-15 10:45:03,128 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult
[2022-04-15 10:45:03,128 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE
[2022-04-15 10:45:03,128 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-15 10:45:03,128 INFO L85 PathProgramCache]: Analyzing trace with hash 891414954, now seen corresponding path program 2 times
[2022-04-15 10:45:03,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 10:45:03,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893804391]
[2022-04-15 10:45:03,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 10:45:03,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 10:45:03,138 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-15 10:45:03,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1724241372]
[2022-04-15 10:45:03,138 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-15 10:45:03,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 10:45:03,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 10:45:03,139 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-15 10:45:03,140 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-15 10:45:03,176 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-15 10:45:03,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-15 10:45:03,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 12 conjunts are in the unsatisfiable core
[2022-04-15 10:45:03,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 10:45:03,195 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-15 10:45:03,429 INFO L272 TraceCheckUtils]: 0: Hoare triple {1193#true} call ULTIMATE.init(); {1193#true} is VALID
[2022-04-15 10:45:03,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {1193#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; {1193#true} is VALID
[2022-04-15 10:45:03,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {1193#true} assume true; {1193#true} is VALID
[2022-04-15 10:45:03,430 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1193#true} {1193#true} #57#return; {1193#true} is VALID
[2022-04-15 10:45:03,430 INFO L272 TraceCheckUtils]: 4: Hoare triple {1193#true} call #t~ret6 := main(); {1193#true} is VALID
[2022-04-15 10:45:03,439 INFO L290 TraceCheckUtils]: 5: Hoare triple {1193#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; {1213#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID
[2022-04-15 10:45:03,440 INFO L290 TraceCheckUtils]: 6: Hoare triple {1213#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1213#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID
[2022-04-15 10:45:03,441 INFO L290 TraceCheckUtils]: 7: Hoare triple {1213#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 2);havoc #t~post5; {1213#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID
[2022-04-15 10:45:03,441 INFO L272 TraceCheckUtils]: 8: Hoare triple {1213#(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)); {1193#true} is VALID
[2022-04-15 10:45:03,441 INFO L290 TraceCheckUtils]: 9: Hoare triple {1193#true} ~cond := #in~cond; {1193#true} is VALID
[2022-04-15 10:45:03,441 INFO L290 TraceCheckUtils]: 10: Hoare triple {1193#true} assume !(0 == ~cond); {1193#true} is VALID
[2022-04-15 10:45:03,441 INFO L290 TraceCheckUtils]: 11: Hoare triple {1193#true} assume true; {1193#true} is VALID
[2022-04-15 10:45:03,442 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1193#true} {1213#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {1213#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID
[2022-04-15 10:45:03,442 INFO L290 TraceCheckUtils]: 13: Hoare triple {1213#(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; {1238#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID
[2022-04-15 10:45:03,443 INFO L290 TraceCheckUtils]: 14: Hoare triple {1238#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1238#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID
[2022-04-15 10:45:03,443 INFO L290 TraceCheckUtils]: 15: Hoare triple {1238#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !!(#t~post5 < 2);havoc #t~post5; {1238#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID
[2022-04-15 10:45:03,443 INFO L272 TraceCheckUtils]: 16: Hoare triple {1238#(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)); {1193#true} is VALID
[2022-04-15 10:45:03,443 INFO L290 TraceCheckUtils]: 17: Hoare triple {1193#true} ~cond := #in~cond; {1193#true} is VALID
[2022-04-15 10:45:03,444 INFO L290 TraceCheckUtils]: 18: Hoare triple {1193#true} assume !(0 == ~cond); {1193#true} is VALID
[2022-04-15 10:45:03,444 INFO L290 TraceCheckUtils]: 19: Hoare triple {1193#true} assume true; {1193#true} is VALID
[2022-04-15 10:45:03,444 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1193#true} {1238#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #51#return; {1238#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID
[2022-04-15 10:45:03,445 INFO L290 TraceCheckUtils]: 21: Hoare triple {1238#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {1263#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID
[2022-04-15 10:45:03,446 INFO L272 TraceCheckUtils]: 22: Hoare triple {1263#(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)); {1267#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-15 10:45:03,446 INFO L290 TraceCheckUtils]: 23: Hoare triple {1267#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1271#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-15 10:45:03,447 INFO L290 TraceCheckUtils]: 24: Hoare triple {1271#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1194#false} is VALID
[2022-04-15 10:45:03,447 INFO L290 TraceCheckUtils]: 25: Hoare triple {1194#false} assume !false; {1194#false} is VALID
[2022-04-15 10:45:03,447 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-15 10:45:03,447 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-15 10:45:03,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 10:45:03,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893804391]
[2022-04-15 10:45:03,748 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-15 10:45:03,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724241372]
[2022-04-15 10:45:03,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724241372] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-15 10:45:03,748 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences.
[2022-04-15 10:45:03,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7
[2022-04-15 10:45:03,748 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 10:45:03,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [722029043]
[2022-04-15 10:45:03,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [722029043] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 10:45:03,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 10:45:03,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2022-04-15 10:45:03,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886712270]
[2022-04-15 10:45:03,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 10:45:03,749 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-15 10:45:03,749 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 10:45:03,750 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-15 10:45:03,771 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-15 10:45:03,771 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2022-04-15 10:45:03,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 10:45:03,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2022-04-15 10:45:03,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2022-04-15 10:45:03,772 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-15 10:45:03,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 10:45:03,956 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions.
[2022-04-15 10:45:03,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2022-04-15 10:45:03,957 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-15 10:45:03,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 10:45:03,957 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-15 10:45:03,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions.
[2022-04-15 10:45:03,958 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-15 10:45:03,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions.
[2022-04-15 10:45:03,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 34 transitions.
[2022-04-15 10:45:03,987 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-15 10:45:03,988 INFO L225 Difference]: With dead ends: 36
[2022-04-15 10:45:03,988 INFO L226 Difference]: Without dead ends: 31
[2022-04-15 10:45:03,989 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-15 10:45:03,989 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-15 10:45:03,989 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-15 10:45:03,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states.
[2022-04-15 10:45:04,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31.
[2022-04-15 10:45:04,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 10:45:04,013 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-15 10:45:04,013 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-15 10:45:04,013 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-15 10:45:04,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 10:45:04,014 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions.
[2022-04-15 10:45:04,014 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions.
[2022-04-15 10:45:04,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 10:45:04,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 10:45:04,015 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-15 10:45:04,015 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-15 10:45:04,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 10:45:04,016 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions.
[2022-04-15 10:45:04,016 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions.
[2022-04-15 10:45:04,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 10:45:04,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 10:45:04,016 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 10:45:04,016 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 10:45:04,017 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-15 10:45:04,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions.
[2022-04-15 10:45:04,018 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 26
[2022-04-15 10:45:04,018 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 10:45:04,018 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions.
[2022-04-15 10:45:04,018 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-15 10:45:04,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 33 transitions.
[2022-04-15 10:45:04,671 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-15 10:45:04,672 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions.
[2022-04-15 10:45:04,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2022-04-15 10:45:04,672 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 10:45:04,672 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-15 10:45:04,694 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-15 10:45:04,873 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-15 10:45:04,873 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 10:45:04,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 10:45:04,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1647059121, now seen corresponding path program 3 times
[2022-04-15 10:45:04,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 10:45:04,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1545015603]
[2022-04-15 10:45:04,991 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult
[2022-04-15 10:45:04,991 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE
[2022-04-15 10:45:04,991 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-15 10:45:04,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1647059121, now seen corresponding path program 4 times
[2022-04-15 10:45:04,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 10:45:04,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462606828]
[2022-04-15 10:45:04,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 10:45:04,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 10:45:05,001 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-15 10:45:05,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2002179765]
[2022-04-15 10:45:05,001 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-04-15 10:45:05,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 10:45:05,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 10:45:05,016 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-15 10:45:05,017 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-15 10:45:05,057 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-04-15 10:45:05,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat
[2022-04-15 10:45:05,057 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-04-15 10:45:05,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-04-15 10:45:05,082 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2022-04-15 10:45:05,083 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace
[2022-04-15 10:45:05,083 INFO L618 BasicCegarLoop]: Counterexample is feasible
[2022-04-15 10:45:05,085 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2022-04-15 10:45:05,131 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-15 10:45:05,286 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-15 10:45:05,290 INFO L719 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 2, 2]
[2022-04-15 10:45:05,292 INFO L177 ceAbstractionStarter]: Computing trace abstraction results
[2022-04-15 10:45:05,302 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation
[2022-04-15 10:45:05,302 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation
[2022-04-15 10:45:05,302 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation
[2022-04-15 10:45:05,302 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation
[2022-04-15 10:45:05,302 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation
[2022-04-15 10:45:05,303 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation
[2022-04-15 10:45:05,303 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation
[2022-04-15 10:45:05,303 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation
[2022-04-15 10:45:05,303 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation
[2022-04-15 10:45:05,303 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation
[2022-04-15 10:45:05,303 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation
[2022-04-15 10:45:05,303 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation
[2022-04-15 10:45:05,303 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation
[2022-04-15 10:45:05,303 WARN L170 areAnnotationChecker]: L27-3 has no Hoare annotation
[2022-04-15 10:45:05,303 WARN L170 areAnnotationChecker]: L27-3 has no Hoare annotation
[2022-04-15 10:45:05,303 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation
[2022-04-15 10:45:05,303 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation
[2022-04-15 10:45:05,303 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation
[2022-04-15 10:45:05,303 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation
[2022-04-15 10:45:05,303 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation
[2022-04-15 10:45:05,303 WARN L170 areAnnotationChecker]: L27-4 has no Hoare annotation
[2022-04-15 10:45:05,303 WARN L170 areAnnotationChecker]: L27-4 has no Hoare annotation
[2022-04-15 10:45:05,303 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation
[2022-04-15 10:45:05,303 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation
[2022-04-15 10:45:05,303 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation
[2022-04-15 10:45:05,304 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation
[2022-04-15 10:45:05,304 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation
[2022-04-15 10:45:05,304 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation
[2022-04-15 10:45:05,304 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation
[2022-04-15 10:45:05,304 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation
[2022-04-15 10:45:05,304 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation
[2022-04-15 10:45:05,304 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation
[2022-04-15 10:45:05,304 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation
[2022-04-15 10:45:05,304 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation
[2022-04-15 10:45:05,304 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation
[2022-04-15 10:45:05,304 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation
[2022-04-15 10:45:05,304 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation
[2022-04-15 10:45:05,304 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation
[2022-04-15 10:45:05,304 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation
[2022-04-15 10:45:05,304 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[2022-04-15 10:45:05,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 10:45:05 BoogieIcfgContainer
[2022-04-15 10:45:05,305 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2022-04-15 10:45:05,306 INFO L158 Benchmark]: Toolchain (without parser) took 8183.12ms. Allocated memory was 179.3MB in the beginning and 216.0MB in the end (delta: 36.7MB). Free memory was 128.7MB in the beginning and 127.0MB in the end (delta: 1.7MB). Peak memory consumption was 40.0MB. Max. memory is 8.0GB.
[2022-04-15 10:45:05,306 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 179.3MB. Free memory was 145.0MB in the beginning and 144.9MB in the end (delta: 140.1kB). There was no memory consumed. Max. memory is 8.0GB.
[2022-04-15 10:45:05,307 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.32ms. Allocated memory is still 179.3MB. Free memory was 128.6MB in the beginning and 154.6MB in the end (delta: -26.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB.
[2022-04-15 10:45:05,307 INFO L158 Benchmark]: Boogie Preprocessor took 31.92ms. Allocated memory is still 179.3MB. Free memory was 154.6MB in the beginning and 153.2MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
[2022-04-15 10:45:05,307 INFO L158 Benchmark]: RCFGBuilder took 208.87ms. Allocated memory is still 179.3MB. Free memory was 153.2MB in the beginning and 142.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB.
[2022-04-15 10:45:05,307 INFO L158 Benchmark]: TraceAbstraction took 7704.57ms. Allocated memory was 179.3MB in the beginning and 216.0MB in the end (delta: 36.7MB). Free memory was 142.4MB in the beginning and 127.0MB in the end (delta: 15.4MB). Peak memory consumption was 53.7MB. Max. memory is 8.0GB.
[2022-04-15 10:45:05,308 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- AssertionsEnabledResult: Assertions are enabled
Assertions are enabled
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.09ms. Allocated memory is still 179.3MB. Free memory was 145.0MB in the beginning and 144.9MB in the end (delta: 140.1kB). There was no memory consumed. Max. memory is 8.0GB.
* CACSL2BoogieTranslator took 226.32ms. Allocated memory is still 179.3MB. Free memory was 128.6MB in the beginning and 154.6MB in the end (delta: -26.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB.
* Boogie Preprocessor took 31.92ms. Allocated memory is still 179.3MB. Free memory was 154.6MB in the beginning and 153.2MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
* RCFGBuilder took 208.87ms. Allocated memory is still 179.3MB. Free memory was 153.2MB in the beginning and 142.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB.
* TraceAbstraction took 7704.57ms. Allocated memory was 179.3MB in the beginning and 216.0MB in the end (delta: 36.7MB). Free memory was 142.4MB in the beginning and 127.0MB in the end (delta: 15.4MB). Peak memory consumption was 53.7MB. Max. memory is 8.0GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: ErrorAutomatonStatistics
NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
- CounterExampleResult [Line: 12]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L17] int counter = 0;
[L19] short k;
[L20] long long y, x, c;
[L21] k = __VERIFIER_nondet_short()
[L23] y = 0
[L24] x = 0
[L25] c = 0
[L27] EXPR counter++
[L27] COND TRUE counter++<2
[L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0)
[L10] COND FALSE !(!(cond))
[L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0)
[L30] COND FALSE !(!(c < k))
[L33] c = c + 1
[L34] y = y + 1
[L35] x = y * y * y + x
[L27] EXPR counter++
[L27] COND TRUE counter++<2
[L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0)
[L10] COND FALSE !(!(cond))
[L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0)
[L30] COND FALSE !(!(c < k))
[L33] c = c + 1
[L34] y = y + 1
[L35] x = y * y * y + x
[L27] EXPR counter++
[L27] COND FALSE !(counter++<2)
[L37] CALL __VERIFIER_assert(k*y - (y*y) == 0)
[L10] COND TRUE !(cond)
[L12] reach_error()
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 6 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.6s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 26 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 23 mSDsluCounter, 363 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 241 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 125 IncrementalHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 122 mSDtfsCounter, 125 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 148 GetRequests, 117 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=6, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2022-04-15 10:45:05,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...