./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_valuebound2.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/cohendiv-ll_valuebound2.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 95c338a7a91abcfb8302c7314ea1de7bdde280884a10e8d539233a34032b9a5d --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:16:20,396 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:16:20,398 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:16:20,418 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:16:20,418 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:16:20,419 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:16:20,420 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:16:20,424 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:16:20,425 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:16:20,426 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:16:20,426 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:16:20,427 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:16:20,428 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:16:20,430 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:16:20,432 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:16:20,434 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:16:20,434 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:16:20,436 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:16:20,437 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:16:20,438 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:16:20,444 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:16:20,446 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:16:20,447 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:16:20,448 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:16:20,449 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:16:20,449 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:16:20,450 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:16:20,450 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:16:20,450 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:16:20,451 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:16:20,451 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:16:20,452 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:16:20,455 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:16:20,455 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:16:20,456 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:16:20,456 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:16:20,456 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:16:20,457 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:16:20,457 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:16:20,458 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:16:20,458 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:16:20,459 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:16:20,478 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:16:20,481 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:16:20,481 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:16:20,481 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:16:20,482 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:16:20,482 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:16:20,482 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:16:20,482 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:16:20,482 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:16:20,483 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:16:20,483 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:16:20,483 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:16:20,484 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:16:20,484 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:16:20,484 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:16:20,484 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:16:20,484 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:16:20,484 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:16:20,484 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:16:20,484 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:16:20,485 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:16:20,485 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:16:20,485 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:16:20,485 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:16:20,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:16:20,485 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:16:20,485 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:16:20,486 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:16:20,486 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:16:20,486 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:16:20,486 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:16:20,486 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:16:20,486 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:16:20,486 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 -> 95c338a7a91abcfb8302c7314ea1de7bdde280884a10e8d539233a34032b9a5d [2022-02-20 17:16:20,678 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:16:20,694 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:16:20,695 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:16:20,696 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:16:20,696 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:16:20,697 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_valuebound2.c [2022-02-20 17:16:20,746 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19230e2db/6b3bcce0d3ae4cb29dcad1bb9fc2bfcf/FLAG7d616e50a [2022-02-20 17:16:21,070 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:16:21,070 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_valuebound2.c [2022-02-20 17:16:21,077 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19230e2db/6b3bcce0d3ae4cb29dcad1bb9fc2bfcf/FLAG7d616e50a [2022-02-20 17:16:21,485 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19230e2db/6b3bcce0d3ae4cb29dcad1bb9fc2bfcf [2022-02-20 17:16:21,487 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:16:21,488 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:16:21,489 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:16:21,489 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:16:21,493 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:16:21,494 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:16:21" (1/1) ... [2022-02-20 17:16:21,495 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66bd52fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:21, skipping insertion in model container [2022-02-20 17:16:21,495 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:16:21" (1/1) ... [2022-02-20 17:16:21,500 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:16:21,513 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:16:21,659 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/cohendiv-ll_valuebound2.c[576,589] [2022-02-20 17:16:21,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:16:21,692 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:16:21,702 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/cohendiv-ll_valuebound2.c[576,589] [2022-02-20 17:16:21,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:16:21,730 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:16:21,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:21 WrapperNode [2022-02-20 17:16:21,730 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:16:21,731 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:16:21,731 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:16:21,732 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:16:21,736 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:16:21" (1/1) ... [2022-02-20 17:16:21,742 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:16:21" (1/1) ... [2022-02-20 17:16:21,763 INFO L137 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2022-02-20 17:16:21,763 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:16:21,764 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:16:21,764 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:16:21,764 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:16:21,769 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:21" (1/1) ... [2022-02-20 17:16:21,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:21" (1/1) ... [2022-02-20 17:16:21,777 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:21" (1/1) ... [2022-02-20 17:16:21,777 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:21" (1/1) ... [2022-02-20 17:16:21,786 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:21" (1/1) ... [2022-02-20 17:16:21,788 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:21" (1/1) ... [2022-02-20 17:16:21,793 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:21" (1/1) ... [2022-02-20 17:16:21,794 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:16:21,795 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:16:21,796 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:16:21,796 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:16:21,797 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:21" (1/1) ... [2022-02-20 17:16:21,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:16:21,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:16:21,818 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:16:21,824 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:16:21,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:16:21,845 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 17:16:21,845 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 17:16:21,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:16:21,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:16:21,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:16:21,846 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:16:21,846 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:16:21,887 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:16:21,889 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:16:22,043 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:16:22,048 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:16:22,048 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 17:16:22,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:16:22 BoogieIcfgContainer [2022-02-20 17:16:22,049 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:16:22,050 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:16:22,050 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:16:22,053 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:16:22,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:16:21" (1/3) ... [2022-02-20 17:16:22,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3421383e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:16:22, skipping insertion in model container [2022-02-20 17:16:22,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:21" (2/3) ... [2022-02-20 17:16:22,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3421383e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:16:22, skipping insertion in model container [2022-02-20 17:16:22,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:16:22" (3/3) ... [2022-02-20 17:16:22,055 INFO L111 eAbstractionObserver]: Analyzing ICFG cohendiv-ll_valuebound2.c [2022-02-20 17:16:22,058 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:16:22,058 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:16:22,085 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:16:22,098 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:16:22,098 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:16:22,114 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:16:22,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 17:16:22,120 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:16:22,120 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:16:22,121 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:16:22,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:16:22,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1418986431, now seen corresponding path program 1 times [2022-02-20 17:16:22,133 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:16:22,134 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058660409] [2022-02-20 17:16:22,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:16:22,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:16:22,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:22,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 17:16:22,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:22,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-02-20 17:16:22,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-02-20 17:16:22,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-02-20 17:16:22,281 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {37#true} #75#return; {38#false} is VALID [2022-02-20 17:16:22,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 17:16:22,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:22,299 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-02-20 17:16:22,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-02-20 17:16:22,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-02-20 17:16:22,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} #77#return; {38#false} is VALID [2022-02-20 17:16:22,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 17:16:22,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:22,312 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-02-20 17:16:22,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-02-20 17:16:22,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-02-20 17:16:22,313 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} #79#return; {38#false} is VALID [2022-02-20 17:16:22,313 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#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(14, 2);call #Ultimate.allocInit(12, 3); {37#true} is VALID [2022-02-20 17:16:22,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~x~0#1, main_~y~0#1, main_~q~0#1, main_~r~0#1, main_~a~0#1, main_~b~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~a~0#1;havoc main_~b~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {37#true} is VALID [2022-02-20 17:16:22,314 INFO L272 TraceCheckUtils]: 2: Hoare triple {37#true} call assume_abort_if_not((if main_~x~0#1 >= 0 && main_~x~0#1 <= 2 then 1 else 0)); {37#true} is VALID [2022-02-20 17:16:22,314 INFO L290 TraceCheckUtils]: 3: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-02-20 17:16:22,315 INFO L290 TraceCheckUtils]: 4: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-02-20 17:16:22,315 INFO L290 TraceCheckUtils]: 5: Hoare triple {38#false} assume true; {38#false} is VALID [2022-02-20 17:16:22,315 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {38#false} {37#true} #75#return; {38#false} is VALID [2022-02-20 17:16:22,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {38#false} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {38#false} is VALID [2022-02-20 17:16:22,315 INFO L272 TraceCheckUtils]: 8: Hoare triple {38#false} call assume_abort_if_not((if main_~y~0#1 >= 0 && main_~y~0#1 <= 2 then 1 else 0)); {37#true} is VALID [2022-02-20 17:16:22,316 INFO L290 TraceCheckUtils]: 9: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-02-20 17:16:22,316 INFO L290 TraceCheckUtils]: 10: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-02-20 17:16:22,316 INFO L290 TraceCheckUtils]: 11: Hoare triple {38#false} assume true; {38#false} is VALID [2022-02-20 17:16:22,317 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {38#false} {38#false} #77#return; {38#false} is VALID [2022-02-20 17:16:22,317 INFO L272 TraceCheckUtils]: 13: Hoare triple {38#false} call assume_abort_if_not((if main_~y~0#1 >= 1 then 1 else 0)); {37#true} is VALID [2022-02-20 17:16:22,318 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-02-20 17:16:22,318 INFO L290 TraceCheckUtils]: 15: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-02-20 17:16:22,318 INFO L290 TraceCheckUtils]: 16: Hoare triple {38#false} assume true; {38#false} is VALID [2022-02-20 17:16:22,319 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {38#false} {38#false} #79#return; {38#false} is VALID [2022-02-20 17:16:22,319 INFO L290 TraceCheckUtils]: 18: Hoare triple {38#false} main_~q~0#1 := 0;main_~r~0#1 := main_~x~0#1;main_~a~0#1 := 0;main_~b~0#1 := 0; {38#false} is VALID [2022-02-20 17:16:22,319 INFO L290 TraceCheckUtils]: 19: Hoare triple {38#false} assume !true; {38#false} is VALID [2022-02-20 17:16:22,320 INFO L272 TraceCheckUtils]: 20: Hoare triple {38#false} call __VERIFIER_assert((if main_~x~0#1 == main_~q~0#1 * main_~y~0#1 + main_~r~0#1 then 1 else 0)); {38#false} is VALID [2022-02-20 17:16:22,320 INFO L290 TraceCheckUtils]: 21: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2022-02-20 17:16:22,320 INFO L290 TraceCheckUtils]: 22: Hoare triple {38#false} assume 0 == ~cond; {38#false} is VALID [2022-02-20 17:16:22,320 INFO L290 TraceCheckUtils]: 23: Hoare triple {38#false} assume !false; {38#false} is VALID [2022-02-20 17:16:22,321 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:16:22,322 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:16:22,322 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058660409] [2022-02-20 17:16:22,322 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058660409] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:16:22,322 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:16:22,323 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:16:22,325 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592032168] [2022-02-20 17:16:22,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:16:22,329 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-02-20 17:16:22,331 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:16:22,333 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:16:22,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:16:22,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:16:22,365 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:16:22,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:16:22,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:16:22,382 INFO L87 Difference]: Start difference. First operand has 34 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:16:22,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:22,485 INFO L93 Difference]: Finished difference Result 65 states and 104 transitions. [2022-02-20 17:16:22,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:16:22,486 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-02-20 17:16:22,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:16:22,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:16:22,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 104 transitions. [2022-02-20 17:16:22,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:16:22,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 104 transitions. [2022-02-20 17:16:22,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 104 transitions. [2022-02-20 17:16:22,629 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:16:22,639 INFO L225 Difference]: With dead ends: 65 [2022-02-20 17:16:22,639 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 17:16:22,642 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 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:16:22,647 INFO L933 BasicCegarLoop]: 43 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, 43 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:16:22,648 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:16:22,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 17:16:22,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-02-20 17:16:22,678 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:16:22,679 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:16:22,680 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:16:22,682 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:16:22,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:22,688 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2022-02-20 17:16:22,688 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-02-20 17:16:22,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:22,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:22,695 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 30 states. [2022-02-20 17:16:22,695 INFO L87 Difference]: Start difference. First operand has 30 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 30 states. [2022-02-20 17:16:22,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:22,699 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2022-02-20 17:16:22,699 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-02-20 17:16:22,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:22,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:22,700 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:16:22,701 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:16:22,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:16:22,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2022-02-20 17:16:22,707 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 24 [2022-02-20 17:16:22,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:16:22,708 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2022-02-20 17:16:22,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:16:22,708 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-02-20 17:16:22,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 17:16:22,710 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:16:22,710 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:16:22,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:16:22,711 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:16:22,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:16:22,712 INFO L85 PathProgramCache]: Analyzing trace with hash 240368937, now seen corresponding path program 1 times [2022-02-20 17:16:22,712 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:16:22,713 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203671879] [2022-02-20 17:16:22,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:16:22,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:16:22,745 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:16:22,748 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [303909193] [2022-02-20 17:16:22,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:16:22,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:16:22,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:16:22,750 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:16:22,751 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:16:22,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:22,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:16:22,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:22,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:16:22,953 INFO L290 TraceCheckUtils]: 0: Hoare triple {251#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(14, 2);call #Ultimate.allocInit(12, 3); {251#true} is VALID [2022-02-20 17:16:22,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {251#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~x~0#1, main_~y~0#1, main_~q~0#1, main_~r~0#1, main_~a~0#1, main_~b~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~a~0#1;havoc main_~b~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {251#true} is VALID [2022-02-20 17:16:22,953 INFO L272 TraceCheckUtils]: 2: Hoare triple {251#true} call assume_abort_if_not((if main_~x~0#1 >= 0 && main_~x~0#1 <= 2 then 1 else 0)); {251#true} is VALID [2022-02-20 17:16:22,953 INFO L290 TraceCheckUtils]: 3: Hoare triple {251#true} ~cond := #in~cond; {251#true} is VALID [2022-02-20 17:16:22,954 INFO L290 TraceCheckUtils]: 4: Hoare triple {251#true} assume !(0 == ~cond); {251#true} is VALID [2022-02-20 17:16:22,954 INFO L290 TraceCheckUtils]: 5: Hoare triple {251#true} assume true; {251#true} is VALID [2022-02-20 17:16:22,954 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {251#true} {251#true} #75#return; {251#true} is VALID [2022-02-20 17:16:22,954 INFO L290 TraceCheckUtils]: 7: Hoare triple {251#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {251#true} is VALID [2022-02-20 17:16:22,954 INFO L272 TraceCheckUtils]: 8: Hoare triple {251#true} call assume_abort_if_not((if main_~y~0#1 >= 0 && main_~y~0#1 <= 2 then 1 else 0)); {251#true} is VALID [2022-02-20 17:16:22,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {251#true} ~cond := #in~cond; {251#true} is VALID [2022-02-20 17:16:22,955 INFO L290 TraceCheckUtils]: 10: Hoare triple {251#true} assume !(0 == ~cond); {251#true} is VALID [2022-02-20 17:16:22,955 INFO L290 TraceCheckUtils]: 11: Hoare triple {251#true} assume true; {251#true} is VALID [2022-02-20 17:16:22,957 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {251#true} {251#true} #77#return; {251#true} is VALID [2022-02-20 17:16:22,958 INFO L272 TraceCheckUtils]: 13: Hoare triple {251#true} call assume_abort_if_not((if main_~y~0#1 >= 1 then 1 else 0)); {251#true} is VALID [2022-02-20 17:16:22,958 INFO L290 TraceCheckUtils]: 14: Hoare triple {251#true} ~cond := #in~cond; {251#true} is VALID [2022-02-20 17:16:22,958 INFO L290 TraceCheckUtils]: 15: Hoare triple {251#true} assume !(0 == ~cond); {251#true} is VALID [2022-02-20 17:16:22,958 INFO L290 TraceCheckUtils]: 16: Hoare triple {251#true} assume true; {251#true} is VALID [2022-02-20 17:16:22,958 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {251#true} {251#true} #79#return; {251#true} is VALID [2022-02-20 17:16:22,959 INFO L290 TraceCheckUtils]: 18: Hoare triple {251#true} main_~q~0#1 := 0;main_~r~0#1 := main_~x~0#1;main_~a~0#1 := 0;main_~b~0#1 := 0; {310#(and (= |ULTIMATE.start_main_~b~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| 0))} is VALID [2022-02-20 17:16:22,959 INFO L290 TraceCheckUtils]: 19: Hoare triple {310#(and (= |ULTIMATE.start_main_~b~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| 0))} assume !false; {310#(and (= |ULTIMATE.start_main_~b~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| 0))} is VALID [2022-02-20 17:16:22,960 INFO L272 TraceCheckUtils]: 20: Hoare triple {310#(and (= |ULTIMATE.start_main_~b~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| 0))} call __VERIFIER_assert((if main_~b~0#1 == main_~y~0#1 * main_~a~0#1 then 1 else 0)); {317#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:16:22,961 INFO L290 TraceCheckUtils]: 21: Hoare triple {317#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {321#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:16:22,961 INFO L290 TraceCheckUtils]: 22: Hoare triple {321#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {252#false} is VALID [2022-02-20 17:16:22,961 INFO L290 TraceCheckUtils]: 23: Hoare triple {252#false} assume !false; {252#false} is VALID [2022-02-20 17:16:22,962 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:16:22,962 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:16:22,962 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:16:22,962 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203671879] [2022-02-20 17:16:22,962 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:16:22,962 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303909193] [2022-02-20 17:16:22,963 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303909193] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:16:22,963 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:16:22,963 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:16:22,964 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65022333] [2022-02-20 17:16:22,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:16:22,964 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-02-20 17:16:22,965 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:16:22,965 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:16:22,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:16:22,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:16:22,978 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:16:22,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:16:22,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:16:22,979 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:16:23,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:23,095 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2022-02-20 17:16:23,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:16:23,095 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-02-20 17:16:23,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:16:23,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:16:23,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2022-02-20 17:16:23,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:16:23,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2022-02-20 17:16:23,099 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 52 transitions. [2022-02-20 17:16:23,142 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:16:23,143 INFO L225 Difference]: With dead ends: 41 [2022-02-20 17:16:23,144 INFO L226 Difference]: Without dead ends: 39 [2022-02-20 17:16:23,144 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 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:16:23,145 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 6 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:16:23,145 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 137 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:16:23,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-02-20 17:16:23,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2022-02-20 17:16:23,150 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:16:23,150 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 36 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:16:23,151 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 36 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:16:23,151 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 36 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:16:23,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:23,153 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2022-02-20 17:16:23,153 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2022-02-20 17:16:23,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:23,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:23,155 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 39 states. [2022-02-20 17:16:23,155 INFO L87 Difference]: Start difference. First operand has 36 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 39 states. [2022-02-20 17:16:23,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:23,157 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2022-02-20 17:16:23,157 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2022-02-20 17:16:23,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:23,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:23,158 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:16:23,158 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:16:23,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:16:23,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2022-02-20 17:16:23,161 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 24 [2022-02-20 17:16:23,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:16:23,161 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-02-20 17:16:23,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:16:23,161 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-02-20 17:16:23,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 17:16:23,162 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:16:23,162 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:16:23,202 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:16:23,379 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:16:23,379 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:16:23,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:16:23,380 INFO L85 PathProgramCache]: Analyzing trace with hash -854318377, now seen corresponding path program 1 times [2022-02-20 17:16:23,380 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:16:23,380 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249476669] [2022-02-20 17:16:23,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:16:23,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:16:23,393 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:16:23,393 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1294884254] [2022-02-20 17:16:23,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:16:23,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:16:23,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:16:23,395 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:16:23,412 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:16:23,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:23,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-20 17:16:23,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:23,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:16:23,690 INFO L290 TraceCheckUtils]: 0: Hoare triple {520#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(14, 2);call #Ultimate.allocInit(12, 3); {520#true} is VALID [2022-02-20 17:16:23,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {520#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~x~0#1, main_~y~0#1, main_~q~0#1, main_~r~0#1, main_~a~0#1, main_~b~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~a~0#1;havoc main_~b~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {520#true} is VALID [2022-02-20 17:16:23,691 INFO L272 TraceCheckUtils]: 2: Hoare triple {520#true} call assume_abort_if_not((if main_~x~0#1 >= 0 && main_~x~0#1 <= 2 then 1 else 0)); {520#true} is VALID [2022-02-20 17:16:23,691 INFO L290 TraceCheckUtils]: 3: Hoare triple {520#true} ~cond := #in~cond; {520#true} is VALID [2022-02-20 17:16:23,691 INFO L290 TraceCheckUtils]: 4: Hoare triple {520#true} assume !(0 == ~cond); {520#true} is VALID [2022-02-20 17:16:23,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {520#true} assume true; {520#true} is VALID [2022-02-20 17:16:23,691 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {520#true} {520#true} #75#return; {520#true} is VALID [2022-02-20 17:16:23,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {520#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {520#true} is VALID [2022-02-20 17:16:23,692 INFO L272 TraceCheckUtils]: 8: Hoare triple {520#true} call assume_abort_if_not((if main_~y~0#1 >= 0 && main_~y~0#1 <= 2 then 1 else 0)); {520#true} is VALID [2022-02-20 17:16:23,692 INFO L290 TraceCheckUtils]: 9: Hoare triple {520#true} ~cond := #in~cond; {552#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 17:16:23,693 INFO L290 TraceCheckUtils]: 10: Hoare triple {552#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {556#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:16:23,693 INFO L290 TraceCheckUtils]: 11: Hoare triple {556#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {556#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:16:23,697 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {556#(not (= |assume_abort_if_not_#in~cond| 0))} {520#true} #77#return; {563#(and (<= |ULTIMATE.start_main_~y~0#1| 2) (<= 0 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:16:23,697 INFO L272 TraceCheckUtils]: 13: Hoare triple {563#(and (<= |ULTIMATE.start_main_~y~0#1| 2) (<= 0 |ULTIMATE.start_main_~y~0#1|))} call assume_abort_if_not((if main_~y~0#1 >= 1 then 1 else 0)); {520#true} is VALID [2022-02-20 17:16:23,698 INFO L290 TraceCheckUtils]: 14: Hoare triple {520#true} ~cond := #in~cond; {552#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 17:16:23,698 INFO L290 TraceCheckUtils]: 15: Hoare triple {552#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {556#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:16:23,699 INFO L290 TraceCheckUtils]: 16: Hoare triple {556#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {556#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:16:23,700 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {556#(not (= |assume_abort_if_not_#in~cond| 0))} {563#(and (<= |ULTIMATE.start_main_~y~0#1| 2) (<= 0 |ULTIMATE.start_main_~y~0#1|))} #79#return; {579#(and (<= |ULTIMATE.start_main_~y~0#1| 2) (<= 1 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:16:23,700 INFO L290 TraceCheckUtils]: 18: Hoare triple {579#(and (<= |ULTIMATE.start_main_~y~0#1| 2) (<= 1 |ULTIMATE.start_main_~y~0#1|))} main_~q~0#1 := 0;main_~r~0#1 := main_~x~0#1;main_~a~0#1 := 0;main_~b~0#1 := 0; {583#(and (<= |ULTIMATE.start_main_~y~0#1| 2) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} is VALID [2022-02-20 17:16:23,701 INFO L290 TraceCheckUtils]: 19: Hoare triple {583#(and (<= |ULTIMATE.start_main_~y~0#1| 2) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} assume !false; {583#(and (<= |ULTIMATE.start_main_~y~0#1| 2) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} is VALID [2022-02-20 17:16:23,701 INFO L272 TraceCheckUtils]: 20: Hoare triple {583#(and (<= |ULTIMATE.start_main_~y~0#1| 2) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} call __VERIFIER_assert((if main_~b~0#1 == main_~y~0#1 * main_~a~0#1 then 1 else 0)); {520#true} is VALID [2022-02-20 17:16:23,701 INFO L290 TraceCheckUtils]: 21: Hoare triple {520#true} ~cond := #in~cond; {520#true} is VALID [2022-02-20 17:16:23,701 INFO L290 TraceCheckUtils]: 22: Hoare triple {520#true} assume !(0 == ~cond); {520#true} is VALID [2022-02-20 17:16:23,701 INFO L290 TraceCheckUtils]: 23: Hoare triple {520#true} assume true; {520#true} is VALID [2022-02-20 17:16:23,702 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {520#true} {583#(and (<= |ULTIMATE.start_main_~y~0#1| 2) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} #81#return; {583#(and (<= |ULTIMATE.start_main_~y~0#1| 2) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} is VALID [2022-02-20 17:16:23,703 INFO L272 TraceCheckUtils]: 25: Hoare triple {583#(and (<= |ULTIMATE.start_main_~y~0#1| 2) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} call __VERIFIER_assert((if main_~x~0#1 == main_~q~0#1 * main_~y~0#1 + main_~r~0#1 then 1 else 0)); {605#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:16:23,703 INFO L290 TraceCheckUtils]: 26: Hoare triple {605#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {609#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:16:23,704 INFO L290 TraceCheckUtils]: 27: Hoare triple {609#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {521#false} is VALID [2022-02-20 17:16:23,704 INFO L290 TraceCheckUtils]: 28: Hoare triple {521#false} assume !false; {521#false} is VALID [2022-02-20 17:16:23,704 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 17:16:23,705 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:16:23,705 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:16:23,705 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249476669] [2022-02-20 17:16:23,705 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:16:23,705 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294884254] [2022-02-20 17:16:23,705 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294884254] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:16:23,705 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:16:23,706 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 17:16:23,706 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637240271] [2022-02-20 17:16:23,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:16:23,706 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2022-02-20 17:16:23,707 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:16:23,707 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 17:16:23,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:16:23,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 17:16:23,727 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:16:23,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 17:16:23,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-02-20 17:16:23,728 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 17:16:24,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:24,091 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2022-02-20 17:16:24,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 17:16:24,091 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2022-02-20 17:16:24,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:16:24,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 17:16:24,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 65 transitions. [2022-02-20 17:16:24,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 17:16:24,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 65 transitions. [2022-02-20 17:16:24,095 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 65 transitions. [2022-02-20 17:16:24,152 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:16:24,154 INFO L225 Difference]: With dead ends: 53 [2022-02-20 17:16:24,154 INFO L226 Difference]: Without dead ends: 50 [2022-02-20 17:16:24,154 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:16:24,155 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 29 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:16:24,155 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 193 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:16:24,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-02-20 17:16:24,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2022-02-20 17:16:24,178 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:16:24,179 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 49 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:16:24,179 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 49 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:16:24,179 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 49 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:16:24,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:24,182 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-02-20 17:16:24,182 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-02-20 17:16:24,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:24,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:24,183 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 50 states. [2022-02-20 17:16:24,183 INFO L87 Difference]: Start difference. First operand has 49 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 50 states. [2022-02-20 17:16:24,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:24,185 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-02-20 17:16:24,186 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-02-20 17:16:24,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:24,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:24,186 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:16:24,186 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:16:24,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:16:24,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2022-02-20 17:16:24,189 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 63 transitions. Word has length 29 [2022-02-20 17:16:24,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:16:24,189 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 63 transitions. [2022-02-20 17:16:24,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 17:16:24,189 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2022-02-20 17:16:24,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-20 17:16:24,190 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:16:24,190 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:16:24,208 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:16:24,406 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:16:24,408 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:16:24,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:16:24,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1997084946, now seen corresponding path program 1 times [2022-02-20 17:16:24,408 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:16:24,408 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106699068] [2022-02-20 17:16:24,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:16:24,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:16:24,430 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:16:24,431 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1563995638] [2022-02-20 17:16:24,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:16:24,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:16:24,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:16:24,450 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:16:24,451 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:16:24,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:24,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-20 17:16:24,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:24,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:16:24,805 INFO L290 TraceCheckUtils]: 0: Hoare triple {870#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(14, 2);call #Ultimate.allocInit(12, 3); {870#true} is VALID [2022-02-20 17:16:24,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {870#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~x~0#1, main_~y~0#1, main_~q~0#1, main_~r~0#1, main_~a~0#1, main_~b~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~a~0#1;havoc main_~b~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {870#true} is VALID [2022-02-20 17:16:24,806 INFO L272 TraceCheckUtils]: 2: Hoare triple {870#true} call assume_abort_if_not((if main_~x~0#1 >= 0 && main_~x~0#1 <= 2 then 1 else 0)); {870#true} is VALID [2022-02-20 17:16:24,806 INFO L290 TraceCheckUtils]: 3: Hoare triple {870#true} ~cond := #in~cond; {884#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 17:16:24,807 INFO L290 TraceCheckUtils]: 4: Hoare triple {884#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {888#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:16:24,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {888#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {888#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:16:24,808 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {888#(not (= |assume_abort_if_not_#in~cond| 0))} {870#true} #75#return; {895#(and (<= 0 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} is VALID [2022-02-20 17:16:24,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {895#(and (<= 0 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {895#(and (<= 0 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} is VALID [2022-02-20 17:16:24,809 INFO L272 TraceCheckUtils]: 8: Hoare triple {895#(and (<= 0 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} call assume_abort_if_not((if main_~y~0#1 >= 0 && main_~y~0#1 <= 2 then 1 else 0)); {870#true} is VALID [2022-02-20 17:16:24,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {870#true} ~cond := #in~cond; {870#true} is VALID [2022-02-20 17:16:24,809 INFO L290 TraceCheckUtils]: 10: Hoare triple {870#true} assume !(0 == ~cond); {870#true} is VALID [2022-02-20 17:16:24,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {870#true} assume true; {870#true} is VALID [2022-02-20 17:16:24,810 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {870#true} {895#(and (<= 0 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} #77#return; {895#(and (<= 0 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} is VALID [2022-02-20 17:16:24,810 INFO L272 TraceCheckUtils]: 13: Hoare triple {895#(and (<= 0 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} call assume_abort_if_not((if main_~y~0#1 >= 1 then 1 else 0)); {870#true} is VALID [2022-02-20 17:16:24,812 INFO L290 TraceCheckUtils]: 14: Hoare triple {870#true} ~cond := #in~cond; {884#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 17:16:24,812 INFO L290 TraceCheckUtils]: 15: Hoare triple {884#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {888#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:16:24,813 INFO L290 TraceCheckUtils]: 16: Hoare triple {888#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {888#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:16:24,813 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {888#(not (= |assume_abort_if_not_#in~cond| 0))} {895#(and (<= 0 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} #79#return; {929#(and (<= 0 |ULTIMATE.start_main_~x~0#1|) (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} is VALID [2022-02-20 17:16:24,814 INFO L290 TraceCheckUtils]: 18: Hoare triple {929#(and (<= 0 |ULTIMATE.start_main_~x~0#1|) (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} main_~q~0#1 := 0;main_~r~0#1 := main_~x~0#1;main_~a~0#1 := 0;main_~b~0#1 := 0; {933#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~r~0#1| 2))} is VALID [2022-02-20 17:16:24,814 INFO L290 TraceCheckUtils]: 19: Hoare triple {933#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~r~0#1| 2))} assume !false; {933#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~r~0#1| 2))} is VALID [2022-02-20 17:16:24,814 INFO L272 TraceCheckUtils]: 20: Hoare triple {933#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~r~0#1| 2))} call __VERIFIER_assert((if main_~b~0#1 == main_~y~0#1 * main_~a~0#1 then 1 else 0)); {870#true} is VALID [2022-02-20 17:16:24,814 INFO L290 TraceCheckUtils]: 21: Hoare triple {870#true} ~cond := #in~cond; {870#true} is VALID [2022-02-20 17:16:24,815 INFO L290 TraceCheckUtils]: 22: Hoare triple {870#true} assume !(0 == ~cond); {870#true} is VALID [2022-02-20 17:16:24,815 INFO L290 TraceCheckUtils]: 23: Hoare triple {870#true} assume true; {870#true} is VALID [2022-02-20 17:16:24,815 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {870#true} {933#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~r~0#1| 2))} #81#return; {933#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~r~0#1| 2))} is VALID [2022-02-20 17:16:24,816 INFO L272 TraceCheckUtils]: 25: Hoare triple {933#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~r~0#1| 2))} call __VERIFIER_assert((if main_~x~0#1 == main_~q~0#1 * main_~y~0#1 + main_~r~0#1 then 1 else 0)); {870#true} is VALID [2022-02-20 17:16:24,816 INFO L290 TraceCheckUtils]: 26: Hoare triple {870#true} ~cond := #in~cond; {870#true} is VALID [2022-02-20 17:16:24,816 INFO L290 TraceCheckUtils]: 27: Hoare triple {870#true} assume !(0 == ~cond); {870#true} is VALID [2022-02-20 17:16:24,816 INFO L290 TraceCheckUtils]: 28: Hoare triple {870#true} assume true; {870#true} is VALID [2022-02-20 17:16:24,818 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {870#true} {933#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~r~0#1| 2))} #83#return; {933#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~r~0#1| 2))} is VALID [2022-02-20 17:16:24,819 INFO L290 TraceCheckUtils]: 30: Hoare triple {933#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~r~0#1| 2))} assume !!(main_~r~0#1 >= main_~y~0#1);main_~a~0#1 := 1;main_~b~0#1 := main_~y~0#1; {970#(and (<= |ULTIMATE.start_main_~y~0#1| 2) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-20 17:16:24,827 INFO L290 TraceCheckUtils]: 31: Hoare triple {970#(and (<= |ULTIMATE.start_main_~y~0#1| 2) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| 1))} assume !false; {970#(and (<= |ULTIMATE.start_main_~y~0#1| 2) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-20 17:16:24,828 INFO L272 TraceCheckUtils]: 32: Hoare triple {970#(and (<= |ULTIMATE.start_main_~y~0#1| 2) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| 1))} call __VERIFIER_assert((if main_~b~0#1 == main_~y~0#1 * main_~a~0#1 then 1 else 0)); {977#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:16:24,829 INFO L290 TraceCheckUtils]: 33: Hoare triple {977#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {981#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:16:24,829 INFO L290 TraceCheckUtils]: 34: Hoare triple {981#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {871#false} is VALID [2022-02-20 17:16:24,829 INFO L290 TraceCheckUtils]: 35: Hoare triple {871#false} assume !false; {871#false} is VALID [2022-02-20 17:16:24,829 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 17:16:24,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:16:25,060 INFO L290 TraceCheckUtils]: 35: Hoare triple {871#false} assume !false; {871#false} is VALID [2022-02-20 17:16:25,061 INFO L290 TraceCheckUtils]: 34: Hoare triple {981#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {871#false} is VALID [2022-02-20 17:16:25,061 INFO L290 TraceCheckUtils]: 33: Hoare triple {977#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {981#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:16:25,062 INFO L272 TraceCheckUtils]: 32: Hoare triple {997#(= (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~b~0#1|)} call __VERIFIER_assert((if main_~b~0#1 == main_~y~0#1 * main_~a~0#1 then 1 else 0)); {977#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:16:25,062 INFO L290 TraceCheckUtils]: 31: Hoare triple {997#(= (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~b~0#1|)} assume !false; {997#(= (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:16:25,063 INFO L290 TraceCheckUtils]: 30: Hoare triple {870#true} assume !!(main_~r~0#1 >= main_~y~0#1);main_~a~0#1 := 1;main_~b~0#1 := main_~y~0#1; {997#(= (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:16:25,063 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {870#true} {870#true} #83#return; {870#true} is VALID [2022-02-20 17:16:25,063 INFO L290 TraceCheckUtils]: 28: Hoare triple {870#true} assume true; {870#true} is VALID [2022-02-20 17:16:25,063 INFO L290 TraceCheckUtils]: 27: Hoare triple {870#true} assume !(0 == ~cond); {870#true} is VALID [2022-02-20 17:16:25,063 INFO L290 TraceCheckUtils]: 26: Hoare triple {870#true} ~cond := #in~cond; {870#true} is VALID [2022-02-20 17:16:25,064 INFO L272 TraceCheckUtils]: 25: Hoare triple {870#true} call __VERIFIER_assert((if main_~x~0#1 == main_~q~0#1 * main_~y~0#1 + main_~r~0#1 then 1 else 0)); {870#true} is VALID [2022-02-20 17:16:25,064 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {870#true} {870#true} #81#return; {870#true} is VALID [2022-02-20 17:16:25,064 INFO L290 TraceCheckUtils]: 23: Hoare triple {870#true} assume true; {870#true} is VALID [2022-02-20 17:16:25,064 INFO L290 TraceCheckUtils]: 22: Hoare triple {870#true} assume !(0 == ~cond); {870#true} is VALID [2022-02-20 17:16:25,064 INFO L290 TraceCheckUtils]: 21: Hoare triple {870#true} ~cond := #in~cond; {870#true} is VALID [2022-02-20 17:16:25,064 INFO L272 TraceCheckUtils]: 20: Hoare triple {870#true} call __VERIFIER_assert((if main_~b~0#1 == main_~y~0#1 * main_~a~0#1 then 1 else 0)); {870#true} is VALID [2022-02-20 17:16:25,064 INFO L290 TraceCheckUtils]: 19: Hoare triple {870#true} assume !false; {870#true} is VALID [2022-02-20 17:16:25,065 INFO L290 TraceCheckUtils]: 18: Hoare triple {870#true} main_~q~0#1 := 0;main_~r~0#1 := main_~x~0#1;main_~a~0#1 := 0;main_~b~0#1 := 0; {870#true} is VALID [2022-02-20 17:16:25,065 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {870#true} {870#true} #79#return; {870#true} is VALID [2022-02-20 17:16:25,065 INFO L290 TraceCheckUtils]: 16: Hoare triple {870#true} assume true; {870#true} is VALID [2022-02-20 17:16:25,065 INFO L290 TraceCheckUtils]: 15: Hoare triple {870#true} assume !(0 == ~cond); {870#true} is VALID [2022-02-20 17:16:25,065 INFO L290 TraceCheckUtils]: 14: Hoare triple {870#true} ~cond := #in~cond; {870#true} is VALID [2022-02-20 17:16:25,065 INFO L272 TraceCheckUtils]: 13: Hoare triple {870#true} call assume_abort_if_not((if main_~y~0#1 >= 1 then 1 else 0)); {870#true} is VALID [2022-02-20 17:16:25,066 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {870#true} {870#true} #77#return; {870#true} is VALID [2022-02-20 17:16:25,066 INFO L290 TraceCheckUtils]: 11: Hoare triple {870#true} assume true; {870#true} is VALID [2022-02-20 17:16:25,066 INFO L290 TraceCheckUtils]: 10: Hoare triple {870#true} assume !(0 == ~cond); {870#true} is VALID [2022-02-20 17:16:25,066 INFO L290 TraceCheckUtils]: 9: Hoare triple {870#true} ~cond := #in~cond; {870#true} is VALID [2022-02-20 17:16:25,066 INFO L272 TraceCheckUtils]: 8: Hoare triple {870#true} call assume_abort_if_not((if main_~y~0#1 >= 0 && main_~y~0#1 <= 2 then 1 else 0)); {870#true} is VALID [2022-02-20 17:16:25,066 INFO L290 TraceCheckUtils]: 7: Hoare triple {870#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {870#true} is VALID [2022-02-20 17:16:25,066 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {870#true} {870#true} #75#return; {870#true} is VALID [2022-02-20 17:16:25,067 INFO L290 TraceCheckUtils]: 5: Hoare triple {870#true} assume true; {870#true} is VALID [2022-02-20 17:16:25,067 INFO L290 TraceCheckUtils]: 4: Hoare triple {870#true} assume !(0 == ~cond); {870#true} is VALID [2022-02-20 17:16:25,067 INFO L290 TraceCheckUtils]: 3: Hoare triple {870#true} ~cond := #in~cond; {870#true} is VALID [2022-02-20 17:16:25,067 INFO L272 TraceCheckUtils]: 2: Hoare triple {870#true} call assume_abort_if_not((if main_~x~0#1 >= 0 && main_~x~0#1 <= 2 then 1 else 0)); {870#true} is VALID [2022-02-20 17:16:25,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {870#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~x~0#1, main_~y~0#1, main_~q~0#1, main_~r~0#1, main_~a~0#1, main_~b~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~a~0#1;havoc main_~b~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {870#true} is VALID [2022-02-20 17:16:25,067 INFO L290 TraceCheckUtils]: 0: Hoare triple {870#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(14, 2);call #Ultimate.allocInit(12, 3); {870#true} is VALID [2022-02-20 17:16:25,067 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 17:16:25,068 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:16:25,068 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106699068] [2022-02-20 17:16:25,068 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:16:25,068 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563995638] [2022-02-20 17:16:25,068 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563995638] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 17:16:25,068 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:16:25,068 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2022-02-20 17:16:25,069 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021193570] [2022-02-20 17:16:25,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:16:25,069 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 36 [2022-02-20 17:16:25,070 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:16:25,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 17:16:25,086 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:16:25,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:16:25,087 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:16:25,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:16:25,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:16:25,087 INFO L87 Difference]: Start difference. First operand 49 states and 63 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 17:16:25,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:25,219 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2022-02-20 17:16:25,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:16:25,219 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 36 [2022-02-20 17:16:25,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:16:25,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 17:16:25,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-02-20 17:16:25,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 17:16:25,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-02-20 17:16:25,221 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 44 transitions. [2022-02-20 17:16:25,259 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:16:25,260 INFO L225 Difference]: With dead ends: 55 [2022-02-20 17:16:25,260 INFO L226 Difference]: Without dead ends: 53 [2022-02-20 17:16:25,260 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-02-20 17:16:25,261 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 10 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:16:25,261 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 100 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:16:25,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-02-20 17:16:25,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-02-20 17:16:25,282 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:16:25,282 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 53 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:16:25,283 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 53 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:16:25,283 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 53 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:16:25,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:25,285 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2022-02-20 17:16:25,285 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2022-02-20 17:16:25,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:25,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:25,286 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 53 states. [2022-02-20 17:16:25,286 INFO L87 Difference]: Start difference. First operand has 53 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 53 states. [2022-02-20 17:16:25,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:25,288 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2022-02-20 17:16:25,288 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2022-02-20 17:16:25,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:25,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:25,288 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:16:25,288 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:16:25,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:16:25,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2022-02-20 17:16:25,290 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 36 [2022-02-20 17:16:25,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:16:25,291 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2022-02-20 17:16:25,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 17:16:25,291 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2022-02-20 17:16:25,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-20 17:16:25,292 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:16:25,292 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:16:25,325 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:16:25,508 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:16:25,509 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:16:25,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:16:25,509 INFO L85 PathProgramCache]: Analyzing trace with hash -2056573358, now seen corresponding path program 1 times [2022-02-20 17:16:25,509 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:16:25,509 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843457796] [2022-02-20 17:16:25,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:16:25,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:16:25,526 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:16:25,526 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [726534514] [2022-02-20 17:16:25,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:16:25,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:16:25,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:16:25,527 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:16:25,528 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:16:25,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:25,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 17:16:25,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:25,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:16:25,762 INFO L290 TraceCheckUtils]: 0: Hoare triple {1359#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(14, 2);call #Ultimate.allocInit(12, 3); {1359#true} is VALID [2022-02-20 17:16:25,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {1359#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~x~0#1, main_~y~0#1, main_~q~0#1, main_~r~0#1, main_~a~0#1, main_~b~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~a~0#1;havoc main_~b~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1359#true} is VALID [2022-02-20 17:16:25,762 INFO L272 TraceCheckUtils]: 2: Hoare triple {1359#true} call assume_abort_if_not((if main_~x~0#1 >= 0 && main_~x~0#1 <= 2 then 1 else 0)); {1359#true} is VALID [2022-02-20 17:16:25,762 INFO L290 TraceCheckUtils]: 3: Hoare triple {1359#true} ~cond := #in~cond; {1359#true} is VALID [2022-02-20 17:16:25,762 INFO L290 TraceCheckUtils]: 4: Hoare triple {1359#true} assume !(0 == ~cond); {1359#true} is VALID [2022-02-20 17:16:25,763 INFO L290 TraceCheckUtils]: 5: Hoare triple {1359#true} assume true; {1359#true} is VALID [2022-02-20 17:16:25,763 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1359#true} {1359#true} #75#return; {1359#true} is VALID [2022-02-20 17:16:25,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {1359#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1359#true} is VALID [2022-02-20 17:16:25,763 INFO L272 TraceCheckUtils]: 8: Hoare triple {1359#true} call assume_abort_if_not((if main_~y~0#1 >= 0 && main_~y~0#1 <= 2 then 1 else 0)); {1359#true} is VALID [2022-02-20 17:16:25,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {1359#true} ~cond := #in~cond; {1359#true} is VALID [2022-02-20 17:16:25,763 INFO L290 TraceCheckUtils]: 10: Hoare triple {1359#true} assume !(0 == ~cond); {1359#true} is VALID [2022-02-20 17:16:25,763 INFO L290 TraceCheckUtils]: 11: Hoare triple {1359#true} assume true; {1359#true} is VALID [2022-02-20 17:16:25,764 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1359#true} {1359#true} #77#return; {1359#true} is VALID [2022-02-20 17:16:25,764 INFO L272 TraceCheckUtils]: 13: Hoare triple {1359#true} call assume_abort_if_not((if main_~y~0#1 >= 1 then 1 else 0)); {1359#true} is VALID [2022-02-20 17:16:25,764 INFO L290 TraceCheckUtils]: 14: Hoare triple {1359#true} ~cond := #in~cond; {1406#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 17:16:25,765 INFO L290 TraceCheckUtils]: 15: Hoare triple {1406#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1410#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:16:25,765 INFO L290 TraceCheckUtils]: 16: Hoare triple {1410#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1410#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:16:25,766 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1410#(not (= |assume_abort_if_not_#in~cond| 0))} {1359#true} #79#return; {1417#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-20 17:16:25,766 INFO L290 TraceCheckUtils]: 18: Hoare triple {1417#(<= 1 |ULTIMATE.start_main_~y~0#1|)} main_~q~0#1 := 0;main_~r~0#1 := main_~x~0#1;main_~a~0#1 := 0;main_~b~0#1 := 0; {1417#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-20 17:16:25,766 INFO L290 TraceCheckUtils]: 19: Hoare triple {1417#(<= 1 |ULTIMATE.start_main_~y~0#1|)} assume !false; {1417#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-20 17:16:25,766 INFO L272 TraceCheckUtils]: 20: Hoare triple {1417#(<= 1 |ULTIMATE.start_main_~y~0#1|)} call __VERIFIER_assert((if main_~b~0#1 == main_~y~0#1 * main_~a~0#1 then 1 else 0)); {1359#true} is VALID [2022-02-20 17:16:25,767 INFO L290 TraceCheckUtils]: 21: Hoare triple {1359#true} ~cond := #in~cond; {1359#true} is VALID [2022-02-20 17:16:25,767 INFO L290 TraceCheckUtils]: 22: Hoare triple {1359#true} assume !(0 == ~cond); {1359#true} is VALID [2022-02-20 17:16:25,767 INFO L290 TraceCheckUtils]: 23: Hoare triple {1359#true} assume true; {1359#true} is VALID [2022-02-20 17:16:25,770 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1359#true} {1417#(<= 1 |ULTIMATE.start_main_~y~0#1|)} #81#return; {1417#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-20 17:16:25,770 INFO L272 TraceCheckUtils]: 25: Hoare triple {1417#(<= 1 |ULTIMATE.start_main_~y~0#1|)} call __VERIFIER_assert((if main_~x~0#1 == main_~q~0#1 * main_~y~0#1 + main_~r~0#1 then 1 else 0)); {1359#true} is VALID [2022-02-20 17:16:25,770 INFO L290 TraceCheckUtils]: 26: Hoare triple {1359#true} ~cond := #in~cond; {1359#true} is VALID [2022-02-20 17:16:25,770 INFO L290 TraceCheckUtils]: 27: Hoare triple {1359#true} assume !(0 == ~cond); {1359#true} is VALID [2022-02-20 17:16:25,770 INFO L290 TraceCheckUtils]: 28: Hoare triple {1359#true} assume true; {1359#true} is VALID [2022-02-20 17:16:25,771 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1359#true} {1417#(<= 1 |ULTIMATE.start_main_~y~0#1|)} #83#return; {1417#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-20 17:16:25,771 INFO L290 TraceCheckUtils]: 30: Hoare triple {1417#(<= 1 |ULTIMATE.start_main_~y~0#1|)} assume !!(main_~r~0#1 >= main_~y~0#1);main_~a~0#1 := 1;main_~b~0#1 := main_~y~0#1; {1457#(<= 1 |ULTIMATE.start_main_~r~0#1|)} is VALID [2022-02-20 17:16:25,772 INFO L290 TraceCheckUtils]: 31: Hoare triple {1457#(<= 1 |ULTIMATE.start_main_~r~0#1|)} assume !false; {1457#(<= 1 |ULTIMATE.start_main_~r~0#1|)} is VALID [2022-02-20 17:16:25,772 INFO L272 TraceCheckUtils]: 32: Hoare triple {1457#(<= 1 |ULTIMATE.start_main_~r~0#1|)} call __VERIFIER_assert((if main_~b~0#1 == main_~y~0#1 * main_~a~0#1 then 1 else 0)); {1359#true} is VALID [2022-02-20 17:16:25,772 INFO L290 TraceCheckUtils]: 33: Hoare triple {1359#true} ~cond := #in~cond; {1359#true} is VALID [2022-02-20 17:16:25,772 INFO L290 TraceCheckUtils]: 34: Hoare triple {1359#true} assume !(0 == ~cond); {1359#true} is VALID [2022-02-20 17:16:25,772 INFO L290 TraceCheckUtils]: 35: Hoare triple {1359#true} assume true; {1359#true} is VALID [2022-02-20 17:16:25,773 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1359#true} {1457#(<= 1 |ULTIMATE.start_main_~r~0#1|)} #85#return; {1457#(<= 1 |ULTIMATE.start_main_~r~0#1|)} is VALID [2022-02-20 17:16:25,773 INFO L272 TraceCheckUtils]: 37: Hoare triple {1457#(<= 1 |ULTIMATE.start_main_~r~0#1|)} call __VERIFIER_assert((if main_~x~0#1 == main_~q~0#1 * main_~y~0#1 + main_~r~0#1 then 1 else 0)); {1359#true} is VALID [2022-02-20 17:16:25,773 INFO L290 TraceCheckUtils]: 38: Hoare triple {1359#true} ~cond := #in~cond; {1359#true} is VALID [2022-02-20 17:16:25,774 INFO L290 TraceCheckUtils]: 39: Hoare triple {1359#true} assume !(0 == ~cond); {1359#true} is VALID [2022-02-20 17:16:25,774 INFO L290 TraceCheckUtils]: 40: Hoare triple {1359#true} assume true; {1359#true} is VALID [2022-02-20 17:16:25,777 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1359#true} {1457#(<= 1 |ULTIMATE.start_main_~r~0#1|)} #87#return; {1457#(<= 1 |ULTIMATE.start_main_~r~0#1|)} is VALID [2022-02-20 17:16:25,777 INFO L272 TraceCheckUtils]: 42: Hoare triple {1457#(<= 1 |ULTIMATE.start_main_~r~0#1|)} call __VERIFIER_assert((if main_~r~0#1 >= 0 then 1 else 0)); {1494#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:16:25,778 INFO L290 TraceCheckUtils]: 43: Hoare triple {1494#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1498#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:16:25,778 INFO L290 TraceCheckUtils]: 44: Hoare triple {1498#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1360#false} is VALID [2022-02-20 17:16:25,778 INFO L290 TraceCheckUtils]: 45: Hoare triple {1360#false} assume !false; {1360#false} is VALID [2022-02-20 17:16:25,778 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-02-20 17:16:25,779 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:16:25,779 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:16:25,779 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843457796] [2022-02-20 17:16:25,779 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:16:25,779 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726534514] [2022-02-20 17:16:25,779 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726534514] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:16:25,779 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:16:25,779 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 17:16:25,780 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539588569] [2022-02-20 17:16:25,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:16:25,780 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 46 [2022-02-20 17:16:25,780 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:16:25,781 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 17:16:25,806 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:16:25,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:16:25,807 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:16:25,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:16:25,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:16:25,807 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 17:16:26,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:26,052 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2022-02-20 17:16:26,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 17:16:26,052 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 46 [2022-02-20 17:16:26,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:16:26,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 17:16:26,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2022-02-20 17:16:26,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 17:16:26,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2022-02-20 17:16:26,061 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 44 transitions. [2022-02-20 17:16:26,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:16:26,093 INFO L225 Difference]: With dead ends: 59 [2022-02-20 17:16:26,093 INFO L226 Difference]: Without dead ends: 57 [2022-02-20 17:16:26,093 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:16:26,094 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 16 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:16:26,094 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 169 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:16:26,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-02-20 17:16:26,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-02-20 17:16:26,123 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:16:26,123 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:16:26,123 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:16:26,123 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:16:26,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:26,125 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2022-02-20 17:16:26,125 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2022-02-20 17:16:26,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:26,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:26,126 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 57 states. [2022-02-20 17:16:26,126 INFO L87 Difference]: Start difference. First operand has 57 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 57 states. [2022-02-20 17:16:26,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:26,128 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2022-02-20 17:16:26,128 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2022-02-20 17:16:26,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:26,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:26,129 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:16:26,129 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:16:26,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:16:26,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2022-02-20 17:16:26,131 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 46 [2022-02-20 17:16:26,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:16:26,131 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2022-02-20 17:16:26,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 17:16:26,132 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2022-02-20 17:16:26,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 17:16:26,132 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:16:26,132 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:16:26,149 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:16:26,348 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:16:26,349 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:16:26,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:16:26,349 INFO L85 PathProgramCache]: Analyzing trace with hash -2085516536, now seen corresponding path program 1 times [2022-02-20 17:16:26,349 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:16:26,349 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487143808] [2022-02-20 17:16:26,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:16:26,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:16:26,370 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:16:26,371 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1247008981] [2022-02-20 17:16:26,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:16:26,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:16:26,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:16:26,383 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:16:26,385 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:16:26,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:26,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 17:16:26,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:26,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:16:26,697 INFO L290 TraceCheckUtils]: 0: Hoare triple {1792#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(14, 2);call #Ultimate.allocInit(12, 3); {1792#true} is VALID [2022-02-20 17:16:26,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {1792#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~x~0#1, main_~y~0#1, main_~q~0#1, main_~r~0#1, main_~a~0#1, main_~b~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~a~0#1;havoc main_~b~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1792#true} is VALID [2022-02-20 17:16:26,697 INFO L272 TraceCheckUtils]: 2: Hoare triple {1792#true} call assume_abort_if_not((if main_~x~0#1 >= 0 && main_~x~0#1 <= 2 then 1 else 0)); {1792#true} is VALID [2022-02-20 17:16:26,697 INFO L290 TraceCheckUtils]: 3: Hoare triple {1792#true} ~cond := #in~cond; {1792#true} is VALID [2022-02-20 17:16:26,697 INFO L290 TraceCheckUtils]: 4: Hoare triple {1792#true} assume !(0 == ~cond); {1792#true} is VALID [2022-02-20 17:16:26,697 INFO L290 TraceCheckUtils]: 5: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-02-20 17:16:26,698 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1792#true} {1792#true} #75#return; {1792#true} is VALID [2022-02-20 17:16:26,698 INFO L290 TraceCheckUtils]: 7: Hoare triple {1792#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1792#true} is VALID [2022-02-20 17:16:26,698 INFO L272 TraceCheckUtils]: 8: Hoare triple {1792#true} call assume_abort_if_not((if main_~y~0#1 >= 0 && main_~y~0#1 <= 2 then 1 else 0)); {1792#true} is VALID [2022-02-20 17:16:26,698 INFO L290 TraceCheckUtils]: 9: Hoare triple {1792#true} ~cond := #in~cond; {1792#true} is VALID [2022-02-20 17:16:26,698 INFO L290 TraceCheckUtils]: 10: Hoare triple {1792#true} assume !(0 == ~cond); {1792#true} is VALID [2022-02-20 17:16:26,699 INFO L290 TraceCheckUtils]: 11: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-02-20 17:16:26,699 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1792#true} {1792#true} #77#return; {1792#true} is VALID [2022-02-20 17:16:26,699 INFO L272 TraceCheckUtils]: 13: Hoare triple {1792#true} call assume_abort_if_not((if main_~y~0#1 >= 1 then 1 else 0)); {1792#true} is VALID [2022-02-20 17:16:26,699 INFO L290 TraceCheckUtils]: 14: Hoare triple {1792#true} ~cond := #in~cond; {1792#true} is VALID [2022-02-20 17:16:26,699 INFO L290 TraceCheckUtils]: 15: Hoare triple {1792#true} assume !(0 == ~cond); {1792#true} is VALID [2022-02-20 17:16:26,699 INFO L290 TraceCheckUtils]: 16: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-02-20 17:16:26,699 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1792#true} {1792#true} #79#return; {1792#true} is VALID [2022-02-20 17:16:26,699 INFO L290 TraceCheckUtils]: 18: Hoare triple {1792#true} main_~q~0#1 := 0;main_~r~0#1 := main_~x~0#1;main_~a~0#1 := 0;main_~b~0#1 := 0; {1792#true} is VALID [2022-02-20 17:16:26,699 INFO L290 TraceCheckUtils]: 19: Hoare triple {1792#true} assume !false; {1792#true} is VALID [2022-02-20 17:16:26,699 INFO L272 TraceCheckUtils]: 20: Hoare triple {1792#true} call __VERIFIER_assert((if main_~b~0#1 == main_~y~0#1 * main_~a~0#1 then 1 else 0)); {1792#true} is VALID [2022-02-20 17:16:26,699 INFO L290 TraceCheckUtils]: 21: Hoare triple {1792#true} ~cond := #in~cond; {1792#true} is VALID [2022-02-20 17:16:26,699 INFO L290 TraceCheckUtils]: 22: Hoare triple {1792#true} assume !(0 == ~cond); {1792#true} is VALID [2022-02-20 17:16:26,700 INFO L290 TraceCheckUtils]: 23: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-02-20 17:16:26,700 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1792#true} {1792#true} #81#return; {1792#true} is VALID [2022-02-20 17:16:26,700 INFO L272 TraceCheckUtils]: 25: Hoare triple {1792#true} call __VERIFIER_assert((if main_~x~0#1 == main_~q~0#1 * main_~y~0#1 + main_~r~0#1 then 1 else 0)); {1792#true} is VALID [2022-02-20 17:16:26,700 INFO L290 TraceCheckUtils]: 26: Hoare triple {1792#true} ~cond := #in~cond; {1792#true} is VALID [2022-02-20 17:16:26,700 INFO L290 TraceCheckUtils]: 27: Hoare triple {1792#true} assume !(0 == ~cond); {1792#true} is VALID [2022-02-20 17:16:26,700 INFO L290 TraceCheckUtils]: 28: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-02-20 17:16:26,700 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1792#true} {1792#true} #83#return; {1792#true} is VALID [2022-02-20 17:16:26,700 INFO L290 TraceCheckUtils]: 30: Hoare triple {1792#true} assume !!(main_~r~0#1 >= main_~y~0#1);main_~a~0#1 := 1;main_~b~0#1 := main_~y~0#1; {1792#true} is VALID [2022-02-20 17:16:26,700 INFO L290 TraceCheckUtils]: 31: Hoare triple {1792#true} assume !false; {1792#true} is VALID [2022-02-20 17:16:26,700 INFO L272 TraceCheckUtils]: 32: Hoare triple {1792#true} call __VERIFIER_assert((if main_~b~0#1 == main_~y~0#1 * main_~a~0#1 then 1 else 0)); {1792#true} is VALID [2022-02-20 17:16:26,715 INFO L290 TraceCheckUtils]: 33: Hoare triple {1792#true} ~cond := #in~cond; {1896#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:16:26,716 INFO L290 TraceCheckUtils]: 34: Hoare triple {1896#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1900#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:16:26,716 INFO L290 TraceCheckUtils]: 35: Hoare triple {1900#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1900#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:16:26,717 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1900#(not (= |__VERIFIER_assert_#in~cond| 0))} {1792#true} #85#return; {1907#(= (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:16:26,718 INFO L272 TraceCheckUtils]: 37: Hoare triple {1907#(= (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~b~0#1|)} call __VERIFIER_assert((if main_~x~0#1 == main_~q~0#1 * main_~y~0#1 + main_~r~0#1 then 1 else 0)); {1792#true} is VALID [2022-02-20 17:16:26,718 INFO L290 TraceCheckUtils]: 38: Hoare triple {1792#true} ~cond := #in~cond; {1792#true} is VALID [2022-02-20 17:16:26,718 INFO L290 TraceCheckUtils]: 39: Hoare triple {1792#true} assume !(0 == ~cond); {1792#true} is VALID [2022-02-20 17:16:26,718 INFO L290 TraceCheckUtils]: 40: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-02-20 17:16:26,719 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1792#true} {1907#(= (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~b~0#1|)} #87#return; {1907#(= (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:16:26,719 INFO L272 TraceCheckUtils]: 42: Hoare triple {1907#(= (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~b~0#1|)} call __VERIFIER_assert((if main_~r~0#1 >= 0 then 1 else 0)); {1792#true} is VALID [2022-02-20 17:16:26,719 INFO L290 TraceCheckUtils]: 43: Hoare triple {1792#true} ~cond := #in~cond; {1792#true} is VALID [2022-02-20 17:16:26,719 INFO L290 TraceCheckUtils]: 44: Hoare triple {1792#true} assume !(0 == ~cond); {1792#true} is VALID [2022-02-20 17:16:26,719 INFO L290 TraceCheckUtils]: 45: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-02-20 17:16:26,720 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {1792#true} {1907#(= (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~b~0#1|)} #89#return; {1907#(= (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:16:26,721 INFO L290 TraceCheckUtils]: 47: Hoare triple {1907#(= (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~b~0#1|)} assume !!(main_~r~0#1 >= 2 * main_~b~0#1); {1941#(<= (* (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~r~0#1|)} is VALID [2022-02-20 17:16:26,723 INFO L272 TraceCheckUtils]: 48: Hoare triple {1941#(<= (* (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~r~0#1|)} call __VERIFIER_assert((if main_~r~0#1 >= 2 * main_~y~0#1 * main_~a~0#1 then 1 else 0)); {1945#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:16:26,724 INFO L290 TraceCheckUtils]: 49: Hoare triple {1945#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1949#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:16:26,724 INFO L290 TraceCheckUtils]: 50: Hoare triple {1949#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1793#false} is VALID [2022-02-20 17:16:26,724 INFO L290 TraceCheckUtils]: 51: Hoare triple {1793#false} assume !false; {1793#false} is VALID [2022-02-20 17:16:26,725 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-02-20 17:16:26,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:16:35,120 INFO L290 TraceCheckUtils]: 51: Hoare triple {1793#false} assume !false; {1793#false} is VALID [2022-02-20 17:16:35,121 INFO L290 TraceCheckUtils]: 50: Hoare triple {1949#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1793#false} is VALID [2022-02-20 17:16:35,121 INFO L290 TraceCheckUtils]: 49: Hoare triple {1945#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1949#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:16:35,122 INFO L272 TraceCheckUtils]: 48: Hoare triple {1941#(<= (* (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~r~0#1|)} call __VERIFIER_assert((if main_~r~0#1 >= 2 * main_~y~0#1 * main_~a~0#1 then 1 else 0)); {1945#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:16:35,122 INFO L290 TraceCheckUtils]: 47: Hoare triple {1968#(<= (* (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* 2 |ULTIMATE.start_main_~b~0#1|))} assume !!(main_~r~0#1 >= 2 * main_~b~0#1); {1941#(<= (* (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~r~0#1|)} is VALID [2022-02-20 17:16:35,123 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {1792#true} {1968#(<= (* (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* 2 |ULTIMATE.start_main_~b~0#1|))} #89#return; {1968#(<= (* (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* 2 |ULTIMATE.start_main_~b~0#1|))} is VALID [2022-02-20 17:16:35,123 INFO L290 TraceCheckUtils]: 45: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-02-20 17:16:35,123 INFO L290 TraceCheckUtils]: 44: Hoare triple {1792#true} assume !(0 == ~cond); {1792#true} is VALID [2022-02-20 17:16:35,123 INFO L290 TraceCheckUtils]: 43: Hoare triple {1792#true} ~cond := #in~cond; {1792#true} is VALID [2022-02-20 17:16:35,123 INFO L272 TraceCheckUtils]: 42: Hoare triple {1968#(<= (* (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* 2 |ULTIMATE.start_main_~b~0#1|))} call __VERIFIER_assert((if main_~r~0#1 >= 0 then 1 else 0)); {1792#true} is VALID [2022-02-20 17:16:35,124 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1792#true} {1968#(<= (* (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* 2 |ULTIMATE.start_main_~b~0#1|))} #87#return; {1968#(<= (* (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* 2 |ULTIMATE.start_main_~b~0#1|))} is VALID [2022-02-20 17:16:35,124 INFO L290 TraceCheckUtils]: 40: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-02-20 17:16:35,124 INFO L290 TraceCheckUtils]: 39: Hoare triple {1792#true} assume !(0 == ~cond); {1792#true} is VALID [2022-02-20 17:16:35,124 INFO L290 TraceCheckUtils]: 38: Hoare triple {1792#true} ~cond := #in~cond; {1792#true} is VALID [2022-02-20 17:16:35,124 INFO L272 TraceCheckUtils]: 37: Hoare triple {1968#(<= (* (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* 2 |ULTIMATE.start_main_~b~0#1|))} call __VERIFIER_assert((if main_~x~0#1 == main_~q~0#1 * main_~y~0#1 + main_~r~0#1 then 1 else 0)); {1792#true} is VALID [2022-02-20 17:16:35,125 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1900#(not (= |__VERIFIER_assert_#in~cond| 0))} {1792#true} #85#return; {1968#(<= (* (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* 2 |ULTIMATE.start_main_~b~0#1|))} is VALID [2022-02-20 17:16:35,125 INFO L290 TraceCheckUtils]: 35: Hoare triple {1900#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1900#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:16:35,125 INFO L290 TraceCheckUtils]: 34: Hoare triple {2011#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1900#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:16:35,126 INFO L290 TraceCheckUtils]: 33: Hoare triple {1792#true} ~cond := #in~cond; {2011#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:16:35,126 INFO L272 TraceCheckUtils]: 32: Hoare triple {1792#true} call __VERIFIER_assert((if main_~b~0#1 == main_~y~0#1 * main_~a~0#1 then 1 else 0)); {1792#true} is VALID [2022-02-20 17:16:35,126 INFO L290 TraceCheckUtils]: 31: Hoare triple {1792#true} assume !false; {1792#true} is VALID [2022-02-20 17:16:35,126 INFO L290 TraceCheckUtils]: 30: Hoare triple {1792#true} assume !!(main_~r~0#1 >= main_~y~0#1);main_~a~0#1 := 1;main_~b~0#1 := main_~y~0#1; {1792#true} is VALID [2022-02-20 17:16:35,126 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1792#true} {1792#true} #83#return; {1792#true} is VALID [2022-02-20 17:16:35,126 INFO L290 TraceCheckUtils]: 28: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-02-20 17:16:35,126 INFO L290 TraceCheckUtils]: 27: Hoare triple {1792#true} assume !(0 == ~cond); {1792#true} is VALID [2022-02-20 17:16:35,126 INFO L290 TraceCheckUtils]: 26: Hoare triple {1792#true} ~cond := #in~cond; {1792#true} is VALID [2022-02-20 17:16:35,126 INFO L272 TraceCheckUtils]: 25: Hoare triple {1792#true} call __VERIFIER_assert((if main_~x~0#1 == main_~q~0#1 * main_~y~0#1 + main_~r~0#1 then 1 else 0)); {1792#true} is VALID [2022-02-20 17:16:35,126 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1792#true} {1792#true} #81#return; {1792#true} is VALID [2022-02-20 17:16:35,126 INFO L290 TraceCheckUtils]: 23: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-02-20 17:16:35,126 INFO L290 TraceCheckUtils]: 22: Hoare triple {1792#true} assume !(0 == ~cond); {1792#true} is VALID [2022-02-20 17:16:35,127 INFO L290 TraceCheckUtils]: 21: Hoare triple {1792#true} ~cond := #in~cond; {1792#true} is VALID [2022-02-20 17:16:35,127 INFO L272 TraceCheckUtils]: 20: Hoare triple {1792#true} call __VERIFIER_assert((if main_~b~0#1 == main_~y~0#1 * main_~a~0#1 then 1 else 0)); {1792#true} is VALID [2022-02-20 17:16:35,127 INFO L290 TraceCheckUtils]: 19: Hoare triple {1792#true} assume !false; {1792#true} is VALID [2022-02-20 17:16:35,127 INFO L290 TraceCheckUtils]: 18: Hoare triple {1792#true} main_~q~0#1 := 0;main_~r~0#1 := main_~x~0#1;main_~a~0#1 := 0;main_~b~0#1 := 0; {1792#true} is VALID [2022-02-20 17:16:35,127 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1792#true} {1792#true} #79#return; {1792#true} is VALID [2022-02-20 17:16:35,127 INFO L290 TraceCheckUtils]: 16: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-02-20 17:16:35,127 INFO L290 TraceCheckUtils]: 15: Hoare triple {1792#true} assume !(0 == ~cond); {1792#true} is VALID [2022-02-20 17:16:35,127 INFO L290 TraceCheckUtils]: 14: Hoare triple {1792#true} ~cond := #in~cond; {1792#true} is VALID [2022-02-20 17:16:35,127 INFO L272 TraceCheckUtils]: 13: Hoare triple {1792#true} call assume_abort_if_not((if main_~y~0#1 >= 1 then 1 else 0)); {1792#true} is VALID [2022-02-20 17:16:35,127 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1792#true} {1792#true} #77#return; {1792#true} is VALID [2022-02-20 17:16:35,127 INFO L290 TraceCheckUtils]: 11: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-02-20 17:16:35,127 INFO L290 TraceCheckUtils]: 10: Hoare triple {1792#true} assume !(0 == ~cond); {1792#true} is VALID [2022-02-20 17:16:35,127 INFO L290 TraceCheckUtils]: 9: Hoare triple {1792#true} ~cond := #in~cond; {1792#true} is VALID [2022-02-20 17:16:35,128 INFO L272 TraceCheckUtils]: 8: Hoare triple {1792#true} call assume_abort_if_not((if main_~y~0#1 >= 0 && main_~y~0#1 <= 2 then 1 else 0)); {1792#true} is VALID [2022-02-20 17:16:35,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {1792#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1792#true} is VALID [2022-02-20 17:16:35,128 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1792#true} {1792#true} #75#return; {1792#true} is VALID [2022-02-20 17:16:35,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-02-20 17:16:35,128 INFO L290 TraceCheckUtils]: 4: Hoare triple {1792#true} assume !(0 == ~cond); {1792#true} is VALID [2022-02-20 17:16:35,128 INFO L290 TraceCheckUtils]: 3: Hoare triple {1792#true} ~cond := #in~cond; {1792#true} is VALID [2022-02-20 17:16:35,128 INFO L272 TraceCheckUtils]: 2: Hoare triple {1792#true} call assume_abort_if_not((if main_~x~0#1 >= 0 && main_~x~0#1 <= 2 then 1 else 0)); {1792#true} is VALID [2022-02-20 17:16:35,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {1792#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~x~0#1, main_~y~0#1, main_~q~0#1, main_~r~0#1, main_~a~0#1, main_~b~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~a~0#1;havoc main_~b~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1792#true} is VALID [2022-02-20 17:16:35,128 INFO L290 TraceCheckUtils]: 0: Hoare triple {1792#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(14, 2);call #Ultimate.allocInit(12, 3); {1792#true} is VALID [2022-02-20 17:16:35,128 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-02-20 17:16:35,128 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:16:35,129 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487143808] [2022-02-20 17:16:35,129 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:16:35,129 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247008981] [2022-02-20 17:16:35,129 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247008981] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:16:35,129 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:16:35,129 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-02-20 17:16:35,129 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744635788] [2022-02-20 17:16:35,129 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:16:35,129 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 52 [2022-02-20 17:16:35,130 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:16:35,130 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-02-20 17:16:35,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:16:35,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 17:16:35,162 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:16:35,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 17:16:35,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:16:35,163 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-02-20 17:16:35,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:35,414 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2022-02-20 17:16:35,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 17:16:35,414 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 52 [2022-02-20 17:16:35,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:16:35,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-02-20 17:16:35,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2022-02-20 17:16:35,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-02-20 17:16:35,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2022-02-20 17:16:35,416 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 44 transitions. [2022-02-20 17:16:35,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:16:35,451 INFO L225 Difference]: With dead ends: 63 [2022-02-20 17:16:35,451 INFO L226 Difference]: Without dead ends: 61 [2022-02-20 17:16:35,451 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-02-20 17:16:35,452 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 24 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:16:35,452 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 124 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:16:35,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-02-20 17:16:35,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-02-20 17:16:35,480 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:16:35,480 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 61 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 38 states have internal predecessors, (41), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:16:35,480 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 61 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 38 states have internal predecessors, (41), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:16:35,481 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 61 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 38 states have internal predecessors, (41), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:16:35,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:35,482 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2022-02-20 17:16:35,483 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2022-02-20 17:16:35,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:35,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:35,483 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 38 states have internal predecessors, (41), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 61 states. [2022-02-20 17:16:35,483 INFO L87 Difference]: Start difference. First operand has 61 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 38 states have internal predecessors, (41), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 61 states. [2022-02-20 17:16:35,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:35,485 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2022-02-20 17:16:35,485 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2022-02-20 17:16:35,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:35,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:35,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:16:35,486 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:16:35,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 38 states have internal predecessors, (41), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:16:35,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2022-02-20 17:16:35,488 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 52 [2022-02-20 17:16:35,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:16:35,488 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2022-02-20 17:16:35,488 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-02-20 17:16:35,488 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2022-02-20 17:16:35,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 17:16:35,489 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:16:35,489 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:16:35,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-20 17:16:35,705 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:16:35,705 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:16:35,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:16:35,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1724367982, now seen corresponding path program 1 times [2022-02-20 17:16:35,706 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:16:35,706 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697432703] [2022-02-20 17:16:35,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:16:35,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:16:35,726 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:16:35,726 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [366323552] [2022-02-20 17:16:35,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:16:35,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:16:35,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:16:35,728 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:16:35,729 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:16:35,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:35,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-20 17:16:35,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:35,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:16:36,043 INFO L290 TraceCheckUtils]: 0: Hoare triple {2416#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(14, 2);call #Ultimate.allocInit(12, 3); {2416#true} is VALID [2022-02-20 17:16:36,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {2416#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~x~0#1, main_~y~0#1, main_~q~0#1, main_~r~0#1, main_~a~0#1, main_~b~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~a~0#1;havoc main_~b~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {2416#true} is VALID [2022-02-20 17:16:36,044 INFO L272 TraceCheckUtils]: 2: Hoare triple {2416#true} call assume_abort_if_not((if main_~x~0#1 >= 0 && main_~x~0#1 <= 2 then 1 else 0)); {2416#true} is VALID [2022-02-20 17:16:36,044 INFO L290 TraceCheckUtils]: 3: Hoare triple {2416#true} ~cond := #in~cond; {2416#true} is VALID [2022-02-20 17:16:36,044 INFO L290 TraceCheckUtils]: 4: Hoare triple {2416#true} assume !(0 == ~cond); {2416#true} is VALID [2022-02-20 17:16:36,044 INFO L290 TraceCheckUtils]: 5: Hoare triple {2416#true} assume true; {2416#true} is VALID [2022-02-20 17:16:36,044 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2416#true} {2416#true} #75#return; {2416#true} is VALID [2022-02-20 17:16:36,045 INFO L290 TraceCheckUtils]: 7: Hoare triple {2416#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2416#true} is VALID [2022-02-20 17:16:36,045 INFO L272 TraceCheckUtils]: 8: Hoare triple {2416#true} call assume_abort_if_not((if main_~y~0#1 >= 0 && main_~y~0#1 <= 2 then 1 else 0)); {2416#true} is VALID [2022-02-20 17:16:36,045 INFO L290 TraceCheckUtils]: 9: Hoare triple {2416#true} ~cond := #in~cond; {2416#true} is VALID [2022-02-20 17:16:36,045 INFO L290 TraceCheckUtils]: 10: Hoare triple {2416#true} assume !(0 == ~cond); {2416#true} is VALID [2022-02-20 17:16:36,045 INFO L290 TraceCheckUtils]: 11: Hoare triple {2416#true} assume true; {2416#true} is VALID [2022-02-20 17:16:36,045 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2416#true} {2416#true} #77#return; {2416#true} is VALID [2022-02-20 17:16:36,045 INFO L272 TraceCheckUtils]: 13: Hoare triple {2416#true} call assume_abort_if_not((if main_~y~0#1 >= 1 then 1 else 0)); {2416#true} is VALID [2022-02-20 17:16:36,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {2416#true} ~cond := #in~cond; {2416#true} is VALID [2022-02-20 17:16:36,046 INFO L290 TraceCheckUtils]: 15: Hoare triple {2416#true} assume !(0 == ~cond); {2416#true} is VALID [2022-02-20 17:16:36,046 INFO L290 TraceCheckUtils]: 16: Hoare triple {2416#true} assume true; {2416#true} is VALID [2022-02-20 17:16:36,046 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2416#true} {2416#true} #79#return; {2416#true} is VALID [2022-02-20 17:16:36,046 INFO L290 TraceCheckUtils]: 18: Hoare triple {2416#true} main_~q~0#1 := 0;main_~r~0#1 := main_~x~0#1;main_~a~0#1 := 0;main_~b~0#1 := 0; {2475#(and (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} is VALID [2022-02-20 17:16:36,047 INFO L290 TraceCheckUtils]: 19: Hoare triple {2475#(and (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} assume !false; {2475#(and (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} is VALID [2022-02-20 17:16:36,047 INFO L272 TraceCheckUtils]: 20: Hoare triple {2475#(and (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} call __VERIFIER_assert((if main_~b~0#1 == main_~y~0#1 * main_~a~0#1 then 1 else 0)); {2416#true} is VALID [2022-02-20 17:16:36,047 INFO L290 TraceCheckUtils]: 21: Hoare triple {2416#true} ~cond := #in~cond; {2416#true} is VALID [2022-02-20 17:16:36,047 INFO L290 TraceCheckUtils]: 22: Hoare triple {2416#true} assume !(0 == ~cond); {2416#true} is VALID [2022-02-20 17:16:36,047 INFO L290 TraceCheckUtils]: 23: Hoare triple {2416#true} assume true; {2416#true} is VALID [2022-02-20 17:16:36,048 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2416#true} {2475#(and (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} #81#return; {2475#(and (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} is VALID [2022-02-20 17:16:36,048 INFO L272 TraceCheckUtils]: 25: Hoare triple {2475#(and (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} call __VERIFIER_assert((if main_~x~0#1 == main_~q~0#1 * main_~y~0#1 + main_~r~0#1 then 1 else 0)); {2416#true} is VALID [2022-02-20 17:16:36,048 INFO L290 TraceCheckUtils]: 26: Hoare triple {2416#true} ~cond := #in~cond; {2416#true} is VALID [2022-02-20 17:16:36,048 INFO L290 TraceCheckUtils]: 27: Hoare triple {2416#true} assume !(0 == ~cond); {2416#true} is VALID [2022-02-20 17:16:36,049 INFO L290 TraceCheckUtils]: 28: Hoare triple {2416#true} assume true; {2416#true} is VALID [2022-02-20 17:16:36,049 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2416#true} {2475#(and (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} #83#return; {2475#(and (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} is VALID [2022-02-20 17:16:36,050 INFO L290 TraceCheckUtils]: 30: Hoare triple {2475#(and (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} assume !!(main_~r~0#1 >= main_~y~0#1);main_~a~0#1 := 1;main_~b~0#1 := main_~y~0#1; {2512#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| 1) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} is VALID [2022-02-20 17:16:36,050 INFO L290 TraceCheckUtils]: 31: Hoare triple {2512#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| 1) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} assume !false; {2512#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| 1) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} is VALID [2022-02-20 17:16:36,050 INFO L272 TraceCheckUtils]: 32: Hoare triple {2512#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| 1) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} call __VERIFIER_assert((if main_~b~0#1 == main_~y~0#1 * main_~a~0#1 then 1 else 0)); {2416#true} is VALID [2022-02-20 17:16:36,050 INFO L290 TraceCheckUtils]: 33: Hoare triple {2416#true} ~cond := #in~cond; {2416#true} is VALID [2022-02-20 17:16:36,051 INFO L290 TraceCheckUtils]: 34: Hoare triple {2416#true} assume !(0 == ~cond); {2416#true} is VALID [2022-02-20 17:16:36,051 INFO L290 TraceCheckUtils]: 35: Hoare triple {2416#true} assume true; {2416#true} is VALID [2022-02-20 17:16:36,051 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2416#true} {2512#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| 1) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} #85#return; {2512#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| 1) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} is VALID [2022-02-20 17:16:36,052 INFO L272 TraceCheckUtils]: 37: Hoare triple {2512#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| 1) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} call __VERIFIER_assert((if main_~x~0#1 == main_~q~0#1 * main_~y~0#1 + main_~r~0#1 then 1 else 0)); {2416#true} is VALID [2022-02-20 17:16:36,052 INFO L290 TraceCheckUtils]: 38: Hoare triple {2416#true} ~cond := #in~cond; {2416#true} is VALID [2022-02-20 17:16:36,052 INFO L290 TraceCheckUtils]: 39: Hoare triple {2416#true} assume !(0 == ~cond); {2416#true} is VALID [2022-02-20 17:16:36,052 INFO L290 TraceCheckUtils]: 40: Hoare triple {2416#true} assume true; {2416#true} is VALID [2022-02-20 17:16:36,053 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2416#true} {2512#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| 1) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} #87#return; {2512#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| 1) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} is VALID [2022-02-20 17:16:36,053 INFO L272 TraceCheckUtils]: 42: Hoare triple {2512#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| 1) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} call __VERIFIER_assert((if main_~r~0#1 >= 0 then 1 else 0)); {2416#true} is VALID [2022-02-20 17:16:36,053 INFO L290 TraceCheckUtils]: 43: Hoare triple {2416#true} ~cond := #in~cond; {2416#true} is VALID [2022-02-20 17:16:36,053 INFO L290 TraceCheckUtils]: 44: Hoare triple {2416#true} assume !(0 == ~cond); {2416#true} is VALID [2022-02-20 17:16:36,053 INFO L290 TraceCheckUtils]: 45: Hoare triple {2416#true} assume true; {2416#true} is VALID [2022-02-20 17:16:36,054 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {2416#true} {2512#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| 1) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} #89#return; {2512#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| 1) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} is VALID [2022-02-20 17:16:36,054 INFO L290 TraceCheckUtils]: 47: Hoare triple {2512#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| 1) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} assume !(main_~r~0#1 >= 2 * main_~b~0#1); {2512#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| 1) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} is VALID [2022-02-20 17:16:36,055 INFO L290 TraceCheckUtils]: 48: Hoare triple {2512#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| 1) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} main_~r~0#1 := main_~r~0#1 - main_~b~0#1;main_~q~0#1 := main_~q~0#1 + main_~a~0#1; {2567#(and (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~q~0#1| 1))} is VALID [2022-02-20 17:16:36,055 INFO L290 TraceCheckUtils]: 49: Hoare triple {2567#(and (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~q~0#1| 1))} assume !false; {2567#(and (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~q~0#1| 1))} is VALID [2022-02-20 17:16:36,055 INFO L272 TraceCheckUtils]: 50: Hoare triple {2567#(and (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~q~0#1| 1))} call __VERIFIER_assert((if main_~b~0#1 == main_~y~0#1 * main_~a~0#1 then 1 else 0)); {2416#true} is VALID [2022-02-20 17:16:36,055 INFO L290 TraceCheckUtils]: 51: Hoare triple {2416#true} ~cond := #in~cond; {2416#true} is VALID [2022-02-20 17:16:36,055 INFO L290 TraceCheckUtils]: 52: Hoare triple {2416#true} assume !(0 == ~cond); {2416#true} is VALID [2022-02-20 17:16:36,055 INFO L290 TraceCheckUtils]: 53: Hoare triple {2416#true} assume true; {2416#true} is VALID [2022-02-20 17:16:36,056 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {2416#true} {2567#(and (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~q~0#1| 1))} #81#return; {2567#(and (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~q~0#1| 1))} is VALID [2022-02-20 17:16:36,057 INFO L272 TraceCheckUtils]: 55: Hoare triple {2567#(and (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~q~0#1| 1))} call __VERIFIER_assert((if main_~x~0#1 == main_~q~0#1 * main_~y~0#1 + main_~r~0#1 then 1 else 0)); {2589#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:16:36,057 INFO L290 TraceCheckUtils]: 56: Hoare triple {2589#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2593#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:16:36,057 INFO L290 TraceCheckUtils]: 57: Hoare triple {2593#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2417#false} is VALID [2022-02-20 17:16:36,057 INFO L290 TraceCheckUtils]: 58: Hoare triple {2417#false} assume !false; {2417#false} is VALID [2022-02-20 17:16:36,058 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-02-20 17:16:36,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:16:36,280 INFO L290 TraceCheckUtils]: 58: Hoare triple {2417#false} assume !false; {2417#false} is VALID [2022-02-20 17:16:36,280 INFO L290 TraceCheckUtils]: 57: Hoare triple {2593#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2417#false} is VALID [2022-02-20 17:16:36,281 INFO L290 TraceCheckUtils]: 56: Hoare triple {2589#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2593#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:16:36,282 INFO L272 TraceCheckUtils]: 55: Hoare triple {2609#(= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|)))} call __VERIFIER_assert((if main_~x~0#1 == main_~q~0#1 * main_~y~0#1 + main_~r~0#1 then 1 else 0)); {2589#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:16:36,283 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {2416#true} {2609#(= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|)))} #81#return; {2609#(= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:16:36,283 INFO L290 TraceCheckUtils]: 53: Hoare triple {2416#true} assume true; {2416#true} is VALID [2022-02-20 17:16:36,283 INFO L290 TraceCheckUtils]: 52: Hoare triple {2416#true} assume !(0 == ~cond); {2416#true} is VALID [2022-02-20 17:16:36,283 INFO L290 TraceCheckUtils]: 51: Hoare triple {2416#true} ~cond := #in~cond; {2416#true} is VALID [2022-02-20 17:16:36,283 INFO L272 TraceCheckUtils]: 50: Hoare triple {2609#(= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|)))} call __VERIFIER_assert((if main_~b~0#1 == main_~y~0#1 * main_~a~0#1 then 1 else 0)); {2416#true} is VALID [2022-02-20 17:16:36,284 INFO L290 TraceCheckUtils]: 49: Hoare triple {2609#(= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|)))} assume !false; {2609#(= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:16:36,301 INFO L290 TraceCheckUtils]: 48: Hoare triple {2631#(= (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) (* (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~x~0#1|)} main_~r~0#1 := main_~r~0#1 - main_~b~0#1;main_~q~0#1 := main_~q~0#1 + main_~a~0#1; {2609#(= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:16:36,301 INFO L290 TraceCheckUtils]: 47: Hoare triple {2631#(= (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) (* (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~x~0#1|)} assume !(main_~r~0#1 >= 2 * main_~b~0#1); {2631#(= (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) (* (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 17:16:36,302 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {2416#true} {2631#(= (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) (* (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~x~0#1|)} #89#return; {2631#(= (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) (* (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 17:16:36,302 INFO L290 TraceCheckUtils]: 45: Hoare triple {2416#true} assume true; {2416#true} is VALID [2022-02-20 17:16:36,302 INFO L290 TraceCheckUtils]: 44: Hoare triple {2416#true} assume !(0 == ~cond); {2416#true} is VALID [2022-02-20 17:16:36,302 INFO L290 TraceCheckUtils]: 43: Hoare triple {2416#true} ~cond := #in~cond; {2416#true} is VALID [2022-02-20 17:16:36,302 INFO L272 TraceCheckUtils]: 42: Hoare triple {2631#(= (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) (* (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~x~0#1|)} call __VERIFIER_assert((if main_~r~0#1 >= 0 then 1 else 0)); {2416#true} is VALID [2022-02-20 17:16:36,303 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2416#true} {2631#(= (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) (* (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~x~0#1|)} #87#return; {2631#(= (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) (* (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 17:16:36,303 INFO L290 TraceCheckUtils]: 40: Hoare triple {2416#true} assume true; {2416#true} is VALID [2022-02-20 17:16:36,303 INFO L290 TraceCheckUtils]: 39: Hoare triple {2416#true} assume !(0 == ~cond); {2416#true} is VALID [2022-02-20 17:16:36,303 INFO L290 TraceCheckUtils]: 38: Hoare triple {2416#true} ~cond := #in~cond; {2416#true} is VALID [2022-02-20 17:16:36,303 INFO L272 TraceCheckUtils]: 37: Hoare triple {2631#(= (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) (* (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~x~0#1|)} call __VERIFIER_assert((if main_~x~0#1 == main_~q~0#1 * main_~y~0#1 + main_~r~0#1 then 1 else 0)); {2416#true} is VALID [2022-02-20 17:16:36,304 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2416#true} {2631#(= (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) (* (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~x~0#1|)} #85#return; {2631#(= (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) (* (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 17:16:36,304 INFO L290 TraceCheckUtils]: 35: Hoare triple {2416#true} assume true; {2416#true} is VALID [2022-02-20 17:16:36,304 INFO L290 TraceCheckUtils]: 34: Hoare triple {2416#true} assume !(0 == ~cond); {2416#true} is VALID [2022-02-20 17:16:36,304 INFO L290 TraceCheckUtils]: 33: Hoare triple {2416#true} ~cond := #in~cond; {2416#true} is VALID [2022-02-20 17:16:36,304 INFO L272 TraceCheckUtils]: 32: Hoare triple {2631#(= (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) (* (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~x~0#1|)} call __VERIFIER_assert((if main_~b~0#1 == main_~y~0#1 * main_~a~0#1 then 1 else 0)); {2416#true} is VALID [2022-02-20 17:16:36,305 INFO L290 TraceCheckUtils]: 31: Hoare triple {2631#(= (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) (* (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~x~0#1|)} assume !false; {2631#(= (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) (* (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 17:16:36,305 INFO L290 TraceCheckUtils]: 30: Hoare triple {2609#(= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|)))} assume !!(main_~r~0#1 >= main_~y~0#1);main_~a~0#1 := 1;main_~b~0#1 := main_~y~0#1; {2631#(= (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) (* (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 17:16:36,306 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2416#true} {2609#(= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|)))} #83#return; {2609#(= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:16:36,306 INFO L290 TraceCheckUtils]: 28: Hoare triple {2416#true} assume true; {2416#true} is VALID [2022-02-20 17:16:36,306 INFO L290 TraceCheckUtils]: 27: Hoare triple {2416#true} assume !(0 == ~cond); {2416#true} is VALID [2022-02-20 17:16:36,306 INFO L290 TraceCheckUtils]: 26: Hoare triple {2416#true} ~cond := #in~cond; {2416#true} is VALID [2022-02-20 17:16:36,306 INFO L272 TraceCheckUtils]: 25: Hoare triple {2609#(= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|)))} call __VERIFIER_assert((if main_~x~0#1 == main_~q~0#1 * main_~y~0#1 + main_~r~0#1 then 1 else 0)); {2416#true} is VALID [2022-02-20 17:16:36,306 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2416#true} {2609#(= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|)))} #81#return; {2609#(= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:16:36,307 INFO L290 TraceCheckUtils]: 23: Hoare triple {2416#true} assume true; {2416#true} is VALID [2022-02-20 17:16:36,307 INFO L290 TraceCheckUtils]: 22: Hoare triple {2416#true} assume !(0 == ~cond); {2416#true} is VALID [2022-02-20 17:16:36,307 INFO L290 TraceCheckUtils]: 21: Hoare triple {2416#true} ~cond := #in~cond; {2416#true} is VALID [2022-02-20 17:16:36,307 INFO L272 TraceCheckUtils]: 20: Hoare triple {2609#(= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|)))} call __VERIFIER_assert((if main_~b~0#1 == main_~y~0#1 * main_~a~0#1 then 1 else 0)); {2416#true} is VALID [2022-02-20 17:16:36,307 INFO L290 TraceCheckUtils]: 19: Hoare triple {2609#(= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|)))} assume !false; {2609#(= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:16:36,308 INFO L290 TraceCheckUtils]: 18: Hoare triple {2416#true} main_~q~0#1 := 0;main_~r~0#1 := main_~x~0#1;main_~a~0#1 := 0;main_~b~0#1 := 0; {2609#(= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:16:36,308 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2416#true} {2416#true} #79#return; {2416#true} is VALID [2022-02-20 17:16:36,308 INFO L290 TraceCheckUtils]: 16: Hoare triple {2416#true} assume true; {2416#true} is VALID [2022-02-20 17:16:36,308 INFO L290 TraceCheckUtils]: 15: Hoare triple {2416#true} assume !(0 == ~cond); {2416#true} is VALID [2022-02-20 17:16:36,308 INFO L290 TraceCheckUtils]: 14: Hoare triple {2416#true} ~cond := #in~cond; {2416#true} is VALID [2022-02-20 17:16:36,308 INFO L272 TraceCheckUtils]: 13: Hoare triple {2416#true} call assume_abort_if_not((if main_~y~0#1 >= 1 then 1 else 0)); {2416#true} is VALID [2022-02-20 17:16:36,308 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2416#true} {2416#true} #77#return; {2416#true} is VALID [2022-02-20 17:16:36,308 INFO L290 TraceCheckUtils]: 11: Hoare triple {2416#true} assume true; {2416#true} is VALID [2022-02-20 17:16:36,309 INFO L290 TraceCheckUtils]: 10: Hoare triple {2416#true} assume !(0 == ~cond); {2416#true} is VALID [2022-02-20 17:16:36,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {2416#true} ~cond := #in~cond; {2416#true} is VALID [2022-02-20 17:16:36,309 INFO L272 TraceCheckUtils]: 8: Hoare triple {2416#true} call assume_abort_if_not((if main_~y~0#1 >= 0 && main_~y~0#1 <= 2 then 1 else 0)); {2416#true} is VALID [2022-02-20 17:16:36,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {2416#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2416#true} is VALID [2022-02-20 17:16:36,309 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2416#true} {2416#true} #75#return; {2416#true} is VALID [2022-02-20 17:16:36,309 INFO L290 TraceCheckUtils]: 5: Hoare triple {2416#true} assume true; {2416#true} is VALID [2022-02-20 17:16:36,309 INFO L290 TraceCheckUtils]: 4: Hoare triple {2416#true} assume !(0 == ~cond); {2416#true} is VALID [2022-02-20 17:16:36,309 INFO L290 TraceCheckUtils]: 3: Hoare triple {2416#true} ~cond := #in~cond; {2416#true} is VALID [2022-02-20 17:16:36,310 INFO L272 TraceCheckUtils]: 2: Hoare triple {2416#true} call assume_abort_if_not((if main_~x~0#1 >= 0 && main_~x~0#1 <= 2 then 1 else 0)); {2416#true} is VALID [2022-02-20 17:16:36,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {2416#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~x~0#1, main_~y~0#1, main_~q~0#1, main_~r~0#1, main_~a~0#1, main_~b~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~a~0#1;havoc main_~b~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {2416#true} is VALID [2022-02-20 17:16:36,310 INFO L290 TraceCheckUtils]: 0: Hoare triple {2416#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(14, 2);call #Ultimate.allocInit(12, 3); {2416#true} is VALID [2022-02-20 17:16:36,310 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-02-20 17:16:36,310 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:16:36,310 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697432703] [2022-02-20 17:16:36,311 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:16:36,311 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366323552] [2022-02-20 17:16:36,311 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366323552] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 17:16:36,311 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:16:36,311 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2022-02-20 17:16:36,311 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160088365] [2022-02-20 17:16:36,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:16:36,312 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 59 [2022-02-20 17:16:36,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:16:36,312 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 17:16:36,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:16:36,344 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 17:16:36,344 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:16:36,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 17:16:36,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-02-20 17:16:36,344 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 17:16:36,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:36,678 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2022-02-20 17:16:36,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:16:36,678 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 59 [2022-02-20 17:16:36,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:16:36,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 17:16:36,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-02-20 17:16:36,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 17:16:36,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-02-20 17:16:36,680 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 42 transitions. [2022-02-20 17:16:36,722 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:16:36,722 INFO L225 Difference]: With dead ends: 61 [2022-02-20 17:16:36,722 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 17:16:36,722 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 107 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:16:36,723 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 12 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:16:36,723 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 105 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:16:36,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 17:16:36,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 17:16:36,723 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:16:36,724 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:16:36,724 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:16:36,724 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:16:36,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:36,724 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:16:36,724 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:16:36,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:36,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:36,724 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 17:16:36,724 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 17:16:36,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:36,724 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:16:36,724 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:16:36,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:36,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:36,725 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:16:36,725 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:16:36,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:16:36,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 17:16:36,725 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 59 [2022-02-20 17:16:36,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:16:36,725 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 17:16:36,725 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 17:16:36,725 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:16:36,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:36,727 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:16:36,745 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:16:36,936 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:16:36,938 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 17:16:37,543 INFO L858 garLoopResultBuilder]: For program point L64(line 64) no Hoare annotation was computed. [2022-02-20 17:16:37,543 INFO L858 garLoopResultBuilder]: For program point L31(line 31) no Hoare annotation was computed. [2022-02-20 17:16:37,543 INFO L861 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: true [2022-02-20 17:16:37,543 INFO L858 garLoopResultBuilder]: For program point L27-1(line 27) no Hoare annotation was computed. [2022-02-20 17:16:37,543 INFO L854 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (let ((.cse0 (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| .cse0)) (<= |ULTIMATE.start_main_~y~0#1| 2) (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= 1 |ULTIMATE.start_main_~r~0#1|) (= (+ |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~r~0#1| .cse0)))) [2022-02-20 17:16:37,543 INFO L854 garLoopResultBuilder]: At program point L48-1(line 48) the Hoare annotation is: (let ((.cse0 (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| .cse0)) (<= |ULTIMATE.start_main_~y~0#1| 2) (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= 1 |ULTIMATE.start_main_~r~0#1|) (= (+ |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~r~0#1| .cse0)))) [2022-02-20 17:16:37,544 INFO L858 garLoopResultBuilder]: For program point L40(lines 38 62) no Hoare annotation was computed. [2022-02-20 17:16:37,544 INFO L861 garLoopResultBuilder]: At program point L65(lines 22 66) the Hoare annotation is: true [2022-02-20 17:16:37,544 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 17:16:37,544 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 17:16:37,544 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 17:16:37,544 INFO L854 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (let ((.cse0 (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| .cse0)) (<= |ULTIMATE.start_main_~y~0#1| 2) (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= 1 |ULTIMATE.start_main_~r~0#1|) (= (+ |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~r~0#1| .cse0)))) [2022-02-20 17:16:37,544 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 17:16:37,544 INFO L861 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: true [2022-02-20 17:16:37,544 INFO L854 garLoopResultBuilder]: At program point L29-1(line 29) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~y~0#1| 2) (<= 0 |ULTIMATE.start_main_~y~0#1|)) [2022-02-20 17:16:37,544 INFO L858 garLoopResultBuilder]: For program point L50(lines 47 59) no Hoare annotation was computed. [2022-02-20 17:16:37,544 INFO L854 garLoopResultBuilder]: At program point L38-2(lines 38 62) the Hoare annotation is: (let ((.cse0 (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| .cse0)) (<= |ULTIMATE.start_main_~y~0#1| 2) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= (+ |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~r~0#1| .cse0)))) [2022-02-20 17:16:37,544 INFO L854 garLoopResultBuilder]: At program point L38-3(lines 38 62) the Hoare annotation is: (let ((.cse1 (<= |ULTIMATE.start_main_~y~0#1| 2)) (.cse2 (<= 1 |ULTIMATE.start_main_~y~0#1|))) (or (let ((.cse0 (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| .cse0)) .cse1 .cse2 (= (+ |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~r~0#1| .cse0)))) (and .cse1 .cse2 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0)))) [2022-02-20 17:16:37,544 INFO L854 garLoopResultBuilder]: At program point L55(line 55) the Hoare annotation is: (let ((.cse1 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse0 (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| .cse0)) (<= |ULTIMATE.start_main_~y~0#1| 2) (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= 1 |ULTIMATE.start_main_~r~0#1|) (<= (* .cse1 2) |ULTIMATE.start_main_~r~0#1|) (= (+ |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|) (+ .cse1 |ULTIMATE.start_main_~r~0#1| .cse0)))) [2022-02-20 17:16:37,545 INFO L858 garLoopResultBuilder]: For program point L55-1(line 55) no Hoare annotation was computed. [2022-02-20 17:16:37,545 INFO L854 garLoopResultBuilder]: At program point L47-2(lines 47 59) the Hoare annotation is: (let ((.cse0 (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| .cse0)) (<= |ULTIMATE.start_main_~y~0#1| 2) (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= 1 |ULTIMATE.start_main_~r~0#1|) (= (+ |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~r~0#1| .cse0)))) [2022-02-20 17:16:37,545 INFO L858 garLoopResultBuilder]: For program point L47-3(lines 47 59) no Hoare annotation was computed. [2022-02-20 17:16:37,545 INFO L854 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (let ((.cse0 (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| .cse0)) (<= |ULTIMATE.start_main_~y~0#1| 2) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= (+ |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~r~0#1| .cse0)))) [2022-02-20 17:16:37,545 INFO L854 garLoopResultBuilder]: At program point L39-1(line 39) the Hoare annotation is: (let ((.cse0 (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| .cse0)) (<= |ULTIMATE.start_main_~y~0#1| 2) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= (+ |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~r~0#1| .cse0)))) [2022-02-20 17:16:37,545 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 11 13) the Hoare annotation is: true [2022-02-20 17:16:37,545 INFO L858 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2022-02-20 17:16:37,545 INFO L858 garLoopResultBuilder]: For program point L12-2(lines 11 13) no Hoare annotation was computed. [2022-02-20 17:16:37,545 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 11 13) no Hoare annotation was computed. [2022-02-20 17:16:37,545 INFO L858 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2022-02-20 17:16:37,545 INFO L858 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2022-02-20 17:16:37,545 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-02-20 17:16:37,545 INFO L858 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2022-02-20 17:16:37,545 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2022-02-20 17:16:37,545 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2022-02-20 17:16:37,548 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:16:37,549 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:16:37,551 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 17:16:37,551 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-02-20 17:16:37,551 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-02-20 17:16:37,551 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 17:16:37,551 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-02-20 17:16:37,551 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-02-20 17:16:37,551 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-02-20 17:16:37,551 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-02-20 17:16:37,551 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 17:16:37,551 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-02-20 17:16:37,551 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-02-20 17:16:37,551 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-02-20 17:16:37,551 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-02-20 17:16:37,551 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 17:16:37,551 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-02-20 17:16:37,551 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-02-20 17:16:37,551 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-02-20 17:16:37,551 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:16:37,551 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:16:37,551 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:16:37,552 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:16:37,552 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:16:37,552 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:16:37,552 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:16:37,552 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-02-20 17:16:37,552 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-02-20 17:16:37,552 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 17:16:37,552 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 17:16:37,552 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 17:16:37,552 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-02-20 17:16:37,552 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-02-20 17:16:37,552 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-02-20 17:16:37,552 WARN L170 areAnnotationChecker]: L55-1 has no Hoare annotation [2022-02-20 17:16:37,552 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2022-02-20 17:16:37,564 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2022-02-20 17:16:37,564 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2022-02-20 17:16:37,564 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2022-02-20 17:16:37,566 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2022-02-20 17:16:37,566 WARN L170 areAnnotationChecker]: L55-1 has no Hoare annotation [2022-02-20 17:16:37,566 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:16:37,566 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:16:37,566 INFO L163 areAnnotationChecker]: CFG has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 17:16:37,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 05:16:37 BoogieIcfgContainer [2022-02-20 17:16:37,573 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 17:16:37,574 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 17:16:37,574 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 17:16:37,574 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 17:16:37,574 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:16:22" (3/4) ... [2022-02-20 17:16:37,576 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 17:16:37,579 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-02-20 17:16:37,580 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-02-20 17:16:37,582 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-02-20 17:16:37,582 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 17:16:37,582 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 17:16:37,582 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 17:16:37,607 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 17:16:37,607 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 17:16:37,608 INFO L158 Benchmark]: Toolchain (without parser) took 16119.93ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 63.1MB in the beginning and 46.9MB in the end (delta: 16.2MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. [2022-02-20 17:16:37,608 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory was 70.2MB in the beginning and 70.1MB in the end (delta: 30.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:16:37,608 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.53ms. Allocated memory is still 96.5MB. Free memory was 62.9MB in the beginning and 72.1MB in the end (delta: -9.3MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2022-02-20 17:16:37,608 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.13ms. Allocated memory is still 96.5MB. Free memory was 72.1MB in the beginning and 70.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:16:37,609 INFO L158 Benchmark]: Boogie Preprocessor took 31.20ms. Allocated memory is still 96.5MB. Free memory was 70.5MB in the beginning and 69.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:16:37,609 INFO L158 Benchmark]: RCFGBuilder took 253.87ms. Allocated memory is still 96.5MB. Free memory was 69.3MB in the beginning and 58.0MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 17:16:37,609 INFO L158 Benchmark]: TraceAbstraction took 15522.90ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 57.5MB in the beginning and 49.0MB in the end (delta: 8.5MB). Peak memory consumption was 28.4MB. Max. memory is 16.1GB. [2022-02-20 17:16:37,609 INFO L158 Benchmark]: Witness Printer took 33.47ms. Allocated memory is still 117.4MB. Free memory was 49.0MB in the beginning and 46.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:16:37,611 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory was 70.2MB in the beginning and 70.1MB in the end (delta: 30.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 241.53ms. Allocated memory is still 96.5MB. Free memory was 62.9MB in the beginning and 72.1MB in the end (delta: -9.3MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.13ms. Allocated memory is still 96.5MB. Free memory was 72.1MB in the beginning and 70.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.20ms. Allocated memory is still 96.5MB. Free memory was 70.5MB in the beginning and 69.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 253.87ms. Allocated memory is still 96.5MB. Free memory was 69.3MB in the beginning and 58.0MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 15522.90ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 57.5MB in the beginning and 49.0MB in the end (delta: 8.5MB). Peak memory consumption was 28.4MB. Max. memory is 16.1GB. * Witness Printer took 33.47ms. Allocated memory is still 117.4MB. Free memory was 49.0MB in the beginning and 46.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.5s, OverallIterations: 7, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 119 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 97 mSDsluCounter, 871 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 647 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 376 IncrementalHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 224 mSDtfsCounter, 376 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 407 GetRequests, 351 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=6, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 39 PreInvPairs, 60 NumberOfFragments, 282 HoareAnnotationTreeSize, 39 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 15 FomulaSimplificationsInter, 383 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 10.6s InterpolantComputationTime, 270 NumberOfCodeBlocks, 270 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 407 ConstructedInterpolants, 0 QuantifiedInterpolants, 941 SizeOfPredicates, 22 NumberOfNonLiveVariables, 649 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 400/420 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: (((x == r + q * y && y <= 2) && 1 <= y) && 1 <= r) && b + x == a * y + r + q * y - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: ((x == r + q * y && y <= 2) && 1 <= y) && b + x == a * y + r + q * y - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-02-20 17:16:37,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE