./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench/bresenham-ll.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/bresenham-ll.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 68505a1040934ea3cdccf61a3fb1a3debf8c6c64330c175637d96b2737c92d5f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:10:38,571 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:10:38,572 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:10:38,591 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:10:38,591 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:10:38,592 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:10:38,593 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:10:38,594 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:10:38,595 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:10:38,596 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:10:38,597 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:10:38,598 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:10:38,598 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:10:38,599 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:10:38,599 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:10:38,600 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:10:38,601 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:10:38,601 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:10:38,603 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:10:38,604 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:10:38,605 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:10:38,606 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:10:38,606 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:10:38,607 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:10:38,609 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:10:38,609 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:10:38,609 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:10:38,610 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:10:38,610 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:10:38,611 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:10:38,611 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:10:38,612 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:10:38,612 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:10:38,613 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:10:38,614 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:10:38,614 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:10:38,614 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:10:38,614 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:10:38,615 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:10:38,615 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:10:38,616 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:10:38,616 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:10:38,631 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:10:38,631 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:10:38,631 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:10:38,631 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:10:38,632 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:10:38,632 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:10:38,633 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:10:38,633 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:10:38,633 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:10:38,633 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:10:38,633 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:10:38,634 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:10:38,634 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:10:38,634 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:10:38,634 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:10:38,634 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:10:38,634 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:10:38,635 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:10:38,635 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:10:38,635 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:10:38,635 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:10:38,635 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:10:38,635 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:10:38,636 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:10:38,636 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:10:38,636 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:10:38,636 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:10:38,636 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:10:38,636 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:10:38,636 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:10:38,637 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:10:38,637 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:10:38,637 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:10:38,637 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 -> 68505a1040934ea3cdccf61a3fb1a3debf8c6c64330c175637d96b2737c92d5f [2022-02-20 17:10:38,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:10:38,842 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:10:38,843 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:10:38,844 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:10:38,855 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:10:38,856 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench/bresenham-ll.c [2022-02-20 17:10:38,912 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edcd5a43a/17d0cf7a554c4c5ab2436b42b593deec/FLAG3bac6dd0b [2022-02-20 17:10:39,274 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:10:39,275 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench/bresenham-ll.c [2022-02-20 17:10:39,278 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edcd5a43a/17d0cf7a554c4c5ab2436b42b593deec/FLAG3bac6dd0b [2022-02-20 17:10:39,288 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edcd5a43a/17d0cf7a554c4c5ab2436b42b593deec [2022-02-20 17:10:39,289 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:10:39,290 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:10:39,291 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:10:39,291 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:10:39,293 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:10:39,294 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:10:39" (1/1) ... [2022-02-20 17:10:39,295 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1adbebd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:10:39, skipping insertion in model container [2022-02-20 17:10:39,295 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:10:39" (1/1) ... [2022-02-20 17:10:39,299 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:10:39,307 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:10:39,420 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/bresenham-ll.c[597,610] [2022-02-20 17:10:39,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:10:39,446 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:10:39,454 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/bresenham-ll.c[597,610] [2022-02-20 17:10:39,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:10:39,467 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:10:39,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:10:39 WrapperNode [2022-02-20 17:10:39,467 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:10:39,468 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:10:39,468 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:10:39,469 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:10:39,473 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:10:39" (1/1) ... [2022-02-20 17:10:39,478 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:10:39" (1/1) ... [2022-02-20 17:10:39,493 INFO L137 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 49 [2022-02-20 17:10:39,494 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:10:39,495 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:10:39,495 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:10:39,495 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:10:39,500 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:10:39" (1/1) ... [2022-02-20 17:10:39,500 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:10:39" (1/1) ... [2022-02-20 17:10:39,507 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:10:39" (1/1) ... [2022-02-20 17:10:39,508 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:10:39" (1/1) ... [2022-02-20 17:10:39,510 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:10:39" (1/1) ... [2022-02-20 17:10:39,512 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:10:39" (1/1) ... [2022-02-20 17:10:39,513 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:10:39" (1/1) ... [2022-02-20 17:10:39,514 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:10:39,514 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:10:39,514 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:10:39,514 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:10:39,520 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:10:39" (1/1) ... [2022-02-20 17:10:39,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:10:39,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:10:39,543 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:10:39,551 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:10:39,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:10:39,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:10:39,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:10:39,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:10:39,568 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:10:39,568 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:10:39,605 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:10:39,607 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:10:39,722 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:10:39,727 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:10:39,727 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:10:39,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:10:39 BoogieIcfgContainer [2022-02-20 17:10:39,728 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:10:39,729 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:10:39,729 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:10:39,741 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:10:39,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:10:39" (1/3) ... [2022-02-20 17:10:39,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6955c38d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:10:39, skipping insertion in model container [2022-02-20 17:10:39,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:10:39" (2/3) ... [2022-02-20 17:10:39,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6955c38d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:10:39, skipping insertion in model container [2022-02-20 17:10:39,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:10:39" (3/3) ... [2022-02-20 17:10:39,743 INFO L111 eAbstractionObserver]: Analyzing ICFG bresenham-ll.c [2022-02-20 17:10:39,747 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:10:39,747 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:10:39,775 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:10:39,779 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:10:39,780 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:10:39,794 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:10:39,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 17:10:39,797 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:10:39,798 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:10:39,798 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:10:39,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:10:39,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1811601823, now seen corresponding path program 1 times [2022-02-20 17:10:39,826 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:10:39,826 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878267715] [2022-02-20 17:10:39,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:10:39,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:10:39,896 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:10:39,896 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [82006856] [2022-02-20 17:10:39,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:10:39,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:10:39,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:10:39,898 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:10:39,899 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:10:39,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:10:39,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 17:10:39,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:10:39,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:10:40,191 INFO L290 TraceCheckUtils]: 0: Hoare triple {22#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(15, 2);call #Ultimate.allocInit(12, 3); {22#true} is VALID [2022-02-20 17:10:40,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#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_#t~post6#1, main_#t~post7#1, main_~X~0#1, main_~Y~0#1, main_~x~0#1, main_~y~0#1, main_~v~0#1, main_~xy~0#1, main_~yx~0#1;havoc main_~X~0#1;havoc main_~Y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~v~0#1;havoc main_~xy~0#1;havoc main_~yx~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;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~Y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~v~0#1 := 2 * main_~Y~0#1 - main_~X~0#1;main_~y~0#1 := 0;main_~x~0#1 := 0; {30#(and (= (+ (* (- 1) |ULTIMATE.start_main_~X~0#1|) (* 2 |ULTIMATE.start_main_~Y~0#1|)) |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:10:40,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {30#(and (= (+ (* (- 1) |ULTIMATE.start_main_~X~0#1|) (* 2 |ULTIMATE.start_main_~Y~0#1|)) |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !false;main_~yx~0#1 := main_~Y~0#1 * main_~x~0#1;main_~xy~0#1 := main_~X~0#1 * main_~y~0#1; {34#(and (= |ULTIMATE.start_main_~xy~0#1| 0) (= (+ (* (- 1) |ULTIMATE.start_main_~X~0#1|) (* 2 |ULTIMATE.start_main_~Y~0#1|)) |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~yx~0#1| 0))} is VALID [2022-02-20 17:10:40,195 INFO L272 TraceCheckUtils]: 3: Hoare triple {34#(and (= |ULTIMATE.start_main_~xy~0#1| 0) (= (+ (* (- 1) |ULTIMATE.start_main_~X~0#1|) (* 2 |ULTIMATE.start_main_~Y~0#1|)) |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~yx~0#1| 0))} call __VERIFIER_assert((if 0 == 2 * main_~yx~0#1 - 2 * main_~xy~0#1 - main_~X~0#1 + 2 * main_~Y~0#1 - main_~v~0#1 then 1 else 0)); {38#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:10:40,196 INFO L290 TraceCheckUtils]: 4: Hoare triple {38#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {42#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:10:40,196 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {23#false} is VALID [2022-02-20 17:10:40,196 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#false} assume !false; {23#false} is VALID [2022-02-20 17:10:40,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:10:40,197 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:10:40,198 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:10:40,198 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878267715] [2022-02-20 17:10:40,198 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:10:40,198 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82006856] [2022-02-20 17:10:40,199 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82006856] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:10:40,199 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:10:40,199 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 17:10:40,201 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348551872] [2022-02-20 17:10:40,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:10:40,204 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 17:10:40,205 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:10:40,207 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:40,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:10:40,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 17:10:40,216 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:10:40,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 17:10:40,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:10:40,231 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:40,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:40,425 INFO L93 Difference]: Finished difference Result 50 states and 69 transitions. [2022-02-20 17:10:40,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:10:40,426 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 17:10:40,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:10:40,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:40,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-02-20 17:10:40,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:40,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-02-20 17:10:40,434 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 69 transitions. [2022-02-20 17:10:40,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:10:40,494 INFO L225 Difference]: With dead ends: 50 [2022-02-20 17:10:40,495 INFO L226 Difference]: Without dead ends: 23 [2022-02-20 17:10:40,497 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:10:40,499 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 16 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:10:40,500 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 60 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:10:40,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-20 17:10:40,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-02-20 17:10:40,520 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:10:40,521 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 22 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:10:40,521 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 22 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:10:40,521 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 22 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:10:40,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:40,524 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-02-20 17:10:40,524 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-02-20 17:10:40,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:10:40,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:10:40,525 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-02-20 17:10:40,526 INFO L87 Difference]: Start difference. First operand has 22 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-02-20 17:10:40,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:40,534 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-02-20 17:10:40,534 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-02-20 17:10:40,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:10:40,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:10:40,535 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:10:40,535 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:10:40,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:10:40,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-02-20 17:10:40,540 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 7 [2022-02-20 17:10:40,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:10:40,541 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-02-20 17:10:40,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:40,542 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-02-20 17:10:40,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 17:10:40,543 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:10:40,543 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:10:40,569 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:10:40,769 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-02-20 17:10:40,769 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:10:40,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:10:40,770 INFO L85 PathProgramCache]: Analyzing trace with hash -343010020, now seen corresponding path program 1 times [2022-02-20 17:10:40,770 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:10:40,770 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590018351] [2022-02-20 17:10:40,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:10:40,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:10:40,783 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:10:40,783 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [117513210] [2022-02-20 17:10:40,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:10:40,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:10:40,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:10:40,788 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:10:40,789 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:10:40,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:10:40,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-20 17:10:40,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:10:40,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:10:41,045 INFO L290 TraceCheckUtils]: 0: Hoare triple {192#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(15, 2);call #Ultimate.allocInit(12, 3); {192#true} is VALID [2022-02-20 17:10:41,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {192#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_#t~post6#1, main_#t~post7#1, main_~X~0#1, main_~Y~0#1, main_~x~0#1, main_~y~0#1, main_~v~0#1, main_~xy~0#1, main_~yx~0#1;havoc main_~X~0#1;havoc main_~Y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~v~0#1;havoc main_~xy~0#1;havoc main_~yx~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;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~Y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~v~0#1 := 2 * main_~Y~0#1 - main_~X~0#1;main_~y~0#1 := 0;main_~x~0#1 := 0; {200#(and (= (+ (* (- 1) |ULTIMATE.start_main_~X~0#1|) (* 2 |ULTIMATE.start_main_~Y~0#1|)) |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:10:41,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {200#(and (= (+ (* (- 1) |ULTIMATE.start_main_~X~0#1|) (* 2 |ULTIMATE.start_main_~Y~0#1|)) |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !false;main_~yx~0#1 := main_~Y~0#1 * main_~x~0#1;main_~xy~0#1 := main_~X~0#1 * main_~y~0#1; {200#(and (= (+ (* (- 1) |ULTIMATE.start_main_~X~0#1|) (* 2 |ULTIMATE.start_main_~Y~0#1|)) |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:10:41,047 INFO L272 TraceCheckUtils]: 3: Hoare triple {200#(and (= (+ (* (- 1) |ULTIMATE.start_main_~X~0#1|) (* 2 |ULTIMATE.start_main_~Y~0#1|)) |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if 0 == 2 * main_~yx~0#1 - 2 * main_~xy~0#1 - main_~X~0#1 + 2 * main_~Y~0#1 - main_~v~0#1 then 1 else 0)); {192#true} is VALID [2022-02-20 17:10:41,048 INFO L290 TraceCheckUtils]: 4: Hoare triple {192#true} ~cond := #in~cond; {192#true} is VALID [2022-02-20 17:10:41,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {192#true} assume !(0 == ~cond); {192#true} is VALID [2022-02-20 17:10:41,048 INFO L290 TraceCheckUtils]: 6: Hoare triple {192#true} assume true; {192#true} is VALID [2022-02-20 17:10:41,050 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {192#true} {200#(and (= (+ (* (- 1) |ULTIMATE.start_main_~X~0#1|) (* 2 |ULTIMATE.start_main_~Y~0#1|)) |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} #46#return; {200#(and (= (+ (* (- 1) |ULTIMATE.start_main_~X~0#1|) (* 2 |ULTIMATE.start_main_~Y~0#1|)) |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:10:41,050 INFO L290 TraceCheckUtils]: 8: Hoare triple {200#(and (= (+ (* (- 1) |ULTIMATE.start_main_~X~0#1|) (* 2 |ULTIMATE.start_main_~Y~0#1|)) |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(main_~x~0#1 <= main_~X~0#1); {200#(and (= (+ (* (- 1) |ULTIMATE.start_main_~X~0#1|) (* 2 |ULTIMATE.start_main_~Y~0#1|)) |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:10:41,051 INFO L290 TraceCheckUtils]: 9: Hoare triple {200#(and (= (+ (* (- 1) |ULTIMATE.start_main_~X~0#1|) (* 2 |ULTIMATE.start_main_~Y~0#1|)) |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume main_~v~0#1 < 0;main_~v~0#1 := main_~v~0#1 + 2 * main_~Y~0#1; {225#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= (+ (* |ULTIMATE.start_main_~Y~0#1| 4) (* (- 1) |ULTIMATE.start_main_~X~0#1|)) |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:10:41,052 INFO L290 TraceCheckUtils]: 10: Hoare triple {225#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= (+ (* |ULTIMATE.start_main_~Y~0#1| 4) (* (- 1) |ULTIMATE.start_main_~X~0#1|)) |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~x~0#1| 0))} main_#t~post7#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {229#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 0) (= (+ (* |ULTIMATE.start_main_~Y~0#1| 4) (* (- 1) |ULTIMATE.start_main_~X~0#1|)) |ULTIMATE.start_main_~v~0#1|))} is VALID [2022-02-20 17:10:41,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {229#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 0) (= (+ (* |ULTIMATE.start_main_~Y~0#1| 4) (* (- 1) |ULTIMATE.start_main_~X~0#1|)) |ULTIMATE.start_main_~v~0#1|))} assume !false;main_~yx~0#1 := main_~Y~0#1 * main_~x~0#1;main_~xy~0#1 := main_~X~0#1 * main_~y~0#1; {233#(and (= |ULTIMATE.start_main_~yx~0#1| |ULTIMATE.start_main_~Y~0#1|) (= |ULTIMATE.start_main_~xy~0#1| 0) (= (+ (* |ULTIMATE.start_main_~Y~0#1| 4) (* (- 1) |ULTIMATE.start_main_~X~0#1|)) |ULTIMATE.start_main_~v~0#1|))} is VALID [2022-02-20 17:10:41,054 INFO L272 TraceCheckUtils]: 12: Hoare triple {233#(and (= |ULTIMATE.start_main_~yx~0#1| |ULTIMATE.start_main_~Y~0#1|) (= |ULTIMATE.start_main_~xy~0#1| 0) (= (+ (* |ULTIMATE.start_main_~Y~0#1| 4) (* (- 1) |ULTIMATE.start_main_~X~0#1|)) |ULTIMATE.start_main_~v~0#1|))} call __VERIFIER_assert((if 0 == 2 * main_~yx~0#1 - 2 * main_~xy~0#1 - main_~X~0#1 + 2 * main_~Y~0#1 - main_~v~0#1 then 1 else 0)); {237#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:10:41,055 INFO L290 TraceCheckUtils]: 13: Hoare triple {237#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {241#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:10:41,055 INFO L290 TraceCheckUtils]: 14: Hoare triple {241#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {193#false} is VALID [2022-02-20 17:10:41,055 INFO L290 TraceCheckUtils]: 15: Hoare triple {193#false} assume !false; {193#false} is VALID [2022-02-20 17:10:41,056 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:10:41,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:10:41,205 INFO L290 TraceCheckUtils]: 15: Hoare triple {193#false} assume !false; {193#false} is VALID [2022-02-20 17:10:41,206 INFO L290 TraceCheckUtils]: 14: Hoare triple {241#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {193#false} is VALID [2022-02-20 17:10:41,207 INFO L290 TraceCheckUtils]: 13: Hoare triple {237#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {241#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:10:41,208 INFO L272 TraceCheckUtils]: 12: Hoare triple {257#(= (+ |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1| (* 2 |ULTIMATE.start_main_~xy~0#1|)) (+ (* 2 |ULTIMATE.start_main_~yx~0#1|) (* 2 |ULTIMATE.start_main_~Y~0#1|)))} call __VERIFIER_assert((if 0 == 2 * main_~yx~0#1 - 2 * main_~xy~0#1 - main_~X~0#1 + 2 * main_~Y~0#1 - main_~v~0#1 then 1 else 0)); {237#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:10:41,208 INFO L290 TraceCheckUtils]: 11: Hoare triple {261#(= (+ (* (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1|) (+ (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|)))} assume !false;main_~yx~0#1 := main_~Y~0#1 * main_~x~0#1;main_~xy~0#1 := main_~X~0#1 * main_~y~0#1; {257#(= (+ |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1| (* 2 |ULTIMATE.start_main_~xy~0#1|)) (+ (* 2 |ULTIMATE.start_main_~yx~0#1|) (* 2 |ULTIMATE.start_main_~Y~0#1|)))} is VALID [2022-02-20 17:10:41,253 INFO L290 TraceCheckUtils]: 10: Hoare triple {265#(= (+ (* (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1|) (+ (* 2 (* |ULTIMATE.start_main_~Y~0#1| (+ |ULTIMATE.start_main_~x~0#1| 1))) (* 2 |ULTIMATE.start_main_~Y~0#1|)))} main_#t~post7#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {261#(= (+ (* (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1|) (+ (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|)))} is VALID [2022-02-20 17:10:41,254 INFO L290 TraceCheckUtils]: 9: Hoare triple {261#(= (+ (* (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1|) (+ (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|)))} assume main_~v~0#1 < 0;main_~v~0#1 := main_~v~0#1 + 2 * main_~Y~0#1; {265#(= (+ (* (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1|) (+ (* 2 (* |ULTIMATE.start_main_~Y~0#1| (+ |ULTIMATE.start_main_~x~0#1| 1))) (* 2 |ULTIMATE.start_main_~Y~0#1|)))} is VALID [2022-02-20 17:10:41,255 INFO L290 TraceCheckUtils]: 8: Hoare triple {261#(= (+ (* (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1|) (+ (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|)))} assume !!(main_~x~0#1 <= main_~X~0#1); {261#(= (+ (* (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1|) (+ (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|)))} is VALID [2022-02-20 17:10:41,256 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {192#true} {261#(= (+ (* (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1|) (+ (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|)))} #46#return; {261#(= (+ (* (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1|) (+ (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|)))} is VALID [2022-02-20 17:10:41,256 INFO L290 TraceCheckUtils]: 6: Hoare triple {192#true} assume true; {192#true} is VALID [2022-02-20 17:10:41,256 INFO L290 TraceCheckUtils]: 5: Hoare triple {192#true} assume !(0 == ~cond); {192#true} is VALID [2022-02-20 17:10:41,257 INFO L290 TraceCheckUtils]: 4: Hoare triple {192#true} ~cond := #in~cond; {192#true} is VALID [2022-02-20 17:10:41,257 INFO L272 TraceCheckUtils]: 3: Hoare triple {261#(= (+ (* (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1|) (+ (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|)))} call __VERIFIER_assert((if 0 == 2 * main_~yx~0#1 - 2 * main_~xy~0#1 - main_~X~0#1 + 2 * main_~Y~0#1 - main_~v~0#1 then 1 else 0)); {192#true} is VALID [2022-02-20 17:10:41,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {261#(= (+ (* (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1|) (+ (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|)))} assume !false;main_~yx~0#1 := main_~Y~0#1 * main_~x~0#1;main_~xy~0#1 := main_~X~0#1 * main_~y~0#1; {261#(= (+ (* (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1|) (+ (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|)))} is VALID [2022-02-20 17:10:41,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {192#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_#t~post6#1, main_#t~post7#1, main_~X~0#1, main_~Y~0#1, main_~x~0#1, main_~y~0#1, main_~v~0#1, main_~xy~0#1, main_~yx~0#1;havoc main_~X~0#1;havoc main_~Y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~v~0#1;havoc main_~xy~0#1;havoc main_~yx~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;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~Y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~v~0#1 := 2 * main_~Y~0#1 - main_~X~0#1;main_~y~0#1 := 0;main_~x~0#1 := 0; {261#(= (+ (* (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1|) (+ (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|)))} is VALID [2022-02-20 17:10:41,258 INFO L290 TraceCheckUtils]: 0: Hoare triple {192#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(15, 2);call #Ultimate.allocInit(12, 3); {192#true} is VALID [2022-02-20 17:10:41,258 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 17:10:41,259 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:10:41,259 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590018351] [2022-02-20 17:10:41,259 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:10:41,259 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117513210] [2022-02-20 17:10:41,259 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117513210] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:10:41,259 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:10:41,260 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2022-02-20 17:10:41,260 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305791352] [2022-02-20 17:10:41,260 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:10:41,261 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-02-20 17:10:41,261 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:10:41,261 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:10:41,299 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:10:41,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 17:10:41,299 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:10:41,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 17:10:41,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:10:41,300 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:10:41,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:41,650 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-02-20 17:10:41,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 17:10:41,650 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-02-20 17:10:41,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:10:41,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:10:41,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 38 transitions. [2022-02-20 17:10:41,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:10:41,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 38 transitions. [2022-02-20 17:10:41,653 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 38 transitions. [2022-02-20 17:10:41,693 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:10:41,694 INFO L225 Difference]: With dead ends: 36 [2022-02-20 17:10:41,694 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 17:10:41,694 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-02-20 17:10:41,695 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 14 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:10:41,695 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 63 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:10:41,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 17:10:41,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2022-02-20 17:10:41,702 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:10:41,702 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 29 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:10:41,704 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 29 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:10:41,705 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 29 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:10:41,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:41,707 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-02-20 17:10:41,708 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-02-20 17:10:41,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:10:41,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:10:41,709 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 30 states. [2022-02-20 17:10:41,709 INFO L87 Difference]: Start difference. First operand has 29 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 30 states. [2022-02-20 17:10:41,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:41,712 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-02-20 17:10:41,712 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-02-20 17:10:41,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:10:41,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:10:41,713 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:10:41,713 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:10:41,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:10:41,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-02-20 17:10:41,719 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 16 [2022-02-20 17:10:41,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:10:41,719 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-02-20 17:10:41,720 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:10:41,720 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-02-20 17:10:41,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 17:10:41,720 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:10:41,721 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:10:41,741 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:10:41,931 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,SelfDestructingSolverStorable1 [2022-02-20 17:10:41,931 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:10:41,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:10:41,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1156539182, now seen corresponding path program 1 times [2022-02-20 17:10:41,932 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:10:41,932 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734104618] [2022-02-20 17:10:41,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:10:41,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:10:41,950 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:10:41,950 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1930590706] [2022-02-20 17:10:41,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:10:41,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:10:41,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:10:41,968 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:10:41,969 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:10:41,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:10:41,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 26 conjunts are in the unsatisfiable core [2022-02-20 17:10:42,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:10:42,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:10:42,405 INFO L290 TraceCheckUtils]: 0: Hoare triple {449#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(15, 2);call #Ultimate.allocInit(12, 3); {449#true} is VALID [2022-02-20 17:10:42,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {449#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_#t~post6#1, main_#t~post7#1, main_~X~0#1, main_~Y~0#1, main_~x~0#1, main_~y~0#1, main_~v~0#1, main_~xy~0#1, main_~yx~0#1;havoc main_~X~0#1;havoc main_~Y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~v~0#1;havoc main_~xy~0#1;havoc main_~yx~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;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~Y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~v~0#1 := 2 * main_~Y~0#1 - main_~X~0#1;main_~y~0#1 := 0;main_~x~0#1 := 0; {457#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:10:42,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {457#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !false;main_~yx~0#1 := main_~Y~0#1 * main_~x~0#1;main_~xy~0#1 := main_~X~0#1 * main_~y~0#1; {457#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:10:42,406 INFO L272 TraceCheckUtils]: 3: Hoare triple {457#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if 0 == 2 * main_~yx~0#1 - 2 * main_~xy~0#1 - main_~X~0#1 + 2 * main_~Y~0#1 - main_~v~0#1 then 1 else 0)); {449#true} is VALID [2022-02-20 17:10:42,407 INFO L290 TraceCheckUtils]: 4: Hoare triple {449#true} ~cond := #in~cond; {449#true} is VALID [2022-02-20 17:10:42,407 INFO L290 TraceCheckUtils]: 5: Hoare triple {449#true} assume !(0 == ~cond); {449#true} is VALID [2022-02-20 17:10:42,407 INFO L290 TraceCheckUtils]: 6: Hoare triple {449#true} assume true; {449#true} is VALID [2022-02-20 17:10:42,408 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {449#true} {457#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} #46#return; {457#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:10:42,408 INFO L290 TraceCheckUtils]: 8: Hoare triple {457#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(main_~x~0#1 <= main_~X~0#1); {479#(and (<= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~X~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:10:42,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {479#(and (<= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~X~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !(main_~v~0#1 < 0);main_~v~0#1 := main_~v~0#1 + 2 * (main_~Y~0#1 - main_~X~0#1);main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {483#(and (<= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~X~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:10:42,409 INFO L290 TraceCheckUtils]: 10: Hoare triple {483#(and (<= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~X~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0))} main_#t~post7#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {487#(and (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~X~0#1| 1)))} is VALID [2022-02-20 17:10:42,412 INFO L290 TraceCheckUtils]: 11: Hoare triple {487#(and (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~X~0#1| 1)))} assume !false;main_~yx~0#1 := main_~Y~0#1 * main_~x~0#1;main_~xy~0#1 := main_~X~0#1 * main_~y~0#1; {491#(and (= (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~xy~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~X~0#1| 1)) (= (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~yx~0#1|))} is VALID [2022-02-20 17:10:42,413 INFO L272 TraceCheckUtils]: 12: Hoare triple {491#(and (= (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~xy~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~X~0#1| 1)) (= (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~yx~0#1|))} call __VERIFIER_assert((if 0 == 2 * main_~yx~0#1 - 2 * main_~xy~0#1 - main_~X~0#1 + 2 * main_~Y~0#1 - main_~v~0#1 then 1 else 0)); {449#true} is VALID [2022-02-20 17:10:42,413 INFO L290 TraceCheckUtils]: 13: Hoare triple {449#true} ~cond := #in~cond; {498#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:10:42,413 INFO L290 TraceCheckUtils]: 14: Hoare triple {498#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {502#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:10:42,414 INFO L290 TraceCheckUtils]: 15: Hoare triple {502#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {502#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:10:42,415 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {502#(not (= |__VERIFIER_assert_#in~cond| 0))} {491#(and (= (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~xy~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~X~0#1| 1)) (= (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~yx~0#1|))} #46#return; {509#(and (= (+ (* (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1|) (+ (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|))) (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~X~0#1| 1)))} is VALID [2022-02-20 17:10:42,417 INFO L290 TraceCheckUtils]: 17: Hoare triple {509#(and (= (+ (* (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1|) (+ (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|))) (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~X~0#1| 1)))} assume !(main_~x~0#1 <= main_~X~0#1); {513#(and (= (+ (* (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1|) (+ (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|))) (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1) (not (<= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~X~0#1|)) (<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~X~0#1| 1)))} is VALID [2022-02-20 17:10:42,418 INFO L290 TraceCheckUtils]: 18: Hoare triple {513#(and (= (+ (* (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1|) (+ (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|))) (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1) (not (<= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~X~0#1|)) (<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~X~0#1| 1)))} main_~xy~0#1 := main_~x~0#1 * main_~y~0#1;main_~yx~0#1 := main_~Y~0#1 * main_~x~0#1; {517#(and (= |ULTIMATE.start_main_~yx~0#1| |ULTIMATE.start_main_~Y~0#1|) (= (+ (* (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1|) (* |ULTIMATE.start_main_~Y~0#1| 4)) (= |ULTIMATE.start_main_~y~0#1| 1) (not (<= 1 |ULTIMATE.start_main_~X~0#1|)) (<= 0 |ULTIMATE.start_main_~X~0#1|) (= |ULTIMATE.start_main_~xy~0#1| |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:10:42,419 INFO L272 TraceCheckUtils]: 19: Hoare triple {517#(and (= |ULTIMATE.start_main_~yx~0#1| |ULTIMATE.start_main_~Y~0#1|) (= (+ (* (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1|) (* |ULTIMATE.start_main_~Y~0#1| 4)) (= |ULTIMATE.start_main_~y~0#1| 1) (not (<= 1 |ULTIMATE.start_main_~X~0#1|)) (<= 0 |ULTIMATE.start_main_~X~0#1|) (= |ULTIMATE.start_main_~xy~0#1| |ULTIMATE.start_main_~y~0#1|))} call __VERIFIER_assert((if 0 == 2 * main_~yx~0#1 - 2 * main_~xy~0#1 - main_~X~0#1 + 2 * main_~Y~0#1 - main_~v~0#1 + 2 * main_~y~0#1 then 1 else 0)); {521#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:10:42,419 INFO L290 TraceCheckUtils]: 20: Hoare triple {521#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {525#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:10:42,420 INFO L290 TraceCheckUtils]: 21: Hoare triple {525#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {450#false} is VALID [2022-02-20 17:10:42,420 INFO L290 TraceCheckUtils]: 22: Hoare triple {450#false} assume !false; {450#false} is VALID [2022-02-20 17:10:42,420 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 17:10:42,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:10:43,044 INFO L290 TraceCheckUtils]: 22: Hoare triple {450#false} assume !false; {450#false} is VALID [2022-02-20 17:10:43,045 INFO L290 TraceCheckUtils]: 21: Hoare triple {525#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {450#false} is VALID [2022-02-20 17:10:43,045 INFO L290 TraceCheckUtils]: 20: Hoare triple {521#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {525#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:10:43,046 INFO L272 TraceCheckUtils]: 19: Hoare triple {541#(= (+ |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1| (* 2 |ULTIMATE.start_main_~xy~0#1|)) (+ (* 2 |ULTIMATE.start_main_~y~0#1|) (* 2 |ULTIMATE.start_main_~yx~0#1|) (* 2 |ULTIMATE.start_main_~Y~0#1|)))} call __VERIFIER_assert((if 0 == 2 * main_~yx~0#1 - 2 * main_~xy~0#1 - main_~X~0#1 + 2 * main_~Y~0#1 - main_~v~0#1 + 2 * main_~y~0#1 then 1 else 0)); {521#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:10:43,047 INFO L290 TraceCheckUtils]: 18: Hoare triple {545#(= (+ |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1| (* 2 (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* 2 |ULTIMATE.start_main_~y~0#1|) (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|)))} main_~xy~0#1 := main_~x~0#1 * main_~y~0#1;main_~yx~0#1 := main_~Y~0#1 * main_~x~0#1; {541#(= (+ |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1| (* 2 |ULTIMATE.start_main_~xy~0#1|)) (+ (* 2 |ULTIMATE.start_main_~y~0#1|) (* 2 |ULTIMATE.start_main_~yx~0#1|) (* 2 |ULTIMATE.start_main_~Y~0#1|)))} is VALID [2022-02-20 17:10:43,047 INFO L290 TraceCheckUtils]: 17: Hoare triple {549#(or (<= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~X~0#1|) (= (+ |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1| (* 2 (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* 2 |ULTIMATE.start_main_~y~0#1|) (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|))))} assume !(main_~x~0#1 <= main_~X~0#1); {545#(= (+ |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1| (* 2 (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* 2 |ULTIMATE.start_main_~y~0#1|) (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|)))} is VALID [2022-02-20 17:10:43,048 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {502#(not (= |__VERIFIER_assert_#in~cond| 0))} {553#(or (<= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~X~0#1|) (= (+ (* 2 |ULTIMATE.start_main_~yx~0#1|) (* 2 |ULTIMATE.start_main_~Y~0#1|) (* (- 2) |ULTIMATE.start_main_~xy~0#1|) (* 2 (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* 2 |ULTIMATE.start_main_~y~0#1|) (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|))))} #46#return; {549#(or (<= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~X~0#1|) (= (+ |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1| (* 2 (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* 2 |ULTIMATE.start_main_~y~0#1|) (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|))))} is VALID [2022-02-20 17:10:43,049 INFO L290 TraceCheckUtils]: 15: Hoare triple {502#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {502#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:10:43,049 INFO L290 TraceCheckUtils]: 14: Hoare triple {563#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {502#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:10:43,050 INFO L290 TraceCheckUtils]: 13: Hoare triple {449#true} ~cond := #in~cond; {563#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:10:43,050 INFO L272 TraceCheckUtils]: 12: Hoare triple {553#(or (<= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~X~0#1|) (= (+ (* 2 |ULTIMATE.start_main_~yx~0#1|) (* 2 |ULTIMATE.start_main_~Y~0#1|) (* (- 2) |ULTIMATE.start_main_~xy~0#1|) (* 2 (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* 2 |ULTIMATE.start_main_~y~0#1|) (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|))))} call __VERIFIER_assert((if 0 == 2 * main_~yx~0#1 - 2 * main_~xy~0#1 - main_~X~0#1 + 2 * main_~Y~0#1 - main_~v~0#1 then 1 else 0)); {449#true} is VALID [2022-02-20 17:10:43,051 INFO L290 TraceCheckUtils]: 11: Hoare triple {570#(or (<= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~X~0#1|) (forall ((|ULTIMATE.start_main_~Y~0#1| Int)) (= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|)) (+ (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* (- 2) (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 |ULTIMATE.start_main_~Y~0#1|) (* 2 (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))))))} assume !false;main_~yx~0#1 := main_~Y~0#1 * main_~x~0#1;main_~xy~0#1 := main_~X~0#1 * main_~y~0#1; {553#(or (<= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~X~0#1|) (= (+ (* 2 |ULTIMATE.start_main_~yx~0#1|) (* 2 |ULTIMATE.start_main_~Y~0#1|) (* (- 2) |ULTIMATE.start_main_~xy~0#1|) (* 2 (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* 2 |ULTIMATE.start_main_~y~0#1|) (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|))))} is VALID [2022-02-20 17:10:43,052 INFO L290 TraceCheckUtils]: 10: Hoare triple {574#(or (<= (+ |ULTIMATE.start_main_~x~0#1| 1) |ULTIMATE.start_main_~X~0#1|) (forall ((|ULTIMATE.start_main_~Y~0#1| Int)) (= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) (* 2 (* |ULTIMATE.start_main_~Y~0#1| (+ |ULTIMATE.start_main_~x~0#1| 1))) (* 2 |ULTIMATE.start_main_~Y~0#1|)) (+ (* (- 2) (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~Y~0#1| (+ |ULTIMATE.start_main_~x~0#1| 1))) (* 2 |ULTIMATE.start_main_~Y~0#1|) (* (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~x~0#1| 1)) 2)))))} main_#t~post7#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {570#(or (<= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~X~0#1|) (forall ((|ULTIMATE.start_main_~Y~0#1| Int)) (= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|)) (+ (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* (- 2) (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 |ULTIMATE.start_main_~Y~0#1|) (* 2 (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))))))} is VALID [2022-02-20 17:10:43,054 INFO L290 TraceCheckUtils]: 9: Hoare triple {578#(or (<= (+ |ULTIMATE.start_main_~x~0#1| 1) |ULTIMATE.start_main_~X~0#1|) (forall ((|ULTIMATE.start_main_~Y~0#1| Int)) (= (+ (* 2 (* |ULTIMATE.start_main_~Y~0#1| (+ |ULTIMATE.start_main_~x~0#1| 1))) (* (- 2) (* (+ |ULTIMATE.start_main_~y~0#1| 1) |ULTIMATE.start_main_~X~0#1|)) (* 2 |ULTIMATE.start_main_~Y~0#1|) (* 2 (* (+ |ULTIMATE.start_main_~y~0#1| 1) (+ |ULTIMATE.start_main_~x~0#1| 1)))) (+ (* 2 |ULTIMATE.start_main_~y~0#1|) 2 (* 2 (* |ULTIMATE.start_main_~Y~0#1| (+ |ULTIMATE.start_main_~x~0#1| 1))) (* 2 |ULTIMATE.start_main_~Y~0#1|)))))} assume !(main_~v~0#1 < 0);main_~v~0#1 := main_~v~0#1 + 2 * (main_~Y~0#1 - main_~X~0#1);main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {574#(or (<= (+ |ULTIMATE.start_main_~x~0#1| 1) |ULTIMATE.start_main_~X~0#1|) (forall ((|ULTIMATE.start_main_~Y~0#1| Int)) (= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) (* 2 (* |ULTIMATE.start_main_~Y~0#1| (+ |ULTIMATE.start_main_~x~0#1| 1))) (* 2 |ULTIMATE.start_main_~Y~0#1|)) (+ (* (- 2) (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~Y~0#1| (+ |ULTIMATE.start_main_~x~0#1| 1))) (* 2 |ULTIMATE.start_main_~Y~0#1|) (* (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~x~0#1| 1)) 2)))))} is VALID [2022-02-20 17:10:43,056 INFO L290 TraceCheckUtils]: 8: Hoare triple {449#true} assume !!(main_~x~0#1 <= main_~X~0#1); {578#(or (<= (+ |ULTIMATE.start_main_~x~0#1| 1) |ULTIMATE.start_main_~X~0#1|) (forall ((|ULTIMATE.start_main_~Y~0#1| Int)) (= (+ (* 2 (* |ULTIMATE.start_main_~Y~0#1| (+ |ULTIMATE.start_main_~x~0#1| 1))) (* (- 2) (* (+ |ULTIMATE.start_main_~y~0#1| 1) |ULTIMATE.start_main_~X~0#1|)) (* 2 |ULTIMATE.start_main_~Y~0#1|) (* 2 (* (+ |ULTIMATE.start_main_~y~0#1| 1) (+ |ULTIMATE.start_main_~x~0#1| 1)))) (+ (* 2 |ULTIMATE.start_main_~y~0#1|) 2 (* 2 (* |ULTIMATE.start_main_~Y~0#1| (+ |ULTIMATE.start_main_~x~0#1| 1))) (* 2 |ULTIMATE.start_main_~Y~0#1|)))))} is VALID [2022-02-20 17:10:43,056 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {449#true} {449#true} #46#return; {449#true} is VALID [2022-02-20 17:10:43,056 INFO L290 TraceCheckUtils]: 6: Hoare triple {449#true} assume true; {449#true} is VALID [2022-02-20 17:10:43,056 INFO L290 TraceCheckUtils]: 5: Hoare triple {449#true} assume !(0 == ~cond); {449#true} is VALID [2022-02-20 17:10:43,056 INFO L290 TraceCheckUtils]: 4: Hoare triple {449#true} ~cond := #in~cond; {449#true} is VALID [2022-02-20 17:10:43,057 INFO L272 TraceCheckUtils]: 3: Hoare triple {449#true} call __VERIFIER_assert((if 0 == 2 * main_~yx~0#1 - 2 * main_~xy~0#1 - main_~X~0#1 + 2 * main_~Y~0#1 - main_~v~0#1 then 1 else 0)); {449#true} is VALID [2022-02-20 17:10:43,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {449#true} assume !false;main_~yx~0#1 := main_~Y~0#1 * main_~x~0#1;main_~xy~0#1 := main_~X~0#1 * main_~y~0#1; {449#true} is VALID [2022-02-20 17:10:43,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {449#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_#t~post6#1, main_#t~post7#1, main_~X~0#1, main_~Y~0#1, main_~x~0#1, main_~y~0#1, main_~v~0#1, main_~xy~0#1, main_~yx~0#1;havoc main_~X~0#1;havoc main_~Y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~v~0#1;havoc main_~xy~0#1;havoc main_~yx~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;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~Y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~v~0#1 := 2 * main_~Y~0#1 - main_~X~0#1;main_~y~0#1 := 0;main_~x~0#1 := 0; {449#true} is VALID [2022-02-20 17:10:43,057 INFO L290 TraceCheckUtils]: 0: Hoare triple {449#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(15, 2);call #Ultimate.allocInit(12, 3); {449#true} is VALID [2022-02-20 17:10:43,058 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 17:10:43,058 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:10:43,058 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734104618] [2022-02-20 17:10:43,058 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:10:43,058 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930590706] [2022-02-20 17:10:43,058 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930590706] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:10:43,058 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:10:43,059 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 22 [2022-02-20 17:10:43,059 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232686105] [2022-02-20 17:10:43,059 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:10:43,060 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 23 [2022-02-20 17:10:43,061 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:10:43,062 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 22 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:10:43,095 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:10:43,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-02-20 17:10:43,096 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:10:43,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-02-20 17:10:43,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-02-20 17:10:43,097 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 22 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:10:43,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:43,946 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-02-20 17:10:43,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-02-20 17:10:43,947 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 23 [2022-02-20 17:10:43,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:10:43,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:10:43,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 47 transitions. [2022-02-20 17:10:43,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:10:43,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 47 transitions. [2022-02-20 17:10:43,951 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 47 transitions. [2022-02-20 17:10:43,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:10:43,999 INFO L225 Difference]: With dead ends: 48 [2022-02-20 17:10:43,999 INFO L226 Difference]: Without dead ends: 40 [2022-02-20 17:10:44,000 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=178, Invalid=878, Unknown=0, NotChecked=0, Total=1056 [2022-02-20 17:10:44,000 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 22 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 17:10:44,000 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 75 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 209 Invalid, 0 Unknown, 43 Unchecked, 0.2s Time] [2022-02-20 17:10:44,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-02-20 17:10:44,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 29. [2022-02-20 17:10:44,008 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:10:44,008 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 29 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:10:44,009 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 29 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:10:44,009 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 29 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:10:44,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:44,011 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2022-02-20 17:10:44,011 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2022-02-20 17:10:44,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:10:44,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:10:44,011 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 40 states. [2022-02-20 17:10:44,012 INFO L87 Difference]: Start difference. First operand has 29 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 40 states. [2022-02-20 17:10:44,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:44,013 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2022-02-20 17:10:44,013 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2022-02-20 17:10:44,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:10:44,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:10:44,014 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:10:44,014 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:10:44,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:10:44,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-02-20 17:10:44,015 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 23 [2022-02-20 17:10:44,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:10:44,015 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-02-20 17:10:44,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:10:44,016 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-02-20 17:10:44,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-20 17:10:44,016 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:10:44,017 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:10:44,035 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:10:44,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:10:44,235 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:10:44,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:10:44,236 INFO L85 PathProgramCache]: Analyzing trace with hash 2047060753, now seen corresponding path program 1 times [2022-02-20 17:10:44,236 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:10:44,236 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424678492] [2022-02-20 17:10:44,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:10:44,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:10:44,245 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:10:44,245 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [478042146] [2022-02-20 17:10:44,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:10:44,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:10:44,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:10:44,247 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:10:44,248 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:10:44,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:10:44,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-20 17:10:44,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:10:44,285 INFO L286 TraceCheckSpWp]: Computing forward predicates...