/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench/ps5-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 04:26:43,271 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 04:26:43,273 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 04:26:43,311 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 04:26:43,312 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 04:26:43,313 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 04:26:43,316 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 04:26:43,318 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 04:26:43,320 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 04:26:43,323 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 04:26:43,324 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 04:26:43,325 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 04:26:43,325 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 04:26:43,327 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 04:26:43,327 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 04:26:43,330 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 04:26:43,330 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 04:26:43,331 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 04:26:43,332 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 04:26:43,336 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 04:26:43,338 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 04:26:43,339 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 04:26:43,339 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 04:26:43,340 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 04:26:43,341 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 04:26:43,343 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 04:26:43,343 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 04:26:43,343 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 04:26:43,344 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 04:26:43,344 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 04:26:43,345 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 04:26:43,345 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 04:26:43,346 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 04:26:43,347 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 04:26:43,347 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 04:26:43,348 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 04:26:43,348 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 04:26:43,348 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 04:26:43,348 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 04:26:43,348 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 04:26:43,349 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 04:26:43,350 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 04:26:43,350 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 04:26:43,359 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 04:26:43,359 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 04:26:43,360 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 04:26:43,360 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 04:26:43,360 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 04:26:43,360 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 04:26:43,360 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 04:26:43,360 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 04:26:43,360 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 04:26:43,361 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 04:26:43,361 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 04:26:43,361 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 04:26:43,361 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 04:26:43,361 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 04:26:43,361 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 04:26:43,362 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 04:26:43,362 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 04:26:43,362 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 04:26:43,362 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:26:43,362 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 04:26:43,362 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 04:26:43,362 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 04:26:43,362 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 04:26:43,362 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 04:26:43,362 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 04:26:43,362 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-28 04:26:43,560 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 04:26:43,589 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 04:26:43,590 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 04:26:43,591 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 04:26:43,593 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 04:26:43,594 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/ps5-ll.c [2022-04-28 04:26:43,643 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d84d5ecf4/efb2fe7fd3eb467c86d6d64154b768fb/FLAG1792f00f5 [2022-04-28 04:26:44,007 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 04:26:44,007 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/ps5-ll.c [2022-04-28 04:26:44,010 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d84d5ecf4/efb2fe7fd3eb467c86d6d64154b768fb/FLAG1792f00f5 [2022-04-28 04:26:44,430 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d84d5ecf4/efb2fe7fd3eb467c86d6d64154b768fb [2022-04-28 04:26:44,432 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 04:26:44,433 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 04:26:44,434 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 04:26:44,434 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 04:26:44,436 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 04:26:44,437 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:26:44" (1/1) ... [2022-04-28 04:26:44,438 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ab4b595 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:26:44, skipping insertion in model container [2022-04-28 04:26:44,438 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:26:44" (1/1) ... [2022-04-28 04:26:44,443 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 04:26:44,452 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 04:26:44,582 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/ps5-ll.c[458,471] [2022-04-28 04:26:44,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:26:44,599 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 04:26:44,609 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/ps5-ll.c[458,471] [2022-04-28 04:26:44,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:26:44,621 INFO L208 MainTranslator]: Completed translation [2022-04-28 04:26:44,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:26:44 WrapperNode [2022-04-28 04:26:44,622 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 04:26:44,623 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 04:26:44,623 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 04:26:44,623 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 04:26:44,629 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:26:44" (1/1) ... [2022-04-28 04:26:44,629 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:26:44" (1/1) ... [2022-04-28 04:26:44,633 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:26:44" (1/1) ... [2022-04-28 04:26:44,634 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:26:44" (1/1) ... [2022-04-28 04:26:44,637 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:26:44" (1/1) ... [2022-04-28 04:26:44,640 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:26:44" (1/1) ... [2022-04-28 04:26:44,641 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:26:44" (1/1) ... [2022-04-28 04:26:44,642 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 04:26:44,642 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 04:26:44,642 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 04:26:44,642 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 04:26:44,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:26:44" (1/1) ... [2022-04-28 04:26:44,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:26:44,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:26:44,664 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-28 04:26:44,685 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-28 04:26:44,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 04:26:44,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 04:26:44,705 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 04:26:44,705 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 04:26:44,705 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 04:26:44,705 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 04:26:44,705 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 04:26:44,706 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 04:26:44,706 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 04:26:44,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 04:26:44,706 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-28 04:26:44,707 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 04:26:44,707 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 04:26:44,707 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 04:26:44,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 04:26:44,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 04:26:44,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 04:26:44,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 04:26:44,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 04:26:44,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 04:26:44,750 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 04:26:44,751 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 04:26:44,846 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 04:26:44,851 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 04:26:44,851 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 04:26:44,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:26:44 BoogieIcfgContainer [2022-04-28 04:26:44,852 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 04:26:44,853 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 04:26:44,853 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 04:26:44,855 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 04:26:44,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 04:26:44" (1/3) ... [2022-04-28 04:26:44,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18bac70d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:26:44, skipping insertion in model container [2022-04-28 04:26:44,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:26:44" (2/3) ... [2022-04-28 04:26:44,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18bac70d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:26:44, skipping insertion in model container [2022-04-28 04:26:44,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:26:44" (3/3) ... [2022-04-28 04:26:44,857 INFO L111 eAbstractionObserver]: Analyzing ICFG ps5-ll.c [2022-04-28 04:26:44,866 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 04:26:44,866 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 04:26:44,893 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 04:26:44,898 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@71b9b2af, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5abe659b [2022-04-28 04:26:44,898 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 04:26:44,903 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 04:26:44,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 04:26:44,908 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:26:44,908 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:26:44,909 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:26:44,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:26:44,912 INFO L85 PathProgramCache]: Analyzing trace with hash -630235283, now seen corresponding path program 1 times [2022-04-28 04:26:44,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:26:44,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2011705901] [2022-04-28 04:26:44,925 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:26:44,925 INFO L85 PathProgramCache]: Analyzing trace with hash -630235283, now seen corresponding path program 2 times [2022-04-28 04:26:44,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:26:44,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818608831] [2022-04-28 04:26:44,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:26:44,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:26:44,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:26:45,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:26:45,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:26:45,047 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#(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); {31#true} is VALID [2022-04-28 04:26:45,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-28 04:26:45,048 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #60#return; {31#true} is VALID [2022-04-28 04:26:45,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 04:26:45,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:26:45,055 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-04-28 04:26:45,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-04-28 04:26:45,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#false} assume true; {32#false} is VALID [2022-04-28 04:26:45,056 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#false} {31#true} #52#return; {32#false} is VALID [2022-04-28 04:26:45,057 INFO L272 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:26:45,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#(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); {31#true} is VALID [2022-04-28 04:26:45,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-28 04:26:45,058 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #60#return; {31#true} is VALID [2022-04-28 04:26:45,058 INFO L272 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret5 := main(); {31#true} is VALID [2022-04-28 04:26:45,058 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#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; {31#true} is VALID [2022-04-28 04:26:45,058 INFO L272 TraceCheckUtils]: 6: Hoare triple {31#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {31#true} is VALID [2022-04-28 04:26:45,058 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-04-28 04:26:45,059 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-04-28 04:26:45,059 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#false} assume true; {32#false} is VALID [2022-04-28 04:26:45,059 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {32#false} {31#true} #52#return; {32#false} is VALID [2022-04-28 04:26:45,059 INFO L290 TraceCheckUtils]: 11: Hoare triple {32#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {32#false} is VALID [2022-04-28 04:26:45,061 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#false} assume false; {32#false} is VALID [2022-04-28 04:26:45,061 INFO L272 TraceCheckUtils]: 13: Hoare triple {32#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {32#false} is VALID [2022-04-28 04:26:45,061 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2022-04-28 04:26:45,061 INFO L290 TraceCheckUtils]: 15: Hoare triple {32#false} assume 0 == ~cond; {32#false} is VALID [2022-04-28 04:26:45,061 INFO L290 TraceCheckUtils]: 16: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-04-28 04:26:45,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:26:45,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:26:45,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818608831] [2022-04-28 04:26:45,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818608831] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:26:45,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:26:45,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 04:26:45,066 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:26:45,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2011705901] [2022-04-28 04:26:45,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2011705901] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:26:45,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:26:45,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 04:26:45,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511192906] [2022-04-28 04:26:45,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:26:45,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 04:26:45,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:26:45,077 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 04:26:45,119 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:26:45,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 04:26:45,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:26:45,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 04:26:45,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 04:26:45,135 INFO L87 Difference]: Start difference. First operand has 28 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 04:26:45,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:26:45,258 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2022-04-28 04:26:45,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 04:26:45,259 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 04:26:45,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:26:45,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 04:26:45,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-28 04:26:45,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 04:26:45,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-28 04:26:45,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2022-04-28 04:26:45,347 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:26:45,353 INFO L225 Difference]: With dead ends: 47 [2022-04-28 04:26:45,353 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 04:26:45,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 04:26:45,358 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:26:45,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 29 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:26:45,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 04:26:45,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-28 04:26:45,390 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:26:45,391 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 04:26:45,392 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 04:26:45,393 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 04:26:45,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:26:45,397 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-28 04:26:45,397 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-28 04:26:45,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:26:45,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:26:45,398 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 23 states. [2022-04-28 04:26:45,398 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 23 states. [2022-04-28 04:26:45,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:26:45,402 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-28 04:26:45,402 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-28 04:26:45,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:26:45,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:26:45,402 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:26:45,402 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:26:45,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 04:26:45,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-04-28 04:26:45,405 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 17 [2022-04-28 04:26:45,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:26:45,406 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-04-28 04:26:45,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 04:26:45,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 25 transitions. [2022-04-28 04:26:45,429 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-28 04:26:45,430 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-28 04:26:45,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 04:26:45,430 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:26:45,430 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:26:45,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 04:26:45,431 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:26:45,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:26:45,431 INFO L85 PathProgramCache]: Analyzing trace with hash 51610547, now seen corresponding path program 1 times [2022-04-28 04:26:45,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:26:45,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [197560047] [2022-04-28 04:26:45,433 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:26:45,433 INFO L85 PathProgramCache]: Analyzing trace with hash 51610547, now seen corresponding path program 2 times [2022-04-28 04:26:45,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:26:45,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259709798] [2022-04-28 04:26:45,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:26:45,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:26:45,448 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:26:45,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1320963360] [2022-04-28 04:26:45,448 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:26:45,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:26:45,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:26:45,450 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-28 04:26:45,476 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-28 04:26:45,502 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 04:26:45,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:26:45,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 04:26:45,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:26:45,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:26:45,624 INFO L272 TraceCheckUtils]: 0: Hoare triple {229#true} call ULTIMATE.init(); {229#true} is VALID [2022-04-28 04:26:45,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {229#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); {229#true} is VALID [2022-04-28 04:26:45,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {229#true} assume true; {229#true} is VALID [2022-04-28 04:26:45,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {229#true} {229#true} #60#return; {229#true} is VALID [2022-04-28 04:26:45,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {229#true} call #t~ret5 := main(); {229#true} is VALID [2022-04-28 04:26:45,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {229#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; {229#true} is VALID [2022-04-28 04:26:45,625 INFO L272 TraceCheckUtils]: 6: Hoare triple {229#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {229#true} is VALID [2022-04-28 04:26:45,625 INFO L290 TraceCheckUtils]: 7: Hoare triple {229#true} ~cond := #in~cond; {229#true} is VALID [2022-04-28 04:26:45,626 INFO L290 TraceCheckUtils]: 8: Hoare triple {229#true} assume !(0 == ~cond); {229#true} is VALID [2022-04-28 04:26:45,626 INFO L290 TraceCheckUtils]: 9: Hoare triple {229#true} assume true; {229#true} is VALID [2022-04-28 04:26:45,626 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {229#true} {229#true} #52#return; {229#true} is VALID [2022-04-28 04:26:45,626 INFO L290 TraceCheckUtils]: 11: Hoare triple {229#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {267#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 04:26:45,627 INFO L290 TraceCheckUtils]: 12: Hoare triple {267#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {267#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 04:26:45,628 INFO L272 TraceCheckUtils]: 13: Hoare triple {267#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {274#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:26:45,628 INFO L290 TraceCheckUtils]: 14: Hoare triple {274#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {278#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:26:45,629 INFO L290 TraceCheckUtils]: 15: Hoare triple {278#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {230#false} is VALID [2022-04-28 04:26:45,629 INFO L290 TraceCheckUtils]: 16: Hoare triple {230#false} assume !false; {230#false} is VALID [2022-04-28 04:26:45,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:26:45,630 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:26:45,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:26:45,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259709798] [2022-04-28 04:26:45,630 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:26:45,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320963360] [2022-04-28 04:26:45,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320963360] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:26:45,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:26:45,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:26:45,632 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:26:45,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [197560047] [2022-04-28 04:26:45,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [197560047] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:26:45,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:26:45,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:26:45,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206735572] [2022-04-28 04:26:45,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:26:45,635 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 04:26:45,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:26:45,636 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 04:26:45,648 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:26:45,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 04:26:45,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:26:45,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 04:26:45,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 04:26:45,650 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 04:26:45,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:26:45,769 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-28 04:26:45,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 04:26:45,769 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 04:26:45,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:26:45,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 04:26:45,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-28 04:26:45,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 04:26:45,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-28 04:26:45,784 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2022-04-28 04:26:45,813 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:26:45,815 INFO L225 Difference]: With dead ends: 34 [2022-04-28 04:26:45,815 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 04:26:45,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 04:26:45,817 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 77 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-28 04:26:45,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 77 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:26:45,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 04:26:45,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-28 04:26:45,832 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:26:45,833 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 04:26:45,833 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 04:26:45,834 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 04:26:45,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:26:45,838 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-28 04:26:45,838 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-28 04:26:45,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:26:45,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:26:45,839 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 30 states. [2022-04-28 04:26:45,839 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 30 states. [2022-04-28 04:26:45,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:26:45,842 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-28 04:26:45,842 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-28 04:26:45,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:26:45,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:26:45,843 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:26:45,843 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:26:45,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 04:26:45,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-04-28 04:26:45,851 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 17 [2022-04-28 04:26:45,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:26:45,851 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-04-28 04:26:45,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 04:26:45,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 32 transitions. [2022-04-28 04:26:45,881 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-28 04:26:45,881 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-28 04:26:45,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 04:26:45,884 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:26:45,888 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:26:45,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 04:26:46,104 WARN L477 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-28 04:26:46,104 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:26:46,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:26:46,105 INFO L85 PathProgramCache]: Analyzing trace with hash 311787922, now seen corresponding path program 1 times [2022-04-28 04:26:46,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:26:46,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [177762940] [2022-04-28 04:26:46,314 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:26:46,314 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:26:46,314 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:26:46,314 INFO L85 PathProgramCache]: Analyzing trace with hash 311787922, now seen corresponding path program 2 times [2022-04-28 04:26:46,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:26:46,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772729260] [2022-04-28 04:26:46,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:26:46,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:26:46,324 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:26:46,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [879464056] [2022-04-28 04:26:46,324 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:26:46,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:26:46,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:26:46,325 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-28 04:26:46,326 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-28 04:26:46,640 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:26:46,640 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:26:46,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 04:26:46,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:26:46,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:26:46,763 INFO L272 TraceCheckUtils]: 0: Hoare triple {474#true} call ULTIMATE.init(); {474#true} is VALID [2022-04-28 04:26:46,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {474#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); {474#true} is VALID [2022-04-28 04:26:46,763 INFO L290 TraceCheckUtils]: 2: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-28 04:26:46,763 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {474#true} {474#true} #60#return; {474#true} is VALID [2022-04-28 04:26:46,763 INFO L272 TraceCheckUtils]: 4: Hoare triple {474#true} call #t~ret5 := main(); {474#true} is VALID [2022-04-28 04:26:46,764 INFO L290 TraceCheckUtils]: 5: Hoare triple {474#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; {474#true} is VALID [2022-04-28 04:26:46,764 INFO L272 TraceCheckUtils]: 6: Hoare triple {474#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {474#true} is VALID [2022-04-28 04:26:46,764 INFO L290 TraceCheckUtils]: 7: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-28 04:26:46,764 INFO L290 TraceCheckUtils]: 8: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-28 04:26:46,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-28 04:26:46,764 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {474#true} {474#true} #52#return; {474#true} is VALID [2022-04-28 04:26:46,768 INFO L290 TraceCheckUtils]: 11: Hoare triple {474#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {512#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 04:26:46,768 INFO L290 TraceCheckUtils]: 12: Hoare triple {512#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {512#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 04:26:46,768 INFO L272 TraceCheckUtils]: 13: Hoare triple {512#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {474#true} is VALID [2022-04-28 04:26:46,768 INFO L290 TraceCheckUtils]: 14: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-28 04:26:46,768 INFO L290 TraceCheckUtils]: 15: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-28 04:26:46,769 INFO L290 TraceCheckUtils]: 16: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-28 04:26:46,770 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {474#true} {512#(and (= main_~x~0 0) (= main_~y~0 0))} #54#return; {512#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 04:26:46,771 INFO L290 TraceCheckUtils]: 18: Hoare triple {512#(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 + ~x~0; {534#(and (= main_~x~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0)) (= main_~y~0 1))} is VALID [2022-04-28 04:26:46,771 INFO L290 TraceCheckUtils]: 19: Hoare triple {534#(and (= main_~x~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0)) (= main_~y~0 1))} assume !false; {534#(and (= main_~x~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0)) (= main_~y~0 1))} is VALID [2022-04-28 04:26:46,772 INFO L272 TraceCheckUtils]: 20: Hoare triple {534#(and (= main_~x~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0)) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {541#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:26:46,773 INFO L290 TraceCheckUtils]: 21: Hoare triple {541#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {545#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:26:46,773 INFO L290 TraceCheckUtils]: 22: Hoare triple {545#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {475#false} is VALID [2022-04-28 04:26:46,773 INFO L290 TraceCheckUtils]: 23: Hoare triple {475#false} assume !false; {475#false} is VALID [2022-04-28 04:26:46,773 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:26:46,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:26:46,977 INFO L290 TraceCheckUtils]: 23: Hoare triple {475#false} assume !false; {475#false} is VALID [2022-04-28 04:26:46,978 INFO L290 TraceCheckUtils]: 22: Hoare triple {545#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {475#false} is VALID [2022-04-28 04:26:46,978 INFO L290 TraceCheckUtils]: 21: Hoare triple {541#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {545#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:26:46,979 INFO L272 TraceCheckUtils]: 20: Hoare triple {561#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {541#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:26:46,980 INFO L290 TraceCheckUtils]: 19: Hoare triple {561#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} assume !false; {561#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-28 04:26:47,656 INFO L290 TraceCheckUtils]: 18: Hoare triple {561#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} 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 + ~x~0; {561#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-28 04:26:47,658 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {474#true} {561#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} #54#return; {561#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-28 04:26:47,658 INFO L290 TraceCheckUtils]: 16: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-28 04:26:47,658 INFO L290 TraceCheckUtils]: 15: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-28 04:26:47,658 INFO L290 TraceCheckUtils]: 14: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-28 04:26:47,658 INFO L272 TraceCheckUtils]: 13: Hoare triple {561#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {474#true} is VALID [2022-04-28 04:26:47,659 INFO L290 TraceCheckUtils]: 12: Hoare triple {561#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} assume !false; {561#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-28 04:26:47,659 INFO L290 TraceCheckUtils]: 11: Hoare triple {474#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {561#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-28 04:26:47,660 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {474#true} {474#true} #52#return; {474#true} is VALID [2022-04-28 04:26:47,660 INFO L290 TraceCheckUtils]: 9: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-28 04:26:47,660 INFO L290 TraceCheckUtils]: 8: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-28 04:26:47,660 INFO L290 TraceCheckUtils]: 7: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-28 04:26:47,660 INFO L272 TraceCheckUtils]: 6: Hoare triple {474#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {474#true} is VALID [2022-04-28 04:26:47,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {474#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; {474#true} is VALID [2022-04-28 04:26:47,660 INFO L272 TraceCheckUtils]: 4: Hoare triple {474#true} call #t~ret5 := main(); {474#true} is VALID [2022-04-28 04:26:47,660 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {474#true} {474#true} #60#return; {474#true} is VALID [2022-04-28 04:26:47,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-28 04:26:47,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {474#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); {474#true} is VALID [2022-04-28 04:26:47,661 INFO L272 TraceCheckUtils]: 0: Hoare triple {474#true} call ULTIMATE.init(); {474#true} is VALID [2022-04-28 04:26:47,661 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 04:26:47,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:26:47,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772729260] [2022-04-28 04:26:47,661 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:26:47,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879464056] [2022-04-28 04:26:47,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879464056] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 04:26:47,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 04:26:47,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-28 04:26:47,662 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:26:47,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [177762940] [2022-04-28 04:26:47,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [177762940] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:26:47,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:26:47,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:26:47,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117109537] [2022-04-28 04:26:47,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:26:47,663 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-28 04:26:47,663 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:26:47,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 04:26:47,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:26:47,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 04:26:47,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:26:47,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 04:26:47,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 04:26:47,996 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 04:26:48,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:26:48,108 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2022-04-28 04:26:48,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 04:26:48,108 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-28 04:26:48,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:26:48,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 04:26:48,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-28 04:26:48,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 04:26:48,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-28 04:26:48,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 30 transitions. [2022-04-28 04:26:48,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:26:48,443 INFO L225 Difference]: With dead ends: 36 [2022-04-28 04:26:48,443 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 04:26:48,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 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-28 04:26:48,444 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 67 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-28 04:26:48,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 67 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:26:48,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 04:26:48,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-28 04:26:48,465 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:26:48,466 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 04:26:48,466 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 04:26:48,466 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 04:26:48,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:26:48,467 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-04-28 04:26:48,468 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-04-28 04:26:48,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:26:48,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:26:48,468 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 32 states. [2022-04-28 04:26:48,468 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 32 states. [2022-04-28 04:26:48,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:26:48,469 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-04-28 04:26:48,469 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-04-28 04:26:48,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:26:48,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:26:48,470 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:26:48,470 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:26:48,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 04:26:48,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2022-04-28 04:26:48,471 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 24 [2022-04-28 04:26:48,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:26:48,471 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2022-04-28 04:26:48,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 04:26:48,471 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 33 transitions. [2022-04-28 04:26:48,639 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:26:48,640 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-04-28 04:26:48,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 04:26:48,640 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:26:48,640 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:26:48,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 04:26:48,841 WARN L477 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-28 04:26:48,841 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:26:48,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:26:48,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1106328449, now seen corresponding path program 1 times [2022-04-28 04:26:48,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:26:48,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [169163230] [2022-04-28 04:26:48,974 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:26:48,974 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:26:48,974 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:26:48,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1106328449, now seen corresponding path program 2 times [2022-04-28 04:26:48,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:26:48,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818000589] [2022-04-28 04:26:48,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:26:48,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:26:48,984 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:26:48,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1743828379] [2022-04-28 04:26:48,985 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:26:48,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:26:48,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:26:48,986 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-28 04:26:48,987 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-28 04:26:49,017 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:26:49,017 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:26:49,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 04:26:49,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:26:49,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:26:49,247 INFO L272 TraceCheckUtils]: 0: Hoare triple {826#true} call ULTIMATE.init(); {826#true} is VALID [2022-04-28 04:26:49,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {826#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); {826#true} is VALID [2022-04-28 04:26:49,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {826#true} assume true; {826#true} is VALID [2022-04-28 04:26:49,247 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {826#true} {826#true} #60#return; {826#true} is VALID [2022-04-28 04:26:49,247 INFO L272 TraceCheckUtils]: 4: Hoare triple {826#true} call #t~ret5 := main(); {826#true} is VALID [2022-04-28 04:26:49,247 INFO L290 TraceCheckUtils]: 5: Hoare triple {826#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; {826#true} is VALID [2022-04-28 04:26:49,248 INFO L272 TraceCheckUtils]: 6: Hoare triple {826#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {826#true} is VALID [2022-04-28 04:26:49,248 INFO L290 TraceCheckUtils]: 7: Hoare triple {826#true} ~cond := #in~cond; {826#true} is VALID [2022-04-28 04:26:49,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {826#true} assume !(0 == ~cond); {826#true} is VALID [2022-04-28 04:26:49,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {826#true} assume true; {826#true} is VALID [2022-04-28 04:26:49,248 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {826#true} {826#true} #52#return; {826#true} is VALID [2022-04-28 04:26:49,248 INFO L290 TraceCheckUtils]: 11: Hoare triple {826#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {864#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 04:26:49,249 INFO L290 TraceCheckUtils]: 12: Hoare triple {864#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {864#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 04:26:49,249 INFO L272 TraceCheckUtils]: 13: Hoare triple {864#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {826#true} is VALID [2022-04-28 04:26:49,249 INFO L290 TraceCheckUtils]: 14: Hoare triple {826#true} ~cond := #in~cond; {826#true} is VALID [2022-04-28 04:26:49,249 INFO L290 TraceCheckUtils]: 15: Hoare triple {826#true} assume !(0 == ~cond); {826#true} is VALID [2022-04-28 04:26:49,249 INFO L290 TraceCheckUtils]: 16: Hoare triple {826#true} assume true; {826#true} is VALID [2022-04-28 04:26:49,251 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {826#true} {864#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {864#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 04:26:49,251 INFO L290 TraceCheckUtils]: 18: Hoare triple {864#(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 + ~x~0; {886#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 04:26:49,251 INFO L290 TraceCheckUtils]: 19: Hoare triple {886#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !false; {886#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 04:26:49,251 INFO L272 TraceCheckUtils]: 20: Hoare triple {886#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {826#true} is VALID [2022-04-28 04:26:49,252 INFO L290 TraceCheckUtils]: 21: Hoare triple {826#true} ~cond := #in~cond; {826#true} is VALID [2022-04-28 04:26:49,252 INFO L290 TraceCheckUtils]: 22: Hoare triple {826#true} assume !(0 == ~cond); {826#true} is VALID [2022-04-28 04:26:49,252 INFO L290 TraceCheckUtils]: 23: Hoare triple {826#true} assume true; {826#true} is VALID [2022-04-28 04:26:49,252 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {826#true} {886#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #54#return; {886#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 04:26:49,253 INFO L290 TraceCheckUtils]: 25: Hoare triple {886#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {908#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-28 04:26:49,253 INFO L272 TraceCheckUtils]: 26: Hoare triple {908#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {826#true} is VALID [2022-04-28 04:26:49,253 INFO L290 TraceCheckUtils]: 27: Hoare triple {826#true} ~cond := #in~cond; {826#true} is VALID [2022-04-28 04:26:49,253 INFO L290 TraceCheckUtils]: 28: Hoare triple {826#true} assume !(0 == ~cond); {826#true} is VALID [2022-04-28 04:26:49,253 INFO L290 TraceCheckUtils]: 29: Hoare triple {826#true} assume true; {826#true} is VALID [2022-04-28 04:26:49,254 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {826#true} {908#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} #56#return; {908#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-28 04:26:49,259 INFO L272 TraceCheckUtils]: 31: Hoare triple {908#(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)); {927#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:26:49,259 INFO L290 TraceCheckUtils]: 32: Hoare triple {927#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {931#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:26:49,259 INFO L290 TraceCheckUtils]: 33: Hoare triple {931#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {827#false} is VALID [2022-04-28 04:26:49,259 INFO L290 TraceCheckUtils]: 34: Hoare triple {827#false} assume !false; {827#false} is VALID [2022-04-28 04:26:49,259 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 04:26:49,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:26:49,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:26:49,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818000589] [2022-04-28 04:26:49,536 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:26:49,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743828379] [2022-04-28 04:26:49,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743828379] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:26:49,536 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 04:26:49,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-28 04:26:49,537 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:26:49,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [169163230] [2022-04-28 04:26:49,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [169163230] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:26:49,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:26:49,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 04:26:49,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609826805] [2022-04-28 04:26:49,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:26:49,537 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 35 [2022-04-28 04:26:49,537 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:26:49,538 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 04:26:49,557 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:26:49,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 04:26:49,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:26:49,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 04:26:49,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 04:26:49,558 INFO L87 Difference]: Start difference. First operand 32 states and 33 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 04:26:49,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:26:49,751 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2022-04-28 04:26:49,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 04:26:49,751 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 35 [2022-04-28 04:26:49,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:26:49,751 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 04:26:49,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2022-04-28 04:26:49,752 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 04:26:49,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2022-04-28 04:26:49,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 40 transitions. [2022-04-28 04:26:49,782 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-28 04:26:49,783 INFO L225 Difference]: With dead ends: 41 [2022-04-28 04:26:49,783 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 04:26:49,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-28 04:26:49,784 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:26:49,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 125 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 04:26:49,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 04:26:49,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-28 04:26:49,797 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:26:49,797 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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-28 04:26:49,797 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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-28 04:26:49,798 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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-28 04:26:49,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:26:49,799 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-04-28 04:26:49,799 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-04-28 04:26:49,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:26:49,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:26:49,799 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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 35 states. [2022-04-28 04:26:49,800 INFO L87 Difference]: Start difference. First operand has 35 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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 35 states. [2022-04-28 04:26:49,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:26:49,801 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-04-28 04:26:49,801 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-04-28 04:26:49,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:26:49,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:26:49,801 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:26:49,801 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:26:49,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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-28 04:26:49,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2022-04-28 04:26:49,802 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 35 [2022-04-28 04:26:49,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:26:49,802 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2022-04-28 04:26:49,802 INFO L496 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 04:26:49,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 37 transitions. [2022-04-28 04:26:50,439 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:26:50,439 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-04-28 04:26:50,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 04:26:50,440 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:26:50,440 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:26:50,456 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-28 04:26:50,640 WARN L477 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-28 04:26:50,641 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:26:50,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:26:50,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1564024736, now seen corresponding path program 3 times [2022-04-28 04:26:50,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:26:50,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1692408295] [2022-04-28 04:26:50,737 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:26:50,738 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:26:50,738 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:26:50,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1564024736, now seen corresponding path program 4 times [2022-04-28 04:26:50,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:26:50,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633637500] [2022-04-28 04:26:50,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:26:50,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:26:50,765 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:26:50,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1652658986] [2022-04-28 04:26:50,766 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 04:26:50,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:26:50,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:26:50,772 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-28 04:26:50,798 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-28 04:26:50,819 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 04:26:50,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:26:50,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 04:26:50,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:26:50,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:26:51,169 INFO L272 TraceCheckUtils]: 0: Hoare triple {1220#true} call ULTIMATE.init(); {1220#true} is VALID [2022-04-28 04:26:51,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {1220#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); {1220#true} is VALID [2022-04-28 04:26:51,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {1220#true} assume true; {1220#true} is VALID [2022-04-28 04:26:51,169 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1220#true} {1220#true} #60#return; {1220#true} is VALID [2022-04-28 04:26:51,170 INFO L272 TraceCheckUtils]: 4: Hoare triple {1220#true} call #t~ret5 := main(); {1220#true} is VALID [2022-04-28 04:26:51,170 INFO L290 TraceCheckUtils]: 5: Hoare triple {1220#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; {1220#true} is VALID [2022-04-28 04:26:51,170 INFO L272 TraceCheckUtils]: 6: Hoare triple {1220#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1220#true} is VALID [2022-04-28 04:26:51,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {1220#true} ~cond := #in~cond; {1220#true} is VALID [2022-04-28 04:26:51,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {1220#true} assume !(0 == ~cond); {1220#true} is VALID [2022-04-28 04:26:51,170 INFO L290 TraceCheckUtils]: 9: Hoare triple {1220#true} assume true; {1220#true} is VALID [2022-04-28 04:26:51,170 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1220#true} {1220#true} #52#return; {1220#true} is VALID [2022-04-28 04:26:51,170 INFO L290 TraceCheckUtils]: 11: Hoare triple {1220#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1258#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 04:26:51,171 INFO L290 TraceCheckUtils]: 12: Hoare triple {1258#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1258#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 04:26:51,171 INFO L272 TraceCheckUtils]: 13: Hoare triple {1258#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1220#true} is VALID [2022-04-28 04:26:51,171 INFO L290 TraceCheckUtils]: 14: Hoare triple {1220#true} ~cond := #in~cond; {1220#true} is VALID [2022-04-28 04:26:51,171 INFO L290 TraceCheckUtils]: 15: Hoare triple {1220#true} assume !(0 == ~cond); {1220#true} is VALID [2022-04-28 04:26:51,171 INFO L290 TraceCheckUtils]: 16: Hoare triple {1220#true} assume true; {1220#true} is VALID [2022-04-28 04:26:51,171 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1220#true} {1258#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {1258#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 04:26:51,172 INFO L290 TraceCheckUtils]: 18: Hoare triple {1258#(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 + ~x~0; {1280#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 04:26:51,172 INFO L290 TraceCheckUtils]: 19: Hoare triple {1280#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {1280#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 04:26:51,172 INFO L272 TraceCheckUtils]: 20: Hoare triple {1280#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1220#true} is VALID [2022-04-28 04:26:51,172 INFO L290 TraceCheckUtils]: 21: Hoare triple {1220#true} ~cond := #in~cond; {1220#true} is VALID [2022-04-28 04:26:51,173 INFO L290 TraceCheckUtils]: 22: Hoare triple {1220#true} assume !(0 == ~cond); {1220#true} is VALID [2022-04-28 04:26:51,173 INFO L290 TraceCheckUtils]: 23: Hoare triple {1220#true} assume true; {1220#true} is VALID [2022-04-28 04:26:51,173 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1220#true} {1280#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {1280#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 04:26:51,173 INFO L290 TraceCheckUtils]: 25: Hoare triple {1280#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1302#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-28 04:26:51,174 INFO L290 TraceCheckUtils]: 26: Hoare triple {1302#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} assume !false; {1302#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-28 04:26:51,174 INFO L272 TraceCheckUtils]: 27: Hoare triple {1302#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1220#true} is VALID [2022-04-28 04:26:51,174 INFO L290 TraceCheckUtils]: 28: Hoare triple {1220#true} ~cond := #in~cond; {1220#true} is VALID [2022-04-28 04:26:51,174 INFO L290 TraceCheckUtils]: 29: Hoare triple {1220#true} assume !(0 == ~cond); {1220#true} is VALID [2022-04-28 04:26:51,174 INFO L290 TraceCheckUtils]: 30: Hoare triple {1220#true} assume true; {1220#true} is VALID [2022-04-28 04:26:51,175 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1220#true} {1302#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} #54#return; {1302#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-28 04:26:51,175 INFO L290 TraceCheckUtils]: 32: Hoare triple {1302#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {1324#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} is VALID [2022-04-28 04:26:51,175 INFO L272 TraceCheckUtils]: 33: Hoare triple {1324#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1220#true} is VALID [2022-04-28 04:26:51,175 INFO L290 TraceCheckUtils]: 34: Hoare triple {1220#true} ~cond := #in~cond; {1220#true} is VALID [2022-04-28 04:26:51,175 INFO L290 TraceCheckUtils]: 35: Hoare triple {1220#true} assume !(0 == ~cond); {1220#true} is VALID [2022-04-28 04:26:51,175 INFO L290 TraceCheckUtils]: 36: Hoare triple {1220#true} assume true; {1220#true} is VALID [2022-04-28 04:26:51,176 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1220#true} {1324#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} #56#return; {1324#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} is VALID [2022-04-28 04:26:51,176 INFO L272 TraceCheckUtils]: 38: Hoare triple {1324#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1343#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:26:51,177 INFO L290 TraceCheckUtils]: 39: Hoare triple {1343#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1347#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:26:51,177 INFO L290 TraceCheckUtils]: 40: Hoare triple {1347#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1221#false} is VALID [2022-04-28 04:26:51,177 INFO L290 TraceCheckUtils]: 41: Hoare triple {1221#false} assume !false; {1221#false} is VALID [2022-04-28 04:26:51,178 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 04:26:51,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:26:51,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:26:51,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633637500] [2022-04-28 04:26:51,426 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:26:51,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652658986] [2022-04-28 04:26:51,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652658986] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:26:51,427 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 04:26:51,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-28 04:26:51,427 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:26:51,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1692408295] [2022-04-28 04:26:51,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1692408295] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:26:51,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:26:51,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 04:26:51,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459687116] [2022-04-28 04:26:51,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:26:51,428 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 42 [2022-04-28 04:26:51,428 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:26:51,428 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 04:26:51,451 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:26:51,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 04:26:51,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:26:51,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 04:26:51,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-28 04:26:51,451 INFO L87 Difference]: Start difference. First operand 35 states and 37 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 04:26:51,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:26:51,681 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-04-28 04:26:51,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 04:26:51,681 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 42 [2022-04-28 04:26:51,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:26:51,682 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 04:26:51,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2022-04-28 04:26:51,683 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 04:26:51,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2022-04-28 04:26:51,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 44 transitions. [2022-04-28 04:26:51,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:26:51,715 INFO L225 Difference]: With dead ends: 44 [2022-04-28 04:26:51,715 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 04:26:51,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-28 04:26:51,716 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:26:51,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 154 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 04:26:51,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 04:26:51,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-28 04:26:51,732 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:26:51,732 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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-28 04:26:51,732 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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-28 04:26:51,732 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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-28 04:26:51,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:26:51,734 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-28 04:26:51,734 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-28 04:26:51,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:26:51,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:26:51,734 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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 38 states. [2022-04-28 04:26:51,734 INFO L87 Difference]: Start difference. First operand has 38 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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 38 states. [2022-04-28 04:26:51,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:26:51,735 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-28 04:26:51,735 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-28 04:26:51,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:26:51,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:26:51,736 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:26:51,736 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:26:51,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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-28 04:26:51,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-04-28 04:26:51,737 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 42 [2022-04-28 04:26:51,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:26:51,737 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-04-28 04:26:51,737 INFO L496 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 04:26:51,737 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 41 transitions. [2022-04-28 04:26:51,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:26:51,980 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-28 04:26:51,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-28 04:26:51,981 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:26:51,981 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:26:52,008 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-28 04:26:52,181 WARN L477 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-28 04:26:52,182 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:26:52,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:26:52,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1951214241, now seen corresponding path program 5 times [2022-04-28 04:26:52,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:26:52,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [142715877] [2022-04-28 04:26:52,275 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:26:52,275 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:26:52,275 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:26:52,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1951214241, now seen corresponding path program 6 times [2022-04-28 04:26:52,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:26:52,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648582700] [2022-04-28 04:26:52,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:26:52,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:26:52,289 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:26:52,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2092383465] [2022-04-28 04:26:52,289 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 04:26:52,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:26:52,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:26:52,315 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-28 04:26:52,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process