/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_unwindbound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 14:23:04,340 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 14:23:04,342 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 14:23:04,394 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 14:23:04,395 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 14:23:04,395 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 14:23:04,396 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 14:23:04,397 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 14:23:04,398 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 14:23:04,398 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 14:23:04,399 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 14:23:04,399 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 14:23:04,400 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 14:23:04,400 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 14:23:04,401 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 14:23:04,401 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 14:23:04,402 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 14:23:04,402 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 14:23:04,403 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 14:23:04,404 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 14:23:04,405 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 14:23:04,407 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 14:23:04,408 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 14:23:04,409 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 14:23:04,410 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 14:23:04,412 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 14:23:04,412 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 14:23:04,412 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 14:23:04,413 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 14:23:04,413 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 14:23:04,413 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 14:23:04,413 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 14:23:04,414 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 14:23:04,414 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 14:23:04,414 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 14:23:04,415 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 14:23:04,415 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 14:23:04,415 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 14:23:04,416 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 14:23:04,416 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 14:23:04,416 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 14:23:04,423 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 14:23:04,424 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 14:23:04,432 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 14:23:04,432 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 14:23:04,433 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 14:23:04,433 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 14:23:04,434 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 14:23:04,434 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 14:23:04,434 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 14:23:04,434 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 14:23:04,434 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 14:23:04,434 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 14:23:04,434 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 14:23:04,435 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 14:23:04,435 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 14:23:04,435 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 14:23:04,435 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 14:23:04,435 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 14:23:04,435 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 14:23:04,435 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 14:23:04,435 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 14:23:04,435 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 14:23:04,435 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 14:23:04,435 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 14:23:04,435 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 14:23:04,591 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 14:23:04,605 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 14:23:04,607 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 14:23:04,607 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 14:23:04,609 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 14:23:04,610 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_unwindbound2.c [2022-04-28 14:23:04,653 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c52405d4/fbe2f448c77e404a88621c53800cc1b8/FLAG83a45ccf3 [2022-04-28 14:23:05,013 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 14:23:05,013 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_unwindbound2.c [2022-04-28 14:23:05,019 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c52405d4/fbe2f448c77e404a88621c53800cc1b8/FLAG83a45ccf3 [2022-04-28 14:23:05,030 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c52405d4/fbe2f448c77e404a88621c53800cc1b8 [2022-04-28 14:23:05,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 14:23:05,034 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 14:23:05,036 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 14:23:05,036 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 14:23:05,038 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 14:23:05,039 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:23:05" (1/1) ... [2022-04-28 14:23:05,040 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2caa6ec7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:23:05, skipping insertion in model container [2022-04-28 14:23:05,040 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:23:05" (1/1) ... [2022-04-28 14:23:05,044 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 14:23:05,054 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 14:23:05,197 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_unwindbound2.c[458,471] [2022-04-28 14:23:05,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 14:23:05,227 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 14:23:05,237 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_unwindbound2.c[458,471] [2022-04-28 14:23:05,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 14:23:05,253 INFO L208 MainTranslator]: Completed translation [2022-04-28 14:23:05,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:23:05 WrapperNode [2022-04-28 14:23:05,254 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 14:23:05,254 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 14:23:05,254 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 14:23:05,254 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 14:23:05,262 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:23:05" (1/1) ... [2022-04-28 14:23:05,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:23:05" (1/1) ... [2022-04-28 14:23:05,267 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:23:05" (1/1) ... [2022-04-28 14:23:05,267 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:23:05" (1/1) ... [2022-04-28 14:23:05,277 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:23:05" (1/1) ... [2022-04-28 14:23:05,281 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:23:05" (1/1) ... [2022-04-28 14:23:05,283 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:23:05" (1/1) ... [2022-04-28 14:23:05,287 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 14:23:05,289 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 14:23:05,289 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 14:23:05,289 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 14:23:05,289 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:23:05" (1/1) ... [2022-04-28 14:23:05,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 14:23:05,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:23:05,310 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 14:23:05,317 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 14:23:05,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 14:23:05,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 14:23:05,343 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 14:23:05,343 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 14:23:05,343 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 14:23:05,343 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 14:23:05,343 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 14:23:05,344 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 14:23:05,344 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 14:23:05,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 14:23:05,344 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-28 14:23:05,344 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 14:23:05,344 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 14:23:05,345 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 14:23:05,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 14:23:05,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 14:23:05,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 14:23:05,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 14:23:05,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 14:23:05,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 14:23:05,389 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 14:23:05,390 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 14:23:05,482 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 14:23:05,486 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 14:23:05,486 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 14:23:05,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:23:05 BoogieIcfgContainer [2022-04-28 14:23:05,487 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 14:23:05,488 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 14:23:05,488 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 14:23:05,490 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 14:23:05,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 02:23:05" (1/3) ... [2022-04-28 14:23:05,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f116f6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:23:05, skipping insertion in model container [2022-04-28 14:23:05,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:23:05" (2/3) ... [2022-04-28 14:23:05,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f116f6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:23:05, skipping insertion in model container [2022-04-28 14:23:05,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:23:05" (3/3) ... [2022-04-28 14:23:05,492 INFO L111 eAbstractionObserver]: Analyzing ICFG ps5-ll_unwindbound2.c [2022-04-28 14:23:05,500 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 14:23:05,500 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 14:23:05,525 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 14:23:05,529 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@49e3c386, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@48d1dd61 [2022-04-28 14:23:05,529 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 14:23:05,533 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 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 14:23:05,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 14:23:05,537 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:23:05,538 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 14:23:05,538 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:23:05,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:23:05,541 INFO L85 PathProgramCache]: Analyzing trace with hash 21872251, now seen corresponding path program 1 times [2022-04-28 14:23:05,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:23:05,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [194606764] [2022-04-28 14:23:05,552 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:23:05,553 INFO L85 PathProgramCache]: Analyzing trace with hash 21872251, now seen corresponding path program 2 times [2022-04-28 14:23:05,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:23:05,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699804155] [2022-04-28 14:23:05,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:23:05,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:23:05,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:23:05,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:23:05,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:23:05,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {32#true} is VALID [2022-04-28 14:23:05,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-28 14:23:05,739 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID [2022-04-28 14:23:05,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 14:23:05,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:23:05,745 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-28 14:23:05,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-28 14:23:05,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-28 14:23:05,746 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-28 14:23:05,747 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {41#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:23:05,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {32#true} is VALID [2022-04-28 14:23:05,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-28 14:23:05,747 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID [2022-04-28 14:23:05,747 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret6 := main(); {32#true} is VALID [2022-04-28 14:23:05,747 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {32#true} is VALID [2022-04-28 14:23:05,748 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {32#true} is VALID [2022-04-28 14:23:05,748 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-28 14:23:05,748 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-28 14:23:05,748 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-28 14:23:05,748 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-28 14:23:05,749 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {33#false} is VALID [2022-04-28 14:23:05,749 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#false} assume !true; {33#false} is VALID [2022-04-28 14:23:05,749 INFO L272 TraceCheckUtils]: 13: Hoare triple {33#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)); {33#false} is VALID [2022-04-28 14:23:05,749 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-28 14:23:05,749 INFO L290 TraceCheckUtils]: 15: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-28 14:23:05,749 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-28 14:23:05,750 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 14:23:05,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:23:05,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699804155] [2022-04-28 14:23:05,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699804155] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:23:05,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:23:05,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 14:23:05,753 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:23:05,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [194606764] [2022-04-28 14:23:05,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [194606764] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:23:05,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:23:05,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 14:23:05,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769055749] [2022-04-28 14:23:05,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:23:05,757 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 14:23:05,758 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:23:05,760 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 14:23:05,788 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 14:23:05,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 14:23:05,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:23:05,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 14:23:05,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 14:23:05,808 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 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 14:23:05,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:05,936 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2022-04-28 14:23:05,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 14:23:05,936 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 14:23:05,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:23:05,937 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 14:23:05,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-04-28 14:23:05,943 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 14:23:05,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-04-28 14:23:05,947 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 65 transitions. [2022-04-28 14:23:06,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:06,010 INFO L225 Difference]: With dead ends: 50 [2022-04-28 14:23:06,010 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 14:23:06,014 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 14:23:06,016 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:23:06,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 34 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:23:06,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 14:23:06,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-04-28 14:23:06,040 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:23:06,040 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 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 14:23:06,041 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 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 14:23:06,041 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 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 14:23:06,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:06,044 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-28 14:23:06,044 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-28 14:23:06,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:23:06,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:23:06,045 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 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 25 states. [2022-04-28 14:23:06,045 INFO L87 Difference]: Start difference. First operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 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 25 states. [2022-04-28 14:23:06,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:06,049 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-28 14:23:06,049 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-28 14:23:06,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:23:06,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:23:06,050 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:23:06,050 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:23:06,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 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 14:23:06,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-28 14:23:06,053 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 17 [2022-04-28 14:23:06,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:23:06,053 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-28 14:23:06,053 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 14:23:06,053 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 27 transitions. [2022-04-28 14:23:06,097 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:06,098 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-28 14:23:06,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 14:23:06,098 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:23:06,098 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:23:06,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 14:23:06,099 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:23:06,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:23:06,099 INFO L85 PathProgramCache]: Analyzing trace with hash -119968982, now seen corresponding path program 1 times [2022-04-28 14:23:06,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:23:06,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [828818474] [2022-04-28 14:23:06,100 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:23:06,100 INFO L85 PathProgramCache]: Analyzing trace with hash -119968982, now seen corresponding path program 2 times [2022-04-28 14:23:06,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:23:06,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821157728] [2022-04-28 14:23:06,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:23:06,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:23:06,137 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:23:06,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [171082282] [2022-04-28 14:23:06,137 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:23:06,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:23:06,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:23:06,139 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 14:23:06,140 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 14:23:06,187 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 14:23:06,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:23:06,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 14:23:06,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:23:06,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:23:06,353 INFO L272 TraceCheckUtils]: 0: Hoare triple {242#true} call ULTIMATE.init(); {242#true} is VALID [2022-04-28 14:23:06,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {242#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {250#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:06,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {250#(<= ~counter~0 0)} assume true; {250#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:06,355 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {250#(<= ~counter~0 0)} {242#true} #61#return; {250#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:06,355 INFO L272 TraceCheckUtils]: 4: Hoare triple {250#(<= ~counter~0 0)} call #t~ret6 := main(); {250#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:06,356 INFO L290 TraceCheckUtils]: 5: Hoare triple {250#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {250#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:06,356 INFO L272 TraceCheckUtils]: 6: Hoare triple {250#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {250#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:06,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {250#(<= ~counter~0 0)} ~cond := #in~cond; {250#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:06,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {250#(<= ~counter~0 0)} assume !(0 == ~cond); {250#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:06,358 INFO L290 TraceCheckUtils]: 9: Hoare triple {250#(<= ~counter~0 0)} assume true; {250#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:06,359 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {250#(<= ~counter~0 0)} {250#(<= ~counter~0 0)} #53#return; {250#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:06,359 INFO L290 TraceCheckUtils]: 11: Hoare triple {250#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {250#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:06,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {250#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {284#(<= |main_#t~post5| 0)} is VALID [2022-04-28 14:23:06,360 INFO L290 TraceCheckUtils]: 13: Hoare triple {284#(<= |main_#t~post5| 0)} assume !(#t~post5 < 2);havoc #t~post5; {243#false} is VALID [2022-04-28 14:23:06,360 INFO L272 TraceCheckUtils]: 14: Hoare triple {243#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)); {243#false} is VALID [2022-04-28 14:23:06,361 INFO L290 TraceCheckUtils]: 15: Hoare triple {243#false} ~cond := #in~cond; {243#false} is VALID [2022-04-28 14:23:06,361 INFO L290 TraceCheckUtils]: 16: Hoare triple {243#false} assume 0 == ~cond; {243#false} is VALID [2022-04-28 14:23:06,361 INFO L290 TraceCheckUtils]: 17: Hoare triple {243#false} assume !false; {243#false} is VALID [2022-04-28 14:23:06,361 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 14:23:06,361 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 14:23:06,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:23:06,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821157728] [2022-04-28 14:23:06,362 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:23:06,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171082282] [2022-04-28 14:23:06,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171082282] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:23:06,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:23:06,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:23:06,364 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:23:06,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [828818474] [2022-04-28 14:23:06,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [828818474] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:23:06,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:23:06,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:23:06,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374410711] [2022-04-28 14:23:06,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:23:06,367 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-28 14:23:06,367 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:23:06,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 14:23:06,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:06,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:23:06,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:23:06,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:23:06,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:23:06,386 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 14:23:06,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:06,441 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-28 14:23:06,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:23:06,442 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-28 14:23:06,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:23:06,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 14:23:06,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-28 14:23:06,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 14:23:06,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-28 14:23:06,463 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-28 14:23:06,487 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 14:23:06,488 INFO L225 Difference]: With dead ends: 34 [2022-04-28 14:23:06,488 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 14:23:06,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:23:06,489 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:23:06,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:23:06,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 14:23:06,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-28 14:23:06,504 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:23:06,505 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 14:23:06,505 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 14:23:06,505 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 14:23:06,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:06,510 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-28 14:23:06,510 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-28 14:23:06,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:23:06,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:23:06,511 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-28 14:23:06,511 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-28 14:23:06,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:06,513 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-28 14:23:06,513 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-28 14:23:06,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:23:06,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:23:06,513 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:23:06,513 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:23:06,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 14:23:06,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-04-28 14:23:06,517 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 18 [2022-04-28 14:23:06,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:23:06,518 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-04-28 14:23:06,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 14:23:06,518 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 29 transitions. [2022-04-28 14:23:06,540 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 14:23:06,540 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-28 14:23:06,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 14:23:06,541 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:23:06,541 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:23:06,570 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 14:23:06,755 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 14:23:06,755 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:23:06,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:23:06,756 INFO L85 PathProgramCache]: Analyzing trace with hash -118181522, now seen corresponding path program 1 times [2022-04-28 14:23:06,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:23:06,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1146218172] [2022-04-28 14:23:06,757 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:23:06,757 INFO L85 PathProgramCache]: Analyzing trace with hash -118181522, now seen corresponding path program 2 times [2022-04-28 14:23:06,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:23:06,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914137686] [2022-04-28 14:23:06,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:23:06,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:23:06,766 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:23:06,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [625286092] [2022-04-28 14:23:06,766 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:23:06,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:23:06,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:23:06,767 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 14:23:06,768 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 14:23:06,795 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 14:23:06,795 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:23:06,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 14:23:06,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:23:06,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:23:06,891 INFO L272 TraceCheckUtils]: 0: Hoare triple {471#true} call ULTIMATE.init(); {471#true} is VALID [2022-04-28 14:23:06,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {471#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {471#true} is VALID [2022-04-28 14:23:06,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {471#true} assume true; {471#true} is VALID [2022-04-28 14:23:06,893 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {471#true} {471#true} #61#return; {471#true} is VALID [2022-04-28 14:23:06,893 INFO L272 TraceCheckUtils]: 4: Hoare triple {471#true} call #t~ret6 := main(); {471#true} is VALID [2022-04-28 14:23:06,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {471#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; {471#true} is VALID [2022-04-28 14:23:06,893 INFO L272 TraceCheckUtils]: 6: Hoare triple {471#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {471#true} is VALID [2022-04-28 14:23:06,896 INFO L290 TraceCheckUtils]: 7: Hoare triple {471#true} ~cond := #in~cond; {471#true} is VALID [2022-04-28 14:23:06,896 INFO L290 TraceCheckUtils]: 8: Hoare triple {471#true} assume !(0 == ~cond); {471#true} is VALID [2022-04-28 14:23:06,896 INFO L290 TraceCheckUtils]: 9: Hoare triple {471#true} assume true; {471#true} is VALID [2022-04-28 14:23:06,896 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {471#true} {471#true} #53#return; {471#true} is VALID [2022-04-28 14:23:06,898 INFO L290 TraceCheckUtils]: 11: Hoare triple {471#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {509#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:23:06,899 INFO L290 TraceCheckUtils]: 12: Hoare triple {509#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {509#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:23:06,899 INFO L290 TraceCheckUtils]: 13: Hoare triple {509#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 2);havoc #t~post5; {509#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:23:06,901 INFO L272 TraceCheckUtils]: 14: Hoare triple {509#(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)); {519#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:23:06,902 INFO L290 TraceCheckUtils]: 15: Hoare triple {519#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {523#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:23:06,902 INFO L290 TraceCheckUtils]: 16: Hoare triple {523#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {472#false} is VALID [2022-04-28 14:23:06,903 INFO L290 TraceCheckUtils]: 17: Hoare triple {472#false} assume !false; {472#false} is VALID [2022-04-28 14:23:06,903 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 14:23:06,903 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 14:23:06,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:23:06,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914137686] [2022-04-28 14:23:06,903 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:23:06,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625286092] [2022-04-28 14:23:06,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625286092] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:23:06,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:23:06,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:23:06,904 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:23:06,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1146218172] [2022-04-28 14:23:06,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1146218172] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:23:06,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:23:06,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:23:06,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365487911] [2022-04-28 14:23:06,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:23:06,905 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-28 14:23:06,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:23:06,906 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:23:06,917 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:06,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:23:06,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:23:06,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:23:06,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 14:23:06,918 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:23:07,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:07,045 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-28 14:23:07,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:23:07,045 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-28 14:23:07,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:23:07,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:23:07,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-28 14:23:07,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:23:07,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-28 14:23:07,063 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-28 14:23:07,091 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 14:23:07,093 INFO L225 Difference]: With dead ends: 36 [2022-04-28 14:23:07,093 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 14:23:07,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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 14:23:07,101 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:23:07,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 87 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:23:07,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 14:23:07,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-28 14:23:07,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:23:07,116 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 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 14:23:07,116 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 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 14:23:07,116 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 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 14:23:07,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:07,118 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-28 14:23:07,118 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-28 14:23:07,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:23:07,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:23:07,118 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 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 32 states. [2022-04-28 14:23:07,119 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 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 32 states. [2022-04-28 14:23:07,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:07,120 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-28 14:23:07,120 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-28 14:23:07,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:23:07,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:23:07,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:23:07,121 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:23:07,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 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 14:23:07,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-04-28 14:23:07,122 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 18 [2022-04-28 14:23:07,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:23:07,122 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-04-28 14:23:07,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:23:07,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 35 transitions. [2022-04-28 14:23:07,147 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:07,148 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-28 14:23:07,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 14:23:07,148 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:23:07,148 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:23:07,173 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 14:23:07,363 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 14:23:07,363 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:23:07,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:23:07,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1364840471, now seen corresponding path program 1 times [2022-04-28 14:23:07,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:23:07,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [992181196] [2022-04-28 14:23:07,534 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:23:07,535 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:23:07,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1364840471, now seen corresponding path program 2 times [2022-04-28 14:23:07,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:23:07,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524602912] [2022-04-28 14:23:07,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:23:07,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:23:07,548 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:23:07,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [128936307] [2022-04-28 14:23:07,548 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:23:07,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:23:07,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:23:07,550 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 14:23:07,551 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 14:23:07,655 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:23:07,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:23:07,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 14:23:07,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:23:07,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:23:07,802 INFO L272 TraceCheckUtils]: 0: Hoare triple {731#true} call ULTIMATE.init(); {731#true} is VALID [2022-04-28 14:23:07,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {731#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {739#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:07,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {739#(<= ~counter~0 0)} assume true; {739#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:07,803 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {739#(<= ~counter~0 0)} {731#true} #61#return; {739#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:07,804 INFO L272 TraceCheckUtils]: 4: Hoare triple {739#(<= ~counter~0 0)} call #t~ret6 := main(); {739#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:07,804 INFO L290 TraceCheckUtils]: 5: Hoare triple {739#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {739#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:07,804 INFO L272 TraceCheckUtils]: 6: Hoare triple {739#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {739#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:07,805 INFO L290 TraceCheckUtils]: 7: Hoare triple {739#(<= ~counter~0 0)} ~cond := #in~cond; {739#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:07,805 INFO L290 TraceCheckUtils]: 8: Hoare triple {739#(<= ~counter~0 0)} assume !(0 == ~cond); {739#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:07,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {739#(<= ~counter~0 0)} assume true; {739#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:07,806 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {739#(<= ~counter~0 0)} {739#(<= ~counter~0 0)} #53#return; {739#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:07,807 INFO L290 TraceCheckUtils]: 11: Hoare triple {739#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {739#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:07,807 INFO L290 TraceCheckUtils]: 12: Hoare triple {739#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {773#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:07,808 INFO L290 TraceCheckUtils]: 13: Hoare triple {773#(<= ~counter~0 1)} assume !!(#t~post5 < 2);havoc #t~post5; {773#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:07,808 INFO L272 TraceCheckUtils]: 14: Hoare triple {773#(<= ~counter~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)); {773#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:07,808 INFO L290 TraceCheckUtils]: 15: Hoare triple {773#(<= ~counter~0 1)} ~cond := #in~cond; {773#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:07,809 INFO L290 TraceCheckUtils]: 16: Hoare triple {773#(<= ~counter~0 1)} assume !(0 == ~cond); {773#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:07,809 INFO L290 TraceCheckUtils]: 17: Hoare triple {773#(<= ~counter~0 1)} assume true; {773#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:07,810 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {773#(<= ~counter~0 1)} {773#(<= ~counter~0 1)} #55#return; {773#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:07,810 INFO L290 TraceCheckUtils]: 19: Hoare triple {773#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {773#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:07,810 INFO L290 TraceCheckUtils]: 20: Hoare triple {773#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {798#(<= |main_#t~post5| 1)} is VALID [2022-04-28 14:23:07,811 INFO L290 TraceCheckUtils]: 21: Hoare triple {798#(<= |main_#t~post5| 1)} assume !(#t~post5 < 2);havoc #t~post5; {732#false} is VALID [2022-04-28 14:23:07,811 INFO L272 TraceCheckUtils]: 22: Hoare triple {732#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)); {732#false} is VALID [2022-04-28 14:23:07,811 INFO L290 TraceCheckUtils]: 23: Hoare triple {732#false} ~cond := #in~cond; {732#false} is VALID [2022-04-28 14:23:07,811 INFO L290 TraceCheckUtils]: 24: Hoare triple {732#false} assume 0 == ~cond; {732#false} is VALID [2022-04-28 14:23:07,811 INFO L290 TraceCheckUtils]: 25: Hoare triple {732#false} assume !false; {732#false} is VALID [2022-04-28 14:23:07,812 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 14:23:07,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:23:07,928 INFO L290 TraceCheckUtils]: 25: Hoare triple {732#false} assume !false; {732#false} is VALID [2022-04-28 14:23:07,928 INFO L290 TraceCheckUtils]: 24: Hoare triple {732#false} assume 0 == ~cond; {732#false} is VALID [2022-04-28 14:23:07,928 INFO L290 TraceCheckUtils]: 23: Hoare triple {732#false} ~cond := #in~cond; {732#false} is VALID [2022-04-28 14:23:07,928 INFO L272 TraceCheckUtils]: 22: Hoare triple {732#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)); {732#false} is VALID [2022-04-28 14:23:07,929 INFO L290 TraceCheckUtils]: 21: Hoare triple {798#(<= |main_#t~post5| 1)} assume !(#t~post5 < 2);havoc #t~post5; {732#false} is VALID [2022-04-28 14:23:07,929 INFO L290 TraceCheckUtils]: 20: Hoare triple {773#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {798#(<= |main_#t~post5| 1)} is VALID [2022-04-28 14:23:07,930 INFO L290 TraceCheckUtils]: 19: Hoare triple {773#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {773#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:07,930 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {731#true} {773#(<= ~counter~0 1)} #55#return; {773#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:07,930 INFO L290 TraceCheckUtils]: 17: Hoare triple {731#true} assume true; {731#true} is VALID [2022-04-28 14:23:07,930 INFO L290 TraceCheckUtils]: 16: Hoare triple {731#true} assume !(0 == ~cond); {731#true} is VALID [2022-04-28 14:23:07,930 INFO L290 TraceCheckUtils]: 15: Hoare triple {731#true} ~cond := #in~cond; {731#true} is VALID [2022-04-28 14:23:07,931 INFO L272 TraceCheckUtils]: 14: Hoare triple {773#(<= ~counter~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)); {731#true} is VALID [2022-04-28 14:23:07,931 INFO L290 TraceCheckUtils]: 13: Hoare triple {773#(<= ~counter~0 1)} assume !!(#t~post5 < 2);havoc #t~post5; {773#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:07,931 INFO L290 TraceCheckUtils]: 12: Hoare triple {739#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {773#(<= ~counter~0 1)} is VALID [2022-04-28 14:23:07,932 INFO L290 TraceCheckUtils]: 11: Hoare triple {739#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {739#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:07,932 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {731#true} {739#(<= ~counter~0 0)} #53#return; {739#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:07,932 INFO L290 TraceCheckUtils]: 9: Hoare triple {731#true} assume true; {731#true} is VALID [2022-04-28 14:23:07,932 INFO L290 TraceCheckUtils]: 8: Hoare triple {731#true} assume !(0 == ~cond); {731#true} is VALID [2022-04-28 14:23:07,932 INFO L290 TraceCheckUtils]: 7: Hoare triple {731#true} ~cond := #in~cond; {731#true} is VALID [2022-04-28 14:23:07,933 INFO L272 TraceCheckUtils]: 6: Hoare triple {739#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {731#true} is VALID [2022-04-28 14:23:07,934 INFO L290 TraceCheckUtils]: 5: Hoare triple {739#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {739#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:07,935 INFO L272 TraceCheckUtils]: 4: Hoare triple {739#(<= ~counter~0 0)} call #t~ret6 := main(); {739#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:07,935 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {739#(<= ~counter~0 0)} {731#true} #61#return; {739#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:07,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {739#(<= ~counter~0 0)} assume true; {739#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:07,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {731#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {739#(<= ~counter~0 0)} is VALID [2022-04-28 14:23:07,940 INFO L272 TraceCheckUtils]: 0: Hoare triple {731#true} call ULTIMATE.init(); {731#true} is VALID [2022-04-28 14:23:07,940 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 14:23:07,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:23:07,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524602912] [2022-04-28 14:23:07,940 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:23:07,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128936307] [2022-04-28 14:23:07,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128936307] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:23:07,940 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:23:07,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-04-28 14:23:07,941 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:23:07,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [992181196] [2022-04-28 14:23:07,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [992181196] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:23:07,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:23:07,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:23:07,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392470576] [2022-04-28 14:23:07,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:23:07,942 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2022-04-28 14:23:07,942 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:23:07,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 14:23:07,963 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:07,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:23:07,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:23:07,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:23:07,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 14:23:07,964 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 14:23:08,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:08,051 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-28 14:23:08,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 14:23:08,052 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2022-04-28 14:23:08,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:23:08,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 14:23:08,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-04-28 14:23:08,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 14:23:08,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-04-28 14:23:08,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 46 transitions. [2022-04-28 14:23:08,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:08,086 INFO L225 Difference]: With dead ends: 42 [2022-04-28 14:23:08,086 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 14:23:08,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-28 14:23:08,087 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:23:08,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 78 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:23:08,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 14:23:08,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-28 14:23:08,104 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:23:08,104 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 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 14:23:08,104 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 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 14:23:08,104 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 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 14:23:08,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:08,105 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-28 14:23:08,106 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-28 14:23:08,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:23:08,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:23:08,106 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 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 34 states. [2022-04-28 14:23:08,107 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 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 34 states. [2022-04-28 14:23:08,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:08,108 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-28 14:23:08,108 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-28 14:23:08,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:23:08,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:23:08,108 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:23:08,108 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:23:08,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 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 14:23:08,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-04-28 14:23:08,109 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 26 [2022-04-28 14:23:08,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:23:08,110 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-04-28 14:23:08,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 14:23:08,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 37 transitions. [2022-04-28 14:23:08,146 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 14:23:08,146 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-28 14:23:08,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 14:23:08,147 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:23:08,147 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:23:08,163 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 14:23:08,347 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 14:23:08,347 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:23:08,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:23:08,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1363053011, now seen corresponding path program 1 times [2022-04-28 14:23:08,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:23:08,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1476850961] [2022-04-28 14:23:08,472 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:23:08,472 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:23:08,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1363053011, now seen corresponding path program 2 times [2022-04-28 14:23:08,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:23:08,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106528768] [2022-04-28 14:23:08,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:23:08,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:23:08,481 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:23:08,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1612253460] [2022-04-28 14:23:08,482 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:23:08,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:23:08,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:23:08,490 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 14:23:08,491 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 14:23:08,537 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:23:08,537 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:23:08,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 14:23:08,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:23:08,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:23:08,647 INFO L272 TraceCheckUtils]: 0: Hoare triple {1113#true} call ULTIMATE.init(); {1113#true} is VALID [2022-04-28 14:23:08,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {1113#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1113#true} is VALID [2022-04-28 14:23:08,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {1113#true} assume true; {1113#true} is VALID [2022-04-28 14:23:08,647 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1113#true} {1113#true} #61#return; {1113#true} is VALID [2022-04-28 14:23:08,647 INFO L272 TraceCheckUtils]: 4: Hoare triple {1113#true} call #t~ret6 := main(); {1113#true} is VALID [2022-04-28 14:23:08,647 INFO L290 TraceCheckUtils]: 5: Hoare triple {1113#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; {1113#true} is VALID [2022-04-28 14:23:08,648 INFO L272 TraceCheckUtils]: 6: Hoare triple {1113#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1113#true} is VALID [2022-04-28 14:23:08,648 INFO L290 TraceCheckUtils]: 7: Hoare triple {1113#true} ~cond := #in~cond; {1113#true} is VALID [2022-04-28 14:23:08,648 INFO L290 TraceCheckUtils]: 8: Hoare triple {1113#true} assume !(0 == ~cond); {1113#true} is VALID [2022-04-28 14:23:08,648 INFO L290 TraceCheckUtils]: 9: Hoare triple {1113#true} assume true; {1113#true} is VALID [2022-04-28 14:23:08,648 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1113#true} {1113#true} #53#return; {1113#true} is VALID [2022-04-28 14:23:08,649 INFO L290 TraceCheckUtils]: 11: Hoare triple {1113#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1151#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:23:08,650 INFO L290 TraceCheckUtils]: 12: Hoare triple {1151#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1151#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:23:08,650 INFO L290 TraceCheckUtils]: 13: Hoare triple {1151#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 2);havoc #t~post5; {1151#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:23:08,650 INFO L272 TraceCheckUtils]: 14: Hoare triple {1151#(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)); {1113#true} is VALID [2022-04-28 14:23:08,650 INFO L290 TraceCheckUtils]: 15: Hoare triple {1113#true} ~cond := #in~cond; {1113#true} is VALID [2022-04-28 14:23:08,651 INFO L290 TraceCheckUtils]: 16: Hoare triple {1113#true} assume !(0 == ~cond); {1113#true} is VALID [2022-04-28 14:23:08,651 INFO L290 TraceCheckUtils]: 17: Hoare triple {1113#true} assume true; {1113#true} is VALID [2022-04-28 14:23:08,669 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1113#true} {1151#(and (= main_~x~0 0) (= main_~y~0 0))} #55#return; {1151#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:23:08,670 INFO L290 TraceCheckUtils]: 19: Hoare triple {1151#(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; {1176#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-28 14:23:08,670 INFO L290 TraceCheckUtils]: 20: Hoare triple {1176#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1176#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-28 14:23:08,671 INFO L290 TraceCheckUtils]: 21: Hoare triple {1176#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} assume !!(#t~post5 < 2);havoc #t~post5; {1176#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-28 14:23:08,671 INFO L272 TraceCheckUtils]: 22: Hoare triple {1176#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) 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)); {1186#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:23:08,672 INFO L290 TraceCheckUtils]: 23: Hoare triple {1186#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1190#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:23:08,672 INFO L290 TraceCheckUtils]: 24: Hoare triple {1190#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1114#false} is VALID [2022-04-28 14:23:08,672 INFO L290 TraceCheckUtils]: 25: Hoare triple {1114#false} assume !false; {1114#false} is VALID [2022-04-28 14:23:08,672 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:23:08,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:23:08,796 INFO L290 TraceCheckUtils]: 25: Hoare triple {1114#false} assume !false; {1114#false} is VALID [2022-04-28 14:23:08,796 INFO L290 TraceCheckUtils]: 24: Hoare triple {1190#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1114#false} is VALID [2022-04-28 14:23:08,796 INFO L290 TraceCheckUtils]: 23: Hoare triple {1186#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1190#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:23:08,797 INFO L272 TraceCheckUtils]: 22: Hoare triple {1206#(= (+ 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)); {1186#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:23:08,798 INFO L290 TraceCheckUtils]: 21: Hoare triple {1206#(= (+ 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 !!(#t~post5 < 2);havoc #t~post5; {1206#(= (+ 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 14:23:08,798 INFO L290 TraceCheckUtils]: 20: Hoare triple {1206#(= (+ 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)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1206#(= (+ 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 14:23:10,804 WARN L290 TraceCheckUtils]: 19: Hoare triple {1206#(= (+ 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; {1206#(= (+ 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 UNKNOWN [2022-04-28 14:23:10,807 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1113#true} {1206#(= (+ 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)))} #55#return; {1206#(= (+ 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 14:23:10,807 INFO L290 TraceCheckUtils]: 17: Hoare triple {1113#true} assume true; {1113#true} is VALID [2022-04-28 14:23:10,807 INFO L290 TraceCheckUtils]: 16: Hoare triple {1113#true} assume !(0 == ~cond); {1113#true} is VALID [2022-04-28 14:23:10,808 INFO L290 TraceCheckUtils]: 15: Hoare triple {1113#true} ~cond := #in~cond; {1113#true} is VALID [2022-04-28 14:23:10,808 INFO L272 TraceCheckUtils]: 14: Hoare triple {1206#(= (+ 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)); {1113#true} is VALID [2022-04-28 14:23:10,808 INFO L290 TraceCheckUtils]: 13: Hoare triple {1206#(= (+ 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 !!(#t~post5 < 2);havoc #t~post5; {1206#(= (+ 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 14:23:10,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {1206#(= (+ 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)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1206#(= (+ 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 14:23:10,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {1113#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1206#(= (+ 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 14:23:10,809 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1113#true} {1113#true} #53#return; {1113#true} is VALID [2022-04-28 14:23:10,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {1113#true} assume true; {1113#true} is VALID [2022-04-28 14:23:10,809 INFO L290 TraceCheckUtils]: 8: Hoare triple {1113#true} assume !(0 == ~cond); {1113#true} is VALID [2022-04-28 14:23:10,810 INFO L290 TraceCheckUtils]: 7: Hoare triple {1113#true} ~cond := #in~cond; {1113#true} is VALID [2022-04-28 14:23:10,810 INFO L272 TraceCheckUtils]: 6: Hoare triple {1113#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1113#true} is VALID [2022-04-28 14:23:10,810 INFO L290 TraceCheckUtils]: 5: Hoare triple {1113#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; {1113#true} is VALID [2022-04-28 14:23:10,810 INFO L272 TraceCheckUtils]: 4: Hoare triple {1113#true} call #t~ret6 := main(); {1113#true} is VALID [2022-04-28 14:23:10,810 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1113#true} {1113#true} #61#return; {1113#true} is VALID [2022-04-28 14:23:10,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {1113#true} assume true; {1113#true} is VALID [2022-04-28 14:23:10,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {1113#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1113#true} is VALID [2022-04-28 14:23:10,810 INFO L272 TraceCheckUtils]: 0: Hoare triple {1113#true} call ULTIMATE.init(); {1113#true} is VALID [2022-04-28 14:23:10,810 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 14:23:10,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:23:10,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106528768] [2022-04-28 14:23:10,811 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:23:10,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612253460] [2022-04-28 14:23:10,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612253460] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 14:23:10,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:23:10,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-28 14:23:10,811 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:23:10,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1476850961] [2022-04-28 14:23:10,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1476850961] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:23:10,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:23:10,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:23:10,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766796938] [2022-04-28 14:23:10,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:23:10,812 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 26 [2022-04-28 14:23:10,812 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:23:10,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 14:23:11,823 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:11,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:23:11,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:23:11,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:23:11,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 14:23:11,824 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 14:23:11,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:11,947 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2022-04-28 14:23:11,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:23:11,947 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 26 [2022-04-28 14:23:11,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:23:11,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 14:23:11,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-28 14:23:11,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 14:23:11,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-28 14:23:11,949 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-28 14:23:12,263 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 14:23:12,264 INFO L225 Difference]: With dead ends: 40 [2022-04-28 14:23:12,264 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 14:23:12,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 14:23:12,265 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 73 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 14:23:12,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 73 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:23:12,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 14:23:12,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-28 14:23:12,285 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:23:12,286 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 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 14:23:12,286 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 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 14:23:12,286 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 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 14:23:12,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:12,287 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-28 14:23:12,287 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-28 14:23:12,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:23:12,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:23:12,288 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 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 36 states. [2022-04-28 14:23:12,288 INFO L87 Difference]: Start difference. First operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 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 36 states. [2022-04-28 14:23:12,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:12,289 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-28 14:23:12,289 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-28 14:23:12,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:23:12,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:23:12,289 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:23:12,289 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:23:12,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 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 14:23:12,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2022-04-28 14:23:12,290 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 26 [2022-04-28 14:23:12,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:23:12,291 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2022-04-28 14:23:12,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 14:23:12,291 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 38 transitions. [2022-04-28 14:23:12,875 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 14:23:12,875 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-28 14:23:12,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 14:23:12,876 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:23:12,876 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 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 14:23:12,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-28 14:23:13,076 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 14:23:13,076 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:23:13,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:23:13,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1559147673, now seen corresponding path program 1 times [2022-04-28 14:23:13,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:23:13,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1884521893] [2022-04-28 14:23:13,180 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:23:13,180 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:23:13,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1559147673, now seen corresponding path program 2 times [2022-04-28 14:23:13,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:23:13,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690409740] [2022-04-28 14:23:13,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:23:13,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:23:13,198 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:23:13,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1654539695] [2022-04-28 14:23:13,199 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:23:13,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:23:13,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:23:13,200 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 14:23:13,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 14:23:13,239 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:23:13,239 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:23:13,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 14:23:13,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:23:13,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:23:13,482 INFO L272 TraceCheckUtils]: 0: Hoare triple {1501#true} call ULTIMATE.init(); {1501#true} is VALID [2022-04-28 14:23:13,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {1501#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1501#true} is VALID [2022-04-28 14:23:13,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {1501#true} assume true; {1501#true} is VALID [2022-04-28 14:23:13,482 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1501#true} {1501#true} #61#return; {1501#true} is VALID [2022-04-28 14:23:13,482 INFO L272 TraceCheckUtils]: 4: Hoare triple {1501#true} call #t~ret6 := main(); {1501#true} is VALID [2022-04-28 14:23:13,482 INFO L290 TraceCheckUtils]: 5: Hoare triple {1501#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; {1501#true} is VALID [2022-04-28 14:23:13,482 INFO L272 TraceCheckUtils]: 6: Hoare triple {1501#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1501#true} is VALID [2022-04-28 14:23:13,483 INFO L290 TraceCheckUtils]: 7: Hoare triple {1501#true} ~cond := #in~cond; {1501#true} is VALID [2022-04-28 14:23:13,483 INFO L290 TraceCheckUtils]: 8: Hoare triple {1501#true} assume !(0 == ~cond); {1501#true} is VALID [2022-04-28 14:23:13,483 INFO L290 TraceCheckUtils]: 9: Hoare triple {1501#true} assume true; {1501#true} is VALID [2022-04-28 14:23:13,483 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1501#true} {1501#true} #53#return; {1501#true} is VALID [2022-04-28 14:23:13,483 INFO L290 TraceCheckUtils]: 11: Hoare triple {1501#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1539#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:23:13,484 INFO L290 TraceCheckUtils]: 12: Hoare triple {1539#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1539#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:23:13,484 INFO L290 TraceCheckUtils]: 13: Hoare triple {1539#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 2);havoc #t~post5; {1539#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:23:13,484 INFO L272 TraceCheckUtils]: 14: Hoare triple {1539#(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)); {1501#true} is VALID [2022-04-28 14:23:13,484 INFO L290 TraceCheckUtils]: 15: Hoare triple {1501#true} ~cond := #in~cond; {1501#true} is VALID [2022-04-28 14:23:13,484 INFO L290 TraceCheckUtils]: 16: Hoare triple {1501#true} assume !(0 == ~cond); {1501#true} is VALID [2022-04-28 14:23:13,484 INFO L290 TraceCheckUtils]: 17: Hoare triple {1501#true} assume true; {1501#true} is VALID [2022-04-28 14:23:13,485 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1501#true} {1539#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {1539#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:23:13,485 INFO L290 TraceCheckUtils]: 19: Hoare triple {1539#(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; {1564#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 14:23:13,486 INFO L290 TraceCheckUtils]: 20: Hoare triple {1564#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1564#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 14:23:13,486 INFO L290 TraceCheckUtils]: 21: Hoare triple {1564#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !!(#t~post5 < 2);havoc #t~post5; {1564#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 14:23:13,486 INFO L272 TraceCheckUtils]: 22: Hoare triple {1564#(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)); {1501#true} is VALID [2022-04-28 14:23:13,486 INFO L290 TraceCheckUtils]: 23: Hoare triple {1501#true} ~cond := #in~cond; {1501#true} is VALID [2022-04-28 14:23:13,486 INFO L290 TraceCheckUtils]: 24: Hoare triple {1501#true} assume !(0 == ~cond); {1501#true} is VALID [2022-04-28 14:23:13,487 INFO L290 TraceCheckUtils]: 25: Hoare triple {1501#true} assume true; {1501#true} is VALID [2022-04-28 14:23:13,487 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1501#true} {1564#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #55#return; {1564#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 14:23:13,488 INFO L290 TraceCheckUtils]: 27: Hoare triple {1564#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {1589#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:13,488 INFO L272 TraceCheckUtils]: 28: Hoare triple {1589#(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)); {1501#true} is VALID [2022-04-28 14:23:13,488 INFO L290 TraceCheckUtils]: 29: Hoare triple {1501#true} ~cond := #in~cond; {1501#true} is VALID [2022-04-28 14:23:13,488 INFO L290 TraceCheckUtils]: 30: Hoare triple {1501#true} assume !(0 == ~cond); {1501#true} is VALID [2022-04-28 14:23:13,488 INFO L290 TraceCheckUtils]: 31: Hoare triple {1501#true} assume true; {1501#true} is VALID [2022-04-28 14:23:13,488 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1501#true} {1589#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} #57#return; {1589#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-28 14:23:13,489 INFO L272 TraceCheckUtils]: 33: Hoare triple {1589#(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)); {1608#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:23:13,489 INFO L290 TraceCheckUtils]: 34: Hoare triple {1608#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1612#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:23:13,490 INFO L290 TraceCheckUtils]: 35: Hoare triple {1612#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1502#false} is VALID [2022-04-28 14:23:13,490 INFO L290 TraceCheckUtils]: 36: Hoare triple {1502#false} assume !false; {1502#false} is VALID [2022-04-28 14:23:13,490 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 14:23:13,490 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:23:13,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:23:13,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690409740] [2022-04-28 14:23:13,732 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:23:13,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654539695] [2022-04-28 14:23:13,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654539695] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:23:13,732 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:23:13,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-28 14:23:13,732 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:23:13,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1884521893] [2022-04-28 14:23:13,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1884521893] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:23:13,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:23:13,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 14:23:13,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908077125] [2022-04-28 14:23:13,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:23:13,733 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 37 [2022-04-28 14:23:13,733 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:23:13,733 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 14:23:13,752 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:23:13,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 14:23:13,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:23:13,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 14:23:13,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 14:23:13,753 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 14:23:13,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:13,963 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-04-28 14:23:13,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 14:23:13,963 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 37 [2022-04-28 14:23:13,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:23:13,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 14:23:13,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-28 14:23:13,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 14:23:13,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-28 14:23:13,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 44 transitions. [2022-04-28 14:23:13,997 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 14:23:13,997 INFO L225 Difference]: With dead ends: 44 [2022-04-28 14:23:13,998 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 14:23:13,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 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 14:23:13,998 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 141 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 14:23:13,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 141 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:23:13,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 14:23:14,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-28 14:23:14,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:23:14,022 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 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 14:23:14,022 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 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 14:23:14,022 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 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 14:23:14,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:14,024 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-28 14:23:14,024 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-28 14:23:14,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:23:14,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:23:14,024 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 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 38 states. [2022-04-28 14:23:14,024 INFO L87 Difference]: Start difference. First operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 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 38 states. [2022-04-28 14:23:14,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:23:14,025 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-28 14:23:14,025 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-28 14:23:14,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:23:14,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:23:14,026 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:23:14,026 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:23:14,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 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 14:23:14,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-04-28 14:23:14,027 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 37 [2022-04-28 14:23:14,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:23:14,027 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-04-28 14:23:14,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 14:23:14,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 41 transitions. [2022-04-28 14:23:14,413 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 14:23:14,413 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-28 14:23:14,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 14:23:14,414 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:23:14,414 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:23:14,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 14:23:14,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:23:14,614 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:23:14,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:23:14,615 INFO L85 PathProgramCache]: Analyzing trace with hash -951509150, now seen corresponding path program 1 times [2022-04-28 14:23:14,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:23:14,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1057502004] [2022-04-28 14:23:14,713 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:23:14,713 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:23:14,713 INFO L85 PathProgramCache]: Analyzing trace with hash -951509150, now seen corresponding path program 2 times [2022-04-28 14:23:14,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:23:14,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991896325] [2022-04-28 14:23:14,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:23:14,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:23:14,734 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:23:14,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1935698989] [2022-04-28 14:23:14,735 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:23:14,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:23:14,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:23:14,738 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:23:14,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 14:23:14,799 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:23:14,799 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-28 14:23:14,800 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 14:23:14,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 14:23:14,868 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 14:23:14,868 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-28 14:23:14,868 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-28 14:23:14,869 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 14:23:14,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 14:23:15,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:23:15,073 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2] [2022-04-28 14:23:15,075 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 14:23:15,083 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 14:23:15,083 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-28 14:23:15,083 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 14:23:15,083 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 14:23:15,083 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 14:23:15,083 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-28 14:23:15,083 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-28 14:23:15,083 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 14:23:15,083 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 14:23:15,083 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 14:23:15,083 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 14:23:15,084 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-28 14:23:15,084 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-28 14:23:15,084 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-04-28 14:23:15,084 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-04-28 14:23:15,084 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-28 14:23:15,084 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-28 14:23:15,084 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 14:23:15,084 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 14:23:15,084 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-28 14:23:15,084 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-04-28 14:23:15,084 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-28 14:23:15,084 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-28 14:23:15,084 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2022-04-28 14:23:15,084 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-28 14:23:15,084 WARN L170 areAnnotationChecker]: L28-3 has no Hoare annotation [2022-04-28 14:23:15,084 WARN L170 areAnnotationChecker]: L28-3 has no Hoare annotation [2022-04-28 14:23:15,084 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 14:23:15,084 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 14:23:15,084 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 14:23:15,084 WARN L170 areAnnotationChecker]: L28-4 has no Hoare annotation [2022-04-28 14:23:15,084 WARN L170 areAnnotationChecker]: L28-4 has no Hoare annotation [2022-04-28 14:23:15,084 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-28 14:23:15,084 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-28 14:23:15,084 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-28 14:23:15,084 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-28 14:23:15,084 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-28 14:23:15,085 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-28 14:23:15,085 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-28 14:23:15,085 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-28 14:23:15,085 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-28 14:23:15,085 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 14:23:15,085 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 14:23:15,085 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 14:23:15,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 02:23:15 BoogieIcfgContainer [2022-04-28 14:23:15,085 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 14:23:15,086 INFO L158 Benchmark]: Toolchain (without parser) took 10052.34ms. Allocated memory was 210.8MB in the beginning and 256.9MB in the end (delta: 46.1MB). Free memory was 161.1MB in the beginning and 205.4MB in the end (delta: -44.2MB). Peak memory consumption was 2.9MB. Max. memory is 8.0GB. [2022-04-28 14:23:15,086 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 210.8MB. Free memory is still 177.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 14:23:15,086 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.25ms. Allocated memory is still 210.8MB. Free memory was 161.0MB in the beginning and 186.0MB in the end (delta: -25.0MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. [2022-04-28 14:23:15,087 INFO L158 Benchmark]: Boogie Preprocessor took 33.38ms. Allocated memory is still 210.8MB. Free memory was 186.0MB in the beginning and 184.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 14:23:15,087 INFO L158 Benchmark]: RCFGBuilder took 198.80ms. Allocated memory is still 210.8MB. Free memory was 184.4MB in the beginning and 173.4MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 14:23:15,087 INFO L158 Benchmark]: TraceAbstraction took 9597.29ms. Allocated memory was 210.8MB in the beginning and 256.9MB in the end (delta: 46.1MB). Free memory was 172.9MB in the beginning and 205.4MB in the end (delta: -32.5MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-28 14:23:15,088 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 210.8MB. Free memory is still 177.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 218.25ms. Allocated memory is still 210.8MB. Free memory was 161.0MB in the beginning and 186.0MB in the end (delta: -25.0MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.38ms. Allocated memory is still 210.8MB. Free memory was 186.0MB in the beginning and 184.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 198.80ms. Allocated memory is still 210.8MB. Free memory was 184.4MB in the beginning and 173.4MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 9597.29ms. Allocated memory was 210.8MB in the beginning and 256.9MB in the end (delta: 46.1MB). Free memory was 172.9MB in the beginning and 205.4MB in the end (delta: -32.5MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 12]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int counter = 0; [L19] short k; [L20] long long y, x, c; [L21] k = __VERIFIER_nondet_short() [L22] CALL assume_abort_if_not(k <= 256) [L7] COND FALSE !(!cond) [L22] RET assume_abort_if_not(k <= 256) [L24] y = 0 [L25] x = 0 [L26] c = 0 [L28] EXPR counter++ [L28] COND TRUE counter++<2 [L29] CALL __VERIFIER_assert(6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y == 0) [L10] COND FALSE !(!(cond)) [L29] RET __VERIFIER_assert(6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y == 0) [L31] COND FALSE !(!(c < k)) [L34] c = c + 1 [L35] y = y + 1 [L36] x = y * y * y * y + x [L28] EXPR counter++ [L28] COND TRUE counter++<2 [L29] CALL __VERIFIER_assert(6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y == 0) [L10] COND FALSE !(!(cond)) [L29] RET __VERIFIER_assert(6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y == 0) [L31] COND FALSE !(!(c < k)) [L34] c = c + 1 [L35] y = y + 1 [L36] x = y * y * y * y + x [L28] EXPR counter++ [L28] COND FALSE !(counter++<2) [L39] CALL __VERIFIER_assert(6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y == 0) [L10] COND FALSE !(!(cond)) [L39] RET __VERIFIER_assert(6*y*y*y*y*y + 15*y*y*y*y + 10*y*y*y - 30*x - y == 0) [L40] CALL __VERIFIER_assert(k*y == y*y) [L10] COND TRUE !(cond) [L12] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.6s, OverallIterations: 7, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 35 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31 mSDsluCounter, 476 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 317 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 142 IncrementalHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 159 mSDtfsCounter, 142 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 203 GetRequests, 172 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=6, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-28 14:23:15,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...