/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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 17:23:41,751 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 17:23:41,752 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 17:23:41,786 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 17:23:41,787 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 17:23:41,788 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 17:23:41,790 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 17:23:41,796 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 17:23:41,799 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 17:23:41,801 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 17:23:41,802 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 17:23:41,802 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 17:23:41,803 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 17:23:41,803 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 17:23:41,804 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 17:23:41,805 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 17:23:41,805 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 17:23:41,806 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 17:23:41,807 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 17:23:41,808 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 17:23:41,809 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 17:23:41,816 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 17:23:41,817 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 17:23:41,820 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 17:23:41,823 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 17:23:41,828 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 17:23:41,828 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 17:23:41,828 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 17:23:41,828 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 17:23:41,829 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 17:23:41,829 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 17:23:41,829 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 17:23:41,830 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 17:23:41,830 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 17:23:41,830 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 17:23:41,831 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 17:23:41,831 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 17:23:41,832 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 17:23:41,832 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 17:23:41,832 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 17:23:41,833 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 17:23:41,835 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 17:23:41,836 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 17:23:41,843 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 17:23:41,843 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 17:23:41,844 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 17:23:41,844 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 17:23:41,844 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 17:23:41,844 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 17:23:41,845 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 17:23:41,845 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 17:23:41,845 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 17:23:41,845 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 17:23:41,845 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 17:23:41,845 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 17:23:41,846 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 17:23:41,846 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 17:23:41,846 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 17:23:41,846 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 17:23:41,846 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 17:23:41,846 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 17:23:41,846 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 17:23:41,846 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 17:23:41,847 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 17:23:41,847 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 17:23:41,847 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 17:23:42,030 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 17:23:42,059 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 17:23:42,060 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 17:23:42,061 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 17:23:42,062 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 17:23:42,063 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound10.c [2022-04-15 17:23:42,113 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf1a47fa1/1ee8469228cc42c3a2d8482339bf0de3/FLAG071f6dfbc [2022-04-15 17:23:42,471 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 17:23:42,471 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound10.c [2022-04-15 17:23:42,476 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf1a47fa1/1ee8469228cc42c3a2d8482339bf0de3/FLAG071f6dfbc [2022-04-15 17:23:42,488 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf1a47fa1/1ee8469228cc42c3a2d8482339bf0de3 [2022-04-15 17:23:42,490 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 17:23:42,491 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 17:23:42,509 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 17:23:42,509 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 17:23:42,512 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 17:23:42,513 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:23:42" (1/1) ... [2022-04-15 17:23:42,514 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f335100 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:23:42, skipping insertion in model container [2022-04-15 17:23:42,514 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:23:42" (1/1) ... [2022-04-15 17:23:42,520 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 17:23:42,530 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 17:23:42,633 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/ps6-ll_valuebound10.c[458,471] [2022-04-15 17:23:42,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 17:23:42,674 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 17:23:42,683 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/ps6-ll_valuebound10.c[458,471] [2022-04-15 17:23:42,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 17:23:42,703 INFO L208 MainTranslator]: Completed translation [2022-04-15 17:23:42,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:23:42 WrapperNode [2022-04-15 17:23:42,703 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 17:23:42,704 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 17:23:42,704 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 17:23:42,704 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 17:23:42,711 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:23:42" (1/1) ... [2022-04-15 17:23:42,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:23:42" (1/1) ... [2022-04-15 17:23:42,716 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:23:42" (1/1) ... [2022-04-15 17:23:42,716 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:23:42" (1/1) ... [2022-04-15 17:23:42,720 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:23:42" (1/1) ... [2022-04-15 17:23:42,723 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:23:42" (1/1) ... [2022-04-15 17:23:42,724 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:23:42" (1/1) ... [2022-04-15 17:23:42,725 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 17:23:42,726 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 17:23:42,726 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 17:23:42,726 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 17:23:42,727 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:23:42" (1/1) ... [2022-04-15 17:23:42,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 17:23:42,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 17:23:42,752 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 17:23:42,756 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 17:23:42,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 17:23:42,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 17:23:42,782 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 17:23:42,783 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 17:23:42,783 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 17:23:42,783 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 17:23:42,783 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 17:23:42,784 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 17:23:42,784 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 17:23:42,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 17:23:42,784 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-15 17:23:42,785 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 17:23:42,785 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 17:23:42,785 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 17:23:42,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 17:23:42,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 17:23:42,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 17:23:42,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 17:23:42,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 17:23:42,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 17:23:42,836 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 17:23:42,838 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 17:23:42,964 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 17:23:42,970 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 17:23:42,970 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 17:23:42,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:23:42 BoogieIcfgContainer [2022-04-15 17:23:42,972 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 17:23:42,988 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 17:23:42,988 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 17:23:42,991 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 17:23:42,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 05:23:42" (1/3) ... [2022-04-15 17:23:42,992 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4948bb12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:23:42, skipping insertion in model container [2022-04-15 17:23:42,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:23:42" (2/3) ... [2022-04-15 17:23:42,992 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4948bb12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:23:42, skipping insertion in model container [2022-04-15 17:23:43,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:23:42" (3/3) ... [2022-04-15 17:23:43,005 INFO L111 eAbstractionObserver]: Analyzing ICFG ps6-ll_valuebound10.c [2022-04-15 17:23:43,009 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 17:23:43,010 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 17:23:43,052 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 17:23:43,057 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 17:23:43,057 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 17:23:43,071 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 17:23:43,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 17:23:43,084 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:23:43,084 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:23:43,085 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:23:43,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:23:43,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1098891495, now seen corresponding path program 1 times [2022-04-15 17:23:43,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:23:43,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1633514198] [2022-04-15 17:23:43,103 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:23:43,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1098891495, now seen corresponding path program 2 times [2022-04-15 17:23:43,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:23:43,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574032869] [2022-04-15 17:23:43,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:23:43,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:23:43,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:23:43,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:23:43,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:23:43,319 INFO L290 TraceCheckUtils]: 0: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-15 17:23:43,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-15 17:23:43,319 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #63#return; {32#true} is VALID [2022-04-15 17:23:43,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 17:23:43,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:23:43,335 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-15 17:23:43,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-15 17:23:43,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-15 17:23:43,338 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-15 17:23:43,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 17:23:43,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:23:43,347 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-15 17:23:43,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-15 17:23:43,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-15 17:23:43,349 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID [2022-04-15 17:23:43,350 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:23:43,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-15 17:23:43,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-15 17:23:43,350 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #63#return; {32#true} is VALID [2022-04-15 17:23:43,351 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret5 := main(); {32#true} is VALID [2022-04-15 17:23:43,351 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#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; {32#true} is VALID [2022-04-15 17:23:43,351 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {32#true} is VALID [2022-04-15 17:23:43,352 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-15 17:23:43,353 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-15 17:23:43,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-15 17:23:43,353 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-15 17:23:43,353 INFO L272 TraceCheckUtils]: 11: Hoare triple {33#false} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {32#true} is VALID [2022-04-15 17:23:43,353 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-15 17:23:43,354 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-15 17:23:43,354 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-15 17:23:43,354 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID [2022-04-15 17:23:43,355 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {33#false} is VALID [2022-04-15 17:23:43,355 INFO L290 TraceCheckUtils]: 17: Hoare triple {33#false} assume false; {33#false} is VALID [2022-04-15 17:23:43,355 INFO L272 TraceCheckUtils]: 18: Hoare triple {33#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {33#false} is VALID [2022-04-15 17:23:43,355 INFO L290 TraceCheckUtils]: 19: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-15 17:23:43,356 INFO L290 TraceCheckUtils]: 20: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-15 17:23:43,356 INFO L290 TraceCheckUtils]: 21: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-15 17:23:43,356 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 17:23:43,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:23:43,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574032869] [2022-04-15 17:23:43,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574032869] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:23:43,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:23:43,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 17:23:43,360 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:23:43,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1633514198] [2022-04-15 17:23:43,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1633514198] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:23:43,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:23:43,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 17:23:43,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170588750] [2022-04-15 17:23:43,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:23:43,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-15 17:23:43,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:23:43,371 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 17:23:43,407 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:23:43,407 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 17:23:43,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:23:43,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 17:23:43,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 17:23:43,436 INFO L87 Difference]: Start difference. First operand has 29 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 17:23:43,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:23:43,691 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-15 17:23:43,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 17:23:43,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-15 17:23:43,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:23:43,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 17:23:43,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-04-15 17:23:43,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 17:23:43,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-04-15 17:23:43,717 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 69 transitions. [2022-04-15 17:23:43,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:23:43,823 INFO L225 Difference]: With dead ends: 51 [2022-04-15 17:23:43,824 INFO L226 Difference]: Without dead ends: 24 [2022-04-15 17:23:43,826 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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 17:23:43,830 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 17:23:43,831 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 30 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 17:23:43,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-15 17:23:43,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-15 17:23:43,858 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:23:43,859 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 17:23:43,859 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 17:23:43,860 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 17:23:43,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:23:43,863 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-15 17:23:43,863 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-15 17:23:43,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:23:43,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:23:43,864 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 24 states. [2022-04-15 17:23:43,864 INFO L87 Difference]: Start difference. First operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 24 states. [2022-04-15 17:23:43,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:23:43,867 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-15 17:23:43,867 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-15 17:23:43,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:23:43,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:23:43,867 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:23:43,867 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:23:43,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 17:23:43,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-15 17:23:43,870 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 22 [2022-04-15 17:23:43,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:23:43,871 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-15 17:23:43,871 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 17:23:43,871 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 27 transitions. [2022-04-15 17:23:43,902 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:23:43,902 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-15 17:23:43,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 17:23:43,903 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:23:43,903 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:23:43,904 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 17:23:43,904 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:23:43,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:23:43,905 INFO L85 PathProgramCache]: Analyzing trace with hash 769620075, now seen corresponding path program 1 times [2022-04-15 17:23:43,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:23:43,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [735658274] [2022-04-15 17:23:43,906 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:23:43,906 INFO L85 PathProgramCache]: Analyzing trace with hash 769620075, now seen corresponding path program 2 times [2022-04-15 17:23:43,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:23:43,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344406053] [2022-04-15 17:23:43,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:23:43,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:23:43,925 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 17:23:43,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1119482172] [2022-04-15 17:23:43,926 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 17:23:43,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 17:23:43,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 17:23:43,931 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 17:23:43,939 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 17:23:43,991 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 17:23:43,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 17:23:43,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 17:23:44,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:23:44,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 17:23:44,139 INFO L272 TraceCheckUtils]: 0: Hoare triple {246#true} call ULTIMATE.init(); {246#true} is VALID [2022-04-15 17:23:44,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {246#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); {246#true} is VALID [2022-04-15 17:23:44,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-15 17:23:44,140 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {246#true} {246#true} #63#return; {246#true} is VALID [2022-04-15 17:23:44,140 INFO L272 TraceCheckUtils]: 4: Hoare triple {246#true} call #t~ret5 := main(); {246#true} is VALID [2022-04-15 17:23:44,141 INFO L290 TraceCheckUtils]: 5: Hoare triple {246#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; {246#true} is VALID [2022-04-15 17:23:44,141 INFO L272 TraceCheckUtils]: 6: Hoare triple {246#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {246#true} is VALID [2022-04-15 17:23:44,141 INFO L290 TraceCheckUtils]: 7: Hoare triple {246#true} ~cond := #in~cond; {246#true} is VALID [2022-04-15 17:23:44,152 INFO L290 TraceCheckUtils]: 8: Hoare triple {246#true} assume !(0 == ~cond); {246#true} is VALID [2022-04-15 17:23:44,152 INFO L290 TraceCheckUtils]: 9: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-15 17:23:44,153 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {246#true} {246#true} #53#return; {246#true} is VALID [2022-04-15 17:23:44,153 INFO L272 TraceCheckUtils]: 11: Hoare triple {246#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {246#true} is VALID [2022-04-15 17:23:44,153 INFO L290 TraceCheckUtils]: 12: Hoare triple {246#true} ~cond := #in~cond; {246#true} is VALID [2022-04-15 17:23:44,153 INFO L290 TraceCheckUtils]: 13: Hoare triple {246#true} assume !(0 == ~cond); {246#true} is VALID [2022-04-15 17:23:44,153 INFO L290 TraceCheckUtils]: 14: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-15 17:23:44,154 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {246#true} {246#true} #55#return; {246#true} is VALID [2022-04-15 17:23:44,155 INFO L290 TraceCheckUtils]: 16: Hoare triple {246#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {299#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 17:23:44,156 INFO L290 TraceCheckUtils]: 17: Hoare triple {299#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {299#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 17:23:44,157 INFO L272 TraceCheckUtils]: 18: Hoare triple {299#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {306#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 17:23:44,157 INFO L290 TraceCheckUtils]: 19: Hoare triple {306#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {310#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 17:23:44,158 INFO L290 TraceCheckUtils]: 20: Hoare triple {310#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {247#false} is VALID [2022-04-15 17:23:44,158 INFO L290 TraceCheckUtils]: 21: Hoare triple {247#false} assume !false; {247#false} is VALID [2022-04-15 17:23:44,158 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 17:23:44,158 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 17:23:44,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:23:44,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344406053] [2022-04-15 17:23:44,159 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 17:23:44,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119482172] [2022-04-15 17:23:44,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119482172] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:23:44,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:23:44,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 17:23:44,161 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:23:44,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [735658274] [2022-04-15 17:23:44,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [735658274] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:23:44,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:23:44,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 17:23:44,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713355856] [2022-04-15 17:23:44,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:23:44,162 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-15 17:23:44,163 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:23:44,163 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 17:23:44,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:23:44,179 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 17:23:44,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:23:44,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 17:23:44,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 17:23:44,180 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 17:23:44,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:23:44,348 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-15 17:23:44,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 17:23:44,348 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-15 17:23:44,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:23:44,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 17:23:44,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-15 17:23:44,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 17:23:44,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-15 17:23:44,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-15 17:23:44,395 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 17:23:44,396 INFO L225 Difference]: With dead ends: 35 [2022-04-15 17:23:44,397 INFO L226 Difference]: Without dead ends: 31 [2022-04-15 17:23:44,397 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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 17:23:44,398 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 85 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 17:23:44,399 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 85 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:23:44,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-15 17:23:44,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-15 17:23:44,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:23:44,410 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 17:23:44,411 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 17:23:44,411 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 17:23:44,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:23:44,413 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-15 17:23:44,413 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-15 17:23:44,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:23:44,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:23:44,414 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 31 states. [2022-04-15 17:23:44,415 INFO L87 Difference]: Start difference. First operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 31 states. [2022-04-15 17:23:44,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:23:44,417 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-15 17:23:44,417 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-15 17:23:44,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:23:44,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:23:44,418 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:23:44,418 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:23:44,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 17:23:44,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-04-15 17:23:44,420 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 22 [2022-04-15 17:23:44,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:23:44,421 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-04-15 17:23:44,421 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 17:23:44,421 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 34 transitions. [2022-04-15 17:23:44,457 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 17:23:44,458 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-15 17:23:44,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 17:23:44,459 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:23:44,459 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:23:44,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 17:23:44,667 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 17:23:44,668 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:23:44,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:23:44,668 INFO L85 PathProgramCache]: Analyzing trace with hash 645812411, now seen corresponding path program 1 times [2022-04-15 17:23:44,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:23:44,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1351940964] [2022-04-15 17:23:44,669 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:23:44,670 INFO L85 PathProgramCache]: Analyzing trace with hash 645812411, now seen corresponding path program 2 times [2022-04-15 17:23:44,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:23:44,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661936223] [2022-04-15 17:23:44,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:23:44,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:23:44,686 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 17:23:44,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1366903242] [2022-04-15 17:23:44,686 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 17:23:44,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 17:23:44,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 17:23:44,687 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 17:23:44,694 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 17:23:44,735 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 17:23:44,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 17:23:44,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 17:23:44,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:23:44,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 17:23:44,889 INFO L272 TraceCheckUtils]: 0: Hoare triple {512#true} call ULTIMATE.init(); {512#true} is VALID [2022-04-15 17:23:44,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {512#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); {512#true} is VALID [2022-04-15 17:23:44,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-15 17:23:44,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {512#true} {512#true} #63#return; {512#true} is VALID [2022-04-15 17:23:44,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {512#true} call #t~ret5 := main(); {512#true} is VALID [2022-04-15 17:23:44,890 INFO L290 TraceCheckUtils]: 5: Hoare triple {512#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; {512#true} is VALID [2022-04-15 17:23:44,890 INFO L272 TraceCheckUtils]: 6: Hoare triple {512#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {512#true} is VALID [2022-04-15 17:23:44,890 INFO L290 TraceCheckUtils]: 7: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-15 17:23:44,890 INFO L290 TraceCheckUtils]: 8: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-15 17:23:44,890 INFO L290 TraceCheckUtils]: 9: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-15 17:23:44,891 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {512#true} {512#true} #53#return; {512#true} is VALID [2022-04-15 17:23:44,891 INFO L272 TraceCheckUtils]: 11: Hoare triple {512#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {512#true} is VALID [2022-04-15 17:23:44,891 INFO L290 TraceCheckUtils]: 12: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-15 17:23:44,891 INFO L290 TraceCheckUtils]: 13: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-15 17:23:44,891 INFO L290 TraceCheckUtils]: 14: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-15 17:23:44,891 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {512#true} {512#true} #55#return; {512#true} is VALID [2022-04-15 17:23:44,892 INFO L290 TraceCheckUtils]: 16: Hoare triple {512#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {565#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 17:23:44,893 INFO L290 TraceCheckUtils]: 17: Hoare triple {565#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {565#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 17:23:44,893 INFO L272 TraceCheckUtils]: 18: Hoare triple {565#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {512#true} is VALID [2022-04-15 17:23:44,893 INFO L290 TraceCheckUtils]: 19: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-15 17:23:44,893 INFO L290 TraceCheckUtils]: 20: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-15 17:23:44,893 INFO L290 TraceCheckUtils]: 21: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-15 17:23:44,894 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {512#true} {565#(and (= main_~x~0 0) (= main_~y~0 0))} #57#return; {565#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 17:23:44,895 INFO L290 TraceCheckUtils]: 23: Hoare triple {565#(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 * ~y~0 * ~y~0 + ~x~0; {587#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} is VALID [2022-04-15 17:23:44,895 INFO L290 TraceCheckUtils]: 24: Hoare triple {587#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} assume !false; {587#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} is VALID [2022-04-15 17:23:44,897 INFO L272 TraceCheckUtils]: 25: Hoare triple {587#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {594#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 17:23:44,897 INFO L290 TraceCheckUtils]: 26: Hoare triple {594#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {598#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 17:23:44,898 INFO L290 TraceCheckUtils]: 27: Hoare triple {598#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {513#false} is VALID [2022-04-15 17:23:44,898 INFO L290 TraceCheckUtils]: 28: Hoare triple {513#false} assume !false; {513#false} is VALID [2022-04-15 17:23:44,898 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 17:23:44,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 17:23:45,178 INFO L290 TraceCheckUtils]: 28: Hoare triple {513#false} assume !false; {513#false} is VALID [2022-04-15 17:23:45,179 INFO L290 TraceCheckUtils]: 27: Hoare triple {598#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {513#false} is VALID [2022-04-15 17:23:45,180 INFO L290 TraceCheckUtils]: 26: Hoare triple {594#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {598#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 17:23:45,181 INFO L272 TraceCheckUtils]: 25: Hoare triple {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {594#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 17:23:45,181 INFO L290 TraceCheckUtils]: 24: Hoare triple {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} assume !false; {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-15 17:23:45,228 INFO L290 TraceCheckUtils]: 23: Hoare triple {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-15 17:23:45,229 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {512#true} {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} #57#return; {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-15 17:23:45,229 INFO L290 TraceCheckUtils]: 21: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-15 17:23:45,229 INFO L290 TraceCheckUtils]: 20: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-15 17:23:45,229 INFO L290 TraceCheckUtils]: 19: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-15 17:23:45,229 INFO L272 TraceCheckUtils]: 18: Hoare triple {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {512#true} is VALID [2022-04-15 17:23:45,230 INFO L290 TraceCheckUtils]: 17: Hoare triple {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} assume !false; {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-15 17:23:45,231 INFO L290 TraceCheckUtils]: 16: Hoare triple {512#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-15 17:23:45,232 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {512#true} {512#true} #55#return; {512#true} is VALID [2022-04-15 17:23:45,232 INFO L290 TraceCheckUtils]: 14: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-15 17:23:45,232 INFO L290 TraceCheckUtils]: 13: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-15 17:23:45,232 INFO L290 TraceCheckUtils]: 12: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-15 17:23:45,232 INFO L272 TraceCheckUtils]: 11: Hoare triple {512#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {512#true} is VALID [2022-04-15 17:23:45,232 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {512#true} {512#true} #53#return; {512#true} is VALID [2022-04-15 17:23:45,232 INFO L290 TraceCheckUtils]: 9: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-15 17:23:45,233 INFO L290 TraceCheckUtils]: 8: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-15 17:23:45,233 INFO L290 TraceCheckUtils]: 7: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-15 17:23:45,233 INFO L272 TraceCheckUtils]: 6: Hoare triple {512#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {512#true} is VALID [2022-04-15 17:23:45,233 INFO L290 TraceCheckUtils]: 5: Hoare triple {512#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; {512#true} is VALID [2022-04-15 17:23:45,233 INFO L272 TraceCheckUtils]: 4: Hoare triple {512#true} call #t~ret5 := main(); {512#true} is VALID [2022-04-15 17:23:45,233 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {512#true} {512#true} #63#return; {512#true} is VALID [2022-04-15 17:23:45,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-15 17:23:45,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {512#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); {512#true} is VALID [2022-04-15 17:23:45,234 INFO L272 TraceCheckUtils]: 0: Hoare triple {512#true} call ULTIMATE.init(); {512#true} is VALID [2022-04-15 17:23:45,234 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 17:23:45,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:23:45,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661936223] [2022-04-15 17:23:45,235 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 17:23:45,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366903242] [2022-04-15 17:23:45,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366903242] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 17:23:45,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 17:23:45,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-15 17:23:45,235 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:23:45,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1351940964] [2022-04-15 17:23:45,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1351940964] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:23:45,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:23:45,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 17:23:45,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152922172] [2022-04-15 17:23:45,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:23:45,236 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-15 17:23:45,237 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:23:45,237 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 17:23:45,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:23:45,355 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 17:23:45,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:23:45,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 17:23:45,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-15 17:23:45,356 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 17:23:45,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:23:45,488 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-15 17:23:45,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 17:23:45,489 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-15 17:23:45,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:23:45,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 17:23:45,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-15 17:23:45,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 17:23:45,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-15 17:23:45,492 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-15 17:23:45,586 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 17:23:45,588 INFO L225 Difference]: With dead ends: 37 [2022-04-15 17:23:45,588 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 17:23:45,588 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 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 17:23:45,589 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:23:45,590 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 75 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:23:45,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 17:23:45,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-15 17:23:45,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:23:45,613 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 17:23:45,614 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 17:23:45,614 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 17:23:45,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:23:45,616 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-15 17:23:45,616 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-15 17:23:45,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:23:45,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:23:45,617 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-04-15 17:23:45,617 INFO L87 Difference]: Start difference. First operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-04-15 17:23:45,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:23:45,619 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-15 17:23:45,619 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-15 17:23:45,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:23:45,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:23:45,620 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:23:45,620 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:23:45,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 17:23:45,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-04-15 17:23:45,622 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 29 [2022-04-15 17:23:45,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:23:45,622 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-04-15 17:23:45,622 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 17:23:45,622 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 35 transitions. [2022-04-15 17:23:45,720 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 17:23:45,720 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-15 17:23:45,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-15 17:23:45,721 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:23:45,721 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:23:45,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-15 17:23:45,922 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 17:23:45,922 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:23:45,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:23:45,923 INFO L85 PathProgramCache]: Analyzing trace with hash 463554397, now seen corresponding path program 1 times [2022-04-15 17:23:45,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:23:45,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [747642754] [2022-04-15 17:23:45,923 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:23:45,923 INFO L85 PathProgramCache]: Analyzing trace with hash 463554397, now seen corresponding path program 2 times [2022-04-15 17:23:45,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:23:45,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897548741] [2022-04-15 17:23:45,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:23:45,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:23:45,938 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 17:23:45,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [577558730] [2022-04-15 17:23:45,939 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 17:23:45,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 17:23:45,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 17:23:45,940 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 17:23:45,945 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 17:23:45,986 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 17:23:45,986 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 17:23:45,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 17:23:45,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:23:45,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 17:23:46,309 INFO L272 TraceCheckUtils]: 0: Hoare triple {900#true} call ULTIMATE.init(); {900#true} is VALID [2022-04-15 17:23:46,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {900#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); {900#true} is VALID [2022-04-15 17:23:46,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-15 17:23:46,310 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {900#true} {900#true} #63#return; {900#true} is VALID [2022-04-15 17:23:46,310 INFO L272 TraceCheckUtils]: 4: Hoare triple {900#true} call #t~ret5 := main(); {900#true} is VALID [2022-04-15 17:23:46,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {900#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; {900#true} is VALID [2022-04-15 17:23:46,310 INFO L272 TraceCheckUtils]: 6: Hoare triple {900#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {900#true} is VALID [2022-04-15 17:23:46,311 INFO L290 TraceCheckUtils]: 7: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-15 17:23:46,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-15 17:23:46,311 INFO L290 TraceCheckUtils]: 9: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-15 17:23:46,311 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {900#true} {900#true} #53#return; {900#true} is VALID [2022-04-15 17:23:46,311 INFO L272 TraceCheckUtils]: 11: Hoare triple {900#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {900#true} is VALID [2022-04-15 17:23:46,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-15 17:23:46,311 INFO L290 TraceCheckUtils]: 13: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-15 17:23:46,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-15 17:23:46,312 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {900#true} {900#true} #55#return; {900#true} is VALID [2022-04-15 17:23:46,319 INFO L290 TraceCheckUtils]: 16: Hoare triple {900#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {953#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 17:23:46,320 INFO L290 TraceCheckUtils]: 17: Hoare triple {953#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {953#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 17:23:46,320 INFO L272 TraceCheckUtils]: 18: Hoare triple {953#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {900#true} is VALID [2022-04-15 17:23:46,320 INFO L290 TraceCheckUtils]: 19: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-15 17:23:46,320 INFO L290 TraceCheckUtils]: 20: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-15 17:23:46,320 INFO L290 TraceCheckUtils]: 21: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-15 17:23:46,321 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {900#true} {953#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {953#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 17:23:46,322 INFO L290 TraceCheckUtils]: 23: Hoare triple {953#(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 * ~y~0 * ~y~0 + ~x~0; {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-15 17:23:46,322 INFO L290 TraceCheckUtils]: 24: Hoare triple {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !false; {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-15 17:23:46,322 INFO L272 TraceCheckUtils]: 25: Hoare triple {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {900#true} is VALID [2022-04-15 17:23:46,322 INFO L290 TraceCheckUtils]: 26: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-15 17:23:46,323 INFO L290 TraceCheckUtils]: 27: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-15 17:23:46,323 INFO L290 TraceCheckUtils]: 28: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-15 17:23:46,323 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {900#true} {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #57#return; {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-15 17:23:46,324 INFO L290 TraceCheckUtils]: 30: Hoare triple {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-15 17:23:46,324 INFO L272 TraceCheckUtils]: 31: Hoare triple {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {900#true} is VALID [2022-04-15 17:23:46,324 INFO L290 TraceCheckUtils]: 32: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-15 17:23:46,325 INFO L290 TraceCheckUtils]: 33: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-15 17:23:46,325 INFO L290 TraceCheckUtils]: 34: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-15 17:23:46,325 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {900#true} {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} #59#return; {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-15 17:23:46,326 INFO L272 TraceCheckUtils]: 36: Hoare triple {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1016#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 17:23:46,326 INFO L290 TraceCheckUtils]: 37: Hoare triple {1016#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1020#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 17:23:46,327 INFO L290 TraceCheckUtils]: 38: Hoare triple {1020#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {901#false} is VALID [2022-04-15 17:23:46,327 INFO L290 TraceCheckUtils]: 39: Hoare triple {901#false} assume !false; {901#false} is VALID [2022-04-15 17:23:46,327 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 17:23:46,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 17:23:46,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:23:46,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897548741] [2022-04-15 17:23:46,763 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 17:23:46,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577558730] [2022-04-15 17:23:46,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577558730] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 17:23:46,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 17:23:46,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-15 17:23:46,764 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:23:46,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [747642754] [2022-04-15 17:23:46,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [747642754] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:23:46,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:23:46,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 17:23:46,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200923272] [2022-04-15 17:23:46,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:23:46,769 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-04-15 17:23:46,770 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:23:46,770 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 17:23:46,798 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 17:23:46,799 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 17:23:46,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:23:46,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 17:23:46,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-15 17:23:46,800 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 17:23:47,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:23:47,052 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-15 17:23:47,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 17:23:47,053 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-04-15 17:23:47,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:23:47,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 17:23:47,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-15 17:23:47,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 17:23:47,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-15 17:23:47,057 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 42 transitions. [2022-04-15 17:23:47,089 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:23:47,091 INFO L225 Difference]: With dead ends: 42 [2022-04-15 17:23:47,091 INFO L226 Difference]: Without dead ends: 36 [2022-04-15 17:23:47,091 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-15 17:23:47,092 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 17:23:47,092 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 135 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 17:23:47,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-15 17:23:47,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-15 17:23:47,108 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:23:47,108 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 17:23:47,108 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 17:23:47,109 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 17:23:47,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:23:47,111 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-15 17:23:47,111 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-15 17:23:47,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:23:47,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:23:47,112 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-15 17:23:47,112 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-15 17:23:47,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:23:47,114 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-15 17:23:47,114 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-15 17:23:47,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:23:47,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:23:47,114 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:23:47,114 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:23:47,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 17:23:47,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-04-15 17:23:47,116 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 40 [2022-04-15 17:23:47,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:23:47,116 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-04-15 17:23:47,117 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 17:23:47,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 39 transitions. [2022-04-15 17:23:47,294 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:23:47,294 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-15 17:23:47,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 17:23:47,295 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:23:47,295 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:23:47,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 17:23:47,499 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 17:23:47,499 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:23:47,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:23:47,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1886956461, now seen corresponding path program 3 times [2022-04-15 17:23:47,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:23:47,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [238130848] [2022-04-15 17:23:47,500 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:23:47,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1886956461, now seen corresponding path program 4 times [2022-04-15 17:23:47,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:23:47,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718261109] [2022-04-15 17:23:47,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:23:47,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:23:47,515 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 17:23:47,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1907666275] [2022-04-15 17:23:47,515 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 17:23:47,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 17:23:47,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 17:23:47,517 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 17:23:47,541 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 17:23:47,560 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 17:23:47,560 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 17:23:47,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 17:23:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:23:47,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 17:23:47,941 INFO L272 TraceCheckUtils]: 0: Hoare triple {1315#true} call ULTIMATE.init(); {1315#true} is VALID [2022-04-15 17:23:47,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {1315#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); {1315#true} is VALID [2022-04-15 17:23:47,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-15 17:23:47,942 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1315#true} {1315#true} #63#return; {1315#true} is VALID [2022-04-15 17:23:47,942 INFO L272 TraceCheckUtils]: 4: Hoare triple {1315#true} call #t~ret5 := main(); {1315#true} is VALID [2022-04-15 17:23:47,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {1315#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; {1315#true} is VALID [2022-04-15 17:23:47,942 INFO L272 TraceCheckUtils]: 6: Hoare triple {1315#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {1315#true} is VALID [2022-04-15 17:23:47,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-15 17:23:47,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-15 17:23:47,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-15 17:23:47,943 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1315#true} {1315#true} #53#return; {1315#true} is VALID [2022-04-15 17:23:47,943 INFO L272 TraceCheckUtils]: 11: Hoare triple {1315#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1315#true} is VALID [2022-04-15 17:23:47,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-15 17:23:47,943 INFO L290 TraceCheckUtils]: 13: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-15 17:23:47,943 INFO L290 TraceCheckUtils]: 14: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-15 17:23:47,944 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1315#true} {1315#true} #55#return; {1315#true} is VALID [2022-04-15 17:23:47,945 INFO L290 TraceCheckUtils]: 16: Hoare triple {1315#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1368#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 17:23:47,945 INFO L290 TraceCheckUtils]: 17: Hoare triple {1368#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1368#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 17:23:47,946 INFO L272 TraceCheckUtils]: 18: Hoare triple {1368#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1315#true} is VALID [2022-04-15 17:23:47,946 INFO L290 TraceCheckUtils]: 19: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-15 17:23:47,946 INFO L290 TraceCheckUtils]: 20: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-15 17:23:47,946 INFO L290 TraceCheckUtils]: 21: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-15 17:23:47,948 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1315#true} {1368#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {1368#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 17:23:47,948 INFO L290 TraceCheckUtils]: 23: Hoare triple {1368#(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 * ~y~0 * ~y~0 + ~x~0; {1390#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-15 17:23:47,949 INFO L290 TraceCheckUtils]: 24: Hoare triple {1390#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} assume !false; {1390#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-15 17:23:47,950 INFO L272 TraceCheckUtils]: 25: Hoare triple {1390#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1315#true} is VALID [2022-04-15 17:23:47,951 INFO L290 TraceCheckUtils]: 26: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-15 17:23:47,951 INFO L290 TraceCheckUtils]: 27: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-15 17:23:47,952 INFO L290 TraceCheckUtils]: 28: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-15 17:23:47,952 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1315#true} {1390#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} #57#return; {1390#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-15 17:23:47,953 INFO L290 TraceCheckUtils]: 30: Hoare triple {1390#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1412#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-15 17:23:47,953 INFO L290 TraceCheckUtils]: 31: Hoare triple {1412#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !false; {1412#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-15 17:23:47,953 INFO L272 TraceCheckUtils]: 32: Hoare triple {1412#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1315#true} is VALID [2022-04-15 17:23:47,953 INFO L290 TraceCheckUtils]: 33: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-15 17:23:47,954 INFO L290 TraceCheckUtils]: 34: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-15 17:23:47,954 INFO L290 TraceCheckUtils]: 35: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-15 17:23:47,954 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1315#true} {1412#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} #57#return; {1412#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-15 17:23:47,955 INFO L290 TraceCheckUtils]: 37: Hoare triple {1412#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {1434#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 17:23:47,955 INFO L272 TraceCheckUtils]: 38: Hoare triple {1434#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1315#true} is VALID [2022-04-15 17:23:47,955 INFO L290 TraceCheckUtils]: 39: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-15 17:23:47,955 INFO L290 TraceCheckUtils]: 40: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-15 17:23:47,955 INFO L290 TraceCheckUtils]: 41: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-15 17:23:47,956 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1315#true} {1434#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} #59#return; {1434#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 17:23:47,957 INFO L272 TraceCheckUtils]: 43: Hoare triple {1434#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1453#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 17:23:47,961 INFO L290 TraceCheckUtils]: 44: Hoare triple {1453#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1457#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 17:23:47,961 INFO L290 TraceCheckUtils]: 45: Hoare triple {1457#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1316#false} is VALID [2022-04-15 17:23:47,961 INFO L290 TraceCheckUtils]: 46: Hoare triple {1316#false} assume !false; {1316#false} is VALID [2022-04-15 17:23:47,962 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-15 17:23:47,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 17:23:48,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:23:48,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718261109] [2022-04-15 17:23:48,372 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 17:23:48,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907666275] [2022-04-15 17:23:48,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907666275] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 17:23:48,372 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 17:23:48,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-15 17:23:48,372 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:23:48,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [238130848] [2022-04-15 17:23:48,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [238130848] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:23:48,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:23:48,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 17:23:48,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120968029] [2022-04-15 17:23:48,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:23:48,373 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 47 [2022-04-15 17:23:48,374 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:23:48,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 17:23:48,408 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 17:23:48,408 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 17:23:48,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:23:48,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 17:23:48,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-15 17:23:48,409 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 17:23:48,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:23:48,716 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-15 17:23:48,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 17:23:48,716 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 47 [2022-04-15 17:23:48,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:23:48,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 17:23:48,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-15 17:23:48,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 17:23:48,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-15 17:23:48,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 46 transitions. [2022-04-15 17:23:48,759 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:23:48,760 INFO L225 Difference]: With dead ends: 45 [2022-04-15 17:23:48,760 INFO L226 Difference]: Without dead ends: 39 [2022-04-15 17:23:48,761 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-15 17:23:48,762 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 2 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 17:23:48,762 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 164 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 17:23:48,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-15 17:23:48,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-15 17:23:48,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:23:48,781 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 17:23:48,782 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 17:23:48,782 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 17:23:48,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:23:48,784 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-15 17:23:48,784 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-15 17:23:48,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:23:48,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:23:48,785 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 39 states. [2022-04-15 17:23:48,785 INFO L87 Difference]: Start difference. First operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 39 states. [2022-04-15 17:23:48,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:23:48,787 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-15 17:23:48,787 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-15 17:23:48,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:23:48,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:23:48,788 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:23:48,788 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:23:48,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 17:23:48,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-04-15 17:23:48,790 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 47 [2022-04-15 17:23:48,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:23:48,790 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-04-15 17:23:48,790 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 17:23:48,791 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 43 transitions. [2022-04-15 17:23:48,884 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:23:48,884 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-15 17:23:48,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-15 17:23:48,889 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:23:48,889 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:23:48,906 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 17:23:49,090 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 17:23:49,090 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:23:49,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:23:49,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1213805219, now seen corresponding path program 5 times [2022-04-15 17:23:49,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:23:49,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [446919728] [2022-04-15 17:23:49,091 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:23:49,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1213805219, now seen corresponding path program 6 times [2022-04-15 17:23:49,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:23:49,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001434754] [2022-04-15 17:23:49,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:23:49,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:23:49,127 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 17:23:49,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [575993372] [2022-04-15 17:23:49,127 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 17:23:49,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 17:23:49,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 17:23:49,144 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 17:23:49,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process