./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound100.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound100.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b8588da8d66d82eb7aa3eaf3ef7c4d24b2b275bf9c1acdf38a110c8bc6eba3b7 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:43:50,289 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:43:50,290 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:43:50,323 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:43:50,327 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:43:50,328 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:43:50,330 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:43:50,335 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:43:50,337 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:43:50,337 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:43:50,339 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:43:50,339 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:43:50,341 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:43:50,342 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:43:50,344 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:43:50,346 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:43:50,347 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:43:50,348 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:43:50,354 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:43:50,355 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:43:50,356 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:43:50,357 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:43:50,364 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:43:50,364 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:43:50,366 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:43:50,366 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:43:50,367 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:43:50,367 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:43:50,368 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:43:50,368 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:43:50,372 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:43:50,373 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:43:50,373 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:43:50,374 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:43:50,374 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:43:50,375 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:43:50,375 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:43:50,375 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:43:50,376 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:43:50,376 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:43:50,376 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:43:50,377 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 17:43:50,396 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:43:50,399 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:43:50,399 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:43:50,399 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:43:50,400 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:43:50,400 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:43:50,401 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:43:50,401 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:43:50,401 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:43:50,401 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:43:50,403 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:43:50,403 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:43:50,403 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:43:50,403 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:43:50,403 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:43:50,404 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:43:50,404 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:43:50,404 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:43:50,404 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:43:50,404 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:43:50,404 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:43:50,405 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:43:50,405 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:43:50,405 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:43:50,405 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:43:50,405 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:43:50,406 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:43:50,406 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:43:50,406 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:43:50,406 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:43:50,406 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:43:50,406 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:43:50,407 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:43:50,407 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b8588da8d66d82eb7aa3eaf3ef7c4d24b2b275bf9c1acdf38a110c8bc6eba3b7 [2022-02-20 17:43:50,642 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:43:50,667 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:43:50,670 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:43:50,671 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:43:50,671 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:43:50,672 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound100.c [2022-02-20 17:43:50,721 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f7e14331/a6310b7b79654e50aa8bbdacc8586a93/FLAGe42ea7168 [2022-02-20 17:43:51,095 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:43:51,096 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound100.c [2022-02-20 17:43:51,103 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f7e14331/a6310b7b79654e50aa8bbdacc8586a93/FLAGe42ea7168 [2022-02-20 17:43:51,112 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f7e14331/a6310b7b79654e50aa8bbdacc8586a93 [2022-02-20 17:43:51,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:43:51,116 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:43:51,117 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:43:51,117 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:43:51,120 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:43:51,121 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:43:51" (1/1) ... [2022-02-20 17:43:51,122 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@732a518c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:51, skipping insertion in model container [2022-02-20 17:43:51,122 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:43:51" (1/1) ... [2022-02-20 17:43:51,132 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:43:51,147 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:43:51,297 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound100.c[458,471] [2022-02-20 17:43:51,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:43:51,321 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:43:51,331 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound100.c[458,471] [2022-02-20 17:43:51,340 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:43:51,351 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:43:51,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:51 WrapperNode [2022-02-20 17:43:51,352 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:43:51,353 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:43:51,353 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:43:51,353 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:43:51,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:51" (1/1) ... [2022-02-20 17:43:51,364 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:51" (1/1) ... [2022-02-20 17:43:51,380 INFO L137 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 36 [2022-02-20 17:43:51,380 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:43:51,381 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:43:51,381 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:43:51,381 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:43:51,387 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:51" (1/1) ... [2022-02-20 17:43:51,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:51" (1/1) ... [2022-02-20 17:43:51,389 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:51" (1/1) ... [2022-02-20 17:43:51,389 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:51" (1/1) ... [2022-02-20 17:43:51,392 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:51" (1/1) ... [2022-02-20 17:43:51,394 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:51" (1/1) ... [2022-02-20 17:43:51,395 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:51" (1/1) ... [2022-02-20 17:43:51,396 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:43:51,397 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:43:51,397 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:43:51,397 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:43:51,403 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:51" (1/1) ... [2022-02-20 17:43:51,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:43:51,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:43:51,432 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-02-20 17:43:51,459 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-02-20 17:43:51,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:43:51,473 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 17:43:51,474 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 17:43:51,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:43:51,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:43:51,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:43:51,474 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:43:51,474 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:43:51,522 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:43:51,525 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:43:51,632 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:43:51,638 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:43:51,638 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:43:51,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:43:51 BoogieIcfgContainer [2022-02-20 17:43:51,640 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:43:51,641 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:43:51,641 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:43:51,644 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:43:51,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:43:51" (1/3) ... [2022-02-20 17:43:51,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@132ead4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:43:51, skipping insertion in model container [2022-02-20 17:43:51,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:51" (2/3) ... [2022-02-20 17:43:51,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@132ead4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:43:51, skipping insertion in model container [2022-02-20 17:43:51,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:43:51" (3/3) ... [2022-02-20 17:43:51,646 INFO L111 eAbstractionObserver]: Analyzing ICFG ps6-ll_valuebound100.c [2022-02-20 17:43:51,650 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:43:51,650 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:43:51,712 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:43:51,718 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 17:43:51,731 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:43:51,750 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:43:51,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 17:43:51,753 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:43:51,754 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:43:51,754 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:43:51,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:43:51,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1845349065, now seen corresponding path program 1 times [2022-02-20 17:43:51,782 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:43:51,783 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946287331] [2022-02-20 17:43:51,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:43:51,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:43:51,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:51,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 17:43:51,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:51,965 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#true} ~cond := #in~cond; {27#true} is VALID [2022-02-20 17:43:51,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume 0 == ~cond;assume false; {28#false} is VALID [2022-02-20 17:43:51,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#false} assume true; {28#false} is VALID [2022-02-20 17:43:51,969 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#false} {27#true} #50#return; {28#false} is VALID [2022-02-20 17:43:51,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-20 17:43:51,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:51,987 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#true} ~cond := #in~cond; {27#true} is VALID [2022-02-20 17:43:51,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume 0 == ~cond;assume false; {28#false} is VALID [2022-02-20 17:43:51,989 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#false} assume true; {28#false} is VALID [2022-02-20 17:43:51,989 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#false} {28#false} #52#return; {28#false} is VALID [2022-02-20 17:43:51,989 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#true} assume { :begin_inline_ULTIMATE.init } 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); {27#true} is VALID [2022-02-20 17:43:51,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {27#true} is VALID [2022-02-20 17:43:51,990 INFO L272 TraceCheckUtils]: 2: Hoare triple {27#true} call assume_abort_if_not((if main_~k~0#1 >= 0 && main_~k~0#1 <= 100 then 1 else 0)); {27#true} is VALID [2022-02-20 17:43:51,991 INFO L290 TraceCheckUtils]: 3: Hoare triple {27#true} ~cond := #in~cond; {27#true} is VALID [2022-02-20 17:43:51,992 INFO L290 TraceCheckUtils]: 4: Hoare triple {27#true} assume 0 == ~cond;assume false; {28#false} is VALID [2022-02-20 17:43:51,993 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#false} assume true; {28#false} is VALID [2022-02-20 17:43:51,993 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {28#false} {27#true} #50#return; {28#false} is VALID [2022-02-20 17:43:51,993 INFO L272 TraceCheckUtils]: 7: Hoare triple {28#false} call assume_abort_if_not((if main_~k~0#1 <= 256 then 1 else 0)); {27#true} is VALID [2022-02-20 17:43:51,993 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#true} ~cond := #in~cond; {27#true} is VALID [2022-02-20 17:43:51,994 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#true} assume 0 == ~cond;assume false; {28#false} is VALID [2022-02-20 17:43:51,994 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#false} assume true; {28#false} is VALID [2022-02-20 17:43:51,995 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {28#false} {28#false} #52#return; {28#false} is VALID [2022-02-20 17:43:51,995 INFO L290 TraceCheckUtils]: 12: Hoare triple {28#false} main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {28#false} is VALID [2022-02-20 17:43:51,995 INFO L290 TraceCheckUtils]: 13: Hoare triple {28#false} assume !true; {28#false} is VALID [2022-02-20 17:43:51,995 INFO L272 TraceCheckUtils]: 14: Hoare triple {28#false} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {28#false} is VALID [2022-02-20 17:43:51,996 INFO L290 TraceCheckUtils]: 15: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2022-02-20 17:43:51,997 INFO L290 TraceCheckUtils]: 16: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2022-02-20 17:43:51,997 INFO L290 TraceCheckUtils]: 17: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-02-20 17:43:51,998 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:43:51,998 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:43:51,999 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946287331] [2022-02-20 17:43:52,000 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946287331] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:43:52,001 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:43:52,001 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:43:52,002 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503073482] [2022-02-20 17:43:52,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:43:52,008 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-02-20 17:43:52,009 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:43:52,012 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:43:52,052 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:43:52,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:43:52,053 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:43:52,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:43:52,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:43:52,084 INFO L87 Difference]: Start difference. First operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:43:52,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:52,184 INFO L93 Difference]: Finished difference Result 45 states and 63 transitions. [2022-02-20 17:43:52,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:43:52,185 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-02-20 17:43:52,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:43:52,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:43:52,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 63 transitions. [2022-02-20 17:43:52,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:43:52,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 63 transitions. [2022-02-20 17:43:52,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 63 transitions. [2022-02-20 17:43:52,299 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:43:52,306 INFO L225 Difference]: With dead ends: 45 [2022-02-20 17:43:52,306 INFO L226 Difference]: Without dead ends: 20 [2022-02-20 17:43:52,309 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:43:52,311 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:43:52,312 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:43:52,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-02-20 17:43:52,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-02-20 17:43:52,335 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:43:52,336 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:43:52,337 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:43:52,337 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:43:52,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:52,341 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-02-20 17:43:52,341 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-02-20 17:43:52,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:52,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:52,342 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 20 states. [2022-02-20 17:43:52,342 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 20 states. [2022-02-20 17:43:52,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:52,345 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-02-20 17:43:52,346 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-02-20 17:43:52,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:52,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:52,346 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:43:52,347 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:43:52,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:43:52,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-02-20 17:43:52,350 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 18 [2022-02-20 17:43:52,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:43:52,350 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-02-20 17:43:52,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:43:52,351 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-02-20 17:43:52,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 17:43:52,352 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:43:52,352 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:43:52,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:43:52,353 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:43:52,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:43:52,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1506842435, now seen corresponding path program 1 times [2022-02-20 17:43:52,354 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:43:52,354 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750211332] [2022-02-20 17:43:52,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:43:52,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:43:52,375 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:43:52,381 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1159468719] [2022-02-20 17:43:52,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:43:52,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:43:52,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:43:52,385 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-02-20 17:43:52,386 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-02-20 17:43:52,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:52,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:43:52,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:52,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:43:52,560 INFO L290 TraceCheckUtils]: 0: Hoare triple {169#true} assume { :begin_inline_ULTIMATE.init } 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); {169#true} is VALID [2022-02-20 17:43:52,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {169#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {169#true} is VALID [2022-02-20 17:43:52,560 INFO L272 TraceCheckUtils]: 2: Hoare triple {169#true} call assume_abort_if_not((if main_~k~0#1 >= 0 && main_~k~0#1 <= 100 then 1 else 0)); {169#true} is VALID [2022-02-20 17:43:52,561 INFO L290 TraceCheckUtils]: 3: Hoare triple {169#true} ~cond := #in~cond; {169#true} is VALID [2022-02-20 17:43:52,561 INFO L290 TraceCheckUtils]: 4: Hoare triple {169#true} assume !(0 == ~cond); {169#true} is VALID [2022-02-20 17:43:52,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {169#true} assume true; {169#true} is VALID [2022-02-20 17:43:52,561 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {169#true} {169#true} #50#return; {169#true} is VALID [2022-02-20 17:43:52,562 INFO L272 TraceCheckUtils]: 7: Hoare triple {169#true} call assume_abort_if_not((if main_~k~0#1 <= 256 then 1 else 0)); {169#true} is VALID [2022-02-20 17:43:52,562 INFO L290 TraceCheckUtils]: 8: Hoare triple {169#true} ~cond := #in~cond; {169#true} is VALID [2022-02-20 17:43:52,562 INFO L290 TraceCheckUtils]: 9: Hoare triple {169#true} assume !(0 == ~cond); {169#true} is VALID [2022-02-20 17:43:52,562 INFO L290 TraceCheckUtils]: 10: Hoare triple {169#true} assume true; {169#true} is VALID [2022-02-20 17:43:52,563 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {169#true} {169#true} #52#return; {169#true} is VALID [2022-02-20 17:43:52,563 INFO L290 TraceCheckUtils]: 12: Hoare triple {169#true} main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {210#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:43:52,564 INFO L290 TraceCheckUtils]: 13: Hoare triple {210#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !false; {210#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:43:52,565 INFO L272 TraceCheckUtils]: 14: Hoare triple {210#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {217#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:43:52,566 INFO L290 TraceCheckUtils]: 15: Hoare triple {217#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {221#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:43:52,566 INFO L290 TraceCheckUtils]: 16: Hoare triple {221#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {170#false} is VALID [2022-02-20 17:43:52,566 INFO L290 TraceCheckUtils]: 17: Hoare triple {170#false} assume !false; {170#false} is VALID [2022-02-20 17:43:52,567 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:43:52,567 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:43:52,567 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:43:52,567 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750211332] [2022-02-20 17:43:52,568 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:43:52,568 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159468719] [2022-02-20 17:43:52,568 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159468719] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:43:52,568 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:43:52,568 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:43:52,569 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135338597] [2022-02-20 17:43:52,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:43:52,570 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-02-20 17:43:52,570 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:43:52,570 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:43:52,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:43:52,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:43:52,585 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:43:52,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:43:52,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:43:52,586 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:43:52,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:52,973 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-02-20 17:43:52,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:43:52,974 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-02-20 17:43:52,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:43:52,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:43:52,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-02-20 17:43:52,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:43:52,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-02-20 17:43:52,982 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2022-02-20 17:43:53,023 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:43:53,024 INFO L225 Difference]: With dead ends: 31 [2022-02-20 17:43:53,025 INFO L226 Difference]: Without dead ends: 27 [2022-02-20 17:43:53,025 INFO L932 BasicCegarLoop]: 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-02-20 17:43:53,026 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:43:53,027 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 75 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:43:53,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-20 17:43:53,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-02-20 17:43:53,032 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:43:53,032 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:43:53,033 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:43:53,033 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:43:53,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:53,035 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-02-20 17:43:53,035 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-02-20 17:43:53,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:53,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:53,036 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 27 states. [2022-02-20 17:43:53,037 INFO L87 Difference]: Start difference. First operand has 27 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 27 states. [2022-02-20 17:43:53,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:53,039 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-02-20 17:43:53,039 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-02-20 17:43:53,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:53,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:53,040 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:43:53,040 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:43:53,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:43:53,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-02-20 17:43:53,042 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 18 [2022-02-20 17:43:53,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:43:53,043 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-02-20 17:43:53,043 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:43:53,043 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-02-20 17:43:53,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 17:43:53,044 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:43:53,044 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:43:53,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 17:43:53,264 WARN L452 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-02-20 17:43:53,264 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:43:53,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:43:53,265 INFO L85 PathProgramCache]: Analyzing trace with hash 903983968, now seen corresponding path program 1 times [2022-02-20 17:43:53,265 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:43:53,265 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8298817] [2022-02-20 17:43:53,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:43:53,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:43:53,282 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:43:53,282 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1045277968] [2022-02-20 17:43:53,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:43:53,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:43:53,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:43:53,284 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-02-20 17:43:53,299 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-02-20 17:43:53,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:53,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 17:43:53,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:53,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:43:53,477 INFO L290 TraceCheckUtils]: 0: Hoare triple {365#true} assume { :begin_inline_ULTIMATE.init } 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); {365#true} is VALID [2022-02-20 17:43:53,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {365#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {365#true} is VALID [2022-02-20 17:43:53,478 INFO L272 TraceCheckUtils]: 2: Hoare triple {365#true} call assume_abort_if_not((if main_~k~0#1 >= 0 && main_~k~0#1 <= 100 then 1 else 0)); {365#true} is VALID [2022-02-20 17:43:53,478 INFO L290 TraceCheckUtils]: 3: Hoare triple {365#true} ~cond := #in~cond; {365#true} is VALID [2022-02-20 17:43:53,478 INFO L290 TraceCheckUtils]: 4: Hoare triple {365#true} assume !(0 == ~cond); {365#true} is VALID [2022-02-20 17:43:53,478 INFO L290 TraceCheckUtils]: 5: Hoare triple {365#true} assume true; {365#true} is VALID [2022-02-20 17:43:53,479 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {365#true} {365#true} #50#return; {365#true} is VALID [2022-02-20 17:43:53,479 INFO L272 TraceCheckUtils]: 7: Hoare triple {365#true} call assume_abort_if_not((if main_~k~0#1 <= 256 then 1 else 0)); {365#true} is VALID [2022-02-20 17:43:53,479 INFO L290 TraceCheckUtils]: 8: Hoare triple {365#true} ~cond := #in~cond; {365#true} is VALID [2022-02-20 17:43:53,479 INFO L290 TraceCheckUtils]: 9: Hoare triple {365#true} assume !(0 == ~cond); {365#true} is VALID [2022-02-20 17:43:53,480 INFO L290 TraceCheckUtils]: 10: Hoare triple {365#true} assume true; {365#true} is VALID [2022-02-20 17:43:53,480 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {365#true} {365#true} #52#return; {365#true} is VALID [2022-02-20 17:43:53,480 INFO L290 TraceCheckUtils]: 12: Hoare triple {365#true} main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {406#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:43:53,481 INFO L290 TraceCheckUtils]: 13: Hoare triple {406#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !false; {406#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:43:53,481 INFO L272 TraceCheckUtils]: 14: Hoare triple {406#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {365#true} is VALID [2022-02-20 17:43:53,481 INFO L290 TraceCheckUtils]: 15: Hoare triple {365#true} ~cond := #in~cond; {365#true} is VALID [2022-02-20 17:43:53,482 INFO L290 TraceCheckUtils]: 16: Hoare triple {365#true} assume !(0 == ~cond); {365#true} is VALID [2022-02-20 17:43:53,482 INFO L290 TraceCheckUtils]: 17: Hoare triple {365#true} assume true; {365#true} is VALID [2022-02-20 17:43:53,482 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {365#true} {406#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} #54#return; {406#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:43:53,483 INFO L290 TraceCheckUtils]: 19: Hoare triple {406#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {428#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) 0))} is VALID [2022-02-20 17:43:53,484 INFO L290 TraceCheckUtils]: 20: Hoare triple {428#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) 0))} assume !false; {428#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) 0))} is VALID [2022-02-20 17:43:53,485 INFO L272 TraceCheckUtils]: 21: Hoare triple {428#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {435#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:43:53,485 INFO L290 TraceCheckUtils]: 22: Hoare triple {435#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {439#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:43:53,486 INFO L290 TraceCheckUtils]: 23: Hoare triple {439#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {366#false} is VALID [2022-02-20 17:43:53,486 INFO L290 TraceCheckUtils]: 24: Hoare triple {366#false} assume !false; {366#false} is VALID [2022-02-20 17:43:53,487 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:43:53,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:43:53,679 INFO L290 TraceCheckUtils]: 24: Hoare triple {366#false} assume !false; {366#false} is VALID [2022-02-20 17:43:53,680 INFO L290 TraceCheckUtils]: 23: Hoare triple {439#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {366#false} is VALID [2022-02-20 17:43:53,681 INFO L290 TraceCheckUtils]: 22: Hoare triple {435#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {439#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:43:53,682 INFO L272 TraceCheckUtils]: 21: Hoare triple {455#(= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {435#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:43:53,682 INFO L290 TraceCheckUtils]: 20: Hoare triple {455#(= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} assume !false; {455#(= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:43:53,807 INFO L290 TraceCheckUtils]: 19: Hoare triple {455#(= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {455#(= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:43:53,808 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {365#true} {455#(= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} #54#return; {455#(= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:43:53,808 INFO L290 TraceCheckUtils]: 17: Hoare triple {365#true} assume true; {365#true} is VALID [2022-02-20 17:43:53,808 INFO L290 TraceCheckUtils]: 16: Hoare triple {365#true} assume !(0 == ~cond); {365#true} is VALID [2022-02-20 17:43:53,809 INFO L290 TraceCheckUtils]: 15: Hoare triple {365#true} ~cond := #in~cond; {365#true} is VALID [2022-02-20 17:43:53,809 INFO L272 TraceCheckUtils]: 14: Hoare triple {455#(= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {365#true} is VALID [2022-02-20 17:43:53,809 INFO L290 TraceCheckUtils]: 13: Hoare triple {455#(= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} assume !false; {455#(= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:43:53,810 INFO L290 TraceCheckUtils]: 12: Hoare triple {365#true} main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {455#(= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:43:53,810 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {365#true} {365#true} #52#return; {365#true} is VALID [2022-02-20 17:43:53,810 INFO L290 TraceCheckUtils]: 10: Hoare triple {365#true} assume true; {365#true} is VALID [2022-02-20 17:43:53,811 INFO L290 TraceCheckUtils]: 9: Hoare triple {365#true} assume !(0 == ~cond); {365#true} is VALID [2022-02-20 17:43:53,811 INFO L290 TraceCheckUtils]: 8: Hoare triple {365#true} ~cond := #in~cond; {365#true} is VALID [2022-02-20 17:43:53,811 INFO L272 TraceCheckUtils]: 7: Hoare triple {365#true} call assume_abort_if_not((if main_~k~0#1 <= 256 then 1 else 0)); {365#true} is VALID [2022-02-20 17:43:53,811 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {365#true} {365#true} #50#return; {365#true} is VALID [2022-02-20 17:43:53,811 INFO L290 TraceCheckUtils]: 5: Hoare triple {365#true} assume true; {365#true} is VALID [2022-02-20 17:43:53,811 INFO L290 TraceCheckUtils]: 4: Hoare triple {365#true} assume !(0 == ~cond); {365#true} is VALID [2022-02-20 17:43:53,811 INFO L290 TraceCheckUtils]: 3: Hoare triple {365#true} ~cond := #in~cond; {365#true} is VALID [2022-02-20 17:43:53,812 INFO L272 TraceCheckUtils]: 2: Hoare triple {365#true} call assume_abort_if_not((if main_~k~0#1 >= 0 && main_~k~0#1 <= 100 then 1 else 0)); {365#true} is VALID [2022-02-20 17:43:53,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {365#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {365#true} is VALID [2022-02-20 17:43:53,812 INFO L290 TraceCheckUtils]: 0: Hoare triple {365#true} assume { :begin_inline_ULTIMATE.init } 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); {365#true} is VALID [2022-02-20 17:43:53,812 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 17:43:53,812 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:43:53,812 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8298817] [2022-02-20 17:43:53,813 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:43:53,813 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045277968] [2022-02-20 17:43:53,813 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045277968] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 17:43:53,814 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:43:53,814 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-02-20 17:43:53,814 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654389614] [2022-02-20 17:43:53,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:43:53,814 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-02-20 17:43:53,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:43:53,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:43:53,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:43:53,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:43:53,941 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:43:53,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:43:53,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:43:53,942 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:43:54,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:54,045 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-02-20 17:43:54,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:43:54,046 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-02-20 17:43:54,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:43:54,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:43:54,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-02-20 17:43:54,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:43:54,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-02-20 17:43:54,049 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 28 transitions. [2022-02-20 17:43:54,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:43:54,163 INFO L225 Difference]: With dead ends: 33 [2022-02-20 17:43:54,163 INFO L226 Difference]: Without dead ends: 29 [2022-02-20 17:43:54,164 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 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-02-20 17:43:54,164 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:43:54,165 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 65 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:43:54,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-20 17:43:54,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-02-20 17:43:54,171 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:43:54,172 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:43:54,172 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:43:54,172 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:43:54,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:54,174 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-02-20 17:43:54,174 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-02-20 17:43:54,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:54,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:54,175 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 29 states. [2022-02-20 17:43:54,176 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 29 states. [2022-02-20 17:43:54,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:54,177 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-02-20 17:43:54,178 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-02-20 17:43:54,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:54,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:54,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:43:54,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:43:54,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:43:54,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-02-20 17:43:54,180 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 25 [2022-02-20 17:43:54,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:43:54,181 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-02-20 17:43:54,181 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:43:54,181 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-02-20 17:43:54,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-20 17:43:54,182 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:43:54,182 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:43:54,205 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-02-20 17:43:54,403 WARN L452 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-02-20 17:43:54,404 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:43:54,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:43:54,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1648043046, now seen corresponding path program 1 times [2022-02-20 17:43:54,404 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:43:54,404 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853161426] [2022-02-20 17:43:54,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:43:54,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:43:54,419 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:43:54,420 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1924606388] [2022-02-20 17:43:54,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:43:54,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:43:54,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:43:54,426 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-02-20 17:43:54,428 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-02-20 17:43:54,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:54,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 17:43:54,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:54,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:43:54,883 INFO L290 TraceCheckUtils]: 0: Hoare triple {664#true} assume { :begin_inline_ULTIMATE.init } 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); {664#true} is VALID [2022-02-20 17:43:54,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {664#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {664#true} is VALID [2022-02-20 17:43:54,884 INFO L272 TraceCheckUtils]: 2: Hoare triple {664#true} call assume_abort_if_not((if main_~k~0#1 >= 0 && main_~k~0#1 <= 100 then 1 else 0)); {664#true} is VALID [2022-02-20 17:43:54,884 INFO L290 TraceCheckUtils]: 3: Hoare triple {664#true} ~cond := #in~cond; {664#true} is VALID [2022-02-20 17:43:54,884 INFO L290 TraceCheckUtils]: 4: Hoare triple {664#true} assume !(0 == ~cond); {664#true} is VALID [2022-02-20 17:43:54,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {664#true} assume true; {664#true} is VALID [2022-02-20 17:43:54,885 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {664#true} {664#true} #50#return; {664#true} is VALID [2022-02-20 17:43:54,885 INFO L272 TraceCheckUtils]: 7: Hoare triple {664#true} call assume_abort_if_not((if main_~k~0#1 <= 256 then 1 else 0)); {664#true} is VALID [2022-02-20 17:43:54,885 INFO L290 TraceCheckUtils]: 8: Hoare triple {664#true} ~cond := #in~cond; {664#true} is VALID [2022-02-20 17:43:54,886 INFO L290 TraceCheckUtils]: 9: Hoare triple {664#true} assume !(0 == ~cond); {664#true} is VALID [2022-02-20 17:43:54,886 INFO L290 TraceCheckUtils]: 10: Hoare triple {664#true} assume true; {664#true} is VALID [2022-02-20 17:43:54,886 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {664#true} {664#true} #52#return; {664#true} is VALID [2022-02-20 17:43:54,888 INFO L290 TraceCheckUtils]: 12: Hoare triple {664#true} main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {705#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:43:54,888 INFO L290 TraceCheckUtils]: 13: Hoare triple {705#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !false; {705#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:43:54,888 INFO L272 TraceCheckUtils]: 14: Hoare triple {705#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {664#true} is VALID [2022-02-20 17:43:54,888 INFO L290 TraceCheckUtils]: 15: Hoare triple {664#true} ~cond := #in~cond; {664#true} is VALID [2022-02-20 17:43:54,889 INFO L290 TraceCheckUtils]: 16: Hoare triple {664#true} assume !(0 == ~cond); {664#true} is VALID [2022-02-20 17:43:54,889 INFO L290 TraceCheckUtils]: 17: Hoare triple {664#true} assume true; {664#true} is VALID [2022-02-20 17:43:54,889 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {664#true} {705#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #54#return; {705#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:43:54,890 INFO L290 TraceCheckUtils]: 19: Hoare triple {705#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {727#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:43:54,891 INFO L290 TraceCheckUtils]: 20: Hoare triple {727#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} assume !false; {727#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:43:54,891 INFO L272 TraceCheckUtils]: 21: Hoare triple {727#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {664#true} is VALID [2022-02-20 17:43:54,891 INFO L290 TraceCheckUtils]: 22: Hoare triple {664#true} ~cond := #in~cond; {664#true} is VALID [2022-02-20 17:43:54,891 INFO L290 TraceCheckUtils]: 23: Hoare triple {664#true} assume !(0 == ~cond); {664#true} is VALID [2022-02-20 17:43:54,892 INFO L290 TraceCheckUtils]: 24: Hoare triple {664#true} assume true; {664#true} is VALID [2022-02-20 17:43:54,892 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {664#true} {727#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} #54#return; {727#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:43:54,900 INFO L290 TraceCheckUtils]: 26: Hoare triple {727#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} assume !(main_~c~0#1 < main_~k~0#1); {749#(and (<= |ULTIMATE.start_main_~k~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:43:54,901 INFO L272 TraceCheckUtils]: 27: Hoare triple {749#(and (<= |ULTIMATE.start_main_~k~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {664#true} is VALID [2022-02-20 17:43:54,901 INFO L290 TraceCheckUtils]: 28: Hoare triple {664#true} ~cond := #in~cond; {664#true} is VALID [2022-02-20 17:43:54,901 INFO L290 TraceCheckUtils]: 29: Hoare triple {664#true} assume !(0 == ~cond); {664#true} is VALID [2022-02-20 17:43:54,901 INFO L290 TraceCheckUtils]: 30: Hoare triple {664#true} assume true; {664#true} is VALID [2022-02-20 17:43:54,902 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {664#true} {749#(and (<= |ULTIMATE.start_main_~k~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} #56#return; {749#(and (<= |ULTIMATE.start_main_~k~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:43:54,903 INFO L272 TraceCheckUtils]: 32: Hoare triple {749#(and (<= |ULTIMATE.start_main_~k~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if main_~k~0#1 * main_~y~0#1 == main_~y~0#1 * main_~y~0#1 then 1 else 0)); {768#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:43:54,903 INFO L290 TraceCheckUtils]: 33: Hoare triple {768#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {772#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:43:54,904 INFO L290 TraceCheckUtils]: 34: Hoare triple {772#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {665#false} is VALID [2022-02-20 17:43:54,904 INFO L290 TraceCheckUtils]: 35: Hoare triple {665#false} assume !false; {665#false} is VALID [2022-02-20 17:43:54,904 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 17:43:54,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:43:55,243 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:43:55,243 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853161426] [2022-02-20 17:43:55,243 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:43:55,243 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924606388] [2022-02-20 17:43:55,244 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924606388] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:43:55,244 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:43:55,244 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-02-20 17:43:55,244 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342519540] [2022-02-20 17:43:55,244 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:43:55,245 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 36 [2022-02-20 17:43:55,245 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:43:55,245 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 17:43:55,270 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:43:55,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 17:43:55,271 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:43:55,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 17:43:55,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:43:55,273 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 17:43:55,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:55,504 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2022-02-20 17:43:55,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:43:55,505 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 36 [2022-02-20 17:43:55,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:43:55,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 17:43:55,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2022-02-20 17:43:55,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 17:43:55,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2022-02-20 17:43:55,510 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 38 transitions. [2022-02-20 17:43:55,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:43:55,552 INFO L225 Difference]: With dead ends: 38 [2022-02-20 17:43:55,552 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 17:43:55,553 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 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-02-20 17:43:55,555 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:43:55,557 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 131 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:43:55,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 17:43:55,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-02-20 17:43:55,568 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:43:55,568 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:43:55,569 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:43:55,569 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:43:55,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:55,571 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-02-20 17:43:55,571 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-02-20 17:43:55,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:55,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:55,572 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 32 states. [2022-02-20 17:43:55,572 INFO L87 Difference]: Start difference. First operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 32 states. [2022-02-20 17:43:55,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:55,574 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-02-20 17:43:55,574 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-02-20 17:43:55,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:55,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:55,575 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:43:55,575 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:43:55,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:43:55,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-02-20 17:43:55,577 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 36 [2022-02-20 17:43:55,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:43:55,577 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-02-20 17:43:55,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 17:43:55,577 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-02-20 17:43:55,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 17:43:55,578 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:43:55,578 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:43:55,608 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-02-20 17:43:55,795 WARN L452 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-02-20 17:43:55,795 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:43:55,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:43:55,796 INFO L85 PathProgramCache]: Analyzing trace with hash -426505545, now seen corresponding path program 2 times [2022-02-20 17:43:55,796 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:43:55,796 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626121691] [2022-02-20 17:43:55,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:43:55,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:43:55,821 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:43:55,821 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1827930922] [2022-02-20 17:43:55,821 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:43:55,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:43:55,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:43:55,827 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-02-20 17:43:55,829 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-02-20 17:43:55,944 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:43:55,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:43:55,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-20 17:43:55,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:55,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:43:56,489 INFO L290 TraceCheckUtils]: 0: Hoare triple {1004#true} assume { :begin_inline_ULTIMATE.init } 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); {1004#true} is VALID [2022-02-20 17:43:56,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {1004#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1004#true} is VALID [2022-02-20 17:43:56,490 INFO L272 TraceCheckUtils]: 2: Hoare triple {1004#true} call assume_abort_if_not((if main_~k~0#1 >= 0 && main_~k~0#1 <= 100 then 1 else 0)); {1004#true} is VALID [2022-02-20 17:43:56,490 INFO L290 TraceCheckUtils]: 3: Hoare triple {1004#true} ~cond := #in~cond; {1004#true} is VALID [2022-02-20 17:43:56,490 INFO L290 TraceCheckUtils]: 4: Hoare triple {1004#true} assume !(0 == ~cond); {1004#true} is VALID [2022-02-20 17:43:56,491 INFO L290 TraceCheckUtils]: 5: Hoare triple {1004#true} assume true; {1004#true} is VALID [2022-02-20 17:43:56,491 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1004#true} {1004#true} #50#return; {1004#true} is VALID [2022-02-20 17:43:56,491 INFO L272 TraceCheckUtils]: 7: Hoare triple {1004#true} call assume_abort_if_not((if main_~k~0#1 <= 256 then 1 else 0)); {1004#true} is VALID [2022-02-20 17:43:56,491 INFO L290 TraceCheckUtils]: 8: Hoare triple {1004#true} ~cond := #in~cond; {1004#true} is VALID [2022-02-20 17:43:56,491 INFO L290 TraceCheckUtils]: 9: Hoare triple {1004#true} assume !(0 == ~cond); {1004#true} is VALID [2022-02-20 17:43:56,492 INFO L290 TraceCheckUtils]: 10: Hoare triple {1004#true} assume true; {1004#true} is VALID [2022-02-20 17:43:56,492 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1004#true} {1004#true} #52#return; {1004#true} is VALID [2022-02-20 17:43:56,492 INFO L290 TraceCheckUtils]: 12: Hoare triple {1004#true} main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {1045#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:43:56,493 INFO L290 TraceCheckUtils]: 13: Hoare triple {1045#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~x~0#1| 0))} assume !false; {1045#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:43:56,493 INFO L272 TraceCheckUtils]: 14: Hoare triple {1045#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1004#true} is VALID [2022-02-20 17:43:56,493 INFO L290 TraceCheckUtils]: 15: Hoare triple {1004#true} ~cond := #in~cond; {1004#true} is VALID [2022-02-20 17:43:56,494 INFO L290 TraceCheckUtils]: 16: Hoare triple {1004#true} assume !(0 == ~cond); {1004#true} is VALID [2022-02-20 17:43:56,494 INFO L290 TraceCheckUtils]: 17: Hoare triple {1004#true} assume true; {1004#true} is VALID [2022-02-20 17:43:56,494 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1004#true} {1045#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~x~0#1| 0))} #54#return; {1045#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:43:56,495 INFO L290 TraceCheckUtils]: 19: Hoare triple {1045#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0) (<= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1067#(and (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:43:56,496 INFO L290 TraceCheckUtils]: 20: Hoare triple {1067#(and (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !false; {1067#(and (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:43:56,496 INFO L272 TraceCheckUtils]: 21: Hoare triple {1067#(and (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1004#true} is VALID [2022-02-20 17:43:56,496 INFO L290 TraceCheckUtils]: 22: Hoare triple {1004#true} ~cond := #in~cond; {1004#true} is VALID [2022-02-20 17:43:56,496 INFO L290 TraceCheckUtils]: 23: Hoare triple {1004#true} assume !(0 == ~cond); {1004#true} is VALID [2022-02-20 17:43:56,497 INFO L290 TraceCheckUtils]: 24: Hoare triple {1004#true} assume true; {1004#true} is VALID [2022-02-20 17:43:56,497 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {1004#true} {1067#(and (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} #54#return; {1067#(and (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:43:56,498 INFO L290 TraceCheckUtils]: 26: Hoare triple {1067#(and (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1089#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (<= (+ |ULTIMATE.start_main_~x~0#1| (* 10 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) 1) (+ (* 5 |ULTIMATE.start_main_~y~0#1|) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} is VALID [2022-02-20 17:43:56,499 INFO L290 TraceCheckUtils]: 27: Hoare triple {1089#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (<= (+ |ULTIMATE.start_main_~x~0#1| (* 10 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) 1) (+ (* 5 |ULTIMATE.start_main_~y~0#1|) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} assume !false; {1089#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (<= (+ |ULTIMATE.start_main_~x~0#1| (* 10 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) 1) (+ (* 5 |ULTIMATE.start_main_~y~0#1|) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} is VALID [2022-02-20 17:43:56,499 INFO L272 TraceCheckUtils]: 28: Hoare triple {1089#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (<= (+ |ULTIMATE.start_main_~x~0#1| (* 10 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) 1) (+ (* 5 |ULTIMATE.start_main_~y~0#1|) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1004#true} is VALID [2022-02-20 17:43:56,500 INFO L290 TraceCheckUtils]: 29: Hoare triple {1004#true} ~cond := #in~cond; {1099#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:43:56,500 INFO L290 TraceCheckUtils]: 30: Hoare triple {1099#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1103#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:43:56,500 INFO L290 TraceCheckUtils]: 31: Hoare triple {1103#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1103#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:43:56,501 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1103#(not (= |__VERIFIER_assert_#in~cond| 0))} {1089#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (<= (+ |ULTIMATE.start_main_~x~0#1| (* 10 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) 1) (+ (* 5 |ULTIMATE.start_main_~y~0#1|) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} #54#return; {1110#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} is VALID [2022-02-20 17:43:56,502 INFO L290 TraceCheckUtils]: 33: Hoare triple {1110#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} assume !(main_~c~0#1 < main_~k~0#1); {1114#(and (<= |ULTIMATE.start_main_~k~0#1| 2) (= 2 |ULTIMATE.start_main_~y~0#1|) (< 1 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:43:56,502 INFO L272 TraceCheckUtils]: 34: Hoare triple {1114#(and (<= |ULTIMATE.start_main_~k~0#1| 2) (= 2 |ULTIMATE.start_main_~y~0#1|) (< 1 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1004#true} is VALID [2022-02-20 17:43:56,502 INFO L290 TraceCheckUtils]: 35: Hoare triple {1004#true} ~cond := #in~cond; {1004#true} is VALID [2022-02-20 17:43:56,503 INFO L290 TraceCheckUtils]: 36: Hoare triple {1004#true} assume !(0 == ~cond); {1004#true} is VALID [2022-02-20 17:43:56,503 INFO L290 TraceCheckUtils]: 37: Hoare triple {1004#true} assume true; {1004#true} is VALID [2022-02-20 17:43:56,503 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1004#true} {1114#(and (<= |ULTIMATE.start_main_~k~0#1| 2) (= 2 |ULTIMATE.start_main_~y~0#1|) (< 1 |ULTIMATE.start_main_~k~0#1|))} #56#return; {1114#(and (<= |ULTIMATE.start_main_~k~0#1| 2) (= 2 |ULTIMATE.start_main_~y~0#1|) (< 1 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:43:56,504 INFO L272 TraceCheckUtils]: 39: Hoare triple {1114#(and (<= |ULTIMATE.start_main_~k~0#1| 2) (= 2 |ULTIMATE.start_main_~y~0#1|) (< 1 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if main_~k~0#1 * main_~y~0#1 == main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1133#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:43:56,505 INFO L290 TraceCheckUtils]: 40: Hoare triple {1133#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1137#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:43:56,505 INFO L290 TraceCheckUtils]: 41: Hoare triple {1137#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1005#false} is VALID [2022-02-20 17:43:56,505 INFO L290 TraceCheckUtils]: 42: Hoare triple {1005#false} assume !false; {1005#false} is VALID [2022-02-20 17:43:56,505 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 13 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-02-20 17:43:56,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:44:15,134 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 18)) (.cse1 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 2)) (.cse2 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 119)) (.cse3 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 65))) (or (not (= (mod (+ .cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 120) .cse1 .cse2 .cse3) 12) 0)) (not (<= (div (+ .cse0 .cse1 .cse2 .cse3 12) 12) (+ (* (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) 10) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) |c_ULTIMATE.start_main_~x~0#1| (* 5 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) 1))) (forall ((|ULTIMATE.start_main_~k~0#1| Int)) (or (let ((.cse4 (+ |c_ULTIMATE.start_main_~y~0#1| 1))) (= (* |ULTIMATE.start_main_~k~0#1| .cse4) (* .cse4 .cse4))) (not (< |c_ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)) (< (+ |c_ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~k~0#1|))))) is different from false [2022-02-20 17:44:18,524 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:44:18,525 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626121691] [2022-02-20 17:44:18,525 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:44:18,525 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827930922] [2022-02-20 17:44:18,525 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827930922] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:44:18,525 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:44:18,525 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-02-20 17:44:18,525 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369780379] [2022-02-20 17:44:18,525 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:44:18,526 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 43 [2022-02-20 17:44:18,526 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:44:18,526 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 17:44:18,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:18,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 17:44:18,561 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:44:18,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 17:44:18,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=166, Unknown=1, NotChecked=26, Total=240 [2022-02-20 17:44:18,561 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 17:44:19,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:19,042 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-02-20 17:44:19,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 17:44:19,043 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 43 [2022-02-20 17:44:19,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:44:19,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 17:44:19,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2022-02-20 17:44:19,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 17:44:19,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2022-02-20 17:44:19,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 42 transitions. [2022-02-20 17:44:19,086 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:19,090 INFO L225 Difference]: With dead ends: 41 [2022-02-20 17:44:19,091 INFO L226 Difference]: Without dead ends: 35 [2022-02-20 17:44:19,091 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=68, Invalid=241, Unknown=1, NotChecked=32, Total=342 [2022-02-20 17:44:19,092 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 9 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 17:44:19,093 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 142 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 17:44:19,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-02-20 17:44:19,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-02-20 17:44:19,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:44:19,117 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:44:19,118 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:44:19,119 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:44:19,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:19,122 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-02-20 17:44:19,122 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-02-20 17:44:19,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:19,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:19,125 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 35 states. [2022-02-20 17:44:19,125 INFO L87 Difference]: Start difference. First operand has 35 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 35 states. [2022-02-20 17:44:19,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:19,130 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-02-20 17:44:19,130 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-02-20 17:44:19,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:19,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:19,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:44:19,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:44:19,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:44:19,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-02-20 17:44:19,136 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 43 [2022-02-20 17:44:19,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:44:19,138 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-02-20 17:44:19,139 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 17:44:19,139 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-02-20 17:44:19,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 17:44:19,141 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:44:19,141 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:44:19,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 17:44:19,343 WARN L452 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-02-20 17:44:19,343 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:44:19,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:44:19,344 INFO L85 PathProgramCache]: Analyzing trace with hash 173594938, now seen corresponding path program 3 times [2022-02-20 17:44:19,344 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:44:19,344 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965247684] [2022-02-20 17:44:19,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:44:19,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:44:19,360 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:44:19,361 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [75281534] [2022-02-20 17:44:19,361 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 17:44:19,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:44:19,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:44:19,362 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-02-20 17:44:19,383 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-02-20 17:44:19,617 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-02-20 17:44:19,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:44:19,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 32 conjunts are in the unsatisfiable core [2022-02-20 17:44:19,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:44:19,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:44:20,115 INFO L290 TraceCheckUtils]: 0: Hoare triple {1389#true} assume { :begin_inline_ULTIMATE.init } 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); {1389#true} is VALID [2022-02-20 17:44:20,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {1389#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1389#true} is VALID [2022-02-20 17:44:20,116 INFO L272 TraceCheckUtils]: 2: Hoare triple {1389#true} call assume_abort_if_not((if main_~k~0#1 >= 0 && main_~k~0#1 <= 100 then 1 else 0)); {1389#true} is VALID [2022-02-20 17:44:20,116 INFO L290 TraceCheckUtils]: 3: Hoare triple {1389#true} ~cond := #in~cond; {1389#true} is VALID [2022-02-20 17:44:20,116 INFO L290 TraceCheckUtils]: 4: Hoare triple {1389#true} assume !(0 == ~cond); {1389#true} is VALID [2022-02-20 17:44:20,116 INFO L290 TraceCheckUtils]: 5: Hoare triple {1389#true} assume true; {1389#true} is VALID [2022-02-20 17:44:20,116 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1389#true} {1389#true} #50#return; {1389#true} is VALID [2022-02-20 17:44:20,116 INFO L272 TraceCheckUtils]: 7: Hoare triple {1389#true} call assume_abort_if_not((if main_~k~0#1 <= 256 then 1 else 0)); {1389#true} is VALID [2022-02-20 17:44:20,116 INFO L290 TraceCheckUtils]: 8: Hoare triple {1389#true} ~cond := #in~cond; {1389#true} is VALID [2022-02-20 17:44:20,116 INFO L290 TraceCheckUtils]: 9: Hoare triple {1389#true} assume !(0 == ~cond); {1389#true} is VALID [2022-02-20 17:44:20,117 INFO L290 TraceCheckUtils]: 10: Hoare triple {1389#true} assume true; {1389#true} is VALID [2022-02-20 17:44:20,117 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1389#true} {1389#true} #52#return; {1389#true} is VALID [2022-02-20 17:44:20,120 INFO L290 TraceCheckUtils]: 12: Hoare triple {1389#true} main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {1430#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:44:20,120 INFO L290 TraceCheckUtils]: 13: Hoare triple {1430#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !false; {1430#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:44:20,120 INFO L272 TraceCheckUtils]: 14: Hoare triple {1430#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1389#true} is VALID [2022-02-20 17:44:20,120 INFO L290 TraceCheckUtils]: 15: Hoare triple {1389#true} ~cond := #in~cond; {1389#true} is VALID [2022-02-20 17:44:20,121 INFO L290 TraceCheckUtils]: 16: Hoare triple {1389#true} assume !(0 == ~cond); {1389#true} is VALID [2022-02-20 17:44:20,121 INFO L290 TraceCheckUtils]: 17: Hoare triple {1389#true} assume true; {1389#true} is VALID [2022-02-20 17:44:20,121 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1389#true} {1430#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #54#return; {1430#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:44:20,122 INFO L290 TraceCheckUtils]: 19: Hoare triple {1430#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1452#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:44:20,123 INFO L290 TraceCheckUtils]: 20: Hoare triple {1452#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !false; {1452#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:44:20,123 INFO L272 TraceCheckUtils]: 21: Hoare triple {1452#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1389#true} is VALID [2022-02-20 17:44:20,123 INFO L290 TraceCheckUtils]: 22: Hoare triple {1389#true} ~cond := #in~cond; {1389#true} is VALID [2022-02-20 17:44:20,123 INFO L290 TraceCheckUtils]: 23: Hoare triple {1389#true} assume !(0 == ~cond); {1389#true} is VALID [2022-02-20 17:44:20,123 INFO L290 TraceCheckUtils]: 24: Hoare triple {1389#true} assume true; {1389#true} is VALID [2022-02-20 17:44:20,124 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {1389#true} {1452#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} #54#return; {1452#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:44:20,128 INFO L290 TraceCheckUtils]: 26: Hoare triple {1452#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1474#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} is VALID [2022-02-20 17:44:20,128 INFO L290 TraceCheckUtils]: 27: Hoare triple {1474#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} assume !false; {1474#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} is VALID [2022-02-20 17:44:20,128 INFO L272 TraceCheckUtils]: 28: Hoare triple {1474#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1389#true} is VALID [2022-02-20 17:44:20,129 INFO L290 TraceCheckUtils]: 29: Hoare triple {1389#true} ~cond := #in~cond; {1484#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:44:20,129 INFO L290 TraceCheckUtils]: 30: Hoare triple {1484#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1488#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:44:20,129 INFO L290 TraceCheckUtils]: 31: Hoare triple {1488#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1488#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:44:20,131 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1488#(not (= |__VERIFIER_assert_#in~cond| 0))} {1474#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} #54#return; {1495#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} is VALID [2022-02-20 17:44:20,131 INFO L290 TraceCheckUtils]: 33: Hoare triple {1495#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1499#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (< 2 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 3) (= 400 (+ (* |ULTIMATE.start_main_~x~0#1| 12) (* 12 (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) 4)))} is VALID [2022-02-20 17:44:20,132 INFO L290 TraceCheckUtils]: 34: Hoare triple {1499#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (< 2 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 3) (= 400 (+ (* |ULTIMATE.start_main_~x~0#1| 12) (* 12 (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) 4)))} assume !false; {1499#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (< 2 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 3) (= 400 (+ (* |ULTIMATE.start_main_~x~0#1| 12) (* 12 (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) 4)))} is VALID [2022-02-20 17:44:20,132 INFO L272 TraceCheckUtils]: 35: Hoare triple {1499#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (< 2 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 3) (= 400 (+ (* |ULTIMATE.start_main_~x~0#1| 12) (* 12 (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) 4)))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1389#true} is VALID [2022-02-20 17:44:20,132 INFO L290 TraceCheckUtils]: 36: Hoare triple {1389#true} ~cond := #in~cond; {1484#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:44:20,133 INFO L290 TraceCheckUtils]: 37: Hoare triple {1484#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1488#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:44:20,133 INFO L290 TraceCheckUtils]: 38: Hoare triple {1488#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1488#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:44:20,134 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1488#(not (= |__VERIFIER_assert_#in~cond| 0))} {1499#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (< 2 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 3) (= 400 (+ (* |ULTIMATE.start_main_~x~0#1| 12) (* 12 (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) 4)))} #54#return; {1518#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (< 2 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 3))} is VALID [2022-02-20 17:44:20,135 INFO L290 TraceCheckUtils]: 40: Hoare triple {1518#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (< 2 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 3))} assume !(main_~c~0#1 < main_~k~0#1); {1522#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 3) (< 2 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:44:20,135 INFO L272 TraceCheckUtils]: 41: Hoare triple {1522#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 3) (< 2 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1389#true} is VALID [2022-02-20 17:44:20,135 INFO L290 TraceCheckUtils]: 42: Hoare triple {1389#true} ~cond := #in~cond; {1389#true} is VALID [2022-02-20 17:44:20,135 INFO L290 TraceCheckUtils]: 43: Hoare triple {1389#true} assume !(0 == ~cond); {1389#true} is VALID [2022-02-20 17:44:20,135 INFO L290 TraceCheckUtils]: 44: Hoare triple {1389#true} assume true; {1389#true} is VALID [2022-02-20 17:44:20,137 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1389#true} {1522#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 3) (< 2 |ULTIMATE.start_main_~k~0#1|))} #56#return; {1522#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 3) (< 2 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:44:20,137 INFO L272 TraceCheckUtils]: 46: Hoare triple {1522#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 3) (< 2 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if main_~k~0#1 * main_~y~0#1 == main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1541#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:44:20,138 INFO L290 TraceCheckUtils]: 47: Hoare triple {1541#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1545#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:44:20,138 INFO L290 TraceCheckUtils]: 48: Hoare triple {1545#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1390#false} is VALID [2022-02-20 17:44:20,138 INFO L290 TraceCheckUtils]: 49: Hoare triple {1390#false} assume !false; {1390#false} is VALID [2022-02-20 17:44:20,139 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 20 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-02-20 17:44:20,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:44:38,915 WARN L838 $PredicateComparison]: unable to prove that (or (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| (- 5)) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| (- 6)) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| (- 2))) 12) 0)) (forall ((|ULTIMATE.start_main_~k~0#1| Int)) (or (let ((.cse0 (+ |c_ULTIMATE.start_main_~y~0#1| 1))) (= (* |ULTIMATE.start_main_~k~0#1| .cse0) (* .cse0 .cse0))) (not (< |c_ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)) (< (+ |c_ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~k~0#1|)))) is different from false [2022-02-20 17:44:38,918 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:44:38,918 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965247684] [2022-02-20 17:44:38,918 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:44:38,918 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75281534] [2022-02-20 17:44:38,918 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75281534] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:44:38,918 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:44:38,918 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-02-20 17:44:38,918 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035662617] [2022-02-20 17:44:38,918 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:44:38,919 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 10 states have internal predecessors, (23), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 50 [2022-02-20 17:44:38,919 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:44:38,919 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 10 states have internal predecessors, (23), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-20 17:44:38,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:38,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 17:44:38,953 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:44:38,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 17:44:38,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=251, Unknown=1, NotChecked=32, Total=342 [2022-02-20 17:44:38,954 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 10 states have internal predecessors, (23), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-20 17:44:39,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:39,457 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2022-02-20 17:44:39,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 17:44:39,458 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 10 states have internal predecessors, (23), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 50 [2022-02-20 17:44:39,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:44:39,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 10 states have internal predecessors, (23), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-20 17:44:39,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 48 transitions. [2022-02-20 17:44:39,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 10 states have internal predecessors, (23), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-20 17:44:39,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 48 transitions. [2022-02-20 17:44:39,462 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 48 transitions. [2022-02-20 17:44:39,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:39,508 INFO L225 Difference]: With dead ends: 48 [2022-02-20 17:44:39,508 INFO L226 Difference]: Without dead ends: 42 [2022-02-20 17:44:39,509 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=79, Invalid=344, Unknown=1, NotChecked=38, Total=462 [2022-02-20 17:44:39,509 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 13 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 17:44:39,509 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 204 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 17:44:39,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-02-20 17:44:39,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-02-20 17:44:39,538 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:44:39,538 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:44:39,539 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:44:39,539 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:44:39,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:39,553 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-02-20 17:44:39,553 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-02-20 17:44:39,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:39,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:39,554 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 42 states. [2022-02-20 17:44:39,555 INFO L87 Difference]: Start difference. First operand has 42 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 42 states. [2022-02-20 17:44:39,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:39,558 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-02-20 17:44:39,558 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-02-20 17:44:39,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:39,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:39,559 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:44:39,559 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:44:39,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:44:39,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2022-02-20 17:44:39,565 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 50 [2022-02-20 17:44:39,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:44:39,565 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-02-20 17:44:39,566 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 10 states have internal predecessors, (23), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-20 17:44:39,566 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-02-20 17:44:39,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-20 17:44:39,567 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:44:39,568 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:44:39,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-02-20 17:44:39,773 WARN L452 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-02-20 17:44:39,773 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:44:39,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:44:39,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1013596503, now seen corresponding path program 4 times [2022-02-20 17:44:39,774 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:44:39,774 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219943295] [2022-02-20 17:44:39,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:44:39,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:44:39,799 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:44:39,801 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1199657045] [2022-02-20 17:44:39,801 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 17:44:39,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:44:39,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:44:39,803 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-02-20 17:44:39,814 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-02-20 17:44:39,845 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 17:44:39,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:44:39,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-20 17:44:39,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:44:39,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:44:40,265 INFO L290 TraceCheckUtils]: 0: Hoare triple {1832#true} assume { :begin_inline_ULTIMATE.init } 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); {1832#true} is VALID [2022-02-20 17:44:40,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {1832#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1832#true} is VALID [2022-02-20 17:44:40,265 INFO L272 TraceCheckUtils]: 2: Hoare triple {1832#true} call assume_abort_if_not((if main_~k~0#1 >= 0 && main_~k~0#1 <= 100 then 1 else 0)); {1832#true} is VALID [2022-02-20 17:44:40,266 INFO L290 TraceCheckUtils]: 3: Hoare triple {1832#true} ~cond := #in~cond; {1832#true} is VALID [2022-02-20 17:44:40,266 INFO L290 TraceCheckUtils]: 4: Hoare triple {1832#true} assume !(0 == ~cond); {1832#true} is VALID [2022-02-20 17:44:40,266 INFO L290 TraceCheckUtils]: 5: Hoare triple {1832#true} assume true; {1832#true} is VALID [2022-02-20 17:44:40,266 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1832#true} {1832#true} #50#return; {1832#true} is VALID [2022-02-20 17:44:40,266 INFO L272 TraceCheckUtils]: 7: Hoare triple {1832#true} call assume_abort_if_not((if main_~k~0#1 <= 256 then 1 else 0)); {1832#true} is VALID [2022-02-20 17:44:40,266 INFO L290 TraceCheckUtils]: 8: Hoare triple {1832#true} ~cond := #in~cond; {1832#true} is VALID [2022-02-20 17:44:40,267 INFO L290 TraceCheckUtils]: 9: Hoare triple {1832#true} assume !(0 == ~cond); {1832#true} is VALID [2022-02-20 17:44:40,267 INFO L290 TraceCheckUtils]: 10: Hoare triple {1832#true} assume true; {1832#true} is VALID [2022-02-20 17:44:40,267 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1832#true} {1832#true} #52#return; {1832#true} is VALID [2022-02-20 17:44:40,268 INFO L290 TraceCheckUtils]: 12: Hoare triple {1832#true} main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {1873#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:44:40,268 INFO L290 TraceCheckUtils]: 13: Hoare triple {1873#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !false; {1873#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:44:40,268 INFO L272 TraceCheckUtils]: 14: Hoare triple {1873#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1832#true} is VALID [2022-02-20 17:44:40,268 INFO L290 TraceCheckUtils]: 15: Hoare triple {1832#true} ~cond := #in~cond; {1832#true} is VALID [2022-02-20 17:44:40,269 INFO L290 TraceCheckUtils]: 16: Hoare triple {1832#true} assume !(0 == ~cond); {1832#true} is VALID [2022-02-20 17:44:40,269 INFO L290 TraceCheckUtils]: 17: Hoare triple {1832#true} assume true; {1832#true} is VALID [2022-02-20 17:44:40,269 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1832#true} {1873#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #54#return; {1873#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:44:40,270 INFO L290 TraceCheckUtils]: 19: Hoare triple {1873#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1895#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:44:40,271 INFO L290 TraceCheckUtils]: 20: Hoare triple {1895#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !false; {1895#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:44:40,271 INFO L272 TraceCheckUtils]: 21: Hoare triple {1895#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1832#true} is VALID [2022-02-20 17:44:40,271 INFO L290 TraceCheckUtils]: 22: Hoare triple {1832#true} ~cond := #in~cond; {1832#true} is VALID [2022-02-20 17:44:40,271 INFO L290 TraceCheckUtils]: 23: Hoare triple {1832#true} assume !(0 == ~cond); {1832#true} is VALID [2022-02-20 17:44:40,272 INFO L290 TraceCheckUtils]: 24: Hoare triple {1832#true} assume true; {1832#true} is VALID [2022-02-20 17:44:40,272 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {1832#true} {1895#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} #54#return; {1895#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:44:40,273 INFO L290 TraceCheckUtils]: 26: Hoare triple {1895#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1917#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 1) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:44:40,273 INFO L290 TraceCheckUtils]: 27: Hoare triple {1917#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 1) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} assume !false; {1917#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 1) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:44:40,274 INFO L272 TraceCheckUtils]: 28: Hoare triple {1917#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 1) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1832#true} is VALID [2022-02-20 17:44:40,274 INFO L290 TraceCheckUtils]: 29: Hoare triple {1832#true} ~cond := #in~cond; {1832#true} is VALID [2022-02-20 17:44:40,274 INFO L290 TraceCheckUtils]: 30: Hoare triple {1832#true} assume !(0 == ~cond); {1832#true} is VALID [2022-02-20 17:44:40,274 INFO L290 TraceCheckUtils]: 31: Hoare triple {1832#true} assume true; {1832#true} is VALID [2022-02-20 17:44:40,275 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1832#true} {1917#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 1) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} #54#return; {1917#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 1) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:44:40,276 INFO L290 TraceCheckUtils]: 33: Hoare triple {1917#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 1) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1939#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:40,276 INFO L290 TraceCheckUtils]: 34: Hoare triple {1939#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} assume !false; {1939#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:40,276 INFO L272 TraceCheckUtils]: 35: Hoare triple {1939#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1832#true} is VALID [2022-02-20 17:44:40,277 INFO L290 TraceCheckUtils]: 36: Hoare triple {1832#true} ~cond := #in~cond; {1832#true} is VALID [2022-02-20 17:44:40,277 INFO L290 TraceCheckUtils]: 37: Hoare triple {1832#true} assume !(0 == ~cond); {1832#true} is VALID [2022-02-20 17:44:40,277 INFO L290 TraceCheckUtils]: 38: Hoare triple {1832#true} assume true; {1832#true} is VALID [2022-02-20 17:44:40,278 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1832#true} {1939#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} #54#return; {1939#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:40,278 INFO L290 TraceCheckUtils]: 40: Hoare triple {1939#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1961#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= |ULTIMATE.start_main_~y~0#1| 4) (< 3 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:44:40,279 INFO L290 TraceCheckUtils]: 41: Hoare triple {1961#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= |ULTIMATE.start_main_~y~0#1| 4) (< 3 |ULTIMATE.start_main_~k~0#1|))} assume !false; {1961#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= |ULTIMATE.start_main_~y~0#1| 4) (< 3 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:44:40,279 INFO L272 TraceCheckUtils]: 42: Hoare triple {1961#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= |ULTIMATE.start_main_~y~0#1| 4) (< 3 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1832#true} is VALID [2022-02-20 17:44:40,279 INFO L290 TraceCheckUtils]: 43: Hoare triple {1832#true} ~cond := #in~cond; {1832#true} is VALID [2022-02-20 17:44:40,279 INFO L290 TraceCheckUtils]: 44: Hoare triple {1832#true} assume !(0 == ~cond); {1832#true} is VALID [2022-02-20 17:44:40,280 INFO L290 TraceCheckUtils]: 45: Hoare triple {1832#true} assume true; {1832#true} is VALID [2022-02-20 17:44:40,280 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {1832#true} {1961#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= |ULTIMATE.start_main_~y~0#1| 4) (< 3 |ULTIMATE.start_main_~k~0#1|))} #54#return; {1961#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= |ULTIMATE.start_main_~y~0#1| 4) (< 3 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:44:40,281 INFO L290 TraceCheckUtils]: 47: Hoare triple {1961#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= |ULTIMATE.start_main_~y~0#1| 4) (< 3 |ULTIMATE.start_main_~k~0#1|))} assume !(main_~c~0#1 < main_~k~0#1); {1983#(and (= |ULTIMATE.start_main_~y~0#1| 4) (<= |ULTIMATE.start_main_~k~0#1| 4) (< 3 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:44:40,281 INFO L272 TraceCheckUtils]: 48: Hoare triple {1983#(and (= |ULTIMATE.start_main_~y~0#1| 4) (<= |ULTIMATE.start_main_~k~0#1| 4) (< 3 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1832#true} is VALID [2022-02-20 17:44:40,281 INFO L290 TraceCheckUtils]: 49: Hoare triple {1832#true} ~cond := #in~cond; {1832#true} is VALID [2022-02-20 17:44:40,281 INFO L290 TraceCheckUtils]: 50: Hoare triple {1832#true} assume !(0 == ~cond); {1832#true} is VALID [2022-02-20 17:44:40,282 INFO L290 TraceCheckUtils]: 51: Hoare triple {1832#true} assume true; {1832#true} is VALID [2022-02-20 17:44:40,282 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {1832#true} {1983#(and (= |ULTIMATE.start_main_~y~0#1| 4) (<= |ULTIMATE.start_main_~k~0#1| 4) (< 3 |ULTIMATE.start_main_~k~0#1|))} #56#return; {1983#(and (= |ULTIMATE.start_main_~y~0#1| 4) (<= |ULTIMATE.start_main_~k~0#1| 4) (< 3 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:44:40,283 INFO L272 TraceCheckUtils]: 53: Hoare triple {1983#(and (= |ULTIMATE.start_main_~y~0#1| 4) (<= |ULTIMATE.start_main_~k~0#1| 4) (< 3 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if main_~k~0#1 * main_~y~0#1 == main_~y~0#1 * main_~y~0#1 then 1 else 0)); {2002#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:44:40,284 INFO L290 TraceCheckUtils]: 54: Hoare triple {2002#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2006#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:44:40,284 INFO L290 TraceCheckUtils]: 55: Hoare triple {2006#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1833#false} is VALID [2022-02-20 17:44:40,284 INFO L290 TraceCheckUtils]: 56: Hoare triple {1833#false} assume !false; {1833#false} is VALID [2022-02-20 17:44:40,285 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-02-20 17:44:40,285 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:44:40,599 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:44:40,599 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219943295] [2022-02-20 17:44:40,599 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:44:40,600 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199657045] [2022-02-20 17:44:40,600 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199657045] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:44:40,600 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:44:40,600 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-02-20 17:44:40,600 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903625054] [2022-02-20 17:44:40,600 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:44:40,601 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 57 [2022-02-20 17:44:40,601 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:44:40,602 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-20 17:44:40,636 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:40,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 17:44:40,637 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:44:40,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 17:44:40,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-02-20 17:44:40,637 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-20 17:44:41,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:41,003 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2022-02-20 17:44:41,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 17:44:41,003 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 57 [2022-02-20 17:44:41,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:44:41,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-20 17:44:41,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2022-02-20 17:44:41,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-20 17:44:41,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2022-02-20 17:44:41,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 50 transitions. [2022-02-20 17:44:41,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:41,048 INFO L225 Difference]: With dead ends: 51 [2022-02-20 17:44:41,048 INFO L226 Difference]: Without dead ends: 45 [2022-02-20 17:44:41,049 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-02-20 17:44:41,049 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 2 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:44:41,050 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 251 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:44:41,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-02-20 17:44:41,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-02-20 17:44:41,074 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:44:41,075 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:44:41,075 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:44:41,075 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:44:41,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:41,077 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-02-20 17:44:41,077 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-02-20 17:44:41,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:41,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:41,077 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 45 states. [2022-02-20 17:44:41,078 INFO L87 Difference]: Start difference. First operand has 45 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 45 states. [2022-02-20 17:44:41,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:41,079 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-02-20 17:44:41,080 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-02-20 17:44:41,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:41,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:41,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:44:41,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:44:41,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:44:41,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2022-02-20 17:44:41,082 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 57 [2022-02-20 17:44:41,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:44:41,082 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2022-02-20 17:44:41,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-20 17:44:41,083 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-02-20 17:44:41,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 17:44:41,083 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:44:41,083 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:44:41,100 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-02-20 17:44:41,291 WARN L452 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-02-20 17:44:41,291 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:44:41,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:44:41,292 INFO L85 PathProgramCache]: Analyzing trace with hash 66449050, now seen corresponding path program 5 times [2022-02-20 17:44:41,292 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:44:41,292 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726678086] [2022-02-20 17:44:41,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:44:41,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:44:41,312 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:44:41,314 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [413930219] [2022-02-20 17:44:41,315 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 17:44:41,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:44:41,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:44:41,316 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:44:41,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-20 17:44:43,877 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-02-20 17:44:43,877 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:44:43,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-20 17:44:43,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:44:43,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:44:44,334 INFO L290 TraceCheckUtils]: 0: Hoare triple {2304#true} assume { :begin_inline_ULTIMATE.init } 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); {2304#true} is VALID [2022-02-20 17:44:44,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {2304#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {2304#true} is VALID [2022-02-20 17:44:44,337 INFO L272 TraceCheckUtils]: 2: Hoare triple {2304#true} call assume_abort_if_not((if main_~k~0#1 >= 0 && main_~k~0#1 <= 100 then 1 else 0)); {2304#true} is VALID [2022-02-20 17:44:44,337 INFO L290 TraceCheckUtils]: 3: Hoare triple {2304#true} ~cond := #in~cond; {2304#true} is VALID [2022-02-20 17:44:44,337 INFO L290 TraceCheckUtils]: 4: Hoare triple {2304#true} assume !(0 == ~cond); {2304#true} is VALID [2022-02-20 17:44:44,337 INFO L290 TraceCheckUtils]: 5: Hoare triple {2304#true} assume true; {2304#true} is VALID [2022-02-20 17:44:44,337 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2304#true} {2304#true} #50#return; {2304#true} is VALID [2022-02-20 17:44:44,338 INFO L272 TraceCheckUtils]: 7: Hoare triple {2304#true} call assume_abort_if_not((if main_~k~0#1 <= 256 then 1 else 0)); {2304#true} is VALID [2022-02-20 17:44:44,338 INFO L290 TraceCheckUtils]: 8: Hoare triple {2304#true} ~cond := #in~cond; {2304#true} is VALID [2022-02-20 17:44:44,338 INFO L290 TraceCheckUtils]: 9: Hoare triple {2304#true} assume !(0 == ~cond); {2304#true} is VALID [2022-02-20 17:44:44,338 INFO L290 TraceCheckUtils]: 10: Hoare triple {2304#true} assume true; {2304#true} is VALID [2022-02-20 17:44:44,338 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {2304#true} {2304#true} #52#return; {2304#true} is VALID [2022-02-20 17:44:44,339 INFO L290 TraceCheckUtils]: 12: Hoare triple {2304#true} main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {2345#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:44:44,339 INFO L290 TraceCheckUtils]: 13: Hoare triple {2345#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !false; {2345#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:44:44,339 INFO L272 TraceCheckUtils]: 14: Hoare triple {2345#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {2304#true} is VALID [2022-02-20 17:44:44,339 INFO L290 TraceCheckUtils]: 15: Hoare triple {2304#true} ~cond := #in~cond; {2304#true} is VALID [2022-02-20 17:44:44,340 INFO L290 TraceCheckUtils]: 16: Hoare triple {2304#true} assume !(0 == ~cond); {2304#true} is VALID [2022-02-20 17:44:44,340 INFO L290 TraceCheckUtils]: 17: Hoare triple {2304#true} assume true; {2304#true} is VALID [2022-02-20 17:44:44,340 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2304#true} {2345#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #54#return; {2345#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:44:44,341 INFO L290 TraceCheckUtils]: 19: Hoare triple {2345#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2367#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:44:44,341 INFO L290 TraceCheckUtils]: 20: Hoare triple {2367#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !false; {2367#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:44:44,342 INFO L272 TraceCheckUtils]: 21: Hoare triple {2367#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {2304#true} is VALID [2022-02-20 17:44:44,342 INFO L290 TraceCheckUtils]: 22: Hoare triple {2304#true} ~cond := #in~cond; {2304#true} is VALID [2022-02-20 17:44:44,342 INFO L290 TraceCheckUtils]: 23: Hoare triple {2304#true} assume !(0 == ~cond); {2304#true} is VALID [2022-02-20 17:44:44,342 INFO L290 TraceCheckUtils]: 24: Hoare triple {2304#true} assume true; {2304#true} is VALID [2022-02-20 17:44:44,343 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2304#true} {2367#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} #54#return; {2367#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} is VALID [2022-02-20 17:44:44,343 INFO L290 TraceCheckUtils]: 26: Hoare triple {2367#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2389#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:44,344 INFO L290 TraceCheckUtils]: 27: Hoare triple {2389#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !false; {2389#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:44,345 INFO L272 TraceCheckUtils]: 28: Hoare triple {2389#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {2304#true} is VALID [2022-02-20 17:44:44,345 INFO L290 TraceCheckUtils]: 29: Hoare triple {2304#true} ~cond := #in~cond; {2304#true} is VALID [2022-02-20 17:44:44,345 INFO L290 TraceCheckUtils]: 30: Hoare triple {2304#true} assume !(0 == ~cond); {2304#true} is VALID [2022-02-20 17:44:44,345 INFO L290 TraceCheckUtils]: 31: Hoare triple {2304#true} assume true; {2304#true} is VALID [2022-02-20 17:44:44,346 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2304#true} {2389#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} #54#return; {2389#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:44,347 INFO L290 TraceCheckUtils]: 33: Hoare triple {2389#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2411#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:44:44,347 INFO L290 TraceCheckUtils]: 34: Hoare triple {2411#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} assume !false; {2411#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:44:44,347 INFO L272 TraceCheckUtils]: 35: Hoare triple {2411#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {2304#true} is VALID [2022-02-20 17:44:44,347 INFO L290 TraceCheckUtils]: 36: Hoare triple {2304#true} ~cond := #in~cond; {2304#true} is VALID [2022-02-20 17:44:44,348 INFO L290 TraceCheckUtils]: 37: Hoare triple {2304#true} assume !(0 == ~cond); {2304#true} is VALID [2022-02-20 17:44:44,348 INFO L290 TraceCheckUtils]: 38: Hoare triple {2304#true} assume true; {2304#true} is VALID [2022-02-20 17:44:44,348 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2304#true} {2411#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} #54#return; {2411#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} is VALID [2022-02-20 17:44:44,349 INFO L290 TraceCheckUtils]: 40: Hoare triple {2411#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2433#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:44:44,349 INFO L290 TraceCheckUtils]: 41: Hoare triple {2433#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} assume !false; {2433#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:44:44,349 INFO L272 TraceCheckUtils]: 42: Hoare triple {2433#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {2304#true} is VALID [2022-02-20 17:44:44,350 INFO L290 TraceCheckUtils]: 43: Hoare triple {2304#true} ~cond := #in~cond; {2304#true} is VALID [2022-02-20 17:44:44,350 INFO L290 TraceCheckUtils]: 44: Hoare triple {2304#true} assume !(0 == ~cond); {2304#true} is VALID [2022-02-20 17:44:44,350 INFO L290 TraceCheckUtils]: 45: Hoare triple {2304#true} assume true; {2304#true} is VALID [2022-02-20 17:44:44,350 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {2304#true} {2433#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} #54#return; {2433#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:44:44,351 INFO L290 TraceCheckUtils]: 47: Hoare triple {2433#(and (= 2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2455#(and (<= |ULTIMATE.start_main_~c~0#1| 5) (= 2 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (< 4 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:44:44,352 INFO L290 TraceCheckUtils]: 48: Hoare triple {2455#(and (<= |ULTIMATE.start_main_~c~0#1| 5) (= 2 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (< 4 |ULTIMATE.start_main_~k~0#1|))} assume !false; {2455#(and (<= |ULTIMATE.start_main_~c~0#1| 5) (= 2 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (< 4 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:44:44,355 INFO L272 TraceCheckUtils]: 49: Hoare triple {2455#(and (<= |ULTIMATE.start_main_~c~0#1| 5) (= 2 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (< 4 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {2304#true} is VALID [2022-02-20 17:44:44,355 INFO L290 TraceCheckUtils]: 50: Hoare triple {2304#true} ~cond := #in~cond; {2304#true} is VALID [2022-02-20 17:44:44,355 INFO L290 TraceCheckUtils]: 51: Hoare triple {2304#true} assume !(0 == ~cond); {2304#true} is VALID [2022-02-20 17:44:44,355 INFO L290 TraceCheckUtils]: 52: Hoare triple {2304#true} assume true; {2304#true} is VALID [2022-02-20 17:44:44,357 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {2304#true} {2455#(and (<= |ULTIMATE.start_main_~c~0#1| 5) (= 2 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (< 4 |ULTIMATE.start_main_~k~0#1|))} #54#return; {2455#(and (<= |ULTIMATE.start_main_~c~0#1| 5) (= 2 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (< 4 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:44:44,358 INFO L290 TraceCheckUtils]: 54: Hoare triple {2455#(and (<= |ULTIMATE.start_main_~c~0#1| 5) (= 2 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (< 4 |ULTIMATE.start_main_~k~0#1|))} assume !(main_~c~0#1 < main_~k~0#1); {2477#(and (= 2 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (< 4 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5))} is VALID [2022-02-20 17:44:44,358 INFO L272 TraceCheckUtils]: 55: Hoare triple {2477#(and (= 2 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (< 4 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {2304#true} is VALID [2022-02-20 17:44:44,358 INFO L290 TraceCheckUtils]: 56: Hoare triple {2304#true} ~cond := #in~cond; {2304#true} is VALID [2022-02-20 17:44:44,359 INFO L290 TraceCheckUtils]: 57: Hoare triple {2304#true} assume !(0 == ~cond); {2304#true} is VALID [2022-02-20 17:44:44,359 INFO L290 TraceCheckUtils]: 58: Hoare triple {2304#true} assume true; {2304#true} is VALID [2022-02-20 17:44:44,359 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {2304#true} {2477#(and (= 2 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (< 4 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5))} #56#return; {2477#(and (= 2 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (< 4 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5))} is VALID [2022-02-20 17:44:44,360 INFO L272 TraceCheckUtils]: 60: Hoare triple {2477#(and (= 2 (+ (- 3) |ULTIMATE.start_main_~y~0#1|)) (< 4 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5))} call __VERIFIER_assert((if main_~k~0#1 * main_~y~0#1 == main_~y~0#1 * main_~y~0#1 then 1 else 0)); {2496#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:44:44,360 INFO L290 TraceCheckUtils]: 61: Hoare triple {2496#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2500#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:44:44,361 INFO L290 TraceCheckUtils]: 62: Hoare triple {2500#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2305#false} is VALID [2022-02-20 17:44:44,361 INFO L290 TraceCheckUtils]: 63: Hoare triple {2305#false} assume !false; {2305#false} is VALID [2022-02-20 17:44:44,361 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 14 proven. 45 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-02-20 17:44:44,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:44:44,658 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:44:44,659 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726678086] [2022-02-20 17:44:44,659 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:44:44,659 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413930219] [2022-02-20 17:44:44,659 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413930219] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:44:44,659 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:44:44,660 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-02-20 17:44:44,660 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516112966] [2022-02-20 17:44:44,660 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:44:44,661 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 64 [2022-02-20 17:44:44,661 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:44:44,661 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-02-20 17:44:44,701 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:44,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 17:44:44,701 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:44:44,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 17:44:44,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-02-20 17:44:44,702 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-02-20 17:44:45,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:45,163 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2022-02-20 17:44:45,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 17:44:45,163 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 64 [2022-02-20 17:44:45,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:44:45,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-02-20 17:44:45,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 54 transitions. [2022-02-20 17:44:45,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-02-20 17:44:45,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 54 transitions. [2022-02-20 17:44:45,168 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 54 transitions. [2022-02-20 17:44:45,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:45,224 INFO L225 Difference]: With dead ends: 54 [2022-02-20 17:44:45,224 INFO L226 Difference]: Without dead ends: 48 [2022-02-20 17:44:45,224 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-02-20 17:44:45,224 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 2 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:44:45,225 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 299 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:44:45,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-02-20 17:44:45,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-02-20 17:44:45,246 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:44:45,246 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:44:45,247 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:44:45,247 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:44:45,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:45,249 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-02-20 17:44:45,249 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2022-02-20 17:44:45,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:45,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:45,249 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 48 states. [2022-02-20 17:44:45,250 INFO L87 Difference]: Start difference. First operand has 48 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 48 states. [2022-02-20 17:44:45,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:45,251 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-02-20 17:44:45,252 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2022-02-20 17:44:45,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:45,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:45,252 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:44:45,252 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:44:45,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:44:45,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2022-02-20 17:44:45,254 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 64 [2022-02-20 17:44:45,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:44:45,255 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2022-02-20 17:44:45,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-02-20 17:44:45,255 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2022-02-20 17:44:45,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-02-20 17:44:45,256 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:44:45,256 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 7, 7, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:44:45,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-20 17:44:45,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:44:45,463 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:44:45,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:44:45,464 INFO L85 PathProgramCache]: Analyzing trace with hash 357326839, now seen corresponding path program 6 times [2022-02-20 17:44:45,464 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:44:45,464 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370364416] [2022-02-20 17:44:45,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:44:45,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:44:45,474 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:44:45,477 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [241695421] [2022-02-20 17:44:45,477 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-20 17:44:45,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:44:45,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:44:45,479 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:44:45,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-20 17:44:46,124 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-02-20 17:44:46,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:44:46,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 32 conjunts are in the unsatisfiable core [2022-02-20 17:44:46,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:44:46,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:44:46,566 INFO L290 TraceCheckUtils]: 0: Hoare triple {2814#true} assume { :begin_inline_ULTIMATE.init } 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); {2814#true} is VALID [2022-02-20 17:44:46,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {2814#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {2814#true} is VALID [2022-02-20 17:44:46,567 INFO L272 TraceCheckUtils]: 2: Hoare triple {2814#true} call assume_abort_if_not((if main_~k~0#1 >= 0 && main_~k~0#1 <= 100 then 1 else 0)); {2814#true} is VALID [2022-02-20 17:44:46,567 INFO L290 TraceCheckUtils]: 3: Hoare triple {2814#true} ~cond := #in~cond; {2814#true} is VALID [2022-02-20 17:44:46,567 INFO L290 TraceCheckUtils]: 4: Hoare triple {2814#true} assume !(0 == ~cond); {2814#true} is VALID [2022-02-20 17:44:46,567 INFO L290 TraceCheckUtils]: 5: Hoare triple {2814#true} assume true; {2814#true} is VALID [2022-02-20 17:44:46,567 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2814#true} {2814#true} #50#return; {2814#true} is VALID [2022-02-20 17:44:46,567 INFO L272 TraceCheckUtils]: 7: Hoare triple {2814#true} call assume_abort_if_not((if main_~k~0#1 <= 256 then 1 else 0)); {2814#true} is VALID [2022-02-20 17:44:46,567 INFO L290 TraceCheckUtils]: 8: Hoare triple {2814#true} ~cond := #in~cond; {2814#true} is VALID [2022-02-20 17:44:46,567 INFO L290 TraceCheckUtils]: 9: Hoare triple {2814#true} assume !(0 == ~cond); {2814#true} is VALID [2022-02-20 17:44:46,568 INFO L290 TraceCheckUtils]: 10: Hoare triple {2814#true} assume true; {2814#true} is VALID [2022-02-20 17:44:46,568 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {2814#true} {2814#true} #52#return; {2814#true} is VALID [2022-02-20 17:44:46,568 INFO L290 TraceCheckUtils]: 12: Hoare triple {2814#true} main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {2855#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:44:46,568 INFO L290 TraceCheckUtils]: 13: Hoare triple {2855#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !false; {2855#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:44:46,568 INFO L272 TraceCheckUtils]: 14: Hoare triple {2855#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {2814#true} is VALID [2022-02-20 17:44:46,569 INFO L290 TraceCheckUtils]: 15: Hoare triple {2814#true} ~cond := #in~cond; {2814#true} is VALID [2022-02-20 17:44:46,569 INFO L290 TraceCheckUtils]: 16: Hoare triple {2814#true} assume !(0 == ~cond); {2814#true} is VALID [2022-02-20 17:44:46,569 INFO L290 TraceCheckUtils]: 17: Hoare triple {2814#true} assume true; {2814#true} is VALID [2022-02-20 17:44:46,575 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2814#true} {2855#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #54#return; {2855#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:44:46,576 INFO L290 TraceCheckUtils]: 19: Hoare triple {2855#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2877#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:44:46,576 INFO L290 TraceCheckUtils]: 20: Hoare triple {2877#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !false; {2877#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:44:46,577 INFO L272 TraceCheckUtils]: 21: Hoare triple {2877#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {2814#true} is VALID [2022-02-20 17:44:46,577 INFO L290 TraceCheckUtils]: 22: Hoare triple {2814#true} ~cond := #in~cond; {2814#true} is VALID [2022-02-20 17:44:46,577 INFO L290 TraceCheckUtils]: 23: Hoare triple {2814#true} assume !(0 == ~cond); {2814#true} is VALID [2022-02-20 17:44:46,577 INFO L290 TraceCheckUtils]: 24: Hoare triple {2814#true} assume true; {2814#true} is VALID [2022-02-20 17:44:46,578 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2814#true} {2877#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} #54#return; {2877#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:44:46,578 INFO L290 TraceCheckUtils]: 26: Hoare triple {2877#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2899#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:46,579 INFO L290 TraceCheckUtils]: 27: Hoare triple {2899#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !false; {2899#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:46,579 INFO L272 TraceCheckUtils]: 28: Hoare triple {2899#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {2814#true} is VALID [2022-02-20 17:44:46,579 INFO L290 TraceCheckUtils]: 29: Hoare triple {2814#true} ~cond := #in~cond; {2814#true} is VALID [2022-02-20 17:44:46,579 INFO L290 TraceCheckUtils]: 30: Hoare triple {2814#true} assume !(0 == ~cond); {2814#true} is VALID [2022-02-20 17:44:46,580 INFO L290 TraceCheckUtils]: 31: Hoare triple {2814#true} assume true; {2814#true} is VALID [2022-02-20 17:44:46,580 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2814#true} {2899#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} #54#return; {2899#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:46,581 INFO L290 TraceCheckUtils]: 33: Hoare triple {2899#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2921#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} is VALID [2022-02-20 17:44:46,581 INFO L290 TraceCheckUtils]: 34: Hoare triple {2921#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} assume !false; {2921#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} is VALID [2022-02-20 17:44:46,582 INFO L272 TraceCheckUtils]: 35: Hoare triple {2921#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {2814#true} is VALID [2022-02-20 17:44:46,582 INFO L290 TraceCheckUtils]: 36: Hoare triple {2814#true} ~cond := #in~cond; {2814#true} is VALID [2022-02-20 17:44:46,582 INFO L290 TraceCheckUtils]: 37: Hoare triple {2814#true} assume !(0 == ~cond); {2814#true} is VALID [2022-02-20 17:44:46,582 INFO L290 TraceCheckUtils]: 38: Hoare triple {2814#true} assume true; {2814#true} is VALID [2022-02-20 17:44:46,583 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2814#true} {2921#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} #54#return; {2921#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} is VALID [2022-02-20 17:44:46,583 INFO L290 TraceCheckUtils]: 40: Hoare triple {2921#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2943#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:44:46,584 INFO L290 TraceCheckUtils]: 41: Hoare triple {2943#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} assume !false; {2943#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:44:46,584 INFO L272 TraceCheckUtils]: 42: Hoare triple {2943#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {2814#true} is VALID [2022-02-20 17:44:46,584 INFO L290 TraceCheckUtils]: 43: Hoare triple {2814#true} ~cond := #in~cond; {2814#true} is VALID [2022-02-20 17:44:46,585 INFO L290 TraceCheckUtils]: 44: Hoare triple {2814#true} assume !(0 == ~cond); {2814#true} is VALID [2022-02-20 17:44:46,585 INFO L290 TraceCheckUtils]: 45: Hoare triple {2814#true} assume true; {2814#true} is VALID [2022-02-20 17:44:46,585 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {2814#true} {2943#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} #54#return; {2943#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:44:46,586 INFO L290 TraceCheckUtils]: 47: Hoare triple {2943#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2965#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} is VALID [2022-02-20 17:44:46,586 INFO L290 TraceCheckUtils]: 48: Hoare triple {2965#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} assume !false; {2965#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} is VALID [2022-02-20 17:44:46,587 INFO L272 TraceCheckUtils]: 49: Hoare triple {2965#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {2814#true} is VALID [2022-02-20 17:44:46,587 INFO L290 TraceCheckUtils]: 50: Hoare triple {2814#true} ~cond := #in~cond; {2814#true} is VALID [2022-02-20 17:44:46,587 INFO L290 TraceCheckUtils]: 51: Hoare triple {2814#true} assume !(0 == ~cond); {2814#true} is VALID [2022-02-20 17:44:46,587 INFO L290 TraceCheckUtils]: 52: Hoare triple {2814#true} assume true; {2814#true} is VALID [2022-02-20 17:44:46,588 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {2814#true} {2965#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} #54#return; {2965#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} is VALID [2022-02-20 17:44:46,588 INFO L290 TraceCheckUtils]: 54: Hoare triple {2965#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 4))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {2987#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:44:46,589 INFO L290 TraceCheckUtils]: 55: Hoare triple {2987#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} assume !false; {2987#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:44:46,589 INFO L272 TraceCheckUtils]: 56: Hoare triple {2987#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {2814#true} is VALID [2022-02-20 17:44:46,589 INFO L290 TraceCheckUtils]: 57: Hoare triple {2814#true} ~cond := #in~cond; {2814#true} is VALID [2022-02-20 17:44:46,589 INFO L290 TraceCheckUtils]: 58: Hoare triple {2814#true} assume !(0 == ~cond); {2814#true} is VALID [2022-02-20 17:44:46,590 INFO L290 TraceCheckUtils]: 59: Hoare triple {2814#true} assume true; {2814#true} is VALID [2022-02-20 17:44:46,590 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {2814#true} {2987#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} #54#return; {2987#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:44:46,591 INFO L290 TraceCheckUtils]: 61: Hoare triple {2987#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} assume !(main_~c~0#1 < main_~k~0#1); {3009#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:44:46,591 INFO L272 TraceCheckUtils]: 62: Hoare triple {3009#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {2814#true} is VALID [2022-02-20 17:44:46,592 INFO L290 TraceCheckUtils]: 63: Hoare triple {2814#true} ~cond := #in~cond; {2814#true} is VALID [2022-02-20 17:44:46,592 INFO L290 TraceCheckUtils]: 64: Hoare triple {2814#true} assume !(0 == ~cond); {2814#true} is VALID [2022-02-20 17:44:46,592 INFO L290 TraceCheckUtils]: 65: Hoare triple {2814#true} assume true; {2814#true} is VALID [2022-02-20 17:44:46,593 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {2814#true} {3009#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} #56#return; {3009#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:44:46,593 INFO L272 TraceCheckUtils]: 67: Hoare triple {3009#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 6) (< 5 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if main_~k~0#1 * main_~y~0#1 == main_~y~0#1 * main_~y~0#1 then 1 else 0)); {3028#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:44:46,594 INFO L290 TraceCheckUtils]: 68: Hoare triple {3028#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3032#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:44:46,594 INFO L290 TraceCheckUtils]: 69: Hoare triple {3032#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2815#false} is VALID [2022-02-20 17:44:46,594 INFO L290 TraceCheckUtils]: 70: Hoare triple {2815#false} assume !false; {2815#false} is VALID [2022-02-20 17:44:46,595 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 16 proven. 63 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-02-20 17:44:46,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:44:46,869 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:44:46,869 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370364416] [2022-02-20 17:44:46,869 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:44:46,869 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241695421] [2022-02-20 17:44:46,870 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241695421] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:44:46,870 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:44:46,870 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-02-20 17:44:46,870 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353604141] [2022-02-20 17:44:46,870 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:44:46,871 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 71 [2022-02-20 17:44:46,871 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:44:46,871 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-02-20 17:44:46,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:46,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 17:44:46,908 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:44:46,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 17:44:46,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-02-20 17:44:46,909 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-02-20 17:44:47,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:47,490 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2022-02-20 17:44:47,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 17:44:47,491 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 71 [2022-02-20 17:44:47,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:44:47,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-02-20 17:44:47,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 58 transitions. [2022-02-20 17:44:47,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-02-20 17:44:47,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 58 transitions. [2022-02-20 17:44:47,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 58 transitions. [2022-02-20 17:44:47,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:47,542 INFO L225 Difference]: With dead ends: 57 [2022-02-20 17:44:47,542 INFO L226 Difference]: Without dead ends: 51 [2022-02-20 17:44:47,543 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-02-20 17:44:47,543 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 2 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 17:44:47,544 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 351 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 17:44:47,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-02-20 17:44:47,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-02-20 17:44:47,570 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:44:47,570 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:44:47,570 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:44:47,571 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:44:47,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:47,573 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2022-02-20 17:44:47,573 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2022-02-20 17:44:47,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:47,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:47,574 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 51 states. [2022-02-20 17:44:47,574 INFO L87 Difference]: Start difference. First operand has 51 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 51 states. [2022-02-20 17:44:47,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:47,576 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2022-02-20 17:44:47,576 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2022-02-20 17:44:47,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:47,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:47,577 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:44:47,577 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:44:47,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:44:47,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2022-02-20 17:44:47,579 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 71 [2022-02-20 17:44:47,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:44:47,579 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2022-02-20 17:44:47,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 9 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-02-20 17:44:47,580 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2022-02-20 17:44:47,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 17:44:47,581 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:44:47,581 INFO L514 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 8, 8, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:44:47,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-02-20 17:44:47,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-02-20 17:44:47,787 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:44:47,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:44:47,787 INFO L85 PathProgramCache]: Analyzing trace with hash 416422906, now seen corresponding path program 7 times [2022-02-20 17:44:47,788 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:44:47,788 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917049354] [2022-02-20 17:44:47,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:44:47,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:44:47,800 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:44:47,800 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [373774451] [2022-02-20 17:44:47,800 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-20 17:44:47,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:44:47,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:44:47,801 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:44:47,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-02-20 17:44:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:44:48,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 36 conjunts are in the unsatisfiable core [2022-02-20 17:44:48,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:44:48,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:44:48,875 INFO L290 TraceCheckUtils]: 0: Hoare triple {3362#true} assume { :begin_inline_ULTIMATE.init } 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); {3362#true} is VALID [2022-02-20 17:44:48,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {3362#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {3362#true} is VALID [2022-02-20 17:44:48,875 INFO L272 TraceCheckUtils]: 2: Hoare triple {3362#true} call assume_abort_if_not((if main_~k~0#1 >= 0 && main_~k~0#1 <= 100 then 1 else 0)); {3362#true} is VALID [2022-02-20 17:44:48,875 INFO L290 TraceCheckUtils]: 3: Hoare triple {3362#true} ~cond := #in~cond; {3362#true} is VALID [2022-02-20 17:44:48,875 INFO L290 TraceCheckUtils]: 4: Hoare triple {3362#true} assume !(0 == ~cond); {3362#true} is VALID [2022-02-20 17:44:48,875 INFO L290 TraceCheckUtils]: 5: Hoare triple {3362#true} assume true; {3362#true} is VALID [2022-02-20 17:44:48,876 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3362#true} {3362#true} #50#return; {3362#true} is VALID [2022-02-20 17:44:48,876 INFO L272 TraceCheckUtils]: 7: Hoare triple {3362#true} call assume_abort_if_not((if main_~k~0#1 <= 256 then 1 else 0)); {3362#true} is VALID [2022-02-20 17:44:48,876 INFO L290 TraceCheckUtils]: 8: Hoare triple {3362#true} ~cond := #in~cond; {3362#true} is VALID [2022-02-20 17:44:48,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {3362#true} assume !(0 == ~cond); {3362#true} is VALID [2022-02-20 17:44:48,876 INFO L290 TraceCheckUtils]: 10: Hoare triple {3362#true} assume true; {3362#true} is VALID [2022-02-20 17:44:48,876 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {3362#true} {3362#true} #52#return; {3362#true} is VALID [2022-02-20 17:44:48,888 INFO L290 TraceCheckUtils]: 12: Hoare triple {3362#true} main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {3403#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:44:48,888 INFO L290 TraceCheckUtils]: 13: Hoare triple {3403#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !false; {3403#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:44:48,888 INFO L272 TraceCheckUtils]: 14: Hoare triple {3403#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {3362#true} is VALID [2022-02-20 17:44:48,889 INFO L290 TraceCheckUtils]: 15: Hoare triple {3362#true} ~cond := #in~cond; {3362#true} is VALID [2022-02-20 17:44:48,889 INFO L290 TraceCheckUtils]: 16: Hoare triple {3362#true} assume !(0 == ~cond); {3362#true} is VALID [2022-02-20 17:44:48,889 INFO L290 TraceCheckUtils]: 17: Hoare triple {3362#true} assume true; {3362#true} is VALID [2022-02-20 17:44:48,889 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3362#true} {3403#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #54#return; {3403#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:44:48,890 INFO L290 TraceCheckUtils]: 19: Hoare triple {3403#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {3425#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:44:48,890 INFO L290 TraceCheckUtils]: 20: Hoare triple {3425#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !false; {3425#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:44:48,890 INFO L272 TraceCheckUtils]: 21: Hoare triple {3425#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {3362#true} is VALID [2022-02-20 17:44:48,890 INFO L290 TraceCheckUtils]: 22: Hoare triple {3362#true} ~cond := #in~cond; {3362#true} is VALID [2022-02-20 17:44:48,890 INFO L290 TraceCheckUtils]: 23: Hoare triple {3362#true} assume !(0 == ~cond); {3362#true} is VALID [2022-02-20 17:44:48,891 INFO L290 TraceCheckUtils]: 24: Hoare triple {3362#true} assume true; {3362#true} is VALID [2022-02-20 17:44:48,892 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3362#true} {3425#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} #54#return; {3425#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:44:48,893 INFO L290 TraceCheckUtils]: 26: Hoare triple {3425#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {3447#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:48,893 INFO L290 TraceCheckUtils]: 27: Hoare triple {3447#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !false; {3447#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:48,893 INFO L272 TraceCheckUtils]: 28: Hoare triple {3447#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {3362#true} is VALID [2022-02-20 17:44:48,893 INFO L290 TraceCheckUtils]: 29: Hoare triple {3362#true} ~cond := #in~cond; {3362#true} is VALID [2022-02-20 17:44:48,893 INFO L290 TraceCheckUtils]: 30: Hoare triple {3362#true} assume !(0 == ~cond); {3362#true} is VALID [2022-02-20 17:44:48,893 INFO L290 TraceCheckUtils]: 31: Hoare triple {3362#true} assume true; {3362#true} is VALID [2022-02-20 17:44:48,894 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3362#true} {3447#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} #54#return; {3447#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:48,894 INFO L290 TraceCheckUtils]: 33: Hoare triple {3447#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {3469#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0) (= 3 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:48,895 INFO L290 TraceCheckUtils]: 34: Hoare triple {3469#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0) (= 3 |ULTIMATE.start_main_~c~0#1|))} assume !false; {3469#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0) (= 3 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:48,895 INFO L272 TraceCheckUtils]: 35: Hoare triple {3469#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0) (= 3 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {3362#true} is VALID [2022-02-20 17:44:48,895 INFO L290 TraceCheckUtils]: 36: Hoare triple {3362#true} ~cond := #in~cond; {3362#true} is VALID [2022-02-20 17:44:48,895 INFO L290 TraceCheckUtils]: 37: Hoare triple {3362#true} assume !(0 == ~cond); {3362#true} is VALID [2022-02-20 17:44:48,895 INFO L290 TraceCheckUtils]: 38: Hoare triple {3362#true} assume true; {3362#true} is VALID [2022-02-20 17:44:48,896 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3362#true} {3469#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0) (= 3 |ULTIMATE.start_main_~c~0#1|))} #54#return; {3469#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0) (= 3 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:48,896 INFO L290 TraceCheckUtils]: 40: Hoare triple {3469#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0) (= 3 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {3491#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:44:48,896 INFO L290 TraceCheckUtils]: 41: Hoare triple {3491#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} assume !false; {3491#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:44:48,897 INFO L272 TraceCheckUtils]: 42: Hoare triple {3491#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {3362#true} is VALID [2022-02-20 17:44:48,897 INFO L290 TraceCheckUtils]: 43: Hoare triple {3362#true} ~cond := #in~cond; {3362#true} is VALID [2022-02-20 17:44:48,897 INFO L290 TraceCheckUtils]: 44: Hoare triple {3362#true} assume !(0 == ~cond); {3362#true} is VALID [2022-02-20 17:44:48,897 INFO L290 TraceCheckUtils]: 45: Hoare triple {3362#true} assume true; {3362#true} is VALID [2022-02-20 17:44:48,897 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3362#true} {3491#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} #54#return; {3491#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} is VALID [2022-02-20 17:44:48,898 INFO L290 TraceCheckUtils]: 47: Hoare triple {3491#(and (= |ULTIMATE.start_main_~y~0#1| 4) (= |ULTIMATE.start_main_~c~0#1| 4))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {3513#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:48,898 INFO L290 TraceCheckUtils]: 48: Hoare triple {3513#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} assume !false; {3513#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:48,898 INFO L272 TraceCheckUtils]: 49: Hoare triple {3513#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {3362#true} is VALID [2022-02-20 17:44:48,898 INFO L290 TraceCheckUtils]: 50: Hoare triple {3362#true} ~cond := #in~cond; {3362#true} is VALID [2022-02-20 17:44:48,898 INFO L290 TraceCheckUtils]: 51: Hoare triple {3362#true} assume !(0 == ~cond); {3362#true} is VALID [2022-02-20 17:44:48,898 INFO L290 TraceCheckUtils]: 52: Hoare triple {3362#true} assume true; {3362#true} is VALID [2022-02-20 17:44:48,899 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {3362#true} {3513#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} #54#return; {3513#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:48,899 INFO L290 TraceCheckUtils]: 54: Hoare triple {3513#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {3535#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:44:48,900 INFO L290 TraceCheckUtils]: 55: Hoare triple {3535#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} assume !false; {3535#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:44:48,900 INFO L272 TraceCheckUtils]: 56: Hoare triple {3535#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {3362#true} is VALID [2022-02-20 17:44:48,900 INFO L290 TraceCheckUtils]: 57: Hoare triple {3362#true} ~cond := #in~cond; {3362#true} is VALID [2022-02-20 17:44:48,900 INFO L290 TraceCheckUtils]: 58: Hoare triple {3362#true} assume !(0 == ~cond); {3362#true} is VALID [2022-02-20 17:44:48,900 INFO L290 TraceCheckUtils]: 59: Hoare triple {3362#true} assume true; {3362#true} is VALID [2022-02-20 17:44:48,901 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {3362#true} {3535#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} #54#return; {3535#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:44:48,901 INFO L290 TraceCheckUtils]: 61: Hoare triple {3535#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 5 (+ (- 1) |ULTIMATE.start_main_~c~0#1|)))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {3557#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (< 6 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 7))} is VALID [2022-02-20 17:44:48,901 INFO L290 TraceCheckUtils]: 62: Hoare triple {3557#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (< 6 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 7))} assume !false; {3557#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (< 6 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 7))} is VALID [2022-02-20 17:44:48,902 INFO L272 TraceCheckUtils]: 63: Hoare triple {3557#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (< 6 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 7))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {3362#true} is VALID [2022-02-20 17:44:48,902 INFO L290 TraceCheckUtils]: 64: Hoare triple {3362#true} ~cond := #in~cond; {3362#true} is VALID [2022-02-20 17:44:48,902 INFO L290 TraceCheckUtils]: 65: Hoare triple {3362#true} assume !(0 == ~cond); {3362#true} is VALID [2022-02-20 17:44:48,902 INFO L290 TraceCheckUtils]: 66: Hoare triple {3362#true} assume true; {3362#true} is VALID [2022-02-20 17:44:48,902 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {3362#true} {3557#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (< 6 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 7))} #54#return; {3557#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (< 6 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 7))} is VALID [2022-02-20 17:44:48,903 INFO L290 TraceCheckUtils]: 68: Hoare triple {3557#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (< 6 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 7))} assume !(main_~c~0#1 < main_~k~0#1); {3579#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 7) (< 6 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:44:48,903 INFO L272 TraceCheckUtils]: 69: Hoare triple {3579#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 7) (< 6 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {3362#true} is VALID [2022-02-20 17:44:48,903 INFO L290 TraceCheckUtils]: 70: Hoare triple {3362#true} ~cond := #in~cond; {3362#true} is VALID [2022-02-20 17:44:48,903 INFO L290 TraceCheckUtils]: 71: Hoare triple {3362#true} assume !(0 == ~cond); {3362#true} is VALID [2022-02-20 17:44:48,903 INFO L290 TraceCheckUtils]: 72: Hoare triple {3362#true} assume true; {3362#true} is VALID [2022-02-20 17:44:48,904 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {3362#true} {3579#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 7) (< 6 |ULTIMATE.start_main_~k~0#1|))} #56#return; {3579#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 7) (< 6 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:44:48,904 INFO L272 TraceCheckUtils]: 74: Hoare triple {3579#(and (= 7 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 7) (< 6 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if main_~k~0#1 * main_~y~0#1 == main_~y~0#1 * main_~y~0#1 then 1 else 0)); {3598#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:44:48,905 INFO L290 TraceCheckUtils]: 75: Hoare triple {3598#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3602#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:44:48,905 INFO L290 TraceCheckUtils]: 76: Hoare triple {3602#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3363#false} is VALID [2022-02-20 17:44:48,905 INFO L290 TraceCheckUtils]: 77: Hoare triple {3363#false} assume !false; {3363#false} is VALID [2022-02-20 17:44:48,906 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 18 proven. 84 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-02-20 17:44:48,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:44:49,192 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:44:49,192 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917049354] [2022-02-20 17:44:49,192 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:44:49,192 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373774451] [2022-02-20 17:44:49,193 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373774451] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:44:49,193 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:44:49,193 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-02-20 17:44:49,193 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918965049] [2022-02-20 17:44:49,193 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:44:49,195 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 78 [2022-02-20 17:44:49,195 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:44:49,195 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-02-20 17:44:49,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:49,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 17:44:49,241 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:44:49,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 17:44:49,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-02-20 17:44:49,242 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-02-20 17:44:50,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:50,014 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2022-02-20 17:44:50,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 17:44:50,015 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 78 [2022-02-20 17:44:50,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:44:50,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-02-20 17:44:50,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 62 transitions. [2022-02-20 17:44:50,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-02-20 17:44:50,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 62 transitions. [2022-02-20 17:44:50,019 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 62 transitions. [2022-02-20 17:44:50,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:50,070 INFO L225 Difference]: With dead ends: 60 [2022-02-20 17:44:50,070 INFO L226 Difference]: Without dead ends: 54 [2022-02-20 17:44:50,070 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-02-20 17:44:50,070 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 2 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 17:44:50,071 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 407 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 17:44:50,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-02-20 17:44:50,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-02-20 17:44:50,110 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:44:50,111 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:44:50,113 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:44:50,113 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:44:50,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:50,117 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-02-20 17:44:50,117 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-02-20 17:44:50,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:50,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:50,119 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 54 states. [2022-02-20 17:44:50,122 INFO L87 Difference]: Start difference. First operand has 54 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 54 states. [2022-02-20 17:44:50,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:50,124 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-02-20 17:44:50,124 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-02-20 17:44:50,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:50,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:50,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:44:50,125 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:44:50,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:44:50,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2022-02-20 17:44:50,126 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 78 [2022-02-20 17:44:50,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:44:50,127 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2022-02-20 17:44:50,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-02-20 17:44:50,127 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-02-20 17:44:50,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-02-20 17:44:50,137 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:44:50,137 INFO L514 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 9, 9, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:44:50,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-02-20 17:44:50,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-02-20 17:44:50,342 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:44:50,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:44:50,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1706793321, now seen corresponding path program 8 times [2022-02-20 17:44:50,343 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:44:50,343 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881064251] [2022-02-20 17:44:50,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:44:50,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:44:50,359 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:44:50,359 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2101608157] [2022-02-20 17:44:50,359 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:44:50,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:44:50,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:44:50,361 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:44:50,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-02-20 17:44:50,836 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:44:50,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:44:50,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 40 conjunts are in the unsatisfiable core [2022-02-20 17:44:50,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:44:50,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:44:51,334 INFO L290 TraceCheckUtils]: 0: Hoare triple {3948#true} assume { :begin_inline_ULTIMATE.init } 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); {3948#true} is VALID [2022-02-20 17:44:51,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {3948#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {3948#true} is VALID [2022-02-20 17:44:51,334 INFO L272 TraceCheckUtils]: 2: Hoare triple {3948#true} call assume_abort_if_not((if main_~k~0#1 >= 0 && main_~k~0#1 <= 100 then 1 else 0)); {3948#true} is VALID [2022-02-20 17:44:51,334 INFO L290 TraceCheckUtils]: 3: Hoare triple {3948#true} ~cond := #in~cond; {3948#true} is VALID [2022-02-20 17:44:51,334 INFO L290 TraceCheckUtils]: 4: Hoare triple {3948#true} assume !(0 == ~cond); {3948#true} is VALID [2022-02-20 17:44:51,334 INFO L290 TraceCheckUtils]: 5: Hoare triple {3948#true} assume true; {3948#true} is VALID [2022-02-20 17:44:51,334 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3948#true} {3948#true} #50#return; {3948#true} is VALID [2022-02-20 17:44:51,335 INFO L272 TraceCheckUtils]: 7: Hoare triple {3948#true} call assume_abort_if_not((if main_~k~0#1 <= 256 then 1 else 0)); {3948#true} is VALID [2022-02-20 17:44:51,335 INFO L290 TraceCheckUtils]: 8: Hoare triple {3948#true} ~cond := #in~cond; {3948#true} is VALID [2022-02-20 17:44:51,335 INFO L290 TraceCheckUtils]: 9: Hoare triple {3948#true} assume !(0 == ~cond); {3948#true} is VALID [2022-02-20 17:44:51,335 INFO L290 TraceCheckUtils]: 10: Hoare triple {3948#true} assume true; {3948#true} is VALID [2022-02-20 17:44:51,335 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {3948#true} {3948#true} #52#return; {3948#true} is VALID [2022-02-20 17:44:51,340 INFO L290 TraceCheckUtils]: 12: Hoare triple {3948#true} main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {3989#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:44:51,341 INFO L290 TraceCheckUtils]: 13: Hoare triple {3989#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !false; {3989#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:44:51,341 INFO L272 TraceCheckUtils]: 14: Hoare triple {3989#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {3948#true} is VALID [2022-02-20 17:44:51,341 INFO L290 TraceCheckUtils]: 15: Hoare triple {3948#true} ~cond := #in~cond; {3948#true} is VALID [2022-02-20 17:44:51,341 INFO L290 TraceCheckUtils]: 16: Hoare triple {3948#true} assume !(0 == ~cond); {3948#true} is VALID [2022-02-20 17:44:51,341 INFO L290 TraceCheckUtils]: 17: Hoare triple {3948#true} assume true; {3948#true} is VALID [2022-02-20 17:44:51,343 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3948#true} {3989#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #54#return; {3989#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:44:51,344 INFO L290 TraceCheckUtils]: 19: Hoare triple {3989#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4011#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:44:51,344 INFO L290 TraceCheckUtils]: 20: Hoare triple {4011#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !false; {4011#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:44:51,345 INFO L272 TraceCheckUtils]: 21: Hoare triple {4011#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {3948#true} is VALID [2022-02-20 17:44:51,345 INFO L290 TraceCheckUtils]: 22: Hoare triple {3948#true} ~cond := #in~cond; {3948#true} is VALID [2022-02-20 17:44:51,345 INFO L290 TraceCheckUtils]: 23: Hoare triple {3948#true} assume !(0 == ~cond); {3948#true} is VALID [2022-02-20 17:44:51,345 INFO L290 TraceCheckUtils]: 24: Hoare triple {3948#true} assume true; {3948#true} is VALID [2022-02-20 17:44:51,345 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3948#true} {4011#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} #54#return; {4011#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:44:51,346 INFO L290 TraceCheckUtils]: 26: Hoare triple {4011#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4033#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:51,346 INFO L290 TraceCheckUtils]: 27: Hoare triple {4033#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !false; {4033#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:51,346 INFO L272 TraceCheckUtils]: 28: Hoare triple {4033#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {3948#true} is VALID [2022-02-20 17:44:51,346 INFO L290 TraceCheckUtils]: 29: Hoare triple {3948#true} ~cond := #in~cond; {3948#true} is VALID [2022-02-20 17:44:51,347 INFO L290 TraceCheckUtils]: 30: Hoare triple {3948#true} assume !(0 == ~cond); {3948#true} is VALID [2022-02-20 17:44:51,347 INFO L290 TraceCheckUtils]: 31: Hoare triple {3948#true} assume true; {3948#true} is VALID [2022-02-20 17:44:51,355 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3948#true} {4033#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} #54#return; {4033#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:51,356 INFO L290 TraceCheckUtils]: 33: Hoare triple {4033#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4055#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:51,357 INFO L290 TraceCheckUtils]: 34: Hoare triple {4055#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} assume !false; {4055#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:51,357 INFO L272 TraceCheckUtils]: 35: Hoare triple {4055#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {3948#true} is VALID [2022-02-20 17:44:51,357 INFO L290 TraceCheckUtils]: 36: Hoare triple {3948#true} ~cond := #in~cond; {3948#true} is VALID [2022-02-20 17:44:51,357 INFO L290 TraceCheckUtils]: 37: Hoare triple {3948#true} assume !(0 == ~cond); {3948#true} is VALID [2022-02-20 17:44:51,357 INFO L290 TraceCheckUtils]: 38: Hoare triple {3948#true} assume true; {3948#true} is VALID [2022-02-20 17:44:51,358 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3948#true} {4055#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} #54#return; {4055#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:51,359 INFO L290 TraceCheckUtils]: 40: Hoare triple {4055#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4077#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} is VALID [2022-02-20 17:44:51,359 INFO L290 TraceCheckUtils]: 41: Hoare triple {4077#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} assume !false; {4077#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} is VALID [2022-02-20 17:44:51,359 INFO L272 TraceCheckUtils]: 42: Hoare triple {4077#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {3948#true} is VALID [2022-02-20 17:44:51,359 INFO L290 TraceCheckUtils]: 43: Hoare triple {3948#true} ~cond := #in~cond; {3948#true} is VALID [2022-02-20 17:44:51,360 INFO L290 TraceCheckUtils]: 44: Hoare triple {3948#true} assume !(0 == ~cond); {3948#true} is VALID [2022-02-20 17:44:51,360 INFO L290 TraceCheckUtils]: 45: Hoare triple {3948#true} assume true; {3948#true} is VALID [2022-02-20 17:44:51,360 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3948#true} {4077#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} #54#return; {4077#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} is VALID [2022-02-20 17:44:51,361 INFO L290 TraceCheckUtils]: 47: Hoare triple {4077#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 3))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4099#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:51,361 INFO L290 TraceCheckUtils]: 48: Hoare triple {4099#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} assume !false; {4099#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:51,362 INFO L272 TraceCheckUtils]: 49: Hoare triple {4099#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {3948#true} is VALID [2022-02-20 17:44:51,362 INFO L290 TraceCheckUtils]: 50: Hoare triple {3948#true} ~cond := #in~cond; {3948#true} is VALID [2022-02-20 17:44:51,362 INFO L290 TraceCheckUtils]: 51: Hoare triple {3948#true} assume !(0 == ~cond); {3948#true} is VALID [2022-02-20 17:44:51,362 INFO L290 TraceCheckUtils]: 52: Hoare triple {3948#true} assume true; {3948#true} is VALID [2022-02-20 17:44:51,363 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {3948#true} {4099#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} #54#return; {4099#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:51,363 INFO L290 TraceCheckUtils]: 54: Hoare triple {4099#(and (= 5 |ULTIMATE.start_main_~y~0#1|) (= 5 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4121#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:51,364 INFO L290 TraceCheckUtils]: 55: Hoare triple {4121#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} assume !false; {4121#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:51,364 INFO L272 TraceCheckUtils]: 56: Hoare triple {4121#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {3948#true} is VALID [2022-02-20 17:44:51,364 INFO L290 TraceCheckUtils]: 57: Hoare triple {3948#true} ~cond := #in~cond; {3948#true} is VALID [2022-02-20 17:44:51,364 INFO L290 TraceCheckUtils]: 58: Hoare triple {3948#true} assume !(0 == ~cond); {3948#true} is VALID [2022-02-20 17:44:51,364 INFO L290 TraceCheckUtils]: 59: Hoare triple {3948#true} assume true; {3948#true} is VALID [2022-02-20 17:44:51,365 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {3948#true} {4121#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} #54#return; {4121#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:51,365 INFO L290 TraceCheckUtils]: 61: Hoare triple {4121#(and (= 6 |ULTIMATE.start_main_~y~0#1|) (= 6 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4143#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} is VALID [2022-02-20 17:44:51,366 INFO L290 TraceCheckUtils]: 62: Hoare triple {4143#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} assume !false; {4143#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} is VALID [2022-02-20 17:44:51,366 INFO L272 TraceCheckUtils]: 63: Hoare triple {4143#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {3948#true} is VALID [2022-02-20 17:44:51,366 INFO L290 TraceCheckUtils]: 64: Hoare triple {3948#true} ~cond := #in~cond; {3948#true} is VALID [2022-02-20 17:44:51,366 INFO L290 TraceCheckUtils]: 65: Hoare triple {3948#true} assume !(0 == ~cond); {3948#true} is VALID [2022-02-20 17:44:51,366 INFO L290 TraceCheckUtils]: 66: Hoare triple {3948#true} assume true; {3948#true} is VALID [2022-02-20 17:44:51,367 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {3948#true} {4143#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} #54#return; {4143#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} is VALID [2022-02-20 17:44:51,368 INFO L290 TraceCheckUtils]: 68: Hoare triple {4143#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 6))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {4165#(and (<= |ULTIMATE.start_main_~c~0#1| 8) (= |ULTIMATE.start_main_~y~0#1| 8) (< 7 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:44:51,380 INFO L290 TraceCheckUtils]: 69: Hoare triple {4165#(and (<= |ULTIMATE.start_main_~c~0#1| 8) (= |ULTIMATE.start_main_~y~0#1| 8) (< 7 |ULTIMATE.start_main_~k~0#1|))} assume !false; {4165#(and (<= |ULTIMATE.start_main_~c~0#1| 8) (= |ULTIMATE.start_main_~y~0#1| 8) (< 7 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:44:51,380 INFO L272 TraceCheckUtils]: 70: Hoare triple {4165#(and (<= |ULTIMATE.start_main_~c~0#1| 8) (= |ULTIMATE.start_main_~y~0#1| 8) (< 7 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {3948#true} is VALID [2022-02-20 17:44:51,380 INFO L290 TraceCheckUtils]: 71: Hoare triple {3948#true} ~cond := #in~cond; {3948#true} is VALID [2022-02-20 17:44:51,381 INFO L290 TraceCheckUtils]: 72: Hoare triple {3948#true} assume !(0 == ~cond); {3948#true} is VALID [2022-02-20 17:44:51,381 INFO L290 TraceCheckUtils]: 73: Hoare triple {3948#true} assume true; {3948#true} is VALID [2022-02-20 17:44:51,381 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {3948#true} {4165#(and (<= |ULTIMATE.start_main_~c~0#1| 8) (= |ULTIMATE.start_main_~y~0#1| 8) (< 7 |ULTIMATE.start_main_~k~0#1|))} #54#return; {4165#(and (<= |ULTIMATE.start_main_~c~0#1| 8) (= |ULTIMATE.start_main_~y~0#1| 8) (< 7 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:44:51,382 INFO L290 TraceCheckUtils]: 75: Hoare triple {4165#(and (<= |ULTIMATE.start_main_~c~0#1| 8) (= |ULTIMATE.start_main_~y~0#1| 8) (< 7 |ULTIMATE.start_main_~k~0#1|))} assume !(main_~c~0#1 < main_~k~0#1); {4187#(and (<= |ULTIMATE.start_main_~k~0#1| 8) (= |ULTIMATE.start_main_~y~0#1| 8) (< 7 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:44:51,382 INFO L272 TraceCheckUtils]: 76: Hoare triple {4187#(and (<= |ULTIMATE.start_main_~k~0#1| 8) (= |ULTIMATE.start_main_~y~0#1| 8) (< 7 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {3948#true} is VALID [2022-02-20 17:44:51,382 INFO L290 TraceCheckUtils]: 77: Hoare triple {3948#true} ~cond := #in~cond; {3948#true} is VALID [2022-02-20 17:44:51,383 INFO L290 TraceCheckUtils]: 78: Hoare triple {3948#true} assume !(0 == ~cond); {3948#true} is VALID [2022-02-20 17:44:51,383 INFO L290 TraceCheckUtils]: 79: Hoare triple {3948#true} assume true; {3948#true} is VALID [2022-02-20 17:44:51,383 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {3948#true} {4187#(and (<= |ULTIMATE.start_main_~k~0#1| 8) (= |ULTIMATE.start_main_~y~0#1| 8) (< 7 |ULTIMATE.start_main_~k~0#1|))} #56#return; {4187#(and (<= |ULTIMATE.start_main_~k~0#1| 8) (= |ULTIMATE.start_main_~y~0#1| 8) (< 7 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:44:51,384 INFO L272 TraceCheckUtils]: 81: Hoare triple {4187#(and (<= |ULTIMATE.start_main_~k~0#1| 8) (= |ULTIMATE.start_main_~y~0#1| 8) (< 7 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if main_~k~0#1 * main_~y~0#1 == main_~y~0#1 * main_~y~0#1 then 1 else 0)); {4206#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:44:51,384 INFO L290 TraceCheckUtils]: 82: Hoare triple {4206#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4210#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:44:51,385 INFO L290 TraceCheckUtils]: 83: Hoare triple {4210#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3949#false} is VALID [2022-02-20 17:44:51,385 INFO L290 TraceCheckUtils]: 84: Hoare triple {3949#false} assume !false; {3949#false} is VALID [2022-02-20 17:44:51,386 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 20 proven. 108 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-02-20 17:44:51,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:44:51,632 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:44:51,632 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881064251] [2022-02-20 17:44:51,633 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:44:51,633 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101608157] [2022-02-20 17:44:51,633 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101608157] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:44:51,633 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:44:51,633 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-02-20 17:44:51,633 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880163202] [2022-02-20 17:44:51,633 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:44:51,633 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 11 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 85 [2022-02-20 17:44:51,634 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:44:51,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 11 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-02-20 17:44:51,677 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:51,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 17:44:51,677 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:44:51,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 17:44:51,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-02-20 17:44:51,677 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 11 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-02-20 17:44:52,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:52,468 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2022-02-20 17:44:52,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 17:44:52,468 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 11 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 85 [2022-02-20 17:44:52,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:44:52,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 11 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-02-20 17:44:52,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 66 transitions. [2022-02-20 17:44:52,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 11 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-02-20 17:44:52,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 66 transitions. [2022-02-20 17:44:52,472 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 66 transitions. [2022-02-20 17:44:52,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:52,531 INFO L225 Difference]: With dead ends: 63 [2022-02-20 17:44:52,531 INFO L226 Difference]: Without dead ends: 57 [2022-02-20 17:44:52,532 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-02-20 17:44:52,532 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 2 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 17:44:52,533 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 467 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 17:44:52,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-02-20 17:44:52,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-02-20 17:44:52,561 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:44:52,561 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 17:44:52,561 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 17:44:52,561 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 17:44:52,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:52,563 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2022-02-20 17:44:52,563 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2022-02-20 17:44:52,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:52,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:52,564 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 57 states. [2022-02-20 17:44:52,564 INFO L87 Difference]: Start difference. First operand has 57 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 57 states. [2022-02-20 17:44:52,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:52,566 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2022-02-20 17:44:52,566 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2022-02-20 17:44:52,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:52,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:52,567 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:44:52,567 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:44:52,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 17:44:52,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2022-02-20 17:44:52,569 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 85 [2022-02-20 17:44:52,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:44:52,569 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2022-02-20 17:44:52,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 11 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-02-20 17:44:52,570 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2022-02-20 17:44:52,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-02-20 17:44:52,571 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:44:52,571 INFO L514 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:44:52,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-02-20 17:44:52,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-02-20 17:44:52,777 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:44:52,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:44:52,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1063034534, now seen corresponding path program 9 times [2022-02-20 17:44:52,777 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:44:52,777 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126296888] [2022-02-20 17:44:52,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:44:52,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:44:52,795 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:44:52,795 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [647989934] [2022-02-20 17:44:52,796 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 17:44:52,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:44:52,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:44:52,797 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:44:52,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process