./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/mannadiv_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_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/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_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/config/TaipanReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound100.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/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_7e3bab56-614a-4092-86ee-dfa81d729034/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 0bd5c2784fe43830be309c722c3fa9fc4d3ef116c17a8343acb2a2dfbcf830c0 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-20 23:42:41,981 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 23:42:41,984 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 23:42:42,049 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 23:42:42,050 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 23:42:42,054 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 23:42:42,057 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 23:42:42,061 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 23:42:42,064 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 23:42:42,071 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 23:42:42,072 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 23:42:42,074 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 23:42:42,075 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 23:42:42,078 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 23:42:42,080 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 23:42:42,089 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 23:42:42,092 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 23:42:42,093 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 23:42:42,096 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 23:42:42,105 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 23:42:42,108 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 23:42:42,111 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 23:42:42,115 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 23:42:42,116 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 23:42:42,127 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 23:42:42,128 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 23:42:42,128 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 23:42:42,131 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 23:42:42,132 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 23:42:42,134 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 23:42:42,134 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 23:42:42,135 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 23:42:42,138 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 23:42:42,139 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 23:42:42,141 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 23:42:42,142 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 23:42:42,143 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 23:42:42,143 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 23:42:42,143 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 23:42:42,145 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 23:42:42,145 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 23:42:42,146 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-20 23:42:42,194 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 23:42:42,195 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 23:42:42,196 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 23:42:42,196 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 23:42:42,197 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-20 23:42:42,204 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-20 23:42:42,205 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-20 23:42:42,205 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-20 23:42:42,205 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-20 23:42:42,206 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-20 23:42:42,207 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-20 23:42:42,207 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-20 23:42:42,207 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-20 23:42:42,208 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-20 23:42:42,208 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-20 23:42:42,208 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-20 23:42:42,209 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-20 23:42:42,209 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-20 23:42:42,210 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 23:42:42,211 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-20 23:42:42,211 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-20 23:42:42,211 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-20 23:42:42,212 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 23:42:42,212 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-20 23:42:42,212 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-20 23:42:42,212 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-20 23:42:42,213 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-20 23:42:42,213 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-20 23:42:42,213 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 23:42:42,214 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-20 23:42:42,214 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 23:42:42,215 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-20 23:42:42,215 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 23:42:42,215 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 23:42:42,216 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-20 23:42:42,216 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-20 23:42:42,216 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-20 23:42:42,216 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-20 23:42:42,217 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-20 23:42:42,217 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 23:42:42,217 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-20 23:42:42,218 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_7e3bab56-614a-4092-86ee-dfa81d729034/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_7e3bab56-614a-4092-86ee-dfa81d729034/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 -> 0bd5c2784fe43830be309c722c3fa9fc4d3ef116c17a8343acb2a2dfbcf830c0 [2021-11-20 23:42:42,516 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 23:42:42,544 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 23:42:42,547 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 23:42:42,548 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 23:42:42,550 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 23:42:42,551 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound100.c [2021-11-20 23:42:42,632 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/data/3faffa36c/d74d1f4b23f24d5f810c48040ebdb6c0/FLAG18f915842 [2021-11-20 23:42:43,176 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 23:42:43,178 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound100.c [2021-11-20 23:42:43,192 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/data/3faffa36c/d74d1f4b23f24d5f810c48040ebdb6c0/FLAG18f915842 [2021-11-20 23:42:43,528 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/data/3faffa36c/d74d1f4b23f24d5f810c48040ebdb6c0 [2021-11-20 23:42:43,531 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 23:42:43,532 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 23:42:43,535 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 23:42:43,536 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 23:42:43,554 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 23:42:43,555 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:42:43" (1/1) ... [2021-11-20 23:42:43,556 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34d27095 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:42:43, skipping insertion in model container [2021-11-20 23:42:43,556 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:42:43" (1/1) ... [2021-11-20 23:42:43,566 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 23:42:43,583 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 23:42:43,766 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_7e3bab56-614a-4092-86ee-dfa81d729034/sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound100.c[573,586] [2021-11-20 23:42:43,789 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 23:42:43,797 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 23:42:43,816 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_7e3bab56-614a-4092-86ee-dfa81d729034/sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound100.c[573,586] [2021-11-20 23:42:43,821 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 23:42:43,837 INFO L208 MainTranslator]: Completed translation [2021-11-20 23:42:43,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:42:43 WrapperNode [2021-11-20 23:42:43,837 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 23:42:43,839 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 23:42:43,839 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 23:42:43,839 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 23:42:43,848 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:42:43" (1/1) ... [2021-11-20 23:42:43,859 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:42:43" (1/1) ... [2021-11-20 23:42:43,884 INFO L137 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 47 [2021-11-20 23:42:43,885 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 23:42:43,886 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 23:42:43,887 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 23:42:43,887 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 23:42:43,897 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:42:43" (1/1) ... [2021-11-20 23:42:43,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:42:43" (1/1) ... [2021-11-20 23:42:43,902 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:42:43" (1/1) ... [2021-11-20 23:42:43,902 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:42:43" (1/1) ... [2021-11-20 23:42:43,906 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:42:43" (1/1) ... [2021-11-20 23:42:43,910 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:42:43" (1/1) ... [2021-11-20 23:42:43,911 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:42:43" (1/1) ... [2021-11-20 23:42:43,913 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 23:42:43,914 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 23:42:43,914 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 23:42:43,914 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 23:42:43,915 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:42:43" (1/1) ... [2021-11-20 23:42:43,924 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 23:42:43,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:42:43,971 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-20 23:42:43,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-20 23:42:44,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-20 23:42:44,029 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-11-20 23:42:44,029 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-11-20 23:42:44,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-20 23:42:44,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 23:42:44,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 23:42:44,030 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-11-20 23:42:44,031 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-11-20 23:42:44,091 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 23:42:44,093 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 23:42:44,237 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 23:42:44,279 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 23:42:44,279 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-20 23:42:44,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:42:44 BoogieIcfgContainer [2021-11-20 23:42:44,282 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 23:42:44,288 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-20 23:42:44,288 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-20 23:42:44,292 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-20 23:42:44,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:42:43" (1/3) ... [2021-11-20 23:42:44,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@594a0d6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:42:44, skipping insertion in model container [2021-11-20 23:42:44,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:42:43" (2/3) ... [2021-11-20 23:42:44,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@594a0d6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:42:44, skipping insertion in model container [2021-11-20 23:42:44,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:42:44" (3/3) ... [2021-11-20 23:42:44,296 INFO L111 eAbstractionObserver]: Analyzing ICFG mannadiv_unwindbound100.c [2021-11-20 23:42:44,311 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-20 23:42:44,312 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-20 23:42:44,414 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-20 23:42:44,429 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:42:44,429 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-20 23:42:44,477 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:42:44,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-20 23:42:44,483 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:42:44,483 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:42:44,484 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 23:42:44,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:42:44,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1046920148, now seen corresponding path program 1 times [2021-11-20 23:42:44,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:42:44,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288434228] [2021-11-20 23:42:44,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:42:44,513 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:42:44,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:42:44,751 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:42:44,752 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:42:44,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288434228] [2021-11-20 23:42:44,753 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288434228] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:42:44,754 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:42:44,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-20 23:42:44,757 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734764810] [2021-11-20 23:42:44,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:42:44,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-20 23:42:44,763 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:42:44,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-20 23:42:44,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-20 23:42:44,811 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:42:44,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:42:44,873 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2021-11-20 23:42:44,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-20 23:42:44,877 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:42:44,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:42:44,887 INFO L225 Difference]: With dead ends: 32 [2021-11-20 23:42:44,887 INFO L226 Difference]: Without dead ends: 17 [2021-11-20 23:42:44,898 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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:42:44,904 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:42:44,907 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:42:44,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-11-20 23:42:44,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-11-20 23:42:44,977 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:42:44,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2021-11-20 23:42:44,981 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 13 [2021-11-20 23:42:44,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:42:44,990 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2021-11-20 23:42:44,991 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:42:44,991 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2021-11-20 23:42:44,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-20 23:42:44,994 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:42:44,994 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:42:44,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-20 23:42:44,996 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 23:42:45,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:42:45,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1317434454, now seen corresponding path program 1 times [2021-11-20 23:42:45,001 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:42:45,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098000099] [2021-11-20 23:42:45,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:42:45,002 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:42:45,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:42:45,127 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:42:45,127 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:42:45,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098000099] [2021-11-20 23:42:45,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098000099] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:42:45,128 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:42:45,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 23:42:45,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628630264] [2021-11-20 23:42:45,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:42:45,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 23:42:45,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:42:45,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 23:42:45,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-20 23:42:45,133 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), 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:42:45,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:42:45,163 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2021-11-20 23:42:45,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 23:42:45,164 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) 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:42:45,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:42:45,166 INFO L225 Difference]: With dead ends: 26 [2021-11-20 23:42:45,169 INFO L226 Difference]: Without dead ends: 19 [2021-11-20 23:42:45,170 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:42:45,172 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 3 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 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:42:45,182 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 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:42:45,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-11-20 23:42:45,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-11-20 23:42:45,189 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:42:45,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2021-11-20 23:42:45,190 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 14 [2021-11-20 23:42:45,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:42:45,191 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2021-11-20 23:42:45,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) 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:42:45,191 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2021-11-20 23:42:45,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-20 23:42:45,192 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:42:45,193 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:42:45,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-20 23:42:45,193 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 23:42:45,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:42:45,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1319221914, now seen corresponding path program 1 times [2021-11-20 23:42:45,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:42:45,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587958780] [2021-11-20 23:42:45,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:42:45,202 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:42:45,228 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 23:42:45,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1408991119] [2021-11-20 23:42:45,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:42:45,229 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:42:45,229 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:42:45,239 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:42:45,246 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-20 23:42:45,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:42:45,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-20 23:42:45,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:42:45,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:42:45,779 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 23:42:45,779 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:42:45,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587958780] [2021-11-20 23:42:45,780 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 23:42:45,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408991119] [2021-11-20 23:42:45,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408991119] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:42:45,783 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:42:45,783 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-20 23:42:45,787 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177711848] [2021-11-20 23:42:45,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:42:45,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-20 23:42:45,789 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:42:45,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-20 23:42:45,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-20 23:42:45,790 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 23:42:45,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:42:45,908 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2021-11-20 23:42:45,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-20 23:42:45,909 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2021-11-20 23:42:45,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:42:45,912 INFO L225 Difference]: With dead ends: 28 [2021-11-20 23:42:45,912 INFO L226 Difference]: Without dead ends: 26 [2021-11-20 23:42:45,914 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-11-20 23:42:45,919 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 14 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 23:42:45,920 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 68 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 23:42:45,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-11-20 23:42:45,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2021-11-20 23:42:45,927 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:42:45,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2021-11-20 23:42:45,928 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 14 [2021-11-20 23:42:45,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:42:45,929 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2021-11-20 23:42:45,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 23:42:45,929 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2021-11-20 23:42:45,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-20 23:42:45,933 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:42:45,934 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:42:45,978 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-20 23:42:46,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:42:46,158 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 23:42:46,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:42:46,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1562521278, now seen corresponding path program 1 times [2021-11-20 23:42:46,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:42:46,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416078038] [2021-11-20 23:42:46,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:42:46,160 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:42:46,172 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 23:42:46,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1475724033] [2021-11-20 23:42:46,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:42:46,173 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:42:46,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:42:46,175 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:42:46,188 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-20 23:42:46,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:42:46,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-20 23:42:46,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:42:46,393 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:42:46,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:42:46,598 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:42:46,599 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:42:46,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416078038] [2021-11-20 23:42:46,600 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 23:42:46,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475724033] [2021-11-20 23:42:46,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475724033] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:42:46,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2027016732] [2021-11-20 23:42:46,633 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-20 23:42:46,633 INFO L166 IcfgInterpreter]: Building call graph [2021-11-20 23:42:46,638 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-20 23:42:46,645 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-20 23:42:46,646 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-20 23:42:48,533 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 40 for LOIs [2021-11-20 23:42:48,688 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 53 for LOIs [2021-11-20 23:42:48,802 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-20 23:42:49,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSifa [2027016732] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:42:49,685 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-20 23:42:49,685 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [8, 8] total 21 [2021-11-20 23:42:49,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903513717] [2021-11-20 23:42:49,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:42:49,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-20 23:42:49,687 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:42:49,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-20 23:42:49,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2021-11-20 23:42:49,689 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:42:49,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:42:49,876 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2021-11-20 23:42:49,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-20 23:42:49,877 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:42:49,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:42:49,878 INFO L225 Difference]: With dead ends: 32 [2021-11-20 23:42:49,878 INFO L226 Difference]: Without dead ends: 25 [2021-11-20 23:42:49,879 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2021-11-20 23:42:49,881 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 7 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:42:49,881 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 45 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 23:42:49,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-11-20 23:42:49,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2021-11-20 23:42:49,889 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:42:49,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2021-11-20 23:42:49,891 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 20 [2021-11-20 23:42:49,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:42:49,892 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2021-11-20 23:42:49,892 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:42:49,892 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2021-11-20 23:42:49,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-20 23:42:49,893 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:42:49,894 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:42:49,938 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-20 23:42:50,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:42:50,123 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 23:42:50,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:42:50,124 INFO L85 PathProgramCache]: Analyzing trace with hash -182192907, now seen corresponding path program 1 times [2021-11-20 23:42:50,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:42:50,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509994215] [2021-11-20 23:42:50,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:42:50,125 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:42:50,137 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 23:42:50,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [816169316] [2021-11-20 23:42:50,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:42:50,138 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:42:50,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:42:50,139 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:42:50,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-20 23:42:50,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:42:50,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-20 23:42:50,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:42:50,281 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:42:50,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:42:50,370 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:42:50,371 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:42:50,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509994215] [2021-11-20 23:42:50,371 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 23:42:50,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816169316] [2021-11-20 23:42:50,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816169316] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:42:50,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1474740580] [2021-11-20 23:42:50,375 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-20 23:42:50,375 INFO L166 IcfgInterpreter]: Building call graph [2021-11-20 23:42:50,376 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-20 23:42:50,376 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-20 23:42:50,376 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-20 23:42:54,449 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 16 for LOIs [2021-11-20 23:42:54,550 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 53 for LOIs [2021-11-20 23:42:54,668 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-20 23:42:55,329 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-20 23:42:55,330 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 23:42:55,330 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2021-11-20 23:42:55,330 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780188501] [2021-11-20 23:42:55,330 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 23:42:55,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-20 23:42:55,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:42:55,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-20 23:42:55,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2021-11-20 23:42:55,332 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:42:55,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:42:55,430 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2021-11-20 23:42:55,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-20 23:42:55,431 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:42:55,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:42:55,433 INFO L225 Difference]: With dead ends: 56 [2021-11-20 23:42:55,433 INFO L226 Difference]: Without dead ends: 49 [2021-11-20 23:42:55,436 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2021-11-20 23:42:55,437 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 24 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 23:42:55,438 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 69 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 23:42:55,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-11-20 23:42:55,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2021-11-20 23:42:55,447 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:42:55,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2021-11-20 23:42:55,449 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 22 [2021-11-20 23:42:55,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:42:55,449 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2021-11-20 23:42:55,449 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:42:55,449 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2021-11-20 23:42:55,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-20 23:42:55,456 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:42:55,456 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:42:55,499 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-20 23:42:55,670 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:42:55,670 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 23:42:55,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:42:55,671 INFO L85 PathProgramCache]: Analyzing trace with hash -180405447, now seen corresponding path program 1 times [2021-11-20 23:42:55,671 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:42:55,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570656846] [2021-11-20 23:42:55,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:42:55,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:42:55,694 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 23:42:55,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [398641734] [2021-11-20 23:42:55,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:42:55,695 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:42:55,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:42:55,698 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:42:55,704 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-20 23:42:55,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:42:55,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-20 23:42:55,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:42:55,966 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:42:55,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:42:56,115 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:42:56,115 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:42:56,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570656846] [2021-11-20 23:42:56,116 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 23:42:56,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398641734] [2021-11-20 23:42:56,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398641734] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:42:56,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1528417633] [2021-11-20 23:42:56,122 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2021-11-20 23:42:56,122 INFO L166 IcfgInterpreter]: Building call graph [2021-11-20 23:42:56,123 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-20 23:42:56,123 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-20 23:42:56,123 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-20 23:42:59,561 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 19 for LOIs [2021-11-20 23:42:59,670 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 53 for LOIs [2021-11-20 23:42:59,795 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-20 23:43:00,395 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-20 23:43:00,395 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 23:43:00,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2021-11-20 23:43:00,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412588078] [2021-11-20 23:43:00,396 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 23:43:00,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-20 23:43:00,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:43:00,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-20 23:43:00,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2021-11-20 23:43:00,400 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 10 states, 10 states have (on average 2.2) 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:43:00,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:43:00,510 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2021-11-20 23:43:00,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 23:43:00,511 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) 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:43:00,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:43:00,512 INFO L225 Difference]: With dead ends: 59 [2021-11-20 23:43:00,512 INFO L226 Difference]: Without dead ends: 51 [2021-11-20 23:43:00,513 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2021-11-20 23:43:00,514 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 15 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 23:43:00,515 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 85 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 23:43:00,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-11-20 23:43:00,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2021-11-20 23:43:00,524 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:43:00,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2021-11-20 23:43:00,525 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 22 [2021-11-20 23:43:00,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:43:00,525 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2021-11-20 23:43:00,526 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) 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:43:00,526 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2021-11-20 23:43:00,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 23:43:00,527 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:43:00,527 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:43:00,560 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-11-20 23:43:00,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-11-20 23:43:00,744 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 23:43:00,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:43:00,745 INFO L85 PathProgramCache]: Analyzing trace with hash 408559265, now seen corresponding path program 1 times [2021-11-20 23:43:00,745 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:43:00,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346795278] [2021-11-20 23:43:00,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:43:00,745 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:43:00,755 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 23:43:00,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [293273219] [2021-11-20 23:43:00,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:43:00,756 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:43:00,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:43:00,757 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:43:00,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-20 23:43:00,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:43:00,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-20 23:43:00,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:43:00,909 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:43:00,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:43:01,057 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:43:01,057 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:43:01,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346795278] [2021-11-20 23:43:01,058 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 23:43:01,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293273219] [2021-11-20 23:43:01,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293273219] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:43:01,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1401926373] [2021-11-20 23:43:01,061 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-20 23:43:01,061 INFO L166 IcfgInterpreter]: Building call graph [2021-11-20 23:43:01,062 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-20 23:43:01,062 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-20 23:43:01,062 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-20 23:43:09,094 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 19 for LOIs [2021-11-20 23:43:09,229 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 53 for LOIs [2021-11-20 23:43:09,402 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-20 23:43:10,117 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-20 23:43:10,117 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 23:43:10,117 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2021-11-20 23:43:10,117 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479180011] [2021-11-20 23:43:10,117 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 23:43:10,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-20 23:43:10,118 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:43:10,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-20 23:43:10,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2021-11-20 23:43:10,119 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:43:10,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:43:10,192 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2021-11-20 23:43:10,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 23:43:10,192 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:43:10,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:43:10,193 INFO L225 Difference]: With dead ends: 50 [2021-11-20 23:43:10,194 INFO L226 Difference]: Without dead ends: 45 [2021-11-20 23:43:10,194 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2021-11-20 23:43:10,196 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 22 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 23:43:10,196 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 43 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 23:43:10,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-11-20 23:43:10,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2021-11-20 23:43:10,205 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:43:10,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2021-11-20 23:43:10,206 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 28 [2021-11-20 23:43:10,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:43:10,207 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2021-11-20 23:43:10,207 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:43:10,207 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2021-11-20 23:43:10,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-20 23:43:10,209 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:43:10,209 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:43:10,243 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-20 23:43:10,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:43:10,422 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 23:43:10,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:43:10,423 INFO L85 PathProgramCache]: Analyzing trace with hash -235004718, now seen corresponding path program 2 times [2021-11-20 23:43:10,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:43:10,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577769914] [2021-11-20 23:43:10,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:43:10,424 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:43:10,433 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 23:43:10,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1798509895] [2021-11-20 23:43:10,434 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:43:10,434 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:43:10,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:43:10,451 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:43:10,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-20 23:43:10,519 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-11-20 23:43:10,519 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:43:10,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-20 23:43:10,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:43:10,695 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:43:10,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:43:10,872 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:43:10,873 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:43:10,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577769914] [2021-11-20 23:43:10,873 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 23:43:10,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798509895] [2021-11-20 23:43:10,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798509895] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:43:10,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [794839675] [2021-11-20 23:43:10,876 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-20 23:43:10,877 INFO L166 IcfgInterpreter]: Building call graph [2021-11-20 23:43:10,877 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-20 23:43:10,878 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-20 23:43:10,878 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-20 23:43:19,812 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 16 for LOIs [2021-11-20 23:43:19,893 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 53 for LOIs [2021-11-20 23:43:19,970 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-20 23:43:20,607 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-20 23:43:20,607 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 23:43:20,607 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2021-11-20 23:43:20,607 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095627625] [2021-11-20 23:43:20,608 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 23:43:20,608 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-20 23:43:20,608 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:43:20,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-20 23:43:20,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2021-11-20 23:43:20,610 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:43:20,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:43:20,857 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2021-11-20 23:43:20,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-20 23:43:20,858 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:43:20,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:43:20,860 INFO L225 Difference]: With dead ends: 98 [2021-11-20 23:43:20,861 INFO L226 Difference]: Without dead ends: 93 [2021-11-20 23:43:20,862 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=278, Invalid=1054, Unknown=0, NotChecked=0, Total=1332 [2021-11-20 23:43:20,863 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 42 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 23:43:20,863 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 111 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 23:43:20,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-11-20 23:43:20,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2021-11-20 23:43:20,878 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:43:20,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2021-11-20 23:43:20,880 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 46 [2021-11-20 23:43:20,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:43:20,881 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2021-11-20 23:43:20,881 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:43:20,882 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2021-11-20 23:43:20,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-20 23:43:20,886 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:43:20,886 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:43:20,929 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-20 23:43:21,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:43:21,104 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 23:43:21,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:43:21,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1419782260, now seen corresponding path program 3 times [2021-11-20 23:43:21,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:43:21,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281760548] [2021-11-20 23:43:21,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:43:21,105 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:43:21,116 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 23:43:21,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1334797370] [2021-11-20 23:43:21,117 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:43:21,117 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:43:21,117 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:43:21,132 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:43:21,154 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-20 23:43:21,226 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:43:21,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:43:21,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-20 23:43:21,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:43:21,531 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:43:21,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:43:22,020 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:43:22,020 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:43:22,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281760548] [2021-11-20 23:43:22,020 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 23:43:22,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334797370] [2021-11-20 23:43:22,021 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334797370] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:43:22,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2045139625] [2021-11-20 23:43:22,023 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-20 23:43:22,024 INFO L166 IcfgInterpreter]: Building call graph [2021-11-20 23:43:22,024 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-20 23:43:22,024 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-20 23:43:22,024 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-20 23:43:30,372 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 16 for LOIs [2021-11-20 23:43:30,457 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 53 for LOIs [2021-11-20 23:43:30,543 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-20 23:43:31,150 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-20 23:43:31,151 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 23:43:31,151 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2021-11-20 23:43:31,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94457207] [2021-11-20 23:43:31,151 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 23:43:31,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-11-20 23:43:31,152 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:43:31,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-20 23:43:31,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1125, Unknown=0, NotChecked=0, Total=1560 [2021-11-20 23:43:31,154 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:43:31,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:43:31,777 INFO L93 Difference]: Finished difference Result 194 states and 206 transitions. [2021-11-20 23:43:31,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-11-20 23:43:31,778 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:43:31,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:43:31,781 INFO L225 Difference]: With dead ends: 194 [2021-11-20 23:43:31,781 INFO L226 Difference]: Without dead ends: 189 [2021-11-20 23:43:31,784 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1079 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=950, Invalid=2710, Unknown=0, NotChecked=0, Total=3660 [2021-11-20 23:43:31,785 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 188 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 23:43:31,785 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 190 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-20 23:43:31,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-11-20 23:43:31,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2021-11-20 23:43:31,809 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:43:31,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2021-11-20 23:43:31,812 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 94 [2021-11-20 23:43:31,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:43:31,813 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2021-11-20 23:43:31,814 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:43:31,814 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2021-11-20 23:43:31,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2021-11-20 23:43:31,827 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:43:31,828 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:43:31,872 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-20 23:43:32,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:43:32,054 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 23:43:32,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:43:32,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1763378944, now seen corresponding path program 4 times [2021-11-20 23:43:32,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:43:32,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818081565] [2021-11-20 23:43:32,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:43:32,055 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:43:32,068 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 23:43:32,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [407917220] [2021-11-20 23:43:32,069 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 23:43:32,069 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:43:32,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:43:32,077 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:43:32,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-20 23:43:32,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:43:32,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 47 conjunts are in the unsatisfiable core [2021-11-20 23:43:32,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:43:32,908 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:43:32,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:43:34,061 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:43:34,061 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:43:34,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818081565] [2021-11-20 23:43:34,062 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 23:43:34,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407917220] [2021-11-20 23:43:34,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407917220] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:43:34,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1816276584] [2021-11-20 23:43:34,064 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-20 23:43:34,065 INFO L166 IcfgInterpreter]: Building call graph [2021-11-20 23:43:34,065 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-20 23:43:34,065 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-20 23:43:34,065 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-20 23:43:40,867 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 16 for LOIs [2021-11-20 23:43:40,959 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 53 for LOIs [2021-11-20 23:43:41,049 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-20 23:43:41,882 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-20 23:43:41,882 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 23:43:41,882 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2021-11-20 23:43:41,882 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937973572] [2021-11-20 23:43:41,883 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 23:43:41,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-11-20 23:43:41,884 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:43:41,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-11-20 23:43:41,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1407, Invalid=2625, Unknown=0, NotChecked=0, Total=4032 [2021-11-20 23:43:41,888 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:43:43,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:43:43,803 INFO L93 Difference]: Finished difference Result 386 states and 410 transitions. [2021-11-20 23:43:43,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2021-11-20 23:43:43,804 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:43:43,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:43:43,809 INFO L225 Difference]: With dead ends: 386 [2021-11-20 23:43:43,810 INFO L226 Difference]: Without dead ends: 381 [2021-11-20 23:43:43,817 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 613 GetRequests, 506 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2909 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3590, Invalid=8182, Unknown=0, NotChecked=0, Total=11772 [2021-11-20 23:43:43,818 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 323 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-20 23:43:43,818 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [323 Valid, 291 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-20 23:43:43,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2021-11-20 23:43:43,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2021-11-20 23:43:43,858 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:43:43,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 382 transitions. [2021-11-20 23:43:43,863 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 382 transitions. Word has length 190 [2021-11-20 23:43:43,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:43:43,864 INFO L470 AbstractCegarLoop]: Abstraction has 381 states and 382 transitions. [2021-11-20 23:43:43,864 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:43:43,865 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 382 transitions. [2021-11-20 23:43:43,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2021-11-20 23:43:43,875 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:43:43,876 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:43:43,922 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-20 23:43:44,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:43:44,098 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 23:43:44,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:43:44,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1767238632, now seen corresponding path program 5 times [2021-11-20 23:43:44,099 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:43:44,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615144717] [2021-11-20 23:43:44,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:43:44,099 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:43:44,117 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 23:43:44,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1166931176] [2021-11-20 23:43:44,118 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:43:44,118 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:43:44,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:43:44,119 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:43:44,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-20 23:43:44,700 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2021-11-20 23:43:44,701 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:43:44,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 803 conjuncts, 95 conjunts are in the unsatisfiable core [2021-11-20 23:43:44,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:43:46,641 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:43:46,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:43:50,131 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:43:50,131 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:43:50,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615144717] [2021-11-20 23:43:50,132 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 23:43:50,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166931176] [2021-11-20 23:43:50,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166931176] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:43:50,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1363784458] [2021-11-20 23:43:50,135 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-20 23:43:50,135 INFO L166 IcfgInterpreter]: Building call graph [2021-11-20 23:43:50,135 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-20 23:43:50,136 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-20 23:43:50,136 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-20 23:43:56,602 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 16 for LOIs [2021-11-20 23:43:56,698 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 53 for LOIs [2021-11-20 23:43:56,793 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-20 23:43:57,710 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-20 23:43:57,711 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 23:43:57,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 98 [2021-11-20 23:43:57,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053127796] [2021-11-20 23:43:57,712 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 23:43:57,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2021-11-20 23:43:57,714 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:43:57,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2021-11-20 23:43:57,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5079, Invalid=7353, Unknown=0, NotChecked=0, Total=12432 [2021-11-20 23:43:57,723 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:44:03,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:44:03,942 INFO L93 Difference]: Finished difference Result 770 states and 818 transitions. [2021-11-20 23:44:03,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2021-11-20 23:44:03,944 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:44:03,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:44:03,949 INFO L225 Difference]: With dead ends: 770 [2021-11-20 23:44:03,949 INFO L226 Difference]: Without dead ends: 765 [2021-11-20 23:44:03,961 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1237 GetRequests, 1034 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8729 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=14054, Invalid=27766, Unknown=0, NotChecked=0, Total=41820 [2021-11-20 23:44:03,962 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 1775 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 679 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1775 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 1423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 679 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-20 23:44:03,962 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1775 Valid, 622 Invalid, 1423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [679 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-20 23:44:03,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2021-11-20 23:44:04,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 765. [2021-11-20 23:44:04,019 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:44:04,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 766 transitions. [2021-11-20 23:44:04,026 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 766 transitions. Word has length 382 [2021-11-20 23:44:04,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:44:04,028 INFO L470 AbstractCegarLoop]: Abstraction has 765 states and 766 transitions. [2021-11-20 23:44:04,029 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:44:04,029 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 766 transitions. [2021-11-20 23:44:04,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 767 [2021-11-20 23:44:04,058 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:44:04,059 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:44:04,104 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-20 23:44:04,282 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:44:04,282 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 23:44:04,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:44:04,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1053987256, now seen corresponding path program 6 times [2021-11-20 23:44:04,283 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:44:04,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540007905] [2021-11-20 23:44:04,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:44:04,284 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:44:04,307 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 23:44:04,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [525605061] [2021-11-20 23:44:04,310 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:44:04,310 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:44:04,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:44:04,311 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:44:04,318 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-20 23:44:05,400 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:44:05,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:44:05,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 1571 conjuncts, 191 conjunts are in the unsatisfiable core [2021-11-20 23:44:05,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:44:10,829 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:44:10,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:44:13,041 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:44:13,042 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:44:13,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540007905] [2021-11-20 23:44:13,042 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 23:44:13,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525605061] [2021-11-20 23:44:13,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525605061] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:44:13,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2026770791] [2021-11-20 23:44:13,045 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-20 23:44:13,046 INFO L166 IcfgInterpreter]: Building call graph [2021-11-20 23:44:13,046 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-20 23:44:13,046 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-20 23:44:13,047 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-20 23:44:19,693 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 16 for LOIs [2021-11-20 23:44:19,784 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 53 for LOIs [2021-11-20 23:44:19,877 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-20 23:44:20,930 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-20 23:44:20,931 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 23:44:20,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 98] total 104 [2021-11-20 23:44:20,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100610017] [2021-11-20 23:44:20,931 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 23:44:20,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2021-11-20 23:44:20,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:44:20,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2021-11-20 23:44:20,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5700, Invalid=8106, Unknown=0, NotChecked=0, Total=13806 [2021-11-20 23:44:20,939 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:44:27,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:44:27,138 INFO L93 Difference]: Finished difference Result 818 states and 824 transitions. [2021-11-20 23:44:27,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2021-11-20 23:44:27,139 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:44:27,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:44:27,146 INFO L225 Difference]: With dead ends: 818 [2021-11-20 23:44:27,146 INFO L226 Difference]: Without dead ends: 813 [2021-11-20 23:44:27,154 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2395 GetRequests, 2179 SyntacticMatches, 1 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8134 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=15893, Invalid=30979, Unknown=0, NotChecked=0, Total=46872 [2021-11-20 23:44:27,155 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 598 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-20 23:44:27,155 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [598 Valid, 663 Invalid, 1069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-20 23:44:27,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2021-11-20 23:44:27,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 813. [2021-11-20 23:44:27,208 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:44:27,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 814 transitions. [2021-11-20 23:44:27,214 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 814 transitions. Word has length 766 [2021-11-20 23:44:27,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:44:27,216 INFO L470 AbstractCegarLoop]: Abstraction has 813 states and 814 transitions. [2021-11-20 23:44:27,218 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:44:27,218 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 814 transitions. [2021-11-20 23:44:27,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 815 [2021-11-20 23:44:27,258 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:44:27,259 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:44:27,303 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-20 23:44:27,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-20 23:44:27,474 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 23:44:27,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:44:27,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1872537714, now seen corresponding path program 7 times [2021-11-20 23:44:27,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:44:27,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160148097] [2021-11-20 23:44:27,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:44:27,476 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:44:27,523 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 23:44:27,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [721063610] [2021-11-20 23:44:27,524 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 23:44:27,524 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:44:27,525 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:44:27,525 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:44:27,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-20 23:44:29,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 23:44:29,298 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 23:44:30,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 23:44:30,767 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-20 23:44:30,768 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-20 23:44:30,769 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-20 23:44:30,824 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-20 23:44:30,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-11-20 23:44:31,002 INFO L732 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1, 1, 1] [2021-11-20 23:44:31,007 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-20 23:44:31,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 11:44:31 BoogieIcfgContainer [2021-11-20 23:44:31,373 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-20 23:44:31,373 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-20 23:44:31,374 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-20 23:44:31,374 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-20 23:44:31,374 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:42:44" (3/4) ... [2021-11-20 23:44:31,376 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-20 23:44:31,717 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/bin/utaipan-TEXQjIfE4P/witness.graphml [2021-11-20 23:44:31,717 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-20 23:44:31,718 INFO L158 Benchmark]: Toolchain (without parser) took 108185.40ms. Allocated memory was 107.0MB in the beginning and 423.6MB in the end (delta: 316.7MB). Free memory was 74.3MB in the beginning and 378.9MB in the end (delta: -304.6MB). Peak memory consumption was 211.3MB. Max. memory is 16.1GB. [2021-11-20 23:44:31,718 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 107.0MB. Free memory is still 62.2MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-20 23:44:31,720 INFO L158 Benchmark]: CACSL2BoogieTranslator took 302.41ms. Allocated memory is still 107.0MB. Free memory was 74.1MB in the beginning and 82.1MB in the end (delta: -8.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-20 23:44:31,720 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.93ms. Allocated memory is still 107.0MB. Free memory was 82.1MB in the beginning and 80.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-20 23:44:31,721 INFO L158 Benchmark]: Boogie Preprocessor took 26.46ms. Allocated memory is still 107.0MB. Free memory was 80.4MB in the beginning and 79.7MB in the end (delta: 710.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-20 23:44:31,721 INFO L158 Benchmark]: RCFGBuilder took 368.76ms. Allocated memory is still 107.0MB. Free memory was 79.5MB in the beginning and 69.3MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-20 23:44:31,722 INFO L158 Benchmark]: TraceAbstraction took 107085.10ms. Allocated memory was 107.0MB in the beginning and 352.3MB in the end (delta: 245.4MB). Free memory was 69.0MB in the beginning and 146.0MB in the end (delta: -77.0MB). Peak memory consumption was 171.5MB. Max. memory is 16.1GB. [2021-11-20 23:44:31,722 INFO L158 Benchmark]: Witness Printer took 343.68ms. Allocated memory was 352.3MB in the beginning and 423.6MB in the end (delta: 71.3MB). Free memory was 146.0MB in the beginning and 378.9MB in the end (delta: -232.9MB). Peak memory consumption was 36.5MB. Max. memory is 16.1GB. [2021-11-20 23:44:31,729 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.33ms. Allocated memory is still 107.0MB. Free memory is still 62.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 302.41ms. Allocated memory is still 107.0MB. Free memory was 74.1MB in the beginning and 82.1MB in the end (delta: -8.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.93ms. Allocated memory is still 107.0MB. Free memory was 82.1MB in the beginning and 80.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.46ms. Allocated memory is still 107.0MB. Free memory was 80.4MB in the beginning and 79.7MB in the end (delta: 710.7kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 368.76ms. Allocated memory is still 107.0MB. Free memory was 79.5MB in the beginning and 69.3MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 107085.10ms. Allocated memory was 107.0MB in the beginning and 352.3MB in the end (delta: 245.4MB). Free memory was 69.0MB in the beginning and 146.0MB in the end (delta: -77.0MB). Peak memory consumption was 171.5MB. Max. memory is 16.1GB. * Witness Printer took 343.68ms. Allocated memory was 352.3MB in the beginning and 423.6MB in the end (delta: 71.3MB). Free memory was 146.0MB in the beginning and 378.9MB in the end (delta: -232.9MB). Peak memory consumption was 36.5MB. 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: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; [L24] int x1, x2; [L25] int y1, y2, y3; [L26] x1 = __VERIFIER_nondet_int() [L27] x2 = __VERIFIER_nondet_int() [L29] CALL assume_abort_if_not(x1 >= 0) VAL [\old(cond)=1, counter=0] [L13] COND FALSE !(!cond) [L29] RET assume_abort_if_not(x1 >= 0) VAL [counter=0, x1=101, x2=3] [L30] CALL assume_abort_if_not(x2 != 0) VAL [\old(cond)=1, counter=0] [L13] COND FALSE !(!cond) [L30] RET assume_abort_if_not(x2 != 0) VAL [counter=0, x1=101, x2=3] [L32] y1 = 0 [L33] y2 = 0 [L34] y3 = x1 VAL [counter=0, x1=101, x2=3, y1=0, y2=0, y3=101] [L36] EXPR counter++ VAL [counter=1, counter++=0, x1=101, x2=3, y1=0, y2=0, y3=101] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=1] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=1, x1=101, x2=3, y1=0, y2=0, y3=101] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=1, x1=101, x2=3, y1=0, y2=1, y3=100] [L36] EXPR counter++ VAL [counter=2, counter++=1, x1=101, x2=3, y1=0, y2=1, y3=100] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=2] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=2, x1=101, x2=3, y1=0, y2=1, y3=100] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=2, x1=101, x2=3, y1=0, y2=2, y3=99] [L36] EXPR counter++ VAL [counter=3, counter++=2, x1=101, x2=3, y1=0, y2=2, y3=99] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=3] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=3, x1=101, x2=3, y1=0, y2=2, y3=99] [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=3, x1=101, x2=3, y1=1, y2=0, y3=98] [L36] EXPR counter++ VAL [counter=4, counter++=3, x1=101, x2=3, y1=1, y2=0, y3=98] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=4] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=4, x1=101, x2=3, y1=1, y2=0, y3=98] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=4, x1=101, x2=3, y1=1, y2=1, y3=97] [L36] EXPR counter++ VAL [counter=5, counter++=4, x1=101, x2=3, y1=1, y2=1, y3=97] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=5] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=5, x1=101, x2=3, y1=1, y2=1, y3=97] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=5, x1=101, x2=3, y1=1, y2=2, y3=96] [L36] EXPR counter++ VAL [counter=6, counter++=5, x1=101, x2=3, y1=1, y2=2, y3=96] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=6] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=6, x1=101, x2=3, y1=1, y2=2, y3=96] [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=6, x1=101, x2=3, y1=2, y2=0, y3=95] [L36] EXPR counter++ VAL [counter=7, counter++=6, x1=101, x2=3, y1=2, y2=0, y3=95] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=7] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=7, x1=101, x2=3, y1=2, y2=0, y3=95] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=7, x1=101, x2=3, y1=2, y2=1, y3=94] [L36] EXPR counter++ VAL [counter=8, counter++=7, x1=101, x2=3, y1=2, y2=1, y3=94] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=8] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=8, x1=101, x2=3, y1=2, y2=1, y3=94] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=8, x1=101, x2=3, y1=2, y2=2, y3=93] [L36] EXPR counter++ VAL [counter=9, counter++=8, x1=101, x2=3, y1=2, y2=2, y3=93] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=9] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=9, x1=101, x2=3, y1=2, y2=2, y3=93] [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=9, x1=101, x2=3, y1=3, y2=0, y3=92] [L36] EXPR counter++ VAL [counter=10, counter++=9, x1=101, x2=3, y1=3, y2=0, y3=92] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=10] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=10, x1=101, x2=3, y1=3, y2=0, y3=92] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=10, x1=101, x2=3, y1=3, y2=1, y3=91] [L36] EXPR counter++ VAL [counter=11, counter++=10, x1=101, x2=3, y1=3, y2=1, y3=91] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=11] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=11, x1=101, x2=3, y1=3, y2=1, y3=91] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=11, x1=101, x2=3, y1=3, y2=2, y3=90] [L36] EXPR counter++ VAL [counter=12, counter++=11, x1=101, x2=3, y1=3, y2=2, y3=90] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=12] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=12, x1=101, x2=3, y1=3, y2=2, y3=90] [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=12, x1=101, x2=3, y1=4, y2=0, y3=89] [L36] EXPR counter++ VAL [counter=13, counter++=12, x1=101, x2=3, y1=4, y2=0, y3=89] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=13] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=13, x1=101, x2=3, y1=4, y2=0, y3=89] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=13, x1=101, x2=3, y1=4, y2=1, y3=88] [L36] EXPR counter++ VAL [counter=14, counter++=13, x1=101, x2=3, y1=4, y2=1, y3=88] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=14] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=14, x1=101, x2=3, y1=4, y2=1, y3=88] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=14, x1=101, x2=3, y1=4, y2=2, y3=87] [L36] EXPR counter++ VAL [counter=15, counter++=14, x1=101, x2=3, y1=4, y2=2, y3=87] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=15] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=15, x1=101, x2=3, y1=4, y2=2, y3=87] [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=15, x1=101, x2=3, y1=5, y2=0, y3=86] [L36] EXPR counter++ VAL [counter=16, counter++=15, x1=101, x2=3, y1=5, y2=0, y3=86] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=16] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=16, x1=101, x2=3, y1=5, y2=0, y3=86] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=16, x1=101, x2=3, y1=5, y2=1, y3=85] [L36] EXPR counter++ VAL [counter=17, counter++=16, x1=101, x2=3, y1=5, y2=1, y3=85] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=17] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=17, x1=101, x2=3, y1=5, y2=1, y3=85] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=17, x1=101, x2=3, y1=5, y2=2, y3=84] [L36] EXPR counter++ VAL [counter=18, counter++=17, x1=101, x2=3, y1=5, y2=2, y3=84] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=18] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=18, x1=101, x2=3, y1=5, y2=2, y3=84] [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=18, x1=101, x2=3, y1=6, y2=0, y3=83] [L36] EXPR counter++ VAL [counter=19, counter++=18, x1=101, x2=3, y1=6, y2=0, y3=83] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=19] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=19, x1=101, x2=3, y1=6, y2=0, y3=83] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=19, x1=101, x2=3, y1=6, y2=1, y3=82] [L36] EXPR counter++ VAL [counter=20, counter++=19, x1=101, x2=3, y1=6, y2=1, y3=82] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=20] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=20, x1=101, x2=3, y1=6, y2=1, y3=82] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=20, x1=101, x2=3, y1=6, y2=2, y3=81] [L36] EXPR counter++ VAL [counter=21, counter++=20, x1=101, x2=3, y1=6, y2=2, y3=81] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=21] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=21, x1=101, x2=3, y1=6, y2=2, y3=81] [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=21, x1=101, x2=3, y1=7, y2=0, y3=80] [L36] EXPR counter++ VAL [counter=22, counter++=21, x1=101, x2=3, y1=7, y2=0, y3=80] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=22] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=22, x1=101, x2=3, y1=7, y2=0, y3=80] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=22, x1=101, x2=3, y1=7, y2=1, y3=79] [L36] EXPR counter++ VAL [counter=23, counter++=22, x1=101, x2=3, y1=7, y2=1, y3=79] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=23] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=23, x1=101, x2=3, y1=7, y2=1, y3=79] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=23, x1=101, x2=3, y1=7, y2=2, y3=78] [L36] EXPR counter++ VAL [counter=24, counter++=23, x1=101, x2=3, y1=7, y2=2, y3=78] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=24] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=24, x1=101, x2=3, y1=7, y2=2, y3=78] [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=24, x1=101, x2=3, y1=8, y2=0, y3=77] [L36] EXPR counter++ VAL [counter=25, counter++=24, x1=101, x2=3, y1=8, y2=0, y3=77] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=25] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=25, x1=101, x2=3, y1=8, y2=0, y3=77] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=25, x1=101, x2=3, y1=8, y2=1, y3=76] [L36] EXPR counter++ VAL [counter=26, counter++=25, x1=101, x2=3, y1=8, y2=1, y3=76] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=26] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=26, x1=101, x2=3, y1=8, y2=1, y3=76] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=26, x1=101, x2=3, y1=8, y2=2, y3=75] [L36] EXPR counter++ VAL [counter=27, counter++=26, x1=101, x2=3, y1=8, y2=2, y3=75] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=27] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=27, x1=101, x2=3, y1=8, y2=2, y3=75] [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=27, x1=101, x2=3, y1=9, y2=0, y3=74] [L36] EXPR counter++ VAL [counter=28, counter++=27, x1=101, x2=3, y1=9, y2=0, y3=74] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=28] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=28, x1=101, x2=3, y1=9, y2=0, y3=74] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=28, x1=101, x2=3, y1=9, y2=1, y3=73] [L36] EXPR counter++ VAL [counter=29, counter++=28, x1=101, x2=3, y1=9, y2=1, y3=73] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=29] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=29, x1=101, x2=3, y1=9, y2=1, y3=73] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=29, x1=101, x2=3, y1=9, y2=2, y3=72] [L36] EXPR counter++ VAL [counter=30, counter++=29, x1=101, x2=3, y1=9, y2=2, y3=72] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=30] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=30, x1=101, x2=3, y1=9, y2=2, y3=72] [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=30, x1=101, x2=3, y1=10, y2=0, y3=71] [L36] EXPR counter++ VAL [counter=31, counter++=30, x1=101, x2=3, y1=10, y2=0, y3=71] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=31] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=31, x1=101, x2=3, y1=10, y2=0, y3=71] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=31, x1=101, x2=3, y1=10, y2=1, y3=70] [L36] EXPR counter++ VAL [counter=32, counter++=31, x1=101, x2=3, y1=10, y2=1, y3=70] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=32] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=32, x1=101, x2=3, y1=10, y2=1, y3=70] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=32, x1=101, x2=3, y1=10, y2=2, y3=69] [L36] EXPR counter++ VAL [counter=33, counter++=32, x1=101, x2=3, y1=10, y2=2, y3=69] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=33] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=33, x1=101, x2=3, y1=10, y2=2, y3=69] [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=33, x1=101, x2=3, y1=11, y2=0, y3=68] [L36] EXPR counter++ VAL [counter=34, counter++=33, x1=101, x2=3, y1=11, y2=0, y3=68] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=34] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=34, x1=101, x2=3, y1=11, y2=0, y3=68] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=34, x1=101, x2=3, y1=11, y2=1, y3=67] [L36] EXPR counter++ VAL [counter=35, counter++=34, x1=101, x2=3, y1=11, y2=1, y3=67] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=35] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=35, x1=101, x2=3, y1=11, y2=1, y3=67] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=35, x1=101, x2=3, y1=11, y2=2, y3=66] [L36] EXPR counter++ VAL [counter=36, counter++=35, x1=101, x2=3, y1=11, y2=2, y3=66] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=36] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=36, x1=101, x2=3, y1=11, y2=2, y3=66] [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=36, x1=101, x2=3, y1=12, y2=0, y3=65] [L36] EXPR counter++ VAL [counter=37, counter++=36, x1=101, x2=3, y1=12, y2=0, y3=65] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=37] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=37, x1=101, x2=3, y1=12, y2=0, y3=65] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=37, x1=101, x2=3, y1=12, y2=1, y3=64] [L36] EXPR counter++ VAL [counter=38, counter++=37, x1=101, x2=3, y1=12, y2=1, y3=64] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=38] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=38, x1=101, x2=3, y1=12, y2=1, y3=64] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=38, x1=101, x2=3, y1=12, y2=2, y3=63] [L36] EXPR counter++ VAL [counter=39, counter++=38, x1=101, x2=3, y1=12, y2=2, y3=63] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=39] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=39, x1=101, x2=3, y1=12, y2=2, y3=63] [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=39, x1=101, x2=3, y1=13, y2=0, y3=62] [L36] EXPR counter++ VAL [counter=40, counter++=39, x1=101, x2=3, y1=13, y2=0, y3=62] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=40] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=40, x1=101, x2=3, y1=13, y2=0, y3=62] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=40, x1=101, x2=3, y1=13, y2=1, y3=61] [L36] EXPR counter++ VAL [counter=41, counter++=40, x1=101, x2=3, y1=13, y2=1, y3=61] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=41] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=41, x1=101, x2=3, y1=13, y2=1, y3=61] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=41, x1=101, x2=3, y1=13, y2=2, y3=60] [L36] EXPR counter++ VAL [counter=42, counter++=41, x1=101, x2=3, y1=13, y2=2, y3=60] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=42] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=42, x1=101, x2=3, y1=13, y2=2, y3=60] [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=42, x1=101, x2=3, y1=14, y2=0, y3=59] [L36] EXPR counter++ VAL [counter=43, counter++=42, x1=101, x2=3, y1=14, y2=0, y3=59] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=43] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=43, x1=101, x2=3, y1=14, y2=0, y3=59] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=43, x1=101, x2=3, y1=14, y2=1, y3=58] [L36] EXPR counter++ VAL [counter=44, counter++=43, x1=101, x2=3, y1=14, y2=1, y3=58] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=44] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=44, x1=101, x2=3, y1=14, y2=1, y3=58] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=44, x1=101, x2=3, y1=14, y2=2, y3=57] [L36] EXPR counter++ VAL [counter=45, counter++=44, x1=101, x2=3, y1=14, y2=2, y3=57] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=45] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=45, x1=101, x2=3, y1=14, y2=2, y3=57] [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=45, x1=101, x2=3, y1=15, y2=0, y3=56] [L36] EXPR counter++ VAL [counter=46, counter++=45, x1=101, x2=3, y1=15, y2=0, y3=56] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=46] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=46, x1=101, x2=3, y1=15, y2=0, y3=56] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=46, x1=101, x2=3, y1=15, y2=1, y3=55] [L36] EXPR counter++ VAL [counter=47, counter++=46, x1=101, x2=3, y1=15, y2=1, y3=55] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=47] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=47, x1=101, x2=3, y1=15, y2=1, y3=55] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=47, x1=101, x2=3, y1=15, y2=2, y3=54] [L36] EXPR counter++ VAL [counter=48, counter++=47, x1=101, x2=3, y1=15, y2=2, y3=54] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=48] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=48, x1=101, x2=3, y1=15, y2=2, y3=54] [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=48, x1=101, x2=3, y1=16, y2=0, y3=53] [L36] EXPR counter++ VAL [counter=49, counter++=48, x1=101, x2=3, y1=16, y2=0, y3=53] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=49] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=49, x1=101, x2=3, y1=16, y2=0, y3=53] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=49, x1=101, x2=3, y1=16, y2=1, y3=52] [L36] EXPR counter++ VAL [counter=50, counter++=49, x1=101, x2=3, y1=16, y2=1, y3=52] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=50] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=50, x1=101, x2=3, y1=16, y2=1, y3=52] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=50, x1=101, x2=3, y1=16, y2=2, y3=51] [L36] EXPR counter++ VAL [counter=51, counter++=50, x1=101, x2=3, y1=16, y2=2, y3=51] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=51] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=51] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=51, x1=101, x2=3, y1=16, y2=2, y3=51] [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=51, x1=101, x2=3, y1=17, y2=0, y3=50] [L36] EXPR counter++ VAL [counter=52, counter++=51, x1=101, x2=3, y1=17, y2=0, y3=50] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=52] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=52] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=52, x1=101, x2=3, y1=17, y2=0, y3=50] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=52, x1=101, x2=3, y1=17, y2=1, y3=49] [L36] EXPR counter++ VAL [counter=53, counter++=52, x1=101, x2=3, y1=17, y2=1, y3=49] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=53] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=53] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=53, x1=101, x2=3, y1=17, y2=1, y3=49] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=53, x1=101, x2=3, y1=17, y2=2, y3=48] [L36] EXPR counter++ VAL [counter=54, counter++=53, x1=101, x2=3, y1=17, y2=2, y3=48] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=54] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=54] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=54, x1=101, x2=3, y1=17, y2=2, y3=48] [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=54, x1=101, x2=3, y1=18, y2=0, y3=47] [L36] EXPR counter++ VAL [counter=55, counter++=54, x1=101, x2=3, y1=18, y2=0, y3=47] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=55] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=55] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=55, x1=101, x2=3, y1=18, y2=0, y3=47] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=55, x1=101, x2=3, y1=18, y2=1, y3=46] [L36] EXPR counter++ VAL [counter=56, counter++=55, x1=101, x2=3, y1=18, y2=1, y3=46] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=56] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=56] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=56, x1=101, x2=3, y1=18, y2=1, y3=46] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=56, x1=101, x2=3, y1=18, y2=2, y3=45] [L36] EXPR counter++ VAL [counter=57, counter++=56, x1=101, x2=3, y1=18, y2=2, y3=45] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=57] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=57] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=57, x1=101, x2=3, y1=18, y2=2, y3=45] [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=57, x1=101, x2=3, y1=19, y2=0, y3=44] [L36] EXPR counter++ VAL [counter=58, counter++=57, x1=101, x2=3, y1=19, y2=0, y3=44] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=58] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=58] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=58, x1=101, x2=3, y1=19, y2=0, y3=44] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=58, x1=101, x2=3, y1=19, y2=1, y3=43] [L36] EXPR counter++ VAL [counter=59, counter++=58, x1=101, x2=3, y1=19, y2=1, y3=43] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=59] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=59] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=59, x1=101, x2=3, y1=19, y2=1, y3=43] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=59, x1=101, x2=3, y1=19, y2=2, y3=42] [L36] EXPR counter++ VAL [counter=60, counter++=59, x1=101, x2=3, y1=19, y2=2, y3=42] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=60] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=60] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=60, x1=101, x2=3, y1=19, y2=2, y3=42] [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=60, x1=101, x2=3, y1=20, y2=0, y3=41] [L36] EXPR counter++ VAL [counter=61, counter++=60, x1=101, x2=3, y1=20, y2=0, y3=41] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=61] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=61] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=61, x1=101, x2=3, y1=20, y2=0, y3=41] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=61, x1=101, x2=3, y1=20, y2=1, y3=40] [L36] EXPR counter++ VAL [counter=62, counter++=61, x1=101, x2=3, y1=20, y2=1, y3=40] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=62] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=62] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=62, x1=101, x2=3, y1=20, y2=1, y3=40] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=62, x1=101, x2=3, y1=20, y2=2, y3=39] [L36] EXPR counter++ VAL [counter=63, counter++=62, x1=101, x2=3, y1=20, y2=2, y3=39] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=63] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=63] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=63, x1=101, x2=3, y1=20, y2=2, y3=39] [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=63, x1=101, x2=3, y1=21, y2=0, y3=38] [L36] EXPR counter++ VAL [counter=64, counter++=63, x1=101, x2=3, y1=21, y2=0, y3=38] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=64] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=64] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=64, x1=101, x2=3, y1=21, y2=0, y3=38] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=64, x1=101, x2=3, y1=21, y2=1, y3=37] [L36] EXPR counter++ VAL [counter=65, counter++=64, x1=101, x2=3, y1=21, y2=1, y3=37] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=65] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=65] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=65, x1=101, x2=3, y1=21, y2=1, y3=37] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=65, x1=101, x2=3, y1=21, y2=2, y3=36] [L36] EXPR counter++ VAL [counter=66, counter++=65, x1=101, x2=3, y1=21, y2=2, y3=36] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=66] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=66] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=66, x1=101, x2=3, y1=21, y2=2, y3=36] [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=66, x1=101, x2=3, y1=22, y2=0, y3=35] [L36] EXPR counter++ VAL [counter=67, counter++=66, x1=101, x2=3, y1=22, y2=0, y3=35] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=67] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=67] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=67, x1=101, x2=3, y1=22, y2=0, y3=35] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=67, x1=101, x2=3, y1=22, y2=1, y3=34] [L36] EXPR counter++ VAL [counter=68, counter++=67, x1=101, x2=3, y1=22, y2=1, y3=34] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=68] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=68] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=68, x1=101, x2=3, y1=22, y2=1, y3=34] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=68, x1=101, x2=3, y1=22, y2=2, y3=33] [L36] EXPR counter++ VAL [counter=69, counter++=68, x1=101, x2=3, y1=22, y2=2, y3=33] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=69] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=69] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=69, x1=101, x2=3, y1=22, y2=2, y3=33] [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=69, x1=101, x2=3, y1=23, y2=0, y3=32] [L36] EXPR counter++ VAL [counter=70, counter++=69, x1=101, x2=3, y1=23, y2=0, y3=32] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=70] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=70] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=70, x1=101, x2=3, y1=23, y2=0, y3=32] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=70, x1=101, x2=3, y1=23, y2=1, y3=31] [L36] EXPR counter++ VAL [counter=71, counter++=70, x1=101, x2=3, y1=23, y2=1, y3=31] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=71] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=71] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=71, x1=101, x2=3, y1=23, y2=1, y3=31] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=71, x1=101, x2=3, y1=23, y2=2, y3=30] [L36] EXPR counter++ VAL [counter=72, counter++=71, x1=101, x2=3, y1=23, y2=2, y3=30] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=72] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=72] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=72, x1=101, x2=3, y1=23, y2=2, y3=30] [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=72, x1=101, x2=3, y1=24, y2=0, y3=29] [L36] EXPR counter++ VAL [counter=73, counter++=72, x1=101, x2=3, y1=24, y2=0, y3=29] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=73] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=73] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=73, x1=101, x2=3, y1=24, y2=0, y3=29] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=73, x1=101, x2=3, y1=24, y2=1, y3=28] [L36] EXPR counter++ VAL [counter=74, counter++=73, x1=101, x2=3, y1=24, y2=1, y3=28] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=74] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=74] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=74, x1=101, x2=3, y1=24, y2=1, y3=28] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=74, x1=101, x2=3, y1=24, y2=2, y3=27] [L36] EXPR counter++ VAL [counter=75, counter++=74, x1=101, x2=3, y1=24, y2=2, y3=27] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=75] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=75] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=75, x1=101, x2=3, y1=24, y2=2, y3=27] [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=75, x1=101, x2=3, y1=25, y2=0, y3=26] [L36] EXPR counter++ VAL [counter=76, counter++=75, x1=101, x2=3, y1=25, y2=0, y3=26] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=76] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=76] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=76, x1=101, x2=3, y1=25, y2=0, y3=26] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=76, x1=101, x2=3, y1=25, y2=1, y3=25] [L36] EXPR counter++ VAL [counter=77, counter++=76, x1=101, x2=3, y1=25, y2=1, y3=25] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=77] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=77] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=77, x1=101, x2=3, y1=25, y2=1, y3=25] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=77, x1=101, x2=3, y1=25, y2=2, y3=24] [L36] EXPR counter++ VAL [counter=78, counter++=77, x1=101, x2=3, y1=25, y2=2, y3=24] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=78] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=78] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=78, x1=101, x2=3, y1=25, y2=2, y3=24] [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=78, x1=101, x2=3, y1=26, y2=0, y3=23] [L36] EXPR counter++ VAL [counter=79, counter++=78, x1=101, x2=3, y1=26, y2=0, y3=23] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=79] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=79] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=79, x1=101, x2=3, y1=26, y2=0, y3=23] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=79, x1=101, x2=3, y1=26, y2=1, y3=22] [L36] EXPR counter++ VAL [counter=80, counter++=79, x1=101, x2=3, y1=26, y2=1, y3=22] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=80] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=80] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=80, x1=101, x2=3, y1=26, y2=1, y3=22] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=80, x1=101, x2=3, y1=26, y2=2, y3=21] [L36] EXPR counter++ VAL [counter=81, counter++=80, x1=101, x2=3, y1=26, y2=2, y3=21] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=81] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=81] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=81, x1=101, x2=3, y1=26, y2=2, y3=21] [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=81, x1=101, x2=3, y1=27, y2=0, y3=20] [L36] EXPR counter++ VAL [counter=82, counter++=81, x1=101, x2=3, y1=27, y2=0, y3=20] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=82] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=82] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=82, x1=101, x2=3, y1=27, y2=0, y3=20] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=82, x1=101, x2=3, y1=27, y2=1, y3=19] [L36] EXPR counter++ VAL [counter=83, counter++=82, x1=101, x2=3, y1=27, y2=1, y3=19] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=83] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=83] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=83, x1=101, x2=3, y1=27, y2=1, y3=19] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=83, x1=101, x2=3, y1=27, y2=2, y3=18] [L36] EXPR counter++ VAL [counter=84, counter++=83, x1=101, x2=3, y1=27, y2=2, y3=18] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=84] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=84] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=84, x1=101, x2=3, y1=27, y2=2, y3=18] [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=84, x1=101, x2=3, y1=28, y2=0, y3=17] [L36] EXPR counter++ VAL [counter=85, counter++=84, x1=101, x2=3, y1=28, y2=0, y3=17] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=85] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=85] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=85, x1=101, x2=3, y1=28, y2=0, y3=17] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=85, x1=101, x2=3, y1=28, y2=1, y3=16] [L36] EXPR counter++ VAL [counter=86, counter++=85, x1=101, x2=3, y1=28, y2=1, y3=16] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=86] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=86] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=86, x1=101, x2=3, y1=28, y2=1, y3=16] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=86, x1=101, x2=3, y1=28, y2=2, y3=15] [L36] EXPR counter++ VAL [counter=87, counter++=86, x1=101, x2=3, y1=28, y2=2, y3=15] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=87] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=87] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=87, x1=101, x2=3, y1=28, y2=2, y3=15] [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=87, x1=101, x2=3, y1=29, y2=0, y3=14] [L36] EXPR counter++ VAL [counter=88, counter++=87, x1=101, x2=3, y1=29, y2=0, y3=14] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=88] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=88] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=88, x1=101, x2=3, y1=29, y2=0, y3=14] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=88, x1=101, x2=3, y1=29, y2=1, y3=13] [L36] EXPR counter++ VAL [counter=89, counter++=88, x1=101, x2=3, y1=29, y2=1, y3=13] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=89] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=89] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=89, x1=101, x2=3, y1=29, y2=1, y3=13] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=89, x1=101, x2=3, y1=29, y2=2, y3=12] [L36] EXPR counter++ VAL [counter=90, counter++=89, x1=101, x2=3, y1=29, y2=2, y3=12] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=90] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=90] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=90, x1=101, x2=3, y1=29, y2=2, y3=12] [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=90, x1=101, x2=3, y1=30, y2=0, y3=11] [L36] EXPR counter++ VAL [counter=91, counter++=90, x1=101, x2=3, y1=30, y2=0, y3=11] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=91] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=91] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=91, x1=101, x2=3, y1=30, y2=0, y3=11] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=91, x1=101, x2=3, y1=30, y2=1, y3=10] [L36] EXPR counter++ VAL [counter=92, counter++=91, x1=101, x2=3, y1=30, y2=1, y3=10] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=92] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=92] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=92, x1=101, x2=3, y1=30, y2=1, y3=10] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=92, x1=101, x2=3, y1=30, y2=2, y3=9] [L36] EXPR counter++ VAL [counter=93, counter++=92, x1=101, x2=3, y1=30, y2=2, y3=9] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=93] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=93] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=93, x1=101, x2=3, y1=30, y2=2, y3=9] [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=93, x1=101, x2=3, y1=31, y2=0, y3=8] [L36] EXPR counter++ VAL [counter=94, counter++=93, x1=101, x2=3, y1=31, y2=0, y3=8] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=94] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=94] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=94, x1=101, x2=3, y1=31, y2=0, y3=8] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=94, x1=101, x2=3, y1=31, y2=1, y3=7] [L36] EXPR counter++ VAL [counter=95, counter++=94, x1=101, x2=3, y1=31, y2=1, y3=7] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=95] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=95] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=95, x1=101, x2=3, y1=31, y2=1, y3=7] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=95, x1=101, x2=3, y1=31, y2=2, y3=6] [L36] EXPR counter++ VAL [counter=96, counter++=95, x1=101, x2=3, y1=31, y2=2, y3=6] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=96] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=96] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=96, x1=101, x2=3, y1=31, y2=2, y3=6] [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=96, x1=101, x2=3, y1=32, y2=0, y3=5] [L36] EXPR counter++ VAL [counter=97, counter++=96, x1=101, x2=3, y1=32, y2=0, y3=5] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=97] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=97] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=97, x1=101, x2=3, y1=32, y2=0, y3=5] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=97, x1=101, x2=3, y1=32, y2=1, y3=4] [L36] EXPR counter++ VAL [counter=98, counter++=97, x1=101, x2=3, y1=32, y2=1, y3=4] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=98] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=98] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=98, x1=101, x2=3, y1=32, y2=1, y3=4] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=98, x1=101, x2=3, y1=32, y2=2, y3=3] [L36] EXPR counter++ VAL [counter=99, counter++=98, x1=101, x2=3, y1=32, y2=2, y3=3] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=99] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=99] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=99, x1=101, x2=3, y1=32, y2=2, y3=3] [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=99, x1=101, x2=3, y1=33, y2=0, y3=2] [L36] EXPR counter++ VAL [counter=100, counter++=99, x1=101, x2=3, y1=33, y2=0, y3=2] [L36] COND TRUE counter++<100 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=100] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=100] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=100, x1=101, x2=3, y1=33, y2=0, y3=2] [L39] COND FALSE !(!(y3 != 0)) [L41] COND FALSE !(y2 + 1 == x2) [L46] y2 = y2 + 1 [L47] y3 = y3 - 1 VAL [counter=100, x1=101, x2=3, y1=33, y2=1, y3=1] [L36] EXPR counter++ VAL [counter=101, counter++=100, x1=101, x2=3, y1=33, y2=1, y3=1] [L36] COND FALSE !(counter++<100) [L50] CALL __VERIFIER_assert(y1*x2 + y2 == x1) VAL [\old(cond)=0, counter=101] [L16] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=101] [L18] 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: 106.6s, OverallIterations: 13, TraceHistogramMax: 101, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.1s, AutomataDifference: 16.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3017 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3011 mSDsluCounter, 2244 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2127 mSDsCounter, 1199 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2541 IncrementalHoareTripleChecker+Invalid, 3740 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1199 mSolverCounterUnsat, 436 mSDtfsCounter, 2541 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4986 GetRequests, 4262 SyntacticMatches, 7 SemanticMatches, 717 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21790 ImplicationChecksByTransitivity, 26.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=813occurred in iteration=12, InterpolantAutomatonStates: 607, 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, 3.6s SatisfiabilityAnalysisTime, 17.9s InterpolantComputationTime, 2425 NumberOfCodeBlocks, 2425 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 3160 ConstructedInterpolants, 0 QuantifiedInterpolants, 7988 SizeOfPredicates, 197 NumberOfNonLiveVariables, 3556 ConjunctsInSsa, 423 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: 2.2s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 3, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 17, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 14, TOOLS_POST_TIME: 0.6s, TOOLS_POST_CALL_APPLICATIONS: 10, TOOLS_POST_CALL_TIME: 0.8s, TOOLS_POST_RETURN_APPLICATIONS: 6, TOOLS_POST_RETURN_TIME: 0.5s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 30, TOOLS_QUANTIFIERELIM_TIME: 1.9s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.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.0s, 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: 138, DAG_COMPRESSION_RETAINED_NODES: 50, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-11-20 23:44:31,814 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e3bab56-614a-4092-86ee-dfa81d729034/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