./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound100.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/config/TaipanReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound100.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 36da946a83103a61b88f0f1db9af94484aad5eefbde5313f974f53b267bd14bf --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-20 23:47:46,622 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 23:47:46,624 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 23:47:46,668 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 23:47:46,669 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 23:47:46,671 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 23:47:46,673 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 23:47:46,676 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 23:47:46,679 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 23:47:46,681 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 23:47:46,682 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 23:47:46,684 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 23:47:46,685 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 23:47:46,687 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 23:47:46,689 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 23:47:46,691 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 23:47:46,693 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 23:47:46,695 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 23:47:46,698 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 23:47:46,701 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 23:47:46,705 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 23:47:46,707 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 23:47:46,709 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 23:47:46,710 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 23:47:46,716 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 23:47:46,717 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 23:47:46,717 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 23:47:46,719 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 23:47:46,720 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 23:47:46,721 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 23:47:46,722 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 23:47:46,723 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 23:47:46,724 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 23:47:46,725 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 23:47:46,727 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 23:47:46,728 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 23:47:46,728 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 23:47:46,729 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 23:47:46,729 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 23:47:46,730 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 23:47:46,731 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 23:47:46,732 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-20 23:47:46,767 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 23:47:46,767 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 23:47:46,768 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 23:47:46,768 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 23:47:46,769 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-20 23:47:46,769 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-20 23:47:46,770 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-20 23:47:46,770 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-20 23:47:46,770 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-20 23:47:46,770 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-20 23:47:46,771 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-20 23:47:46,771 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-20 23:47:46,771 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-20 23:47:46,772 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-20 23:47:46,772 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-20 23:47:46,772 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-20 23:47:46,773 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-20 23:47:46,773 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-20 23:47:46,774 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 23:47:46,774 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-20 23:47:46,774 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-20 23:47:46,775 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-20 23:47:46,775 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 23:47:46,775 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-20 23:47:46,775 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-20 23:47:46,776 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-20 23:47:46,776 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-20 23:47:46,776 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-20 23:47:46,777 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 23:47:46,777 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-20 23:47:46,777 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 23:47:46,777 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-20 23:47:46,778 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 23:47:46,778 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 23:47:46,778 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-20 23:47:46,779 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-20 23:47:46,779 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-20 23:47:46,779 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-20 23:47:46,780 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-20 23:47:46,780 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 23:47:46,780 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-20 23:47:46,780 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P 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 -> Taipan 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 -> 36da946a83103a61b88f0f1db9af94484aad5eefbde5313f974f53b267bd14bf [2021-11-20 23:47:47,091 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 23:47:47,118 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 23:47:47,121 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 23:47:47,123 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 23:47:47,124 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 23:47:47,126 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound100.c [2021-11-20 23:47:47,194 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/data/5e39e96ab/804e303a6c20495985a06a26c931c0b5/FLAGc03289fa8 [2021-11-20 23:47:47,647 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 23:47:47,648 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound100.c [2021-11-20 23:47:47,671 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/data/5e39e96ab/804e303a6c20495985a06a26c931c0b5/FLAGc03289fa8 [2021-11-20 23:47:48,171 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/data/5e39e96ab/804e303a6c20495985a06a26c931c0b5 [2021-11-20 23:47:48,174 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 23:47:48,176 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 23:47:48,178 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 23:47:48,178 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 23:47:48,182 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 23:47:48,183 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:47:48" (1/1) ... [2021-11-20 23:47:48,184 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@827066d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:47:48, skipping insertion in model container [2021-11-20 23:47:48,184 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:47:48" (1/1) ... [2021-11-20 23:47:48,196 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 23:47:48,216 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 23:47:48,409 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound100.c[524,537] [2021-11-20 23:47:48,431 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 23:47:48,441 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 23:47:48,457 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound100.c[524,537] [2021-11-20 23:47:48,467 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 23:47:48,484 INFO L208 MainTranslator]: Completed translation [2021-11-20 23:47:48,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:47:48 WrapperNode [2021-11-20 23:47:48,485 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 23:47:48,486 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 23:47:48,486 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 23:47:48,487 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 23:47:48,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:47:48" (1/1) ... [2021-11-20 23:47:48,504 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:47:48" (1/1) ... [2021-11-20 23:47:48,527 INFO L137 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 46 [2021-11-20 23:47:48,528 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 23:47:48,529 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 23:47:48,529 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 23:47:48,529 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 23:47:48,539 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:47:48" (1/1) ... [2021-11-20 23:47:48,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:47:48" (1/1) ... [2021-11-20 23:47:48,542 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:47:48" (1/1) ... [2021-11-20 23:47:48,542 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:47:48" (1/1) ... [2021-11-20 23:47:48,546 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:47:48" (1/1) ... [2021-11-20 23:47:48,551 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:47:48" (1/1) ... [2021-11-20 23:47:48,552 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:47:48" (1/1) ... [2021-11-20 23:47:48,554 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 23:47:48,567 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 23:47:48,568 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 23:47:48,568 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 23:47:48,569 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:47:48" (1/1) ... [2021-11-20 23:47:48,580 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 23:47:48,595 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:47:48,614 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-20 23:47:48,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-20 23:47:48,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-20 23:47:48,683 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-11-20 23:47:48,683 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-11-20 23:47:48,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-20 23:47:48,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 23:47:48,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 23:47:48,684 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-11-20 23:47:48,685 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-11-20 23:47:48,769 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 23:47:48,772 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 23:47:48,978 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 23:47:49,009 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 23:47:49,009 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-20 23:47:49,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:47:49 BoogieIcfgContainer [2021-11-20 23:47:49,012 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 23:47:49,015 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-20 23:47:49,015 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-20 23:47:49,019 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-20 23:47:49,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:47:48" (1/3) ... [2021-11-20 23:47:49,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37c4e130 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:47:49, skipping insertion in model container [2021-11-20 23:47:49,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:47:48" (2/3) ... [2021-11-20 23:47:49,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37c4e130 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:47:49, skipping insertion in model container [2021-11-20 23:47:49,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:47:49" (3/3) ... [2021-11-20 23:47:49,023 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat2-ll_unwindbound100.c [2021-11-20 23:47:49,030 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-20 23:47:49,030 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-20 23:47:49,090 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-20 23:47:49,099 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=FINITE_AUTOMATA, 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 [2021-11-20 23:47:49,100 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-20 23:47:49,121 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-20 23:47:49,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-20 23:47:49,128 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:47:49,128 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:47:49,129 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 23:47:49,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:47:49,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1046920148, now seen corresponding path program 1 times [2021-11-20 23:47:49,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:47:49,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961386471] [2021-11-20 23:47:49,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:47:49,151 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:47:49,253 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 23:47:49,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [735304026] [2021-11-20 23:47:49,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:47:49,255 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:47:49,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:47:49,267 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:47:49,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-20 23:47:49,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:47:49,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-20 23:47:49,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:47:49,443 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 23:47:49,443 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 23:47:49,444 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:47:49,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961386471] [2021-11-20 23:47:49,445 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 23:47:49,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735304026] [2021-11-20 23:47:49,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735304026] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:47:49,446 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:47:49,446 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-20 23:47:49,449 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898246330] [2021-11-20 23:47:49,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:47:49,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-20 23:47:49,456 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:47:49,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-20 23:47:49,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-20 23:47:49,517 INFO L87 Difference]: Start difference. First operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 23:47:49,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:47:49,570 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2021-11-20 23:47:49,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-20 23:47:49,574 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 13 [2021-11-20 23:47:49,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:47:49,583 INFO L225 Difference]: With dead ends: 32 [2021-11-20 23:47:49,584 INFO L226 Difference]: Without dead ends: 17 [2021-11-20 23:47:49,588 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-20 23:47:49,599 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 23:47:49,601 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 23:47:49,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-11-20 23:47:49,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-11-20 23:47:49,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-20 23:47:49,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2021-11-20 23:47:49,681 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 13 [2021-11-20 23:47:49,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:47:49,684 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2021-11-20 23:47:49,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 23:47:49,684 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2021-11-20 23:47:49,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-20 23:47:49,686 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:47:49,687 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:47:49,722 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-20 23:47:49,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2021-11-20 23:47:49,904 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 23:47:49,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:47:49,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1317434454, now seen corresponding path program 1 times [2021-11-20 23:47:49,906 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:47:49,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918330247] [2021-11-20 23:47:49,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:47:49,907 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:47:49,922 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 23:47:49,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [245758593] [2021-11-20 23:47:49,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:47:49,936 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:47:49,936 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:47:49,937 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:47:49,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-20 23:47:50,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:47:50,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-20 23:47:50,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:47:50,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 23:47:50,229 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 23:47:50,230 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:47:50,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918330247] [2021-11-20 23:47:50,230 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 23:47:50,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245758593] [2021-11-20 23:47:50,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245758593] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:47:50,231 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:47:50,232 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-20 23:47:50,232 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843475500] [2021-11-20 23:47:50,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:47:50,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 23:47:50,234 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:47:50,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 23:47:50,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-20 23:47:50,236 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 23:47:50,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:47:50,263 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2021-11-20 23:47:50,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 23:47:50,264 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2021-11-20 23:47:50,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:47:50,265 INFO L225 Difference]: With dead ends: 26 [2021-11-20 23:47:50,266 INFO L226 Difference]: Without dead ends: 19 [2021-11-20 23:47:50,266 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-20 23:47:50,268 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 23:47:50,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 23:47:50,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-11-20 23:47:50,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-11-20 23:47:50,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-20 23:47:50,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2021-11-20 23:47:50,287 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 14 [2021-11-20 23:47:50,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:47:50,288 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2021-11-20 23:47:50,288 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 23:47:50,289 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2021-11-20 23:47:50,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-20 23:47:50,290 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:47:50,290 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:47:50,317 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-20 23:47:50,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2021-11-20 23:47:50,516 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 23:47:50,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:47:50,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1319221914, now seen corresponding path program 1 times [2021-11-20 23:47:50,517 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:47:50,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049729634] [2021-11-20 23:47:50,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:47:50,518 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:47:50,532 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 23:47:50,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1559139295] [2021-11-20 23:47:50,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:47:50,533 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:47:50,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:47:50,534 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:47:50,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-20 23:47:50,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:47:50,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-20 23:47:50,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:47:50,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 23:47:50,967 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 23:47:50,967 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:47:50,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049729634] [2021-11-20 23:47:50,968 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 23:47:50,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559139295] [2021-11-20 23:47:50,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559139295] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:47:50,969 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:47:50,969 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-20 23:47:50,969 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308932710] [2021-11-20 23:47:50,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:47:50,970 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 23:47:50,970 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:47:50,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 23:47:50,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 23:47:50,972 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 23:47:51,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:47:51,121 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2021-11-20 23:47:51,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 23:47:51,123 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2021-11-20 23:47:51,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:47:51,124 INFO L225 Difference]: With dead ends: 28 [2021-11-20 23:47:51,125 INFO L226 Difference]: Without dead ends: 26 [2021-11-20 23:47:51,125 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-20 23:47:51,127 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 23:47:51,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 53 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 23:47:51,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-11-20 23:47:51,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2021-11-20 23:47:51,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-20 23:47:51,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2021-11-20 23:47:51,139 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 14 [2021-11-20 23:47:51,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:47:51,140 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2021-11-20 23:47:51,140 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 23:47:51,141 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2021-11-20 23:47:51,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-20 23:47:51,142 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:47:51,142 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:47:51,184 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-20 23:47:51,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:47:51,358 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 23:47:51,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:47:51,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1562521278, now seen corresponding path program 1 times [2021-11-20 23:47:51,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:47:51,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416866364] [2021-11-20 23:47:51,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:47:51,360 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:47:51,370 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 23:47:51,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [334294300] [2021-11-20 23:47:51,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:47:51,371 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:47:51,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:47:51,376 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:47:51,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-20 23:47:51,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:47:51,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-20 23:47:51,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:47:51,589 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 23:47:51,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:47:51,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 23:47:51,814 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:47:51,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416866364] [2021-11-20 23:47:51,814 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 23:47:51,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334294300] [2021-11-20 23:47:51,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334294300] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:47:51,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [25414868] [2021-11-20 23:47:51,845 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-20 23:47:51,845 INFO L166 IcfgInterpreter]: Building call graph [2021-11-20 23:47:51,851 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-20 23:47:51,859 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-20 23:47:51,860 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-20 23:48:01,469 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 43 for LOIs [2021-11-20 23:48:01,732 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 53 for LOIs [2021-11-20 23:48:01,868 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-20 23:48:04,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSifa [25414868] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:48:04,284 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-20 23:48:04,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [8, 8] total 21 [2021-11-20 23:48:04,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087217287] [2021-11-20 23:48:04,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:48:04,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-20 23:48:04,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:48:04,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-20 23:48:04,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2021-11-20 23:48:04,292 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 13 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-20 23:48:06,458 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2021-11-20 23:48:06,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:48:06,534 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2021-11-20 23:48:06,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-20 23:48:06,535 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 20 [2021-11-20 23:48:06,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:48:06,536 INFO L225 Difference]: With dead ends: 32 [2021-11-20 23:48:06,536 INFO L226 Difference]: Without dead ends: 25 [2021-11-20 23:48:06,537 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2021-11-20 23:48:06,539 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 7 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:48:06,539 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 31 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2021-11-20 23:48:06,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-11-20 23:48:06,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2021-11-20 23:48:06,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-20 23:48:06,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2021-11-20 23:48:06,547 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 20 [2021-11-20 23:48:06,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:48:06,548 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2021-11-20 23:48:06,548 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-20 23:48:06,548 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2021-11-20 23:48:06,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-20 23:48:06,549 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:48:06,549 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:48:06,583 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-11-20 23:48:06,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:48:06,750 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 23:48:06,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:48:06,751 INFO L85 PathProgramCache]: Analyzing trace with hash -182192907, now seen corresponding path program 1 times [2021-11-20 23:48:06,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:48:06,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840277561] [2021-11-20 23:48:06,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:48:06,752 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:48:06,761 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 23:48:06,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [155903131] [2021-11-20 23:48:06,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:48:06,762 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:48:06,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:48:06,763 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:48:06,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-20 23:48:06,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:48:06,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-20 23:48:06,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:48:06,882 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 23:48:06,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:48:06,959 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 23:48:06,960 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:48:06,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840277561] [2021-11-20 23:48:06,960 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 23:48:06,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155903131] [2021-11-20 23:48:06,960 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155903131] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:48:06,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [924300654] [2021-11-20 23:48:06,964 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-20 23:48:06,964 INFO L166 IcfgInterpreter]: Building call graph [2021-11-20 23:48:06,965 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-20 23:48:06,965 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-20 23:48:06,965 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-20 23:48:19,718 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 16 for LOIs [2021-11-20 23:48:19,815 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 53 for LOIs [2021-11-20 23:48:19,914 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-20 23:48:20,743 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-20 23:48:20,744 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 23:48:20,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2021-11-20 23:48:20,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608489622] [2021-11-20 23:48:20,744 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 23:48:20,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-20 23:48:20,745 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:48:20,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-20 23:48:20,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2021-11-20 23:48:20,746 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-11-20 23:48:20,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:48:20,854 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2021-11-20 23:48:20,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-20 23:48:20,855 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 22 [2021-11-20 23:48:20,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:48:20,856 INFO L225 Difference]: With dead ends: 56 [2021-11-20 23:48:20,856 INFO L226 Difference]: Without dead ends: 49 [2021-11-20 23:48:20,857 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2021-11-20 23:48:20,859 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 24 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 23:48:20,859 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 86 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 23:48:20,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-11-20 23:48:20,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2021-11-20 23:48:20,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-20 23:48:20,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2021-11-20 23:48:20,872 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 22 [2021-11-20 23:48:20,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:48:20,873 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2021-11-20 23:48:20,873 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-11-20 23:48:20,873 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2021-11-20 23:48:20,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-20 23:48:20,874 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:48:20,874 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:48:20,899 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-20 23:48:21,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:48:21,080 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 23:48:21,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:48:21,081 INFO L85 PathProgramCache]: Analyzing trace with hash -180405447, now seen corresponding path program 1 times [2021-11-20 23:48:21,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:48:21,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000994212] [2021-11-20 23:48:21,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:48:21,081 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:48:21,089 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 23:48:21,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1010611073] [2021-11-20 23:48:21,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:48:21,090 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:48:21,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:48:21,112 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:48:21,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-20 23:48:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:48:21,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-20 23:48:21,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:48:49,887 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 23:48:49,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:48:52,854 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 23:48:52,854 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:48:52,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000994212] [2021-11-20 23:48:52,855 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 23:48:52,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010611073] [2021-11-20 23:48:52,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010611073] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:48:52,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1376768924] [2021-11-20 23:48:52,858 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2021-11-20 23:48:52,859 INFO L166 IcfgInterpreter]: Building call graph [2021-11-20 23:48:52,859 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-20 23:48:52,859 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-20 23:48:52,860 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-20 23:49:06,591 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 17 for LOIs [2021-11-20 23:49:06,711 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 53 for LOIs [2021-11-20 23:49:06,814 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-20 23:49:12,417 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-20 23:49:12,418 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 23:49:12,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 11 [2021-11-20 23:49:12,418 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427336374] [2021-11-20 23:49:12,418 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 23:49:12,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-20 23:49:12,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:49:12,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-20 23:49:12,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=474, Unknown=2, NotChecked=0, Total=552 [2021-11-20 23:49:12,420 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-20 23:49:14,456 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-11-20 23:49:16,467 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-11-20 23:49:30,778 WARN L227 SmtUtils]: Spent 13.47s on a formula simplification. DAG size of input: 63 DAG size of output: 38 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-20 23:49:31,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:49:31,667 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2021-11-20 23:49:31,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-20 23:49:31,667 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 22 [2021-11-20 23:49:31,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:49:31,669 INFO L225 Difference]: With dead ends: 59 [2021-11-20 23:49:31,669 INFO L226 Difference]: Without dead ends: 51 [2021-11-20 23:49:31,670 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 28.5s TimeCoverageRelationStatistics Valid=95, Invalid=605, Unknown=2, NotChecked=0, Total=702 [2021-11-20 23:49:31,671 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 13 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2021-11-20 23:49:31,672 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 118 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 82 Invalid, 2 Unknown, 12 Unchecked, 5.6s Time] [2021-11-20 23:49:31,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-11-20 23:49:31,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2021-11-20 23:49:31,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-20 23:49:31,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2021-11-20 23:49:31,684 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 22 [2021-11-20 23:49:31,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:49:31,685 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2021-11-20 23:49:31,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-20 23:49:31,685 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2021-11-20 23:49:31,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:49:31,686 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:49:31,687 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:49:31,694 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-20 23:49:31,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:49:31,894 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 23:49:31,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:49:31,894 INFO L85 PathProgramCache]: Analyzing trace with hash 408559265, now seen corresponding path program 1 times [2021-11-20 23:49:31,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:49:31,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568436808] [2021-11-20 23:49:31,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:49:31,895 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:49:31,904 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 23:49:31,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1835012339] [2021-11-20 23:49:31,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:49:31,905 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:49:31,905 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:49:31,906 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:49:31,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-20 23:49:31,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:49:31,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-20 23:49:31,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:49:32,137 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-20 23:49:32,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:49:32,306 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-20 23:49:32,306 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:49:32,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568436808] [2021-11-20 23:49:32,307 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 23:49:32,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835012339] [2021-11-20 23:49:32,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835012339] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:49:32,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1815828218] [2021-11-20 23:49:32,313 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-20 23:49:32,313 INFO L166 IcfgInterpreter]: Building call graph [2021-11-20 23:49:32,314 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-20 23:49:32,314 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-20 23:49:32,314 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-20 23:49:45,710 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 16 for LOIs [2021-11-20 23:49:45,806 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 53 for LOIs [2021-11-20 23:49:45,900 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-20 23:49:47,354 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-20 23:49:47,354 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 23:49:47,354 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2021-11-20 23:49:47,355 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48766374] [2021-11-20 23:49:47,355 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 23:49:47,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-20 23:49:47,355 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:49:47,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-20 23:49:47,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2021-11-20 23:49:47,356 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-11-20 23:49:47,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:49:47,466 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2021-11-20 23:49:47,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 23:49:47,467 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 28 [2021-11-20 23:49:47,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:49:47,468 INFO L225 Difference]: With dead ends: 50 [2021-11-20 23:49:47,468 INFO L226 Difference]: Without dead ends: 45 [2021-11-20 23:49:47,468 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2021-11-20 23:49:47,469 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 22 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 23:49:47,470 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 51 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 23:49:47,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-11-20 23:49:47,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2021-11-20 23:49:47,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-20 23:49:47,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2021-11-20 23:49:47,478 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 28 [2021-11-20 23:49:47,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:49:47,478 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2021-11-20 23:49:47,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-11-20 23:49:47,479 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2021-11-20 23:49:47,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-20 23:49:47,480 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:49:47,480 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:49:47,500 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-20 23:49:47,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:49:47,683 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 23:49:47,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:49:47,684 INFO L85 PathProgramCache]: Analyzing trace with hash -235004718, now seen corresponding path program 2 times [2021-11-20 23:49:47,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:49:47,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84395877] [2021-11-20 23:49:47,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:49:47,684 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:49:47,689 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 23:49:47,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1664453078] [2021-11-20 23:49:47,689 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:49:47,689 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:49:47,690 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:49:47,694 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:49:47,697 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-20 23:49:49,061 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-11-20 23:49:49,061 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:49:49,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-20 23:49:49,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:49:49,214 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 23:49:49,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:49:49,407 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-20 23:49:49,407 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:49:49,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84395877] [2021-11-20 23:49:49,407 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 23:49:49,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664453078] [2021-11-20 23:49:49,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664453078] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:49:49,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [551049061] [2021-11-20 23:49:49,410 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-20 23:49:49,410 INFO L166 IcfgInterpreter]: Building call graph [2021-11-20 23:49:49,411 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-20 23:49:49,411 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-20 23:49:49,411 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-20 23:50:02,792 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 16 for LOIs [2021-11-20 23:50:02,880 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 53 for LOIs [2021-11-20 23:50:02,985 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-20 23:50:04,729 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-20 23:50:04,729 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 23:50:04,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2021-11-20 23:50:04,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286879562] [2021-11-20 23:50:04,729 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 23:50:04,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-20 23:50:04,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:50:04,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-20 23:50:04,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2021-11-20 23:50:04,732 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 11 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2021-11-20 23:50:05,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:50:05,023 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2021-11-20 23:50:05,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-20 23:50:05,024 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 11 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 46 [2021-11-20 23:50:05,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:50:05,026 INFO L225 Difference]: With dead ends: 98 [2021-11-20 23:50:05,026 INFO L226 Difference]: Without dead ends: 93 [2021-11-20 23:50:05,027 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=278, Invalid=1054, Unknown=0, NotChecked=0, Total=1332 [2021-11-20 23:50:05,028 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 62 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:50:05,029 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 96 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 23:50:05,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-11-20 23:50:05,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2021-11-20 23:50:05,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 13 states have call successors, (13), 12 states have call predecessors, (13), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2021-11-20 23:50:05,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2021-11-20 23:50:05,045 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 46 [2021-11-20 23:50:05,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:50:05,046 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2021-11-20 23:50:05,046 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 11 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2021-11-20 23:50:05,047 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2021-11-20 23:50:05,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-20 23:50:05,051 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:50:05,051 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:50:05,059 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-11-20 23:50:05,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2021-11-20 23:50:05,258 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 23:50:05,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:50:05,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1419782260, now seen corresponding path program 3 times [2021-11-20 23:50:05,259 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:50:05,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674666456] [2021-11-20 23:50:05,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:50:05,259 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:50:05,268 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 23:50:05,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [605668717] [2021-11-20 23:50:05,268 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:50:05,268 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:50:05,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:50:05,291 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:50:05,304 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-20 23:50:05,835 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:50:05,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:50:05,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-20 23:50:05,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:50:06,144 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 20 proven. 380 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 23:50:06,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:50:06,497 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 20 proven. 200 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2021-11-20 23:50:06,497 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:50:06,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674666456] [2021-11-20 23:50:06,498 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 23:50:06,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605668717] [2021-11-20 23:50:06,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605668717] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:50:06,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [909993338] [2021-11-20 23:50:06,501 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-20 23:50:06,501 INFO L166 IcfgInterpreter]: Building call graph [2021-11-20 23:50:06,501 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-20 23:50:06,501 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-20 23:50:06,502 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-20 23:50:17,672 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 16 for LOIs [2021-11-20 23:50:17,755 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 53 for LOIs [2021-11-20 23:50:17,825 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-20 23:50:18,967 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-20 23:50:18,968 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 23:50:18,968 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2021-11-20 23:50:18,968 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231190478] [2021-11-20 23:50:18,968 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 23:50:18,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-11-20 23:50:18,970 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:50:18,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-20 23:50:18,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1125, Unknown=0, NotChecked=0, Total=1560 [2021-11-20 23:50:18,972 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 23 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2021-11-20 23:50:19,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:50:19,686 INFO L93 Difference]: Finished difference Result 194 states and 206 transitions. [2021-11-20 23:50:19,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-11-20 23:50:19,687 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 23 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) Word has length 94 [2021-11-20 23:50:19,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:50:19,690 INFO L225 Difference]: With dead ends: 194 [2021-11-20 23:50:19,690 INFO L226 Difference]: Without dead ends: 189 [2021-11-20 23:50:19,693 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1083 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=950, Invalid=2710, Unknown=0, NotChecked=0, Total=3660 [2021-11-20 23:50:19,694 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 321 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 23:50:19,694 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [321 Valid, 180 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-20 23:50:19,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-11-20 23:50:19,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2021-11-20 23:50:19,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 140 states have (on average 1.0071428571428571) internal successors, (141), 140 states have internal predecessors, (141), 25 states have call successors, (25), 24 states have call predecessors, (25), 23 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2021-11-20 23:50:19,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2021-11-20 23:50:19,718 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 94 [2021-11-20 23:50:19,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:50:19,719 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2021-11-20 23:50:19,720 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 23 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2021-11-20 23:50:19,720 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2021-11-20 23:50:19,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2021-11-20 23:50:19,724 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:50:19,724 INFO L514 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:50:19,730 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-20 23:50:19,930 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:50:19,931 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 23:50:19,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:50:19,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1763378944, now seen corresponding path program 4 times [2021-11-20 23:50:19,931 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:50:19,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128796493] [2021-11-20 23:50:19,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:50:19,932 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:50:19,947 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 23:50:19,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [385743983] [2021-11-20 23:50:19,949 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 23:50:19,949 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:50:19,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:50:19,950 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:50:19,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-20 23:50:20,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:50:20,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 47 conjunts are in the unsatisfiable core [2021-11-20 23:50:20,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:50:20,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1938 backedges. 44 proven. 1892 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 23:50:20,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:50:21,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1938 backedges. 44 proven. 968 refuted. 0 times theorem prover too weak. 926 trivial. 0 not checked. [2021-11-20 23:50:21,858 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:50:21,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128796493] [2021-11-20 23:50:21,859 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 23:50:21,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385743983] [2021-11-20 23:50:21,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385743983] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:50:21,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2080291658] [2021-11-20 23:50:21,862 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-20 23:50:21,862 INFO L166 IcfgInterpreter]: Building call graph [2021-11-20 23:50:21,863 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-20 23:50:21,863 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-20 23:50:21,863 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-20 23:50:31,503 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 16 for LOIs [2021-11-20 23:50:31,579 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 53 for LOIs [2021-11-20 23:50:31,653 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-20 23:50:32,670 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-20 23:50:32,670 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 23:50:32,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2021-11-20 23:50:32,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507506255] [2021-11-20 23:50:32,671 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 23:50:32,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-11-20 23:50:32,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:50:32,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-11-20 23:50:32,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1407, Invalid=2625, Unknown=0, NotChecked=0, Total=4032 [2021-11-20 23:50:32,675 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand has 50 states, 50 states have (on average 4.28) internal successors, (214), 50 states have internal predecessors, (214), 47 states have call successors, (49), 25 states have call predecessors, (49), 24 states have return successors, (48), 46 states have call predecessors, (48), 46 states have call successors, (48) [2021-11-20 23:50:34,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:50:34,268 INFO L93 Difference]: Finished difference Result 386 states and 410 transitions. [2021-11-20 23:50:34,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2021-11-20 23:50:34,268 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 4.28) internal successors, (214), 50 states have internal predecessors, (214), 47 states have call successors, (49), 25 states have call predecessors, (49), 24 states have return successors, (48), 46 states have call predecessors, (48), 46 states have call successors, (48) Word has length 190 [2021-11-20 23:50:34,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:50:34,272 INFO L225 Difference]: With dead ends: 386 [2021-11-20 23:50:34,273 INFO L226 Difference]: Without dead ends: 381 [2021-11-20 23:50:34,277 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 613 GetRequests, 506 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2913 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3590, Invalid=8182, Unknown=0, NotChecked=0, Total=11772 [2021-11-20 23:50:34,278 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 336 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-20 23:50:34,279 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [336 Valid, 349 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-20 23:50:34,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2021-11-20 23:50:34,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2021-11-20 23:50:34,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 284 states have (on average 1.0035211267605635) internal successors, (285), 284 states have internal predecessors, (285), 49 states have call successors, (49), 48 states have call predecessors, (49), 47 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2021-11-20 23:50:34,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 382 transitions. [2021-11-20 23:50:34,314 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 382 transitions. Word has length 190 [2021-11-20 23:50:34,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:50:34,315 INFO L470 AbstractCegarLoop]: Abstraction has 381 states and 382 transitions. [2021-11-20 23:50:34,315 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 4.28) internal successors, (214), 50 states have internal predecessors, (214), 47 states have call successors, (49), 25 states have call predecessors, (49), 24 states have return successors, (48), 46 states have call predecessors, (48), 46 states have call successors, (48) [2021-11-20 23:50:34,315 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 382 transitions. [2021-11-20 23:50:34,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2021-11-20 23:50:34,325 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:50:34,325 INFO L514 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:50:34,360 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-20 23:50:34,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-20 23:50:34,539 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 23:50:34,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:50:34,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1767238632, now seen corresponding path program 5 times [2021-11-20 23:50:34,540 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:50:34,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495928092] [2021-11-20 23:50:34,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:50:34,540 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:50:34,557 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 23:50:34,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1387503141] [2021-11-20 23:50:34,558 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:50:34,558 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:50:34,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:50:34,559 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:50:34,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-20 23:53:34,145 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2021-11-20 23:53:34,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:53:34,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 803 conjuncts, 95 conjunts are in the unsatisfiable core [2021-11-20 23:53:34,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:53:35,841 INFO L134 CoverageAnalysis]: Checked inductivity of 8466 backedges. 92 proven. 8372 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 23:53:35,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:53:39,212 INFO L134 CoverageAnalysis]: Checked inductivity of 8466 backedges. 92 proven. 4232 refuted. 0 times theorem prover too weak. 4142 trivial. 0 not checked. [2021-11-20 23:53:39,213 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:53:39,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495928092] [2021-11-20 23:53:39,213 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 23:53:39,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387503141] [2021-11-20 23:53:39,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387503141] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:53:39,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1970267238] [2021-11-20 23:53:39,215 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-20 23:53:39,215 INFO L166 IcfgInterpreter]: Building call graph [2021-11-20 23:53:39,215 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-20 23:53:39,215 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-20 23:53:39,216 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-20 23:53:48,691 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 16 for LOIs [2021-11-20 23:53:48,763 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 53 for LOIs [2021-11-20 23:53:48,833 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-20 23:53:50,743 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-20 23:53:50,743 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 23:53:50,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 98 [2021-11-20 23:53:50,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363329532] [2021-11-20 23:53:50,744 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 23:53:50,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2021-11-20 23:53:50,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:53:50,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2021-11-20 23:53:50,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5079, Invalid=7353, Unknown=0, NotChecked=0, Total=12432 [2021-11-20 23:53:50,752 INFO L87 Difference]: Start difference. First operand 381 states and 382 transitions. Second operand has 98 states, 98 states have (on average 4.387755102040816) internal successors, (430), 98 states have internal predecessors, (430), 95 states have call successors, (97), 49 states have call predecessors, (97), 48 states have return successors, (96), 94 states have call predecessors, (96), 94 states have call successors, (96) [2021-11-20 23:53:56,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:53:56,336 INFO L93 Difference]: Finished difference Result 770 states and 818 transitions. [2021-11-20 23:53:56,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2021-11-20 23:53:56,337 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 4.387755102040816) internal successors, (430), 98 states have internal predecessors, (430), 95 states have call successors, (97), 49 states have call predecessors, (97), 48 states have return successors, (96), 94 states have call predecessors, (96), 94 states have call successors, (96) Word has length 382 [2021-11-20 23:53:56,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:53:56,343 INFO L225 Difference]: With dead ends: 770 [2021-11-20 23:53:56,343 INFO L226 Difference]: Without dead ends: 765 [2021-11-20 23:53:56,355 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1237 GetRequests, 1034 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8733 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=14054, Invalid=27766, Unknown=0, NotChecked=0, Total=41820 [2021-11-20 23:53:56,356 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 901 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 379 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 901 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 1105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 379 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-20 23:53:56,356 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [901 Valid, 516 Invalid, 1105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [379 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-20 23:53:56,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2021-11-20 23:53:56,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 765. [2021-11-20 23:53:56,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 572 states have (on average 1.0017482517482517) internal successors, (573), 572 states have internal predecessors, (573), 97 states have call successors, (97), 96 states have call predecessors, (97), 95 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2021-11-20 23:53:56,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 766 transitions. [2021-11-20 23:53:56,417 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 766 transitions. Word has length 382 [2021-11-20 23:53:56,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:53:56,418 INFO L470 AbstractCegarLoop]: Abstraction has 765 states and 766 transitions. [2021-11-20 23:53:56,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 98 states have (on average 4.387755102040816) internal successors, (430), 98 states have internal predecessors, (430), 95 states have call successors, (97), 49 states have call predecessors, (97), 48 states have return successors, (96), 94 states have call predecessors, (96), 94 states have call successors, (96) [2021-11-20 23:53:56,420 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 766 transitions. [2021-11-20 23:53:56,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 767 [2021-11-20 23:53:56,455 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:53:56,456 INFO L514 BasicCegarLoop]: trace histogram [95, 95, 94, 94, 94, 94, 94, 94, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:53:56,486 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-20 23:53:56,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-11-20 23:53:56,679 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 23:53:56,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:53:56,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1053987256, now seen corresponding path program 6 times [2021-11-20 23:53:56,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:53:56,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157546709] [2021-11-20 23:53:56,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:53:56,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:53:56,703 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 23:53:56,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1873672443] [2021-11-20 23:53:56,715 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:53:56,715 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:53:56,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:53:56,722 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:53:56,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-20 23:54:24,938 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:54:24,938 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:54:24,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 1571 conjuncts, 191 conjunts are in the unsatisfiable core [2021-11-20 23:54:24,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:54:29,974 INFO L134 CoverageAnalysis]: Checked inductivity of 35346 backedges. 188 proven. 35156 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 23:54:29,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:54:32,279 INFO L134 CoverageAnalysis]: Checked inductivity of 35346 backedges. 188 proven. 17672 refuted. 0 times theorem prover too weak. 17486 trivial. 0 not checked. [2021-11-20 23:54:32,279 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:54:32,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157546709] [2021-11-20 23:54:32,280 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 23:54:32,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873672443] [2021-11-20 23:54:32,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873672443] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:54:32,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1520589242] [2021-11-20 23:54:32,282 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-20 23:54:32,283 INFO L166 IcfgInterpreter]: Building call graph [2021-11-20 23:54:32,283 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-20 23:54:32,283 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-20 23:54:32,284 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-20 23:54:44,872 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 16 for LOIs [2021-11-20 23:54:44,947 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 53 for LOIs [2021-11-20 23:54:45,019 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-20 23:54:47,132 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-20 23:54:47,133 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 23:54:47,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 98] total 104 [2021-11-20 23:54:47,134 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019185558] [2021-11-20 23:54:47,134 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 23:54:47,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2021-11-20 23:54:47,136 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:54:47,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2021-11-20 23:54:47,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5700, Invalid=8106, Unknown=0, NotChecked=0, Total=13806 [2021-11-20 23:54:47,141 INFO L87 Difference]: Start difference. First operand 765 states and 766 transitions. Second operand has 104 states, 104 states have (on average 5.721153846153846) internal successors, (595), 104 states have internal predecessors, (595), 101 states have call successors, (193), 97 states have call predecessors, (193), 96 states have return successors, (192), 100 states have call predecessors, (192), 100 states have call successors, (192) [2021-11-20 23:54:52,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:54:52,407 INFO L93 Difference]: Finished difference Result 818 states and 824 transitions. [2021-11-20 23:54:52,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2021-11-20 23:54:52,408 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 5.721153846153846) internal successors, (595), 104 states have internal predecessors, (595), 101 states have call successors, (193), 97 states have call predecessors, (193), 96 states have return successors, (192), 100 states have call predecessors, (192), 100 states have call successors, (192) Word has length 766 [2021-11-20 23:54:52,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:54:52,415 INFO L225 Difference]: With dead ends: 818 [2021-11-20 23:54:52,415 INFO L226 Difference]: Without dead ends: 813 [2021-11-20 23:54:52,422 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2395 GetRequests, 2179 SyntacticMatches, 1 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8138 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=15893, Invalid=30979, Unknown=0, NotChecked=0, Total=46872 [2021-11-20 23:54:52,423 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 1181 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 413 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1181 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 1246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 413 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-20 23:54:52,423 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1181 Valid, 561 Invalid, 1246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [413 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-20 23:54:52,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2021-11-20 23:54:52,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 813. [2021-11-20 23:54:52,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 608 states have (on average 1.0016447368421053) internal successors, (609), 608 states have internal predecessors, (609), 103 states have call successors, (103), 102 states have call predecessors, (103), 101 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2021-11-20 23:54:52,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 814 transitions. [2021-11-20 23:54:52,475 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 814 transitions. Word has length 766 [2021-11-20 23:54:52,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:54:52,477 INFO L470 AbstractCegarLoop]: Abstraction has 813 states and 814 transitions. [2021-11-20 23:54:52,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 5.721153846153846) internal successors, (595), 104 states have internal predecessors, (595), 101 states have call successors, (193), 97 states have call predecessors, (193), 96 states have return successors, (192), 100 states have call predecessors, (192), 100 states have call successors, (192) [2021-11-20 23:54:52,478 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 814 transitions. [2021-11-20 23:54:52,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 815 [2021-11-20 23:54:52,501 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:54:52,501 INFO L514 BasicCegarLoop]: trace histogram [101, 101, 100, 100, 100, 100, 100, 100, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:54:52,515 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-20 23:54:52,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-20 23:54:52,712 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 23:54:52,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:54:52,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1872537714, now seen corresponding path program 7 times [2021-11-20 23:54:52,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:54:52,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071155563] [2021-11-20 23:54:52,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:54:52,714 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:54:52,733 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 23:54:52,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2033005511] [2021-11-20 23:54:52,733 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 23:54:52,733 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:54:52,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:54:52,735 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:54:52,738 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-20 23:56:39,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 23:56:39,155 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 23:56:46,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 23:56:46,391 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-20 23:56:46,391 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-20 23:56:46,392 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-20 23:56:46,408 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2021-11-20 23:56:46,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:56:46,597 INFO L732 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1, 1, 1] [2021-11-20 23:56:46,602 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-20 23:56:46,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 11:56:46 BoogieIcfgContainer [2021-11-20 23:56:46,869 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-20 23:56:46,870 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-20 23:56:46,870 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-20 23:56:46,871 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-20 23:56:46,871 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:47:49" (3/4) ... [2021-11-20 23:56:46,873 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-20 23:56:47,083 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/witness.graphml [2021-11-20 23:56:47,083 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-20 23:56:47,084 INFO L158 Benchmark]: Toolchain (without parser) took 538907.88ms. Allocated memory was 107.0MB in the beginning and 195.0MB in the end (delta: 88.1MB). Free memory was 65.6MB in the beginning and 104.3MB in the end (delta: -38.7MB). Peak memory consumption was 50.4MB. Max. memory is 16.1GB. [2021-11-20 23:56:47,084 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 107.0MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-20 23:56:47,084 INFO L158 Benchmark]: CACSL2BoogieTranslator took 306.87ms. Allocated memory is still 107.0MB. Free memory was 65.5MB in the beginning and 82.6MB in the end (delta: -17.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-20 23:56:47,085 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.97ms. Allocated memory is still 107.0MB. Free memory was 82.6MB in the beginning and 80.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-20 23:56:47,085 INFO L158 Benchmark]: Boogie Preprocessor took 25.85ms. Allocated memory is still 107.0MB. Free memory was 80.9MB in the beginning and 80.1MB in the end (delta: 835.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-20 23:56:47,086 INFO L158 Benchmark]: RCFGBuilder took 445.48ms. Allocated memory is still 107.0MB. Free memory was 80.1MB in the beginning and 69.2MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-20 23:56:47,086 INFO L158 Benchmark]: TraceAbstraction took 537854.83ms. Allocated memory was 107.0MB in the beginning and 195.0MB in the end (delta: 88.1MB). Free memory was 68.8MB in the beginning and 137.9MB in the end (delta: -69.1MB). Peak memory consumption was 128.2MB. Max. memory is 16.1GB. [2021-11-20 23:56:47,086 INFO L158 Benchmark]: Witness Printer took 213.15ms. Allocated memory is still 195.0MB. Free memory was 137.9MB in the beginning and 104.3MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2021-11-20 23:56:47,088 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37ms. Allocated memory is still 107.0MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 306.87ms. Allocated memory is still 107.0MB. Free memory was 65.5MB in the beginning and 82.6MB in the end (delta: -17.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.97ms. Allocated memory is still 107.0MB. Free memory was 82.6MB in the beginning and 80.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.85ms. Allocated memory is still 107.0MB. Free memory was 80.9MB in the beginning and 80.1MB in the end (delta: 835.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 445.48ms. Allocated memory is still 107.0MB. Free memory was 80.1MB in the beginning and 69.2MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 537854.83ms. Allocated memory was 107.0MB in the beginning and 195.0MB in the end (delta: 88.1MB). Free memory was 68.8MB in the beginning and 137.9MB in the end (delta: -69.1MB). Peak memory consumption was 128.2MB. Max. memory is 16.1GB. * Witness Printer took 213.15ms. Allocated memory is still 195.0MB. Free memory was 137.9MB in the beginning and 104.3MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 14]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int counter = 0; [L21] int A, R; [L22] long long u, v, r; [L23] A = __VERIFIER_nondet_int() [L24] R = __VERIFIER_nondet_int() [L26] CALL assume_abort_if_not(((long long) R - 1) * ((long long) R - 1) < A) VAL [\old(cond)=1, counter=0] [L9] COND FALSE !(!cond) [L26] RET assume_abort_if_not(((long long) R - 1) * ((long long) R - 1) < A) VAL [A=164691, counter=0, R=406] [L28] CALL assume_abort_if_not(A % 2 == 1) VAL [\old(cond)=1, counter=0] [L9] COND FALSE !(!cond) [L28] RET assume_abort_if_not(A % 2 == 1) VAL [A=164691, counter=0, R=406] [L30] u = ((long long) 2 * R) + 1 [L31] v = 1 [L32] r = ((long long) R * R) - A VAL [A=164691, counter=0, R=406, r=145, u=813, v=1] [L34] EXPR counter++ VAL [A=164691, counter=1, counter++=0, r=145, R=406, u=813, v=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=1] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=1, r=145, R=406, u=813, v=1] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=1, R=406, r=144, u=813, v=3] [L34] EXPR counter++ VAL [A=164691, counter=2, counter++=1, r=144, R=406, u=813, v=3] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=2] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=2, R=406, r=144, u=813, v=3] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=2, r=141, R=406, u=813, v=5] [L34] EXPR counter++ VAL [A=164691, counter=3, counter++=2, R=406, r=141, u=813, v=5] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=3] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=3, R=406, r=141, u=813, v=5] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=3, r=136, R=406, u=813, v=7] [L34] EXPR counter++ VAL [A=164691, counter=4, counter++=3, R=406, r=136, u=813, v=7] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=4] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=4, r=136, R=406, u=813, v=7] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=4, R=406, r=129, u=813, v=9] [L34] EXPR counter++ VAL [A=164691, counter=5, counter++=4, R=406, r=129, u=813, v=9] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=5] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=5, R=406, r=129, u=813, v=9] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=5, R=406, r=120, u=813, v=11] [L34] EXPR counter++ VAL [A=164691, counter=6, counter++=5, r=120, R=406, u=813, v=11] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=6] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=6, R=406, r=120, u=813, v=11] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=6, r=109, R=406, u=813, v=13] [L34] EXPR counter++ VAL [A=164691, counter=7, counter++=6, r=109, R=406, u=813, v=13] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=7] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=7, r=109, R=406, u=813, v=13] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=7, r=96, R=406, u=813, v=15] [L34] EXPR counter++ VAL [A=164691, counter=8, counter++=7, r=96, R=406, u=813, v=15] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=8] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=8, r=96, R=406, u=813, v=15] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=8, r=81, R=406, u=813, v=17] [L34] EXPR counter++ VAL [A=164691, counter=9, counter++=8, R=406, r=81, u=813, v=17] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=9] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=9, R=406, r=81, u=813, v=17] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=9, r=64, R=406, u=813, v=19] [L34] EXPR counter++ VAL [A=164691, counter=10, counter++=9, R=406, r=64, u=813, v=19] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=10] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=10, r=64, R=406, u=813, v=19] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=10, r=45, R=406, u=813, v=21] [L34] EXPR counter++ VAL [A=164691, counter=11, counter++=10, r=45, R=406, u=813, v=21] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=11] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=11, R=406, r=45, u=813, v=21] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=11, r=24, R=406, u=813, v=23] [L34] EXPR counter++ VAL [A=164691, counter=12, counter++=11, R=406, r=24, u=813, v=23] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=12] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=12, R=406, r=24, u=813, v=23] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=12, r=1, R=406, u=813, v=25] [L34] EXPR counter++ VAL [A=164691, counter=13, counter++=12, R=406, r=1, u=813, v=25] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=13] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=13, R=406, r=1, u=813, v=25] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=13, R=406, r=-24, u=813, v=27] [L34] EXPR counter++ VAL [A=164691, counter=14, counter++=13, r=-24, R=406, u=813, v=27] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=14] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=14, R=406, r=-24, u=813, v=27] [L36] COND FALSE !(!(r != 0)) [L38] COND FALSE !(r > 0) [L42] r = r + u [L43] u = u + 2 VAL [A=164691, counter=14, R=406, r=789, u=815, v=27] [L34] EXPR counter++ VAL [A=164691, counter=15, counter++=14, r=789, R=406, u=815, v=27] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=15] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=15, R=406, r=789, u=815, v=27] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=15, R=406, r=762, u=815, v=29] [L34] EXPR counter++ VAL [A=164691, counter=16, counter++=15, R=406, r=762, u=815, v=29] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=16] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=16, r=762, R=406, u=815, v=29] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=16, R=406, r=733, u=815, v=31] [L34] EXPR counter++ VAL [A=164691, counter=17, counter++=16, r=733, R=406, u=815, v=31] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=17] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=17, r=733, R=406, u=815, v=31] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=17, r=702, R=406, u=815, v=33] [L34] EXPR counter++ VAL [A=164691, counter=18, counter++=17, r=702, R=406, u=815, v=33] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=18] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=18, r=702, R=406, u=815, v=33] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=18, R=406, r=669, u=815, v=35] [L34] EXPR counter++ VAL [A=164691, counter=19, counter++=18, R=406, r=669, u=815, v=35] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=19] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=19, R=406, r=669, u=815, v=35] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=19, R=406, r=634, u=815, v=37] [L34] EXPR counter++ VAL [A=164691, counter=20, counter++=19, R=406, r=634, u=815, v=37] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=20] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=20, R=406, r=634, u=815, v=37] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=20, R=406, r=597, u=815, v=39] [L34] EXPR counter++ VAL [A=164691, counter=21, counter++=20, R=406, r=597, u=815, v=39] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=21] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=21, R=406, r=597, u=815, v=39] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=21, R=406, r=558, u=815, v=41] [L34] EXPR counter++ VAL [A=164691, counter=22, counter++=21, r=558, R=406, u=815, v=41] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=22] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=22, r=558, R=406, u=815, v=41] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=22, R=406, r=517, u=815, v=43] [L34] EXPR counter++ VAL [A=164691, counter=23, counter++=22, R=406, r=517, u=815, v=43] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=23] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=23, R=406, r=517, u=815, v=43] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=23, R=406, r=474, u=815, v=45] [L34] EXPR counter++ VAL [A=164691, counter=24, counter++=23, R=406, r=474, u=815, v=45] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=24] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=24, r=474, R=406, u=815, v=45] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=24, R=406, r=429, u=815, v=47] [L34] EXPR counter++ VAL [A=164691, counter=25, counter++=24, R=406, r=429, u=815, v=47] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=25] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=25, R=406, r=429, u=815, v=47] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=25, R=406, r=382, u=815, v=49] [L34] EXPR counter++ VAL [A=164691, counter=26, counter++=25, R=406, r=382, u=815, v=49] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=26] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=26, r=382, R=406, u=815, v=49] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=26, r=333, R=406, u=815, v=51] [L34] EXPR counter++ VAL [A=164691, counter=27, counter++=26, r=333, R=406, u=815, v=51] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=27] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=27, R=406, r=333, u=815, v=51] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=27, r=282, R=406, u=815, v=53] [L34] EXPR counter++ VAL [A=164691, counter=28, counter++=27, r=282, R=406, u=815, v=53] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=28] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=28, r=282, R=406, u=815, v=53] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=28, r=229, R=406, u=815, v=55] [L34] EXPR counter++ VAL [A=164691, counter=29, counter++=28, R=406, r=229, u=815, v=55] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=29] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=29, R=406, r=229, u=815, v=55] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=29, R=406, r=174, u=815, v=57] [L34] EXPR counter++ VAL [A=164691, counter=30, counter++=29, r=174, R=406, u=815, v=57] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=30] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=30, r=174, R=406, u=815, v=57] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=30, R=406, r=117, u=815, v=59] [L34] EXPR counter++ VAL [A=164691, counter=31, counter++=30, R=406, r=117, u=815, v=59] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=31] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=31, R=406, r=117, u=815, v=59] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=31, r=58, R=406, u=815, v=61] [L34] EXPR counter++ VAL [A=164691, counter=32, counter++=31, r=58, R=406, u=815, v=61] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=32] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=32, r=58, R=406, u=815, v=61] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=32, R=406, r=-3, u=815, v=63] [L34] EXPR counter++ VAL [A=164691, counter=33, counter++=32, r=-3, R=406, u=815, v=63] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=33] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=33, R=406, r=-3, u=815, v=63] [L36] COND FALSE !(!(r != 0)) [L38] COND FALSE !(r > 0) [L42] r = r + u [L43] u = u + 2 VAL [A=164691, counter=33, R=406, r=812, u=817, v=63] [L34] EXPR counter++ VAL [A=164691, counter=34, counter++=33, r=812, R=406, u=817, v=63] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=34] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=34, r=812, R=406, u=817, v=63] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=34, r=749, R=406, u=817, v=65] [L34] EXPR counter++ VAL [A=164691, counter=35, counter++=34, r=749, R=406, u=817, v=65] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=35] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=35, R=406, r=749, u=817, v=65] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=35, R=406, r=684, u=817, v=67] [L34] EXPR counter++ VAL [A=164691, counter=36, counter++=35, R=406, r=684, u=817, v=67] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=36] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=36, r=684, R=406, u=817, v=67] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=36, r=617, R=406, u=817, v=69] [L34] EXPR counter++ VAL [A=164691, counter=37, counter++=36, r=617, R=406, u=817, v=69] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=37] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=37, r=617, R=406, u=817, v=69] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=37, r=548, R=406, u=817, v=71] [L34] EXPR counter++ VAL [A=164691, counter=38, counter++=37, r=548, R=406, u=817, v=71] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=38] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=38, r=548, R=406, u=817, v=71] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=38, r=477, R=406, u=817, v=73] [L34] EXPR counter++ VAL [A=164691, counter=39, counter++=38, r=477, R=406, u=817, v=73] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=39] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=39, r=477, R=406, u=817, v=73] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=39, R=406, r=404, u=817, v=75] [L34] EXPR counter++ VAL [A=164691, counter=40, counter++=39, r=404, R=406, u=817, v=75] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=40] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=40, R=406, r=404, u=817, v=75] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=40, r=329, R=406, u=817, v=77] [L34] EXPR counter++ VAL [A=164691, counter=41, counter++=40, r=329, R=406, u=817, v=77] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=41] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=41, r=329, R=406, u=817, v=77] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=41, R=406, r=252, u=817, v=79] [L34] EXPR counter++ VAL [A=164691, counter=42, counter++=41, r=252, R=406, u=817, v=79] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=42] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=42, R=406, r=252, u=817, v=79] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=42, R=406, r=173, u=817, v=81] [L34] EXPR counter++ VAL [A=164691, counter=43, counter++=42, R=406, r=173, u=817, v=81] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=43] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=43, r=173, R=406, u=817, v=81] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=43, R=406, r=92, u=817, v=83] [L34] EXPR counter++ VAL [A=164691, counter=44, counter++=43, R=406, r=92, u=817, v=83] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=44] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=44, R=406, r=92, u=817, v=83] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=44, R=406, r=9, u=817, v=85] [L34] EXPR counter++ VAL [A=164691, counter=45, counter++=44, r=9, R=406, u=817, v=85] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=45] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=45, R=406, r=9, u=817, v=85] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=45, r=-76, R=406, u=817, v=87] [L34] EXPR counter++ VAL [A=164691, counter=46, counter++=45, r=-76, R=406, u=817, v=87] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=46] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=46, r=-76, R=406, u=817, v=87] [L36] COND FALSE !(!(r != 0)) [L38] COND FALSE !(r > 0) [L42] r = r + u [L43] u = u + 2 VAL [A=164691, counter=46, r=741, R=406, u=819, v=87] [L34] EXPR counter++ VAL [A=164691, counter=47, counter++=46, R=406, r=741, u=819, v=87] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=47] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=47, r=741, R=406, u=819, v=87] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=47, R=406, r=654, u=819, v=89] [L34] EXPR counter++ VAL [A=164691, counter=48, counter++=47, r=654, R=406, u=819, v=89] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=48] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=48, R=406, r=654, u=819, v=89] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=48, R=406, r=565, u=819, v=91] [L34] EXPR counter++ VAL [A=164691, counter=49, counter++=48, R=406, r=565, u=819, v=91] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=49] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=49, R=406, r=565, u=819, v=91] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=49, r=474, R=406, u=819, v=93] [L34] EXPR counter++ VAL [A=164691, counter=50, counter++=49, r=474, R=406, u=819, v=93] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=50] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=50, r=474, R=406, u=819, v=93] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=50, r=381, R=406, u=819, v=95] [L34] EXPR counter++ VAL [A=164691, counter=51, counter++=50, R=406, r=381, u=819, v=95] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=51] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=51] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=51, R=406, r=381, u=819, v=95] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=51, R=406, r=286, u=819, v=97] [L34] EXPR counter++ VAL [A=164691, counter=52, counter++=51, r=286, R=406, u=819, v=97] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=52] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=52] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=52, r=286, R=406, u=819, v=97] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=52, r=189, R=406, u=819, v=99] [L34] EXPR counter++ VAL [A=164691, counter=53, counter++=52, r=189, R=406, u=819, v=99] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=53] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=53] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=53, r=189, R=406, u=819, v=99] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=53, r=90, R=406, u=819, v=101] [L34] EXPR counter++ VAL [A=164691, counter=54, counter++=53, r=90, R=406, u=819, v=101] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=54] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=54] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=54, r=90, R=406, u=819, v=101] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=54, R=406, r=-11, u=819, v=103] [L34] EXPR counter++ VAL [A=164691, counter=55, counter++=54, r=-11, R=406, u=819, v=103] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=55] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=55] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=55, R=406, r=-11, u=819, v=103] [L36] COND FALSE !(!(r != 0)) [L38] COND FALSE !(r > 0) [L42] r = r + u [L43] u = u + 2 VAL [A=164691, counter=55, r=808, R=406, u=821, v=103] [L34] EXPR counter++ VAL [A=164691, counter=56, counter++=55, R=406, r=808, u=821, v=103] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=56] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=56] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=56, r=808, R=406, u=821, v=103] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=56, r=705, R=406, u=821, v=105] [L34] EXPR counter++ VAL [A=164691, counter=57, counter++=56, r=705, R=406, u=821, v=105] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=57] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=57] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=57, R=406, r=705, u=821, v=105] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=57, R=406, r=600, u=821, v=107] [L34] EXPR counter++ VAL [A=164691, counter=58, counter++=57, r=600, R=406, u=821, v=107] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=58] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=58] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=58, r=600, R=406, u=821, v=107] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=58, r=493, R=406, u=821, v=109] [L34] EXPR counter++ VAL [A=164691, counter=59, counter++=58, R=406, r=493, u=821, v=109] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=59] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=59] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=59, R=406, r=493, u=821, v=109] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=59, r=384, R=406, u=821, v=111] [L34] EXPR counter++ VAL [A=164691, counter=60, counter++=59, r=384, R=406, u=821, v=111] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=60] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=60] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=60, R=406, r=384, u=821, v=111] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=60, r=273, R=406, u=821, v=113] [L34] EXPR counter++ VAL [A=164691, counter=61, counter++=60, r=273, R=406, u=821, v=113] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=61] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=61] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=61, R=406, r=273, u=821, v=113] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=61, r=160, R=406, u=821, v=115] [L34] EXPR counter++ VAL [A=164691, counter=62, counter++=61, r=160, R=406, u=821, v=115] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=62] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=62] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=62, R=406, r=160, u=821, v=115] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=62, r=45, R=406, u=821, v=117] [L34] EXPR counter++ VAL [A=164691, counter=63, counter++=62, r=45, R=406, u=821, v=117] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=63] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=63] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=63, R=406, r=45, u=821, v=117] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=63, r=-72, R=406, u=821, v=119] [L34] EXPR counter++ VAL [A=164691, counter=64, counter++=63, R=406, r=-72, u=821, v=119] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=64] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=64] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=64, R=406, r=-72, u=821, v=119] [L36] COND FALSE !(!(r != 0)) [L38] COND FALSE !(r > 0) [L42] r = r + u [L43] u = u + 2 VAL [A=164691, counter=64, r=749, R=406, u=823, v=119] [L34] EXPR counter++ VAL [A=164691, counter=65, counter++=64, R=406, r=749, u=823, v=119] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=65] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=65] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=65, R=406, r=749, u=823, v=119] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=65, R=406, r=630, u=823, v=121] [L34] EXPR counter++ VAL [A=164691, counter=66, counter++=65, r=630, R=406, u=823, v=121] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=66] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=66] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=66, r=630, R=406, u=823, v=121] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=66, r=509, R=406, u=823, v=123] [L34] EXPR counter++ VAL [A=164691, counter=67, counter++=66, R=406, r=509, u=823, v=123] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=67] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=67] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=67, r=509, R=406, u=823, v=123] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=67, R=406, r=386, u=823, v=125] [L34] EXPR counter++ VAL [A=164691, counter=68, counter++=67, r=386, R=406, u=823, v=125] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=68] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=68] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=68, R=406, r=386, u=823, v=125] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=68, r=261, R=406, u=823, v=127] [L34] EXPR counter++ VAL [A=164691, counter=69, counter++=68, R=406, r=261, u=823, v=127] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=69] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=69] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=69, r=261, R=406, u=823, v=127] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=69, r=134, R=406, u=823, v=129] [L34] EXPR counter++ VAL [A=164691, counter=70, counter++=69, R=406, r=134, u=823, v=129] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=70] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=70] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=70, r=134, R=406, u=823, v=129] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=70, R=406, r=5, u=823, v=131] [L34] EXPR counter++ VAL [A=164691, counter=71, counter++=70, R=406, r=5, u=823, v=131] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=71] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=71] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=71, R=406, r=5, u=823, v=131] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=71, r=-126, R=406, u=823, v=133] [L34] EXPR counter++ VAL [A=164691, counter=72, counter++=71, R=406, r=-126, u=823, v=133] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=72] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=72] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=72, R=406, r=-126, u=823, v=133] [L36] COND FALSE !(!(r != 0)) [L38] COND FALSE !(r > 0) [L42] r = r + u [L43] u = u + 2 VAL [A=164691, counter=72, R=406, r=697, u=825, v=133] [L34] EXPR counter++ VAL [A=164691, counter=73, counter++=72, R=406, r=697, u=825, v=133] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=73] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=73] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=73, r=697, R=406, u=825, v=133] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=73, R=406, r=564, u=825, v=135] [L34] EXPR counter++ VAL [A=164691, counter=74, counter++=73, r=564, R=406, u=825, v=135] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=74] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=74] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=74, R=406, r=564, u=825, v=135] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=74, R=406, r=429, u=825, v=137] [L34] EXPR counter++ VAL [A=164691, counter=75, counter++=74, r=429, R=406, u=825, v=137] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=75] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=75] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=75, r=429, R=406, u=825, v=137] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=75, r=292, R=406, u=825, v=139] [L34] EXPR counter++ VAL [A=164691, counter=76, counter++=75, R=406, r=292, u=825, v=139] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=76] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=76] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=76, R=406, r=292, u=825, v=139] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=76, R=406, r=153, u=825, v=141] [L34] EXPR counter++ VAL [A=164691, counter=77, counter++=76, r=153, R=406, u=825, v=141] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=77] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=77] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=77, R=406, r=153, u=825, v=141] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=77, r=12, R=406, u=825, v=143] [L34] EXPR counter++ VAL [A=164691, counter=78, counter++=77, r=12, R=406, u=825, v=143] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=78] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=78] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=78, R=406, r=12, u=825, v=143] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=78, R=406, r=-131, u=825, v=145] [L34] EXPR counter++ VAL [A=164691, counter=79, counter++=78, r=-131, R=406, u=825, v=145] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=79] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=79] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=79, R=406, r=-131, u=825, v=145] [L36] COND FALSE !(!(r != 0)) [L38] COND FALSE !(r > 0) [L42] r = r + u [L43] u = u + 2 VAL [A=164691, counter=79, R=406, r=694, u=827, v=145] [L34] EXPR counter++ VAL [A=164691, counter=80, counter++=79, r=694, R=406, u=827, v=145] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=80] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=80] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=80, R=406, r=694, u=827, v=145] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=80, R=406, r=549, u=827, v=147] [L34] EXPR counter++ VAL [A=164691, counter=81, counter++=80, R=406, r=549, u=827, v=147] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=81] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=81] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=81, r=549, R=406, u=827, v=147] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=81, r=402, R=406, u=827, v=149] [L34] EXPR counter++ VAL [A=164691, counter=82, counter++=81, r=402, R=406, u=827, v=149] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=82] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=82] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=82, R=406, r=402, u=827, v=149] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=82, R=406, r=253, u=827, v=151] [L34] EXPR counter++ VAL [A=164691, counter=83, counter++=82, R=406, r=253, u=827, v=151] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=83] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=83] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=83, r=253, R=406, u=827, v=151] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=83, r=102, R=406, u=827, v=153] [L34] EXPR counter++ VAL [A=164691, counter=84, counter++=83, r=102, R=406, u=827, v=153] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=84] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=84] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=84, R=406, r=102, u=827, v=153] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=84, R=406, r=-51, u=827, v=155] [L34] EXPR counter++ VAL [A=164691, counter=85, counter++=84, r=-51, R=406, u=827, v=155] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=85] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=85] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=85, r=-51, R=406, u=827, v=155] [L36] COND FALSE !(!(r != 0)) [L38] COND FALSE !(r > 0) [L42] r = r + u [L43] u = u + 2 VAL [A=164691, counter=85, R=406, r=776, u=829, v=155] [L34] EXPR counter++ VAL [A=164691, counter=86, counter++=85, r=776, R=406, u=829, v=155] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=86] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=86] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=86, r=776, R=406, u=829, v=155] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=86, R=406, r=621, u=829, v=157] [L34] EXPR counter++ VAL [A=164691, counter=87, counter++=86, R=406, r=621, u=829, v=157] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=87] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=87] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=87, r=621, R=406, u=829, v=157] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=87, R=406, r=464, u=829, v=159] [L34] EXPR counter++ VAL [A=164691, counter=88, counter++=87, R=406, r=464, u=829, v=159] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=88] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=88] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=88, r=464, R=406, u=829, v=159] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=88, R=406, r=305, u=829, v=161] [L34] EXPR counter++ VAL [A=164691, counter=89, counter++=88, r=305, R=406, u=829, v=161] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=89] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=89] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=89, R=406, r=305, u=829, v=161] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=89, R=406, r=144, u=829, v=163] [L34] EXPR counter++ VAL [A=164691, counter=90, counter++=89, r=144, R=406, u=829, v=163] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=90] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=90] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=90, r=144, R=406, u=829, v=163] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=90, R=406, r=-19, u=829, v=165] [L34] EXPR counter++ VAL [A=164691, counter=91, counter++=90, r=-19, R=406, u=829, v=165] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=91] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=91] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=91, R=406, r=-19, u=829, v=165] [L36] COND FALSE !(!(r != 0)) [L38] COND FALSE !(r > 0) [L42] r = r + u [L43] u = u + 2 VAL [A=164691, counter=91, R=406, r=810, u=831, v=165] [L34] EXPR counter++ VAL [A=164691, counter=92, counter++=91, R=406, r=810, u=831, v=165] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=92] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=92] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=92, r=810, R=406, u=831, v=165] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=92, r=645, R=406, u=831, v=167] [L34] EXPR counter++ VAL [A=164691, counter=93, counter++=92, R=406, r=645, u=831, v=167] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=93] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=93] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=93, R=406, r=645, u=831, v=167] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=93, r=478, R=406, u=831, v=169] [L34] EXPR counter++ VAL [A=164691, counter=94, counter++=93, R=406, r=478, u=831, v=169] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=94] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=94] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=94, r=478, R=406, u=831, v=169] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=94, R=406, r=309, u=831, v=171] [L34] EXPR counter++ VAL [A=164691, counter=95, counter++=94, r=309, R=406, u=831, v=171] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=95] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=95] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=95, R=406, r=309, u=831, v=171] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=95, R=406, r=138, u=831, v=173] [L34] EXPR counter++ VAL [A=164691, counter=96, counter++=95, R=406, r=138, u=831, v=173] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=96] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=96] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=96, R=406, r=138, u=831, v=173] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=96, r=-35, R=406, u=831, v=175] [L34] EXPR counter++ VAL [A=164691, counter=97, counter++=96, r=-35, R=406, u=831, v=175] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=97] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=97] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=97, R=406, r=-35, u=831, v=175] [L36] COND FALSE !(!(r != 0)) [L38] COND FALSE !(r > 0) [L42] r = r + u [L43] u = u + 2 VAL [A=164691, counter=97, r=796, R=406, u=833, v=175] [L34] EXPR counter++ VAL [A=164691, counter=98, counter++=97, R=406, r=796, u=833, v=175] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=98] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=98] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=98, R=406, r=796, u=833, v=175] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=98, r=621, R=406, u=833, v=177] [L34] EXPR counter++ VAL [A=164691, counter=99, counter++=98, R=406, r=621, u=833, v=177] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=99] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=99] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=99, R=406, r=621, u=833, v=177] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=99, R=406, r=444, u=833, v=179] [L34] EXPR counter++ VAL [A=164691, counter=100, counter++=99, r=444, R=406, u=833, v=179] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=100] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=100] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=164691, counter=100, R=406, r=444, u=833, v=179] [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=164691, counter=100, r=265, R=406, u=833, v=181] [L34] EXPR counter++ VAL [A=164691, counter=101, counter++=100, R=406, r=265, u=833, v=181] [L34] COND FALSE !(counter++<100) [L48] CALL __VERIFIER_assert(((long long) 4*A) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=0, counter=101] [L12] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=101] [L14] reach_error() VAL [\old(cond)=0, cond=0, counter=101] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 537.5s, OverallIterations: 13, TraceHistogramMax: 101, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.1s, AutomataDifference: 35.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 2876 SdHoareTripleChecker+Valid, 11.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2873 mSDsluCounter, 2098 SdHoareTripleChecker+Invalid, 10.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 12 IncrementalHoareTripleChecker+Unchecked, 1983 mSDsCounter, 1162 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2435 IncrementalHoareTripleChecker+Invalid, 3611 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1162 mSolverCounterUnsat, 438 mSDtfsCounter, 2435 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5007 GetRequests, 4287 SyntacticMatches, 4 SemanticMatches, 716 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21843 ImplicationChecksByTransitivity, 58.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=813occurred in iteration=12, InterpolantAutomatonStates: 605, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 316.2s SatisfiabilityAnalysisTime, 48.3s InterpolantComputationTime, 2425 NumberOfCodeBlocks, 2425 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 3160 ConstructedInterpolants, 3 QuantifiedInterpolants, 8496 SizeOfPredicates, 196 NumberOfNonLiveVariables, 3686 ConjunctsInSsa, 420 ConjunctsInUnsatCore, 21 InterpolantComputations, 3 PerfectInterpolantSequences, 23531/92504 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: OVERALL_TIME: 10.0s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 3, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 17, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 14, TOOLS_POST_TIME: 2.9s, TOOLS_POST_CALL_APPLICATIONS: 10, TOOLS_POST_CALL_TIME: 4.0s, TOOLS_POST_RETURN_APPLICATIONS: 6, TOOLS_POST_RETURN_TIME: 2.8s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 30, TOOLS_QUANTIFIERELIM_TIME: 9.7s, TOOLS_QUANTIFIERELIM_MAX_TIME: 1.1s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 46, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 10, DOMAIN_JOIN_TIME: 0.1s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 0, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 17, DOMAIN_ISBOTTOM_TIME: 0.1s, LOOP_SUMMARIZER_APPLICATIONS: 0, LOOP_SUMMARIZER_CACHE_MISSES: 0, LOOP_SUMMARIZER_OVERALL_TIME: 0.0s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 0, CALL_SUMMARIZER_APPLICATIONS: 6, CALL_SUMMARIZER_CACHE_MISSES: 2, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 145, DAG_COMPRESSION_RETAINED_NODES: 50, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-11-20 23:56:47,148 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e27602e-3722-4f7e-8881-fb6ead15cb55/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE